Abstract
We present source tracing as a new viable approach to routing in ad hoc networks in which routers communicate the second-to-last hop and distance in preferred paths to destinations. We introduce a table-driven protocol (BEST) in which routers maintain routing information for all destinations, and an on-demand routing protocol (DST) in which routers maintain routing information for only those destinations to whom they need to forward data. Simulation experiments are used to compare these protocols with DSR, which has been shown to incur less control overhead that other on-demand routing protocols. The simulations show that DST requires far less control packets to achieve comparable or better average delays and percentage of packet delivered than DSR, and that BEST achieves comparable results to DSR while maintaining routing information for all destinations.
- S. P. R. Kumar C. Cheng, R. Reley and J. J. Garcia-Luna-Aceves. A Loop-Free Extended Bellman-Ford Routing Protocol without Boumcing Effect. ACM Computer Communications Review, 19(4):224--236, 1989. Google ScholarDigital Library
- IEEE Computer Society LAN MAN Standards Committee. Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications. The Institute of Electrical and Electronics Engineers, 1997. IEEE Std 802.11.Google Scholar
- J. Broch et. al. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In Proc. ACM MOBICOM 98, Dallas, TX, October 1998. Google ScholarDigital Library
- Per Johansson et. al. Scenario Based Performance Analysis of Routing Protocols for Mobile Ad hoc Networks. In Proc. ACM Mobicom'99, Seattle, Washington, August 1999. Google ScholarDigital Library
- R. Dube et. al. Signal Stability-Based Adaptive Routing (SSA) for Ad hoc Mobile Networks. IEEE Pers. Commun., February 1997.Google ScholarCross Ref
- Kevin Fall and Kannan Varadhan, ns notes and documentation. The VINT Project, UC Berkeley, LBL, USC/ISI and Xerox PARC, 1999. Available from http://www-mash.cs.berkeley.edu.Google Scholar
- C. L. Fullmer and J. J. Garcia-Luna-Aceves. Solutions to Hidden Terminal Problems in Wireless Networks. In Proc. ACM SIGCOMM'97, Cannes, France, September 1997. Google ScholarDigital Library
- J. J. Garcia-Luna-Aceves and S. Murthy. A Path Finding Algorithm for Loop-Free Routing. IEEE/ACM Trans. Networking, February 1997. Google ScholarDigital Library
- J. J. Garcia-Luna-Aceves and M. Spohn. Source-Tree Routing in Wireless Networks. In Proc. IEEE ICNP 99, 7th International Conference on Network Protocols, Toronto, Canada, 1999. Google ScholarDigital Library
- J. J. Garcia-Luna-Aceves and A. Tzamaloukas. Reversing The Collision-Avoidance Handshake in Wireless Networks. In Proc. ACM/IEEE Mobicom'99, Seattle, Washington, August 1999. Google ScholarDigital Library
- Z. Haas and M. Pearlman. The Performance of Query Control Schemes for the Zone Routing Protocol. In Proc. ACM SIGCOMM '98, Vancouver, British Columbia, August 1998. Google ScholarDigital Library
- D. B. Johnson and D. A. Maltz. Dynamic Source Routing in Ad hoc Wireless Networks. Mobile Computing, 1994.Google Scholar
- S. Murthy and J. J. Garcia-Luna-Aceves. An Efficient Routing Protocol for Wireless Networks. ACM Mobile Networks and Applications Journal, 1996. Google ScholarDigital Library
- V. D. Park and M. S. Corson. A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks. In Proc. IEEE INFOCOM'97, Kobe, Japan, April 1997. Google ScholarDigital Library
- C. E. Perkins and P. Bhagwat. Highly Dynamic Distance-Sequenced Distance-Vector(DSDV) for mobile computers. Computer Communication Review, 24(4):234--244, October 1994. Google ScholarDigital Library
- C. E. Perkins and E. M. Royer. Ad Hoc On-Demand Distance Vector Routing. In Proc. of IEEE WMCSA'99, New Orleans, LA, 1999. Google ScholarDigital Library
- C. E. Perkins S. R. Das and E. M. Royer. Performance Comparison of Two On-Demand Routing Protocols for Ad hoc Networks. In Proc. of IEEE Infocom 2000, Tel Aviv, Israel, Mar 2000.Google ScholarCross Ref
- Z. Tang and J. J. Garcia-Luna-Aceves. Hop-Reservation Multiple Access (HRMA) for Ad hoc Networks. In Proc. IEEE INFOCOM'99, March 1999.Google Scholar
- C.K. Toh. Associativity-Based Routing for Ad hoc Mobile Networks. Wireless Personal Communications Journal, Special Issue on Mobile Networking and Computing Systems, Kluwer Academic Publishers, 4(2):103--109, Mar. 1997. Google ScholarDigital Library
- C. Zhu and S. Corson. A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks. In Proc. IEEE Infocom, 98.Google Scholar
Index Terms
- Scenario-based comparison of source-tracing and dynamic source routing protocols for ad hoc networks
Recommendations
Performance study of multiple route dynamic source routing protocols for mobile ad hoc networks
Design and analysis of routing protocols are the key issues for a mobile ad hoc network (MANET). The Dynamic Source Routing (DSR) protocol is one of the important on-demand routing protocols. In this paper, we develop a comprehensive analytic model for ...
Query localization techniques for on-demand routing protocols in ad hoc networks
Selected Papers from Mobicom'99Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called ...
Efficient, Secure, Dynamic Source Routing for Ad-hoc Networks
Routing is a must for networks that do not have a fixed point-to-point infrastructure, such as in an ad hoc wireless network that offers unrestricted mobility. A source node in such a network can communicate with a distant destination node after finding ...
Comments