A routing protocol for k-hop networks
William D. List, Nitin H. Vaidya · 2004
Recent years have witnessed the widespread deployment of IEEE 802.11 LANs in areas such as airports, campuses, and enterprises. These networks allow users to access network services and the Internet in remote locations and without the need Tor wires. The data rates for 802.11a, b and g far surpass that of wide-area cellular networks, however, the range of transmission of 802.11 is much less than that of cellular (250m versus 20km). Employing ad-hoc mode in 802.11 can extend traditional WLANs to multiple hops, thus increasing coverage and reducing the need for additional infrastructure. The amount of network extension (in terms of wireless hops) is limited by the density of the network (i.e., the availability of wireless devices that can serve as relays for other devices), and the scalability of stand-alone wireless ad-hoc networks. In this paper, we introduce a k-hop architecture and routing protocol utilizing a "beaconing" approach for route discovery and maintenance. We demonstrate through simulations the efficiency and reliability of our routing protocol in the presence of mobility and high node density.