Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks
Pages 115 - 144
Abstract
We present in this paper three deterministic broadcast and a gossiping algorithm suitable for ad hoc networks where topology changes range from infrequent to very frequent. The proposed algorithms are designed to work in networks where the mobile nodes possessing collision detection capabilities. Our first broadcast algorithm accomplishes broadcast in O ( n log n ) for networks where topology changes are infrequent. We also present an O ( n log n ) worst case time broadcast algorithms that is resilient to mobility. For networks where topology changes are frequent, we present a third algorithm that accomplishes broadcast in O ( · n log n + n ·| M |) in the worst case scenario, where | M | is the length of the message to be broadcasted and the maximum node degree. We then extend one of our broadcast algorithms to develop an O ( Dn log n + D 2 ) algorithm for gossiping in the same network model.
References
[1]
1. L. Gasieniec and A. Lingas. On adaptive deterministic gossiping in ad hoc radio networks, Information Processing Letters , 83:89-93, (2002).]]
[2]
2. M. Chorabak, L. Gasieniec and W. Rytter. Fast broadcasting and gossiping in radio networks. In Proc. 41st IEEE Symp. on Found. Of Computer Science (FOCS'2000) , 575-581, 2000.]]
[3]
3. A. E. F. Clementi, A. Monti and R. Silvestri. Distributed multi-broadcast in unknown radio networks. In Proc. 20th ACM Symp. on Principles of Distributed Computing (PODC'2001) , 255-263, 2001.]]
[4]
4. A. E. F. Clementi, A. Monti and R. Silvestri. Selective families, superimposed codes, and broadcasting in unknown radio networks. In Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA'2001) , 709-718, 2001.]]
[5]
5. I. Gaber and Y. Mansour. Broadcast in radio networks, In Proc. 6th Annual ACM-SIAM Symp. Discrete Algorithms , 577-585, 1995.]]
[6]
6. I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Comm. , 39:426-433, Mar. 1991.]]
[7]
7. S. Basagni, D. Bruschi and I. Chlamtac. A mobility-transparent deterministic broadcast mechanism for ad hoc networks. IEEE Trans. on Networking , 7(6):799-807, Dec. 1999.]]
[8]
8. R. Bar-Yehuda, O. Goldreich and A. Itai. On the time-complexity of broadcast in multi-hop radio networks : an exponential gap between determinism and randomization, in J. computer Syst. Sci. , 45:104-126, Aug. 1992.]]
[9]
9. E. Kushilevitz and Y. Mansour. An ¿( D log n/D ) lower bound for broadcast in radio networks, in SIAM J. Computing , 27:702-712, June 1998.]]
[10]
10. B. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc and W. Rytter. Deterministic broadcasting in unknown radio networks. Proc. of SODA , 861-870, 2000.]]
[11]
11. M. Chrobak, L. Gasieniec and W. Rytter. A randomized algorithm for gossiping in radio networks. In Proc. 7th Annual International Computing and Combinatorics Conference (COCOON 2001) , 483-492, 2001.]]
[12]
12. B. S. Chlebus, L. Gasieniec, A. Lingas and A. Pagourtzis. Oblivious gossiping in ad hoc radio networks. In Proc. 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM 2001) , 44-51, 2001.]]
[13]
13. A. E. F. Clementi, A. Monti and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. In Proc. 9th Annual European Symp. on Algorithms (ESA 2001) , 452-463, 2001.]]
[14]
14. B. S. Chlebus. Randomized communication in radio networks. P. M. Pardalos, S. Rajasekaran, J. H. Reif, J. D. P. Rolim (Eds.), Handbook on Randomized Computing , Kluwer Academic Publishers, 2001.]]
[15]
15. A. Pelc. Broadcasting in radio networks. I. Stojmenovic (Ed.), Handbook of Wireless Networks and Mobile Computing , John Wiley, New York, 2002.]]
[16]
16. S. K. S. Gupta and P. K. Srimani. Adaptive core selection and migration method for multi-cast routing in mobile ad hoc networks. To appear in IEEE Transactions on Parallel and Distributed Systems , 2003.]]
[17]
17. P. Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA 2002) , 697-704, 2002.]]
[18]
18. Rajnish Kumar, Arnab Paul and Umakishore Ramachandran. Fountain broadcast for wireless sensor networks. Technical Report--GIT-CERCS-05-02, Georgia Institute of Technology , 2005.]]
Index Terms
- Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks
Recommendations
Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
We present a mobility resilient deterministic broadcast algorithm with worst-case time complexity of O(nlogn) for ad hoc networks where the nodes possess collision detection capabilities; n is the total number of nodes in the network. The algorithm is ...
Multipoint relay selection for robust broadcast in ad hoc networks
Broadcasting is a frequently used technique in a wireless ad hoc network not only to deliver protocol control information but also application data. Optimized Link State Routing (OLSR) uses Multipoint Relay (MPR) to flood Topology Control (TC) message ...
Reviews
Wei Yen
Broadcasting is an important function in ad hoc and sensor networks. This paper introduces three broadcast algorithms and one gossiping algorithm for ad hoc networks with collision detection capability. Two of the three broadcast algorithms are realizations based on the depth-first and breadth-first traversal algorithms; the remaining one is tailored for ad hoc networks of high mobility. In principle, during a phase of this mobility-resilient algorithm, any node yet to receive the message is required to signal its neighbors. This technique accommodates high mobility and makes deterministic broadcast possible. The gossip algorithm allows nodes to broadcast messages to one another using the same breadth-first search (BFS) tree of the root. The paper exhibits a solid presentation structure. Each algorithm is explained conceptually first. Then, succinct pseudocode is provided for the sake of clarity, followed immediately by the proof of correctness and complexity analysis. However, there are more examples for one algorithm than for the others. Fortunately, the descriptions are often sufficient to understand the material. This paper realizes well-known algorithms in the specific networking environment, and contributes efficient algorithms to cope with high mobility at a manageable cost. The paper will be quite accessible to graduate-level students, and should appeal to researchers in the mobile networking area. Online Computing Reviews Service
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 2006 Springer Science + Business Media, LLC.
Publisher
Kluwer Academic Publishers
United States
Publication History
Published: 01 August 2006
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Jan 2025