Skip to main content
Log in

PANDA: A novel mechanism for flooding based route discovery in ad hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Flooding technique is often used for route discovery in on-demand routing protocols in mobile ad hoc networks (MANETs) such as Dynamic Source Routing (DSR) and Ad hoc On-demand Distance Vector (AODV) routing. In this paper we present a Positional Attribute based Next-hop Determination Approach (PANDA) to improve the performance of flooding-based route discovery in MANETs using positional attributes of the nodes. These attributes may be geographical, power-aware, or based on any other quality of service (QoS) measure. We identify the “next-hop racing” phenomena due to the random rebroadcast delay (RRD) approach during the route discovery process in DSR and AODV, and show how the PANDA approach can resolve this problem. We assume that each node knows its positional attributes, and an intermediate node can learn the positional attributes of its previous-hop node via the received route-request message. Based on the attributes such as the relative distance, estimated link lifetime, transmission power consumption, residual battery capacity, an intermediate node will identify itself as good or bad candidate for the next-hop node and use different rebroadcast delay accordingly. By allowing good candidates to always go first, our approach will lead to the discovery of better end-to-end routes in terms of the desired quality of service metrics. Through simulations we evaluate the performance of PANDA using path optimality, end-to-end delay, delivery ratio, transmission power consumption, and network lifetime. Simulation results show that PANDA can: (a) improve path optimality, and end-to-end delay, (b) help find data paths with only 15%–40% energy consumption compared to the RRD approach at a moderate cost of increased routing messages, (c) balance individual node’s battery power utilization and hence prolong the entire network’s lifetime.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E.M. Royer and C.-K. Toh. A review of current routing protocols for Ad-hoc mobile wireless networks, IEEE Personal Communications (April 1999) 46–55.

  2. C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance vector routing (DSDV) for Mobile Computers. in: Proc. ACM SIGCOMM’94, London, UK, (Sept. 1994) pp. 234–244.

  3. V.D. Park and M.S. Corson, A highly adaptive distributed routing algorithm for Mobile Wireless Networks. in Proc. of IEEE INFOCOM ’97, Kobe, Japan (April 1997).

  4. D.B. Johnson, D.A. Maltz and J. Broch, DSR: The dynamic source routing protocol for multi-hop wireless Ad Hoc Networks. Ad Hoc Networking, edited by C.E. Perkins (Addison-Wesley, 2001).

  5. C.E. Perkins and E.M. Royer, Ad hoc on-demand distance vector routing. Ad Hoc Networking, edited by C.E. Perkins (Addison-Wesley, 2001).

  6. Z. Haas and M. Pearlman, The zone routing protocol: A hybrid framework for routing in Ad Hoc Networks. Ad Hoc Networking, edited by C. E. Perkins, (Addison-Wesley, 2001).

  7. Y.-B. Ko and N.H. Vaidya, Location-aided routing (LAR) in Mobile Ad Hoc Networks. ACM/Baltzer Wireless Networks (WINET) Journal, 6-(4), (2000).

  8. S. Basagni, I. Chlamtac, V.R. Syrotiuk and B.A. Woodward, A distance routing effect algorithm for mobility (DREAM), in: Proc. of ACM MOBICOM’98, pp. 76–84.

  9. T.S. Rappaport. Wireless Communications Principles and Practice, (Prentice Hall, 1996) pp. 102–104.

  10. M. Pearlman and Z. Haas. Improving the performance of query-based routing protocols through “Diversity Injection” in: Proc. of WCNC’99, New Orleans, LA (Sept. 1999).

  11. Y.-C. Hu and D.B. Johnson. Implicit source routes for on-demand Ad Hoc Network Routing, in: Proc. of ACM MOBIHOC’01, Long Beach, CA (Oct. 2001) pp. 1–10,.

  12. Y.-C. Hu and D.B. Johnson, Caching strategies in on-demand routing protocols for Wireless Ad Hoc Networks, in: Proc. of ACM MOBICOM 2000, Boston, MA (August 2000).

  13. Z. Haas, J. Halpern and L. Li, Gossip-based Ad Hoc Routing, in: Proc. of IEEE INFOCOM 2002.

  14. Z. Haas and M. Pearlman. The performance of query control schemes for the Zone Routing Protocol. IEEE/ACM Transactions on Networking (TON), Vol. 9, Issue 4 (August 2001), pp. 427–438.

  15. B. Karp and H.T. Kung, GPSR: Greedy perimeter stateless routing for Wireless Networks, in: Proc. of ACM MOBICOM 2000, pp. 243–254.

  16. J. Broch, D.A. Maltz, D.B. Johnson, Y-C. Hu and J. Jetcheva, A performance comparison of multi-hop Wireless Ad-hoc Networking Routing Protocols, in: Proc. ACM MOBICOM ’98,(Oct. 1998) pp. 85–97 .

  17. P. Jain, A. Puri and R. Sengupta, Geographical routing using partial information for wireless Ad Hoc Networks, IEEE Personal Communications, 2001.

  18. C.-K. Toh. Associativity based routing for Ad Hoc Mobile Networks, Wireless Personal Communications Journal, Special Issue on Mobile Networking and Computing Systems, 4-(2), pp. 103–139, (March 1997).

  19. S. Marti, T. Giuli, K. Lai and M. Baker. Mitigating routing misbehavior in Mobile Ad hoc Networks. in: Proc. IEEE INFOCOM 2001.

  20. 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. ACM MOBICOM (1999), pp. 151–162.

  21. M. Sun, W. Feng and T. H. Lai. Location aided broadcast in Wireless Ad Hoc Networks. in: Proc. IEEE GLOBECOM 2001, San Antonio, TX (Nov. 2001) pp. 2842–2846.

  22. B. Williams and T. Camp. Comparison of broadcasting techniques for Mobile Ad Hoc Networks, in: Proc. of MOBIHOC 2002, EPFL, Lausanne, Switzerland.

  23. X. Chen, M. Faloutsos and S. Krishnamurthy, Distance adaptive (DAD) broadcasting for Ad Hoc Networks, MILCOM 2002.

  24. M. Mauve, J. Widmer and H. Hartenstein. A Survey on position-based routing in Mobile Ad hoc Networks. IEEE Network Magazine, 15(6): (Nov. 2001), 30–39.

    Google Scholar 

  25. J. Yoon, M. Liu and B. Noble. Random waypoint considered harmful. in: Proc. IEEE INFOCOM, Vol 2, pp 1312–1321 (April 2003), San Francisco, CA.

  26. J. Gomez, A.T. Campbell, M. Naghshineh and C. Bisdikian. Conserving transmission power in Wireless Ad Hoc Networks. in: Proc. 9th International Conference on Network Protocols (ICNP 2001), Riverside, California Nov., 2001.

  27. S. Singh, M. Woo and C. Raghavendra, Power-aware routing in Mobile Ad-hoc Networks. in: Proc. of ACM MOBICOM, (Oct. 1998).

  28. J. Chang and L. Tassiulas, Energy conserving routing in Wireless Ad Hoc Networks, in: Proc. IEEE INFOCOM 2000, pp. 22–31.

  29. S. Banerjee and A. Misra, Minimum energy paths for reliable communication in Multi-hop Wireless Networks, in: Proc. ACM MOBIHOC 2002, 146–156.

  30. W. Yu and J. Lee. DSR-based energy-aware routing protocols in Ad hoc Networks. in: pp. Proc. of ICWN 2002.

  31. N. Bulusu, J. Heidemann and D. Estrin, GPS-less low cost outdoor localization for very small devices. IEEE Personal Communications Magazine, vol. 7, no. 5, (Oct. 2000) 28–34.

  32. A. Savvides, C. Han and M.B. Strivastava. Dynamic finegrained localization in ad hoc networks of sensors. in: Proc. of ACM MOBICOM, pp. 166–179, 2001.

  33. D. Niculescu and B. Nath. Ad hoc positioning system using AoA. in: Proc. of IEEE INFOCOM 2003, San Francisco, CA.

  34. X. Cheng, A. Thaeler, G. Xue and D. Chen, TPS: A time-based positioning scheme for outdoor wireless sensor networks. in: Proc. of IEEE INFOCOM, 2004, Hongkong, China (to appear).

  35. J. Wu and F. Dai. Broadcasting in Ad Hoc Networks Based on Self-Pruning. in: Proc. of INFOCOM 2003.

  36. The Network Simulator ns-2, available online at http://www.isi.edu/nsnam/ns/.

  37. The Monarch Group at Rice University, project website http://www.monarch.cs.rice.edu/.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jian Li.

