Abstract
In this paper, an efficient distributed heuristic-based algorithm is presented, which is based on joint distance-counter threshold scheme. It features a distributed manner by each node in the network needing no global information. Each node in an ad hoc network receives the message from its neighbors and decides whether to operate retransmitting or not according to the signal strength and times of the receiving messages. The algorithm has superiority such as reliability, rebroadcast saving, less communication overhead for broadcasting task, localized and parameter-less behaviors, so it is easy to operate and possesses a good performance in mobile ad hoc communication environments. A comparison with several other existing algorithms is conducted. It shows by simulation results that the new algorithm is more efficient than others.
This work is proudly supported in part by the Grand Research Problem of the National Science Foundation of P.R.C. under Grant No. 90304018.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Layuan, L., Chunlin, L.: A QoS multicast routing protocol for dynamic group topology. Information Sciences 169(1-2), 113–130 (2005)
Ramanathan, S., Streenstrup, M.: A Survey of Routing Techniques for Mobile Communication Networks. Mobile Networks and Applications, 89–104 (1996)
Perkins, C.E., Royer, E.M.: Ad hoc on-demand distance vector (AODV) routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (February 1999)
Layuan, L., Chunlin, L.: A routing protocol for dynamic and large computer networks with clustering topology. Computer Communications 23(2), 171–176 (2000)
Johnson, D.B., Maltz, D.A., Hu, Y.-C., Jetcheva, J.G.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks (DSR) (April 2003), http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-09.txt
Layuan, L., Chunlin, L.: Acta Informatica. In: A distributed QoS-aware multicast routing protocol. Computer Science, vol. 40 (3), pp. 221–233. Springer, Heidelberg (2003)
Cartigny, J., Simplot, D.: Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks. In: Proc. 36th International Hawaii International Conference on System Sciences (HICSS 2003), Hawaii, USA (2003)
Tseng, Y.-C., Ni, S.-Y., Chen, Y.-S., Sheu, J.-P.: The Broadcast Storm Problem in a Mobile Ad Hoc Network. In: MOBICOM 1999, pp. 151–152. ACM Press, New York (1999)
Royer, E., Toh, C.-K.: A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks. IEEE Personal Communications 6(4), 46–55 (1999)
Broch, J., et al.: A performance comparison of multi-hop wireless ad hoc network routing protocols. In: Proc. ACM MOBICOM, pp. 85–97. ACM Press, New York (1998)
Burmester, M., van Le, T., Yasinsac, A.: Weathering the storm: managing redundancy and security in ad hoc networks. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2004. LNCS, vol. 3158, pp. 96–107. Springer, Heidelberg (2004)
Pagnani, G.E., Rossi, G.P.: Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks. Mobile Networks and Applications 5(4), 175–192 (1999)
Gerla, M., Kwon, T. J., Pei, G.: On demand routing in large ad hoc wireless networks with passive clustering. In: Proceedings of the IEEE WCNC 2000, Chicago, IL (September 2000)
Li, H., Wu, J.: A dominating-set-based routing scheme in ad hoc wireless networks. Telecommunication Systems 18(1-3), 13–36 (2001)
Stojmenovic, I., Seddigh, M., Zunic, J.: Dominating Sets and Neighbor Elimination-Based Broadcast Algorithms in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems 1(13), 14–25 (2002)
Qayyum, A., Viennot, L., Laouiti, A.: Multipoint relaying for flooding broadcast messages in mobile wireless networks. In: Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS 2002), Hawaii (2002)
Calinescu, G., Mandoiu, I.I., Wan, P.J., Zelikovsky, A.Z.: Selecting forwarding neighbors in wireless ad hoc networks. Mobile Networks & Applications 9(2), 101–111 (2004)
ITSI STC-RES10 Committee. Radio Equipment and Systems: High Performance Radio Local Area Network Type 1, Functional Specifications, 7 (1999)
Wu, J., Dai, F.: A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks. IEEE Transactions On Computers 10(53), 1343–1354 (2004)
Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks. ACM Wireless Networks 5(8), 481–494 (2002)
Lim, H., Kim, C.: Multicast Tree Construction and Flooding in Wireless Ad Hoc Networks. In: Proc. of the ACM Int’l Workshop on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM), pp. 61–68 (2000)
Dube, R., Rais, C.D., Wang, K.-Y., Tripathi, S.K.: Signal stability based adaptive routing (SSA) for ad hoc mobile networks. Technical Report CS-TR-3646. University of Maryland, College Park (1996)
Vargas, A.: OMNET++Discrete Event Simulation System. version 3.0 edition (2005)
Bettstetter, C., Wagner, C.: The Spatial Node Distribution of the Random Waypoint Mobility Model. Mobile Ad-Hoc Netzwerke. In: 1. deutscher Workshop über Mobile Ad-Hoc Netzwerke WMAN 2002, March 25-26, pp. 41–58 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, Q., Li, L. (2005). An Efficient Distributed Broadcasting Algorithm for Ad Hoc Networks. In: Cao, J., Nejdl, W., Xu, M. (eds) Advanced Parallel Processing Technologies. APPT 2005. Lecture Notes in Computer Science, vol 3756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573937_39
Download citation
DOI: https://doi.org/10.1007/11573937_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29639-3
Online ISBN: 978-3-540-32107-1
eBook Packages: Computer ScienceComputer Science (R0)