A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Scenario-based performance analysis of routing protocols for mobile ad-hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The Mathematics of Infectious Diseases
SIAM Review
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Reactive routing overhead in networks with unreliable nodes
Proceedings of the 9th annual international conference on Mobile computing and networking
Matching data dissemination algorithms to application requirements
Proceedings of the 1st international conference on Embedded networked sensor systems
Experimental Evaluation of Ad Hoc Routing Protocols
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Distribution of path durations in mobile ad-hoc networks: Palm's theorem to the rescue
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Network modelling and simulation
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
IEEE Pervasive Computing
Distribution of path durations in mobile ad hoc networks and path selection
IEEE/ACM Transactions on Networking (TON)
Information theoretic analysis of proactive routing overhead in mobile ad hoc networks
IEEE Transactions on Information Theory
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
Modeling path duration distributions in MANETs and their impact on reactive routing protocols
IEEE Journal on Selected Areas in Communications
The impact of traffic patterns on the overhead of reactive routing protocols
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We present an analytical, epidemiological, model for the overhead of information dissemination in mobile networks, which finds application in a range of settings, including resource discovery, information dissemination in sensor networks, location services and ad hoc network routing. We consider two principal information dissemination mechanisms, one for which nodes strictly relay information for other nodes, and the other for which they also take advantage of the information already being disseminated to insert their own data to share. The latter mechanism is denoted by path accumulation. We will show that the overhead with path accumulation scales as n3/2 and without path accumulation as n5/4. With respect to the connection rate, both scale as √λ. We also identify the cut-off point for path accumulation as ξc = 1- √2/√n. Below that threshold, path accumulation should be preferred, while above, path accumulation does not provide substantial benefits. Our model proves extremely accurate against simulation data.