Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Coping with communication gray zones in IEEE 802.11b based ad hoc networks
WOWMOM '02 Proceedings of the 5th ACM international workshop on Wireless mobile multimedia
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Minimum energy disjoint path routing in wireless ad-hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Only the short die old: route optimization in MANETs by dynamic subconnection shrinking
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
| Hi-index | 0.00 |
When a routing protocol for manet networks (mobile and ad hoc networks) does a route discovery, it does not discover the shortest route but the route through which the route request flood traveled faster. In addition, since nodes are moving, a route that was the shortest one at discovery time might stop being so in quite a short period of time. This causes, not only a much bigger end-to-end delay, but also more collisions and a faster power consumption. In order to avoid all the performance loss due to these problems, this paper develops a technique to periodically discover shortcuts to the active routes that can be used with any destination vector routing protocol. It also shows how the same mechanism can be used as a bidirectional route recovery mechanism.