📖
Link State Routing in Wireless Ad-Hoc Networks
Cédric Adjih, Emmanuel Baccelli, Philippe Jacquet

Link State Routing in Wireless Ad-Hoc Networks

Science & Mathematics Published 2003 Verification Pending

Overview & Synopsis

Link state has been the dominating IGP routing technology in IP networks for more than a decade. With the advent of wireless ad-hoc networking, the need for light, efficient and robust routing makes it a good candidate to be also used in this constrained environment. One of the key issue in ad-hoc networking is the lack of bandwidth. Thus, in this paper we examine the overhead due to link state routing in an ad-hoc network. More precisely we study the classic link-state protocol OSPF and OLSR, a link state protocol that was developed specifically for ad-hoc networks. Further, we study how this overhead evolves when the node density increases. The last part of the paper presents directions towards extending OSPF for wireless and ad-hoc networks, which would make it a favorite to seamlessly unify wired and mobile IP networks.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Link State Routing in Wireless Ad-Hoc Networks
Author / Organization Cédric Adjih, Emmanuel Baccelli, Philippe Jacquet
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2003
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-188653
Original Source Link Visit Source Page on hal.science »