Sinha1999

CEDAR: A Core-Extraction Distributed Ad Hoc Routing Algorithm

Prasun Sinha, Raghupathy Sivakumar, Vaduvur Bharghavan
University of Illinois at Urbana-Champaign
Email: {prasun,sivakumr,bharghavg}@timely.crhc.uiuc.edu

The 18th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM '99
New York, NY, USA,
pp. 202-209
IEEE, March 1999

Citeseer:


Paper:


see [Sivakumar1999] for journal publication
see [Sivakumar1998] for Internet-Draft

Abstract

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.

Our 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.

Keywords

Ad hoc routing, QoS routing

BibTex

@INPROCEEDINGS(Sinha1999,
   TITLE = {CEDAR: Core extraction distributed ad hoc routing},
   AUTHOR = {Prasun Sinha and Raghupathy Sivakumar and Vaduvur Bharghavan},
   BOOKTITLE = {Proceedings of the Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM '99, New York, NY, USA},
   PAGES = {202-209},
   ORGANIZATION = {IEEE},
   PUBLISHER = {IEEE},
   MONTH = {March},
   YEAR = {1999},
   URL = {http://timely.crhc.uiuc.edu/Papers/infocom99.cedar.ps.gz},
   FILE = {infocom99.cedar.pdf}