CEDAR: a core-extraction distributed ad hoc routing algorithm

CEDAR is an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and maintenance of a self-organizing routing infrastructure called the core for performing route computations, (b) the propagation of the link-state of stable high-bandwidth links in the core through increase/decrease waves, and (c) a QoS route computation algorithm that is executed at the core nodes using only locally available state. But preliminary performance evaluation shows that CEDAR is a robust and adaptive QoS routing algorithm that reacts effectively to the dynamics of the network while still approximating link-state performance for stable networks.

[1]  Peter Steenkiste,et al.  Quality-of-Service Routing for Traffic with Performance Guarantees , 1997 .

[2]  V. Bharghavan,et al.  MACAW: A media access protocol for wireless LANs , 1994 .

[3]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[4]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[5]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[6]  J. J. Garcia-Luna-Aceves,et al.  A routing protocol for packet radio networks , 1995, MobiCom '95.

[7]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[8]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[9]  D. A. Hall.  Tactical Internet system architecture for Task Force XXI , 1996, Proceedings of the 1996 Tactical Communications Conference. Ensuring Joint Force Superiority in the Information Age.

[10]  J. Jubin,et al.  The DARPA packet radio network protocols , 1987, Proceedings of the IEEE.

[11]  Douglas S. Reeves,et al.  A distributed algorithm for delay-constrained unicast routing , 1997, Proceedings of INFOCOM '97.

[12]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[13]  N. Shacham,et al.  Future directions in packet radio architectures and protocols , 1987, Proceedings of the IEEE.

[14]  Norio Shiratori,et al.  QoS based routing algorithm in integrated services packet networks , 1997, Proceedings 1997 International Conference on Network Protocols.

[15]  M. S. Corson,et al.  Architectural considerations for mobile mesh networking , 1996, Proceedings of MILCOM '96 IEEE Military Communications Conference.

[16]  Quan Sun,et al.  A new distributed routing algorithm for supporting delay-sensitive applications , 1998, Comput. Commun..

[17]  Cengiz Alaettinoglu,et al.  The Viewserver Hierarchy for Interdomain Routing: Protocols and Evaluation , 1995, IEEE J. Sel. Areas Commun..

[18]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[19]  J. J. Garcia-Luna-Aceves,et al.  Solutions to hidden terminal problems in wireless networks , 1997, SIGCOMM '97.

[20]  Chai-Keong Toh,et al.  A novel distributed routing protocol to support ad-hoc mobile computing , 1996, Conference Proceedings of the 1996 IEEE Fifteenth Annual International Phoenix Conference on Computers and Communications.

[21]  Peter Steenkiste,et al.  Routing high-bandwidth traffic in max-min fair share networks , 1996, SIGCOMM '96.

[22]  P. F. Tsuchiya.  The landmark hierarchy: a new hierarchy for routing in very large networks , 1988, SIGCOMM.

[23]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[24]  J. Broach,et al.  The dynamic source routing protocol for mobile ad-hoc networks , 1998 .

[25]  Anthony Ephremides,et al.  A neural network approach to routing in multihop radio networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[26]  Baruch Awerbuch,et al.  Routing through networks with hierarchical topology aggregation , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[27]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[28]  C. V. Ramamoorthy,et al.  An Adaptive Hierarchical Routing Protocol , 1989, IEEE Trans. Computers.

[29]  Ariel Orda,et al.  QoS routing in networks with uncertain parameters , 1998, IEEE/ACM Trans. Netw..

[30]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[31]  R. Lee Hamilton,et al.  Optimal routing in multihop packet radio networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[32]  Satish K. Tripathi,et al.  Signal stability-based adaptive routing (SSA) for ad hoc mobile networks , 1997, IEEE Wirel. Commun..

[33]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[34]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[35]  BhagwatPravin,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994 .

[36]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[37]  David L. Mills.  Wiretap: an experimental multiple-path routing algorithm , 1989, CCRV.

[38]  Zygmunt J. Haas,et al.  The performance of query control schemes for the zone routing protocol , 2001, TNET.