BibTeX
@MISC{List03routingprotocols,
author = {William Douglass List},
title = {Routing Protocols for k-hop Networks },
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Previous research has identified the scalability limitations of stand-alone wireless ad hoc networks. Shared access to a single wireless channel in the presence of a dense network leads to congestion and high channel contention. Increasing the diameter of the network introduces long paths that become prone to breakage, leading to degraded performance. As such, in this thesis we propose that the scope of a node’s ad hoc capabilities be limited to a maximum diameter of k hops where k is small, in order to trade off connectivity with overhead. In addition, we suggest an overlay of fixed base stations equipped with a secondary high-bandwidth channel to support connections between nodes in the network, with a maximum of 2k wireless hops. We present our k-hop network architecture and propose several routing protocols specifically tailored for the architecture. We demonstrate through simulations that these routing protocols provide efficient and reliable routing even in the presence of mobility and high node density. Finally, we describe our testbed here at UIUC that has put into practice the k-hop architecture.
Keyphrases
k-hop network approved maximum diameter high node density scalability limitation wireless hop network introduces node ad hoc capability secondary high-bandwidth channel k-hop network architecture previous research shared access stand-alone wireless ad hoc network fixed base station k-hop architecture high channel contention single wireless channel dense network
