Design and Implementation of Fisheye Routing Protocol for Mobile Ad Hoc Networks by
Download 268.85 Kb.
|
- Navigate this page:
- Conclusions
- 1.24Future Work
- References
1.22SummaryEach of the proposed schemes have certain features to deal with certain problems of routing in ad hoc networks. Because inherently, network conditions (such as traffic density, network size, and mobility) in an ad hoc network are not known, it is preferable to design a protocol that is not sensitive to network conditions. This is why Fisheye opted for a table-driven approach. The table-driven approach makes the protocol insensitive to traffic source/destination pair density. The fisheye update mechanism significantly reduces the overhead traffic that plagues conventional and proposed table-driven schemes. This results in good scalability to network size. However, routing performance is affected by the update interval between scopes, which is partially determined based on the mobility of the system. In the presence of high mobility, routing updates must be propagated more frequently to reflect the current network topology. However, when there is low mobility, routing updates do not need to be propagated as frequently as the topology does not change as much. The trade-off is between overhead traffic verses routing accuracy.
The ad hoc wireless network presents many challenges in routing protocol design. The goal of this thesis is to study traditional routing schemes and design and implement a new routing approach for ad hoc wireless networks. 1.23ContributionsA new routing scheme using a link-state foundation and employing a novel fisheye updating mechanism was designed and implemented. Called Fisheye routing, this mechanism reduces the control overhead by disseminating topology information using the fisheye technique, where routing information is updated at different rates depending on the distance from the source. Through simulation, Fisheye routing has exhibited good performance in reducing overhead control traffic. It also performs well in terms of successful packet delivery in the presence of low mobility. Proper selection of the update interval time is necessary for good successful packet delivery in the presence of high mobility. This thesis has given insight into the problems that arise when designing routing protocols in an ad hoc wireless network, shown correct implementation functionality, and demonstrated functionality and performance of the Fisheye Routing Protocol 1.24Future WorkCurrent ad hoc routing approaches have introduced several new paradigms, such as exploiting user demand, the use of location, association parameters, and updating mechanisms. However, it is not clear that any particular algorithm or class of algorithm is the best for all scenarios, each protocol has definite advantages and disadvantages, and is well suited for certain situations. A key characteristic to the success of widespread use of a ad hoc wireless routing protocol is flexibility. A flexible ad hoc routing protocol could responsively invoke table-driven and/or on-demand approaches based on situations and communication requirements. The “toggle” between these two approaches may not be trivial since concerned nodes must be “in sync” with the toggling. Coexistence of both approaches may also exist in spatially clustered ad hoc groups, with intracluster employing table-driven approach and intercluster employing the demand-driven approach, or vice-versa. Further work is necessary to investigate the feasibility and performance of hybrid ad hoc routing approaches. Other features of ad hoc networks that can be examined not addressed in this research are 1) Multicast routing [GCZ98] and 2) Quality of Service(QoS) support. Multicast is desirable to support multiparty wireless communications. Since the multicast tree is no longer static, the multicast routing protocol must be able to copy with mobility, including multicast membership dynamics. In terms of QoS, given the problems associated with the dynamics of nodes, hidden terminals, and fluctuating link characteristics, support end-to-end QoS is a nontrivial issue that requires in-dept investigation. The field of ad hoc mobile networks is rapidly growing and changing, and while there are still many challenges that need to be met, it is likely that such networks will see widespread use within the next few years.
[Bak97] D. Baker, et al., “Flat vs. Hierarchical Network Control Architecture,” ARP/DARPA Workshop on Mobile Ad-Hoc Networking, March 1997. [Bag98] R. Bagrodia and et. al, “Parsec: A Parallel Simulation Environment for Complex Systems”, Computer, Vol. 31, October 1998, pp. 78-85. [BJM98] J. Broch, D. Johnson, and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” IETF Internet draft, Dec. 1998. [BG87] D. Bertsekas and R. Gallager. Routing in Data Networks, chapter 5., Prentice Hall, second edition, 1987. [BJ98] J. Broch, D. John Johnson, and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks”, IETF Internet-Draft, draft-ietf-manet-dsr-00.txt, Mar. 1998 [Chi97] C. Chiang, “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel,” Proceedings of IEEE SICON ’97, April 1997, pp. 197-211. [Dub97] R. Dube, “Signal Stability based Adaptive Routing for Ad-Hoc Mobile Networks,” IEEE Personal Communication, Feb. 1997, pp. 36-45. [GCZ98] M. Gerla, C. Chiang, and L. Zhang, “Tree Multicast Strategies in Mobile, Multihop Wireless Networks,” ACM Mobile Networks and Applications, January 1998. [HP98] Z. Haas and M. Pearlman, “The Performance of Query Control Schemes for the Zone Routing Protocol”, ACM SIGCOMM ’98. [ICP99] A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, “Scalable Routing Strategies for Ad Hoc Wireless Networks”, IEEE Journal on Selected Areas in Communications, Aug. 1999, pp. 1369-79. [Jaf86] J.M. Jaffer and et al. “Subtle Design Issues in the implementation of Distributed, Dynamic Routing Algorithms”, Computer Networks and ISDN systems, 1986, pp. 147-68 [JLT99] M. Jiang, J. Li, and Y. Tay, “Cluster Based Routing Protocol”, August 1999, IETF Internet-Draft. [JM96] D. Johnson and D. Maltz, “Dynamic Source Routing in Ad Hoc Networks”, Mobile Computing, Kulwer, 1996, pp. 152-81. [JM99] D. Johnson and D. Maltz, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks”, October 1999 IETF Internet-Draft. [JN99] M. Joa-Ng and I. Lu, “A Peer-to-Peer zone-based two-level link state routing for mobile Ad Hoc Networks,” IEEE Journal on Selected Areas in Communications, Special Issue on Ad-Hoc Networks, Aug. 1999, pp.1415-25. [JT87] J. Jubin and J. Tornow, “The DARPA Packet Radio Network Protocols,” Proceedings of IEEE, vol. 75, no. 1, 1987, pp. 21-32 [KS71] L. Kleinrock and K. Stevens, “Fisheye: A Lenslike Computer Display Transformation,” Computer Science Department, UCLA, CA Tech. Report, 1971. [Man00] Mobile Ad-hoc Networks (MANET). URL:www.ietf.org/html.charters/manet-charter.html. February 2000. Work in progress. [MG96] S. Murthy and J.J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and Applications, Routing in Mobile Communication Networks, Oct. 1996, pp. 183-97. [Mis99] P. Misra, “Routing Protocols for Ad Hoc Mobile Wireless Networks”, Computer Science Department, Ohio State University, 1999. [Moy98] J. Moy, OSPF: Anatomy of an Internet Routing Protocol. Reading, Massachusetts, Addison Wesley Longman, Inc., 1998. [PB94] C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing(DSDV) for Mobile Computers”, Computer Communication Review, October 1994, pp.234-244. [PB96] L. Peterson and B. Davie, Computer Networks – A Systems Approach. San Francisco, Morgan Kaufmann Publishers Inc., 1996. [PC97] V. Park and M. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proceedings of INFOCOM ’97, Apr. 1997. [PR99] C.E. Perkins and E.M. Royer, “Ad-hoc On-Demand Distance Vector Routing,” Proceedings of 2nd IEEE Workshop of Mobile Computer Systems and Applications, Feb. 1999, pp. 90-100. [PC97] V. Park and M. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks”, Proceeedings of INFOCOM ’97, April 1997. [Per00] R. Perlman, Interconnections: Bridges, Routers, Switches, and Internetworking Protocols- 2nd Edition. Reading, Massachusetts, Addison Wesley Longman, Inc., 2000. [PR98] C. Perkins and E. Royer, “Ad Hoc On Demand Distance Vector(AODV) Routing,” IETF Internet draft, Nov. 1998. [PRD99] C. Perkins, E. Royer, and S. Das, “Ad Hoc On-demand Distance Vector Routing”, October 1999 IETF Internet-Draft. [RT99] R. Royer and C. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks”, IEEE Personal Communications, Vol. 6, No.2, pp.46-55, April 1999. [Sed83] R. Sedgewick. Weighted Graphs, chapter 31. Addison-Wesley, 1983. [Toh96] C. Toh, “A Novel Distributed Routing Protocol to Support Ad-Hoc Mobile Computing,” Proceedings of 1996 IEEE 15th Annual International Conference on Computing and Communication, Mar. 1996, pp. 480-86. [Toh97] C. Toh, “Associativity-Based Routing for Ad-Hoc Mobile Networks,” Wireless Personal Communication, vol. 4, no.2, Mar. 1997, pp. 1-36. [ZA91] W. Zaumen and J. Aceves, “Dynamics of Distributed Shortest-path Routing Algorithms”, Proceedings on Communication Architecture and Protocols, September 1991, pp 31-42. [ZBG98]X.Zeng, R. Bagrodia, and M.Gerla, “GloMoSim: A library for the parallel simulation of large-scale wireless networks,” in Proc. 12th Workshop Parallel and Distributed Simulations- PADS’98, pp. 154-161.
|