Skip to main content
SpringerLink
Log in

Regional Gossip Routing for Wireless Ad Hoc Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Many routing protocols have been proposed for wireless ad hoc networks, and most of them are based on some variants of flooding. Thus many routing messages are propagated through the network unnecessarily despite various optimizations. Gossip based routing method has been used and re-investigated to reduce the number of messages in both wired networks and wireless ad hoc networks. However, the global gossiping still generates many unnecessary messages in the area that could be far away from the line between sender node and receiver node. We propose a regional gossip approach, where only the nodes within some region forward a message with some probability, to reduce the overhead of the route discovery in the network. We show how to set the forwarding probability based on the region and the network density both by theoretical analysis and by extensive simulations. Our simulations show that the number of messages generated using this approach is much less than the simple global gossiping method, which already saves many messages compared with global flooding. We expect that the improvement should be even more significant in larger networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Capkun, M. Hamdi and J.P. Hubaux, GPS-free positioning in mobile ad-hoc networks, in: Proc. Hawaii Internat. Conf. on System Sciences (2001).

  2. C. Bettstetter, On the minimum node degree and connectivity of a wireless multihop network, in: 3rd ACM Internat. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'02) (June 2002).

  3. G. Calinescu, I. Mandoiu and A. Zelikovsky, Symmetric connectivity with minimum power consumption in radio networks, in: IFIP-TCS (2002) to appear.

  4. A. Clementi, P. Penna and R. Silvestri, The power range assignment problem in radio networks on the plane, in: XVII Symposium on Theoretical Aspects of Computer Science (STACS'00), Lecture Notes in Computer Science, Vol. 1770 (Springer, New York, 2000) pp. 651–660.

    Google Scholar 

  5. P. Gupta and P. R. Kumar, Critical power for asymptotic connectivity in wireless networks, in: Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, eds.W.M. McEneaney, G. Yin and Q. Zhang (1998).

  6. J. Monks, V. Bharghavan and W.-M Hwu, A power controlled multiple access protocol for wireless packet networks, in: IEEE INFOCOM (2001).

  7. M. Sanchez, P. Manzoni and Z. Haas, Determination of critical transmission range in ad-hoc networks, in: Multiaccess, Mobility and Teletraffic for Wireless Communications (MMT'99) (1999).

  8. M. Bahramgiri, M.T. Hajiaghayi and V.S. Mirrokni, Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks, in: Proc. of the 11th Annual IEEE Internat. Conf. on Computer Communications and Networks (ICCCN) (2002) pp. 392–397.

  9. L. Hu, Topology control for multihop packet radio networks, IEEE Transactions on Communications 41(10) (1993).

  10. X.-Y. Li, P.-J. Wan, Y. Wang and O. Frieder, Sparse power efficient topology for wireless networks, Journal of Parallel and Distributed Computing (2002) to appear; preliminary version appeared in: ICCCN (2001).

  11. X.-Y. Li, G. Calinescu, P.-J. Wan and Y. Wang, Localized delaunay triangulation with application in wireless ad hoc networks, IEEE Transactions on Parallel and Distributed Systems (2003); short version appeared in: IEEE INFOCOM (2002).

  12. X.-Y. Li, G. Calinescu and P.-J. Wan, Distributed construction of planar spanner and routing for ad hoc wireless networks, in: 21st Annual Joint Conf. of the IEEE Computer and Communications Societies (IN-FOCOM), Vol. 3 (2002).

  13. R. Ramanathan and R. Rosales-Hain, Topology control of multihop wireless networks using transmit power adjustment, in: IEEE INFO-COM (2000).

  14. R. Wattenhofer, L. Li, P. Bahl and Y.-M. Wang, Distributed topology control for wireless multihop ad-hoc networks, in: IEEE INFOCOM'01 (2001).

  15. S. Singh, M. Woo and C. Raghavendra, Power-aware routing in mobile ad hoc networks, in: Proc. of MOBICOM (1998) pp. 181–190.

  16. I. Stojmenovic and X. Lin, Power aware localized routing in ad hoc wireless networks, IEEE Transactions on Parallel and Distributed Systems 12(11) (2001) 1122–1133.

    Google Scholar 

  17. J. Wu, F. Dai, M. Gao and I. Stojmenovic, On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks, IEEE/KICS Journal of Communication and Networks 4(1) (2002) 59–70.

    Google Scholar 

  18. P. Bose, P. Morin, I. Stojmenovic and J. Urrutia, Routing with guaranteed delivery in ad hoc wireless networks, ACM/Kluwer Wireless Networks 7(6) (2001) 609–616, also in: 3rd Internat. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (1999) pp. 48–55.

    Google Scholar 

  19. B. Das and V. Bharghavan, Routing in ad-hoc networks using minimum connected dominating sets, in: 1997 IEEE Internat. Conf. on Communications (ICC'97), Vol. 1 (1997) pp. 376–380.

    Google Scholar 

  20. C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, Computer Communications Review (October 1994) 234–244.

  21. D.B. Johnson and D.A. Maltz, Dynamic source routing in ad hoc wireless networks, in: Mobile Computing, eds. Imielinski and Korth, Vol. 353 (Kluwer Academic, Dordrecht, 1996).

    Google Scholar 

  22. B. Karp and H.T. Kung, Gpsr: Greedy perimeter stateless routing for wireless networks, in: ACM/IEEE Internat. Conf. on Mobile Computing and Networking (2000).

  23. Y.-B. Ko and N.H. Vaidya, Using location information to improve routing in ad hoc networks, Technical Report, Department of Computer Science, Texas A&M University (1997).

  24. Z. Haas, J. Halpern and L. Li, Gossip-based ad hoc routing, in: IEEE INFOCOM (2002).

  25. S. Murthy and J. Garcia-Luna-Aceves, An efficient routing protocol for wireless networks, ACM Mobile Networks and Applications (Special Issue on Routing in Mobile Communication Networks) 1(2) (1996).

  26. V. Park and M. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: IEEE INFOCOM (1997).

  27. C. Perkins, Ad-hoc on-demand distance vector routing, in: MILCOM '97 (November 1997).

  28. C. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing, in: Proc. of the ACM SIGCOMM (October 1994).

  29. P. Sinha, R. Sivakumar and V. Bharghavan, CEDAR: Core extraction distributed ad hoc routing algorithm, IEEE Journal on Selected Areas in Communications 17(8) (1999) 1454–1465.

    Google Scholar 

  30. P. Sinha, R. Sivakumar and V. Bharghavan, Enhancing ad hoc routing with dynamic virtual infrastructures, in: Proc. of IEEE INFOCOM 2001, Vol. 3 (2001) pp. 1763–1772.

    Google Scholar 

  31. J. Wu and H. Li, A dominating-set-based routing scheme in ad hoc wireless networks, Telecommunication Systems (Special Issue on Wireless Networks) 3 (2001) 63–84.

    Google Scholar 

  32. M. Joa-Ng and I.-T. Lu, A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks, IEEE Journal on Selected Areas in Communications 17(8) (1999) 1415–1425.

    Google Scholar 

  33. E. Royer and C. Toh, A review of current routing protocols for ad-hoc mobile wireless networks, IEEE Personal Communications (April 1999).

  34. S. Ramanathan and M. Steenstrup, A survey of routing techniques for mobile communication networks, Mobile Networks and Applications (1996) 89–104.

  35. M. Mauve, J. Widmer and H. Harenstein, A survey on position-based routing in mobile ad hoc networks, IEEE Network Magazine 15(6) (2001) 30–39.

    Google Scholar 

  36. P. Hall, On continuum percolation, The Annals of Probability 13(4) (1985).

  37. R. Meester and R. Roy, Continuum Percolation (Cambridge Univ. Press, Cambridge, 1996).

    Google Scholar 

  38. S. Basagni, I. Chlamtac, V.R. Syrotiuk and B.A. Woodward, A distance routing effect algorithm for mobility (DREAM), in: Proc. of ACM/IEEE MOBICOM'98 (1998).

  39. Z. Haas and B. Liang, Ad-hoc mobility management with uniform quorum systems, IEEE/ACM Transactions on Networking 7(2) (1999) 228–240.

    Google Scholar 

  40. I. Stojmenovic, A routing strategy and quorum based location update scheme for ad hoc wireless networks, Technical Report TR–99–09, Computer Science, SITE, University of Ottawa (1999).

  41. I. Chlamtac and A. Farago, A new approach to design and analysis of peer to peer mobile networks, Wireless Networks 5 (1999) 149–156.

    Google Scholar 

  42. P.-J. Wan, K.M. Alzoubi and O. Frieder, Distributed construction of connected dominating set in wireless ad hoc networks, in: INFOCOM (2002).

  43. K.M. Alzoubi, P.-J. Wan and O. Frieder, New distributed algorithm for connected dominating set in wireless ad hoc networks, in: HICSS, Hawaii (2002).

  44. K. Alzoubi, P.-J. Wan and O. Frieder, Message-optimal connected-dominating-set construction for routing in mobile ad hoc networks, in: 3rd ACM Internat. Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'02) (2002).

  45. K.N. Amouris, S. Papavassiliou and M. Li, A position based multizone routing protocol for wide area mobile ad-hoc networks, in: Proc. of the 49th IEEE Vehicular Technology Conf. (1999) pp. 1365–1369.

  46. G. Calinescu, I. Mandoiu, P.-J. Wan and A. Zelikovsky, Selecting forwarding neighbors in wireless ad hoc networks, in: ACMDialM (2001).

  47. M. Penrose, The longest edge of the random minimal spanning tree, Annals of Applied Probability 7 (1997) 340–361.

    Google Scholar 

  48. X.-Y. Li, Y. Wang, C.-W. Yi, P.-J. Wan and O. Frieder, Robust wireless ad hoc networks, in: IEEE ICC (2003) accepted for publication.

  49. P.-J. Wan, C.-W. Yi, X.-Y. Li, Y. Wang and O. Frieder, Asymptotic distribution of critical transmission range for k-connectivity in wireless ad hoc networks (2002) submitted for publication.

  50. B. Bollobás, Random Graphs (Cambridge Univ. Press, Cambrige, 2001).

    Google Scholar 

  51. H. Dette and N. Henze, Some peculiar boundary phenomena for extremes of rth nearest neighbor links, Statistics & Probability Letters 10 (1990) 381–390.

    Google Scholar 

  52. M. Penrose, Extremes for the minimal spanning tree on normally distributed points, Advances in Applied Probability 30 (1998) 628–639.

    Google Scholar 

  53. M. Penrose, On k-connectivity for a geometric random graph, Random Structures and Algorithms 15 (1999) 145–164.

    Google Scholar 

  54. M. Penrose, A strong law for the longest edge of the minimal spanning tree, Annals of Probability 27 (1999) 246–260.

    Google Scholar 

  55. D.M. Blough, M. Leoncini, G. Resta and P. Santi, On the symmetric range assignment problem in wireless ad hoc networks, in: Proc. of the 2nd IFIP Internat. Conf. on Theoretical Computer Science (2002).

  56. C. Cooper and A. Frieze, On the connectivity of random kth nearest neighbour graphs, Combinatorics, Probability and Computing 4 (1995) 343–362.

    Google Scholar 

  57. M. Grossglauser and D. Tse, Mobility increases the capacity of ad-hoc wireless networks, in: INFOCOMM, Vol. 3 (2001) pp. 1360–1369.

    Google Scholar 

  58. P. Gupta and P. Kumar, Capacity of wireless networks, Technical Report University of Illinois, Urbana-Champaign (1999).

  59. O.D. Patrick, Connectivity in ad-hoc and hybrid networks, in: IEEE INFOCOM (2002).

  60. P. Santi and D.M. Blough, An evaluation of connectivity in mobile wireless ad hoc networks, in: Proc. of IEEE DSN (2002) pp. 89–98.

  61. F. Xue and P.R. Kumar, The number of neighbors needed for connectivity of wireless networks, Wireless Networks (2002) submitted.

  62. T. Lukovszki, New results of fault tolerant geometric spanners, in: Workshop on Algorithms and Data Structures (1999) pp. 193–204.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Illinois Institute of Technology, Chicago, IL, 60616, USA

    Xiang-Yang Li, Kousha Moaveninejad & Ophir Frieder

Authors
  1. Xiang-Yang Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kousha Moaveninejad
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ophir Frieder
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, XY., Moaveninejad, K. & Frieder, O. Regional Gossip Routing for Wireless Ad Hoc Networks. Mobile Networks and Applications 10, 61–77 (2005). https://doi.org/10.1023/B:MONE.0000048546.90440.0d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:MONE.0000048546.90440.0d

Search

Navigation