Abstract
Gossiping is a lightweight and simple technique for information dissemination in many application domains, be it in Wireless Sensor Networks (WSNs), Mobile Ad-hoc Networks (MANETs), or Vehicular Ad-hoc Networks (VANETs). Much research has been conducted in the past on probabilistic dissemination methods because of their efficiency compared with simple flooding and their simple application. However most work was focused on static gossiping, i.e., the gossiping probability cannot be adapted according to topology changes. Thus, topology characteristics have to be known in advance.
In this work the use of position information for building up a neighborhood relationship is proposed. Based on this information, a forwarding hierarchy is constructed and the protocol is capable to adjust the dissemination probability dynamically in a distributed manner. The protocol is evaluated in a highway scenario, where the network characteristic varies from sparse networks with highly mobile nodes to a traffic jam with very high node density and low node velocities. The applicability of the proposed protocol for such scenarios is shown by simulations.
This work has been supported by a grant from the Ministry of Science, Research and the Arts of Baden-Württemberg (Az: 23-7532.24-14-19) to Boto Bako.
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
Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a Tiny AGgregation service for ad-hoc sensor networks, vol. 36, pp. 131–146. ACM Press, New York, NY, USA (2002)
Johnson, D.B., Maltz, D.A.: Dynamic Source Routing in Ad Hoc Wireless Networks. In: Imielinski, T., Korth, H. (eds.) Mobile Computing, vol. 353, pp. 153–181. Kluwer Academic Publishers, Boston, MA (1996)
Perkins, C.E., Royer, E.M.: Ad-Hoc On-Demand Distance Vector Routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computer Systems and Applications, pp. 90–100 (February 1999)
Maihöfer, C., Eberhardt, R., Schoch, E.: CGGC: Cached Greedy Geocast. In: Langendoerfer, P., Liu, M., Matta, I., Tsaoussidis, V. (eds.) WWIC. LNCS, vol. 2957, pp. 13–25. Springer, Heidelberg (2004)
Ni, S.Y., Tseng, Y.C., Chen, Y.S., Sheu, J.P.: The Broadcast Storm Problem in a Mobile ad hoc Network. In: MOBICOM, pp. 151–162 (1999)
Chandra, R., Ramasubramanian, V., Birman, K.: Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks. Technical report, Ithaca, NY, USA (2001)
Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. IEEE/ACM Trans. Netw. 14(3), 479–491 (2006)
Miller, M.J., Sengul, C., Gupta, I.: Exploring the Energy-Latency Trade-Off for Broadcasts in Energy-Saving Sensor Networks. In: ICDCS, pp. 17–26 (2005)
Kyasanur, P., Choudhury, R.R., Gupta, I.: Smart Gossip: An Adaptive Gossip-based Broadcasting Service for Sensor Networks. In: Mobile Adhoc and Sensor Sysetems (MASS), IEEE International Conference, pp. 91–100 (2006)
Barr, R., Haas, Z.J., van Renesse, R.: JiST: an efficient approach to simulation using virtual machines: Research Articles. Softw. Pract. Exper. 35(6), 539–576 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bako, B., Rikanovic, I., Kargl, F., Schoch, E. (2007). Adaptive Topology Based Gossiping in VANETs Using Position Information. In: Zhang, H., Olariu, S., Cao, J., Johnson, D.B. (eds) Mobile Ad-Hoc and Sensor Networks. MSN 2007. Lecture Notes in Computer Science, vol 4864. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77024-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-77024-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77023-7
Online ISBN: 978-3-540-77024-4
eBook Packages: Computer ScienceComputer Science (R0)