Performance Evaluation of Time-Based and Hop-Based TTL Schemes in Partially Connected Ad Hoc Networks

We characterize the resource usage of an upload application for partially connected ad hoc networks. Time-based (TB) and hop-based (HB) TTL schemes are proposed and evaluated via both analysis and simulation. A HB(b, 2) scheme is near optimal, where 2 and b denote depth and breadth of the data dissemination tree. b is chosen such that the probability of message delivery approaches one. We also consider feedback schemes to notify mobile nodes to purge message replicas upon successful message delivery. With feedback, we obtain a 100-fold and 5-fold cost reduction for TB and HB schemes, respectively.