CEDAR: a Core-Extraction Distributed Ad hoc Routing algorithm

CEDAR: a Core-Extraction Distributed Ad hoc Routing algorithm

1999 | Prasun Sinha Raghupathy Sivakumar Vaduvur Bharghavan
CEDAR is an algorithm designed for QoS routing in ad hoc networks, focusing on robust and adaptive performance. It consists of three key components: (a) establishing and maintaining a self-organizing routing infrastructure called the core, (b) propagating link-state information of stable high-bandwidth links through increase/decrease waves, and (c) a QoS route computation algorithm executed at core nodes using local state. The core is formed by electing a set of hosts that approximate a minimum dominating set, each maintaining local topology and performing route computation. Link-state propagation is achieved through increase and decrease waves, ensuring that only stable high-bandwidth links are propagated. Route computation involves finding a shortest-widest path along the core path, using local information. The paper discusses the network model, core architecture, link state propagation, and route computation, followed by performance evaluation through simulations. CEDAR demonstrates robustness and adaptability, effectively handling network dynamics while maintaining link-state performance for stable networks.CEDAR is an algorithm designed for QoS routing in ad hoc networks, focusing on robust and adaptive performance. It consists of three key components: (a) establishing and maintaining a self-organizing routing infrastructure called the core, (b) propagating link-state information of stable high-bandwidth links through increase/decrease waves, and (c) a QoS route computation algorithm executed at core nodes using local state. The core is formed by electing a set of hosts that approximate a minimum dominating set, each maintaining local topology and performing route computation. Link-state propagation is achieved through increase and decrease waves, ensuring that only stable high-bandwidth links are propagated. Route computation involves finding a shortest-widest path along the core path, using local information. The paper discusses the network model, core architecture, link state propagation, and route computation, followed by performance evaluation through simulations. CEDAR demonstrates robustness and adaptability, effectively handling network dynamics while maintaining link-state performance for stable networks.
Reach us at info@study.space
Understanding CEDAR%3A a core-extraction distributed ad hoc routing algorithm