Dynamically adjusted fl ooding scheme for vehicular ad-hoc networks
In this article there is detailed discussion on MANET’s & Broadcast problem and how it helps to solve the Broadcast storm problem in VANET’s. First about the Mobile ad hoc networks i.e. (MANETs) they are self-organizing mobile wireless networks that do not rely on a preexisting infrastructure to communicate. Nodes of such networks have limited transmission range, and packets may need to traverse multiple other nodes. Although straightforward, fl ooding is far from optimal and generates a high number of redundant messages, wasting valuable limited resources such as bandwidth and energy supplies to network; such a scenario has often been referred to as the broadcast storm problem , and has generated many challenging research issues.
KeywordsMobile Host Broadcast Message Packet Loss Ratio Broadcast Scheme Broadcast Packet
Unable to display preview. Download preview PDF.
- 1.B.Williams, T. Camp, Comparison of broadcasting techniques for mobile ad hoc networks.Proc. ACM Symposium on Mobile Ad HocNetworking & Computing (MOBIHOC 2002), pp.194– 205, 2002.Google Scholar
- 3.Zygmunt J. Haas, Joseph Y. Halpern, and Li Li. Gossip-based ad hoc routing. In IEEE INFOCOM, Jun 2002.Google Scholar
- 4.Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu. The broadcast storm problem in a mobile ad hoc network. In Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, pages 151–162, Aug 1999.Google Scholar
- 5.Y. Sasson, D. Cavin, A. Schiper, Probabilistic broadcast for flooding in wireless mobile ad hoc networks, EPFL Technical Report IC/2002/54,Swiss Federal Institute of Technology(EPFL), 2002.Google Scholar
- 6.M. Torrent-Moreno, D. Jiang, and H. Hartenstein, “Broadcast Reception Rates and Effects of Priority Access in 802.11Based Vehicular Ad Hoc Networks,” Proceeding in ACM. Vehicular Ad hoc Networks, Philadelphia, PA, Oct. 2004.Google Scholar
- 7.Z. Haas, J. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” Proc. IEEE INFOCOM, vol. 3, New York, NY, June 2002, pp. 1707–1716Google Scholar