A mobility-transparent deterministic broadcast mechanism for ad hoc networks

IEEE/ACM Transactions on Networking

Volumn 7, Issue 6, 1999, Pages 799-807

  Basagni, Stefano ^a,b   Bruschi, Danilo ^c   Chlamtac, Imrich ^a,b  

^a IEEE   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

^c UNIVERSITY OF MILAN   (Italy)

Author keywords

Ad hoc networks; Broadcast protocols; Distributed algorithms; Mobile computing

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; MOBILE COMPUTING; MOBILE RADIO SYSTEMS; NETWORK PROTOCOLS; RADIO BROADCASTING; WIRELESS TELECOMMUNICATION SYSTEMS;

BROADCAST PROTOCOLS;

TELECOMMUNICATION NETWORKS;

EID: 0033338095     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.811446     Document Type: Article

References (16)

1. 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," J. Comput. Syst. Sci., vol. 45, pp. 104-126, Aug. 1992.
2. W. F. Lo and H. T. Mouftah, "Collision detection and multitone tree search for multiple-access protocols on radio channels," IEEE J. Select. Areas Commun., vol. SAC-5, pp. 1035-1040, July 1987.
3. I. Chlamtac and O. Weinstein, "The wave expansion approach to broadcasting in multihop radio networks," IEEE Trans. Commun., vol. 39, pp. 426-433, Mar. 1991.
4. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg, "A lower bound for radio broadcast," J. Comput. Syst. Sci., vol. 43, pp. 290-298, Oct. 1991.
5. I. Gaber and Y. Mansour, "Broadcast in radio networks," in Proc. 6th Annu. ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, Jan. 1995, pp. 577-585.
6. E. Kushilevitz and Y. Mansour, "An Ω(D log n / D) lower bound for broadcast in radio networks," SIAM J. Computing, vol. 27, pp. 702-712, June 1998.
7. C. Lee, J. E. Burns, and M. H. Ammar, "Improved randomized broadcast protocols in multi-hop radio networks," in Proc. 1993 Int. Conf. Network Protocols, San Francisco, CA, pp. 234-241.
8. I. Chlamtac and S. Kutten, "On broadcasting in radio networks - Problem analysis and protocol design," IEEE Trans. Commun., vol. COM-33, pp. 1240-1246, Dec. 1985.
9. _, "Tree-based broadcasting in multihop radio networks," IEEE Trans. Comput., vol. C-36, pp. 1209-1223, Oct. 1987.
10. I. Chlamtac and O. Weinstein, "Distributed 'wave' broadcasting in mobile multi-hop radio networks," in Proc. 7th Int. Conf. Distributed Computing Systems, Berlin, Germany, 1987, pp. 82-89.
11. E. Pagani and G. P. Rossi, "Reliable broadcast in mobile multi hop packet networks," in Proc. 3rd Annu. ACM/IEEE Int. Conf. Mobile Computing and Networking (MobiCom'97), Budapest, Hungary, pp. 34-42.
12. P. Merlin and A. Segall, "A failsafe distributed routing protocol," IEEE Trans. Commun., vol. COM-27, pp. 1280-1287, Sept. 1979.
13. A. Segall and M. Sidi, "A failsafe distributed routing protocol for minimum delay routing," IEEE Trans. Commun., vol. COM-29, pp. 689-695, May 1981.
14. S. Basagni, On the Broadcast and Clustering Problems in Peer-To-Peer Networks. Ph.D. dissertation, Univ. degli Studi di Milano, Milano, Italy, May 1998.
15. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. Cambridge, MA: MIT Press, and New York: McGraw-Hill, 1990.
16. D. Bruschi and M. Del Pinto, "Lower bounds for the broadcast problem in mobile radio networks," Distributed Computing, vol. 10, no. 3, pp. 129-135, Apr. 1997.