Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Routing with load balancing in wireless Ad hoc networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Comparison of routing metrics for static multi-hop wireless networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Mitigating the FloodingWaves Problem in Energy-Efficient Routing for MANETs
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Multichannel mesh networks: challenges and protocols
IEEE Wireless Communications
IEEE Communications Magazine
| Hi-index | 0.00 |
On-demand routing protocols in wireless ad-hoc (mesh) networks use route requests to search for a routing path. To determine a route that optimizes a metric function, an intermediate node retransmits a route request that has a lower metric value. This can create flooding waves, where a large number of route requests are retransmitted through the network. In this paper, we study different classes of node load-based metric functions that are useful in sensor networks and telephony applications. We tackle the problem of determining optimal routes while minimizing flooding waves. We define a notion of efficient floodingand show that an online algorithm can discover an optimal metric path while achieving efficient flooding for a sum loadmetric, but this is not possible for a min-maxload metric. We simulate an online algorithm that is provably efficient in terms of flooding for some classes of metrics and analyze its performance for different load-based metric functions.