Additional information

Jian Li is a Ph.D. candidate in the Department of Computer Science at the University of California, Davis. His research interests include wireless networking and mobile computing. Li received an MS in computer science from UC Davis in 2002, an M.Eng. in intelligent system and a B.Eng. in automatic control, both from Tsinghua University, Beijing,China, in 2000 and 1997, respectively.

Dr. Prasant Mohapatra is currently a Professor in the Department of Computer Science at the University of California, Davis. He has also held various positions at Iowa State University, Michigan State University, Intel Corporation, Panasonic Technologies, Institute of Infocomm Research, Singapore, and the National ICT, Australia. Dr. Mohapatra received his Ph.D. in Computer Engineering from the Pennsylvania State University in 1993. He was/is on the editorial boards of the IEEE Transactions on Computers, ACM/Springer WINET, and Ad hoc Networks Journal. He has served on numerous technical program committees for international conferences, and served on several panels. He was the Program Vice-Chair of INFOCOM 2004, and the Program Co-Chair of the First IEEE International Conference on Sensor and Ad Hoc Communications and Networks (SECON-2004). Dr. Mohapatra’s research interests are in the areas of wireless networks, sensor networks, Internet protocols and QoS.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, J., Mohapatra, P. PANDA: A novel mechanism for flooding based route discovery in ad hoc networks. Wireless Netw 12, 771–787 (2006). https://doi.org/10.1007/s11276-006-1324-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-006-1324-3

Keywords

Navigation