CEDAR: a Core-Extraction Distributed Ad hoc Routing Algorithm

DMCA

CEDAR: a Core-Extraction Distributed Ad hoc Routing Algorithm (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Prasun Sinha , Raghupathy Sivakumar , Vaduvur Bharghavan

Venue:	IEEE Journal on Selected Areas in Communications
Citations:	397 - 10 self

BibTeX

@ARTICLE{Sinha99cedar:a,
    author = {Prasun Sinha and Raghupathy Sivakumar and Vaduvur Bharghavan},
    title = {CEDAR: a Core-Extraction Distributed Ad hoc Routing Algorithm},
    journal = {IEEE Journal on Selected Areas in Communications},
    year = {1999},
    volume = {17},
    pages = {1454--1465}
}

OpenURL

Abstract

Absiract—CEDARis an algorithm for QoS routing in ad hoc network environments. It has three key components: (a) the establishment and main-tenance of a setf-organizing routing infrastructure catted the core for per-forming 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 ra,ute computation algorithm that is exeeuted at the core nodes using onty 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 white stitl approximating link-state performance for stable networks. Keywords—Ad hoc routing, QoS routing I.

Keyphrases

qos ra keywords ad hoc routing absiract cedaris network white stitl increase decrease wave ute computation algorithm stable network core node ad hoc network environment stable high-bandwidth link key component setf-organizing routing infrastructure per-forming route computation available state link-state performance adaptive qos preliminary performance evaluation

DMCA