We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
—We reconsider the problem of geographic routing in wireless ad hoc networks. We are interested in local, memoryless routing algorithms, i.e. each network node bases its routing ...
—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
—Urban sensing where mobile users continuously gather, process, and share location-sensitive sensor data (e.g., street images, road condition, traffic flow) is emerging as a ne...
Supporting scalable and efficient routing and service provision in Mobile Ad Hoc Networks (MANET) has been a big research challenge. Conventional topology-based unicast and multic...