A family of encounter-based broadcast protocols for mobile ad-hoc networks

Authors:
D. E. Cooper;P. Ezhilchelvan;I. Mitrani
Affiliations:
School of Computing Science, University of Newcastle, Newcastle upon Tyne, U.K.;School of Computing Science, University of Newcastle, Newcastle upon Tyne, U.K.;School of Computing Science, University of Newcastle, Newcastle upon Tyne, U.K.
Venue:
NGI'04 Proceedings of the First international conference on Wireless Systems and Mobility in Next Generation Internet
Year:
2004

Citing 7
Cited 2

Reliable broadcast in mobile multihop packet networks

MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Probabilistic modelling

Probabilistic modelling
Fault-tolerant broadcasts and related problems

Distributed systems (2nd Ed.)
Flooding for reliable multicast in multi-hop ad hoc networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Comparison of broadcasting techniques for mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A Reliable Multicast Algorithm for Mobile Ad Hoc Networks

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)

On the performance evaluation and prediction of encounter-based worm interactions based on node characteristics

Proceedings of the second ACM workshop on Challenged networks
Encounter-based worms: Analysis and defense

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A family of message propagation protocols for highly mobile ad-hoc networks is defined, and is studied analytically and by simulation. The coverage of a message (the fraction of nodes that receive it), can be made arbitrarily close to 1, at a moderate cost of extra message traffic. Under certain simplifying assumptions, it is shown that a high coverage is achieved by making a total of O(n ln n) broadcasts, where n is the number of nodes, and the time to propagate a message is O(ln n). The effect of various parameters on the protocol performance is examined.