Skip to main content
SpringerLink
Log in

Selecting Forwarding Neighbors in Wireless Ad Hoc Networks

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

Abstract

Broadcasting is a fundamental operation which is frequent in wireless ad hoc networks. A simple broadcasting mechanism, known as flooding, is to let every node retransmit the message to all its 1-hop neighbors when receiving the first copy of the message. Despite its simplicity, flooding is very inefficient and can result in high redundancy, contention, and collision. One approach to reducing the redundancy is to let each node forward the message only to a small subset of 1-hop neighbors that cover all of the node's 2-hop neighbors. In this paper we propose two practical heuristics for selecting the minimum number of forwarding neighbors: an O(nlog n) time algorithm that selects at most 6 times more forwarding neighbors than the optimum, and an O(nlog 2 n) time algorithm with an improved approximation ratio of 3, where n is the number of 1- and 2-hop neighbors. The best previously known algorithm, due to Bronnimann and Goodrich [2], guarantees O(1) approximation in O(n 3 log n) time.

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. J. Broch, D.B. Johnson and D.A. Maltz, The Dynamic Source Routing Protocol for mobile ad hoc networks, IETF Internet Draft, draft-ietf-manet-dsr-05.txt (March 2001).

  2. H. Bronnimann and M.T. Goodrich, Almost optimal set covers in finite VC-dimension, in: Proc. of 10th ACM Symp. on Computational Geometry (SCG) (1994) pp. 293–302.

  3. G. Calinescu, I. Mandoiu, P.-J. Wan and A. Zelikovsky, Selecting forwarding neighbors in wireless ad hoc networks, in: Proc. of 5th International Workshop on Discrete Algorithms and Methods for Mobility (2001) pp. 34–43.

  4. V. Chvátal, A greedy heuristic for the set-covering problem, Mathematics of Operation Research 4(3) (1979) 233–235.

    Google Scholar 

  5. B.N. Clark, C.J. Colbourn and D.S. Johnson, Unit disk graphs, Discrete Mathematics 86 (1990) 165–177.

    Google Scholar 

  6. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank and A. Schrijver, Combinatorial Optimization (Wiley-Interscience, 1998).

  7. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (McGraw Hill, 1990).

  8. J.E. Goodman and J. O'Rourke (eds.), Handbook of Discrete and Computational Geometry (CRC Press, 1997).

  9. Z.J. Haas, M.R. Pearlman and P. Samar, The Interzone Routing Protocol (IERP) for ad hoc networks, IETF Internet Draft, draft-ietf-manet-zone-ierp-00.txt (January 2001).

  10. D.S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in imageprocessing and VLSI, Journal of the ACM 32(1) (1985) 130–136.

    Google Scholar 

  11. H.B. Hunt III, M.V. Marathe, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz and R.E. Stearns, NC-approximation schemes for NPand PSPACE-hard problems for geometric graphs, Journal of Algorithms 26(2) (1998) 238–274.

    Google Scholar 

  12. P. Jacquet, P. Muhlethaler, A. Qayyum, A. Laouiti, L. Viennot and T. Clausen, Optimized Link State Routing Protocol, IETF Internet Draft, draft-ietf-manet-olsr-04.txt (March 2001).

  13. A. Qayyum, L. Viennot and A. Laouiti, Multipoint Relaying: An efficient technique for flooding in mobile wireless networks, in: Proc. of 35th Annual Hawaii International Conference on System Sciences (HICSS 2002) (2002).

  14. M.V. Marathe, H. Breu, H.B. Hunt III, S.S. Ravi and D.J. Rosenkrantz, Simple heuristics for unit disk graphs, Networks 25 (1995) 59–68.

    Google Scholar 

  15. B.M.E. Moret and H.D. Shapiro, Algorithms from P to NP, Vol. I: Design and Efficiency (Benjamin/Cummings, 1991).

  16. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen and J.-P. Sheu, The Broadcast Storm problem in a mobile ad hoc network, in: Proc. of 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking (1999) pp. 151–162.

  17. C.E. Perkins, E.M. Royer and S. Das, Ad Hoc On Demand Distance Vector (AODV) routing, IETF Internet Draft, draft-ietf-manet-aodv-08.txt (March 2001).

  18. G. Ramalingam and C. Pandu Rangan, A unified approach to domination problems in interval graphs, Information Processing Letters 27 (1988) 271–274.

    Google Scholar 

  19. P. Sinha, R. Sivakumar and B. Vaduvur, Enhancing ad hoc routing with dynamic virtual infrastructures, in: Proc. of IEEE INFOCOM (2001) pp. 1763–1772.

Download references

Author information

Authors and Affiliations

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

    Gruia Călinescu

  2. Department of Computer Science and Engineering, University of California at San Diego, La Jolla, CA, 92093-0114, USA

    Ion I. Măndoiu

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

    Peng-Jun Wan

  4. Department of Computer Science, Georgia State University, University Plaza, Atlanta, GA, 30303, USA

    Alexander Z. Zelikovsky

Authors
  1. Gruia Călinescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ion I. Măndoiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peng-Jun Wan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alexander Z. Zelikovsky
    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

Călinescu, G., Măndoiu, I.I., Wan, PJ. et al. Selecting Forwarding Neighbors in Wireless Ad Hoc Networks. Mobile Networks and Applications 9, 101–111 (2004). https://doi.org/10.1023/B:MONE.0000013622.63511.57

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:MONE.0000013622.63511.57

Search

Navigation