Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Neighborhood aware source routing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Maximum flow-life curve for a wireless ad hoc network
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Minimum energy paths for reliable communication in multi-hop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Mobile Computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Routing and multicasting strategies in wireless mobile ad hoc networks
Routing and multicasting strategies in wireless mobile ad hoc networks
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
Shortcut Detection and Route Repair in Ad Hoc Networks
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks
Journal of Parallel and Distributed Computing
Salvaging route reply for on-demand routing protocols in mobile ad-hoc networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
IEEE Transactions on Mobile Computing
Congestion Adaptive Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
Adaptive backup routing for ad-hoc networks
Computer Communications
Quality-of-service routing using path and power aware techniques in mobile ad hoc networks
Journal of Computer Systems, Networks, and Communications
Energy level and link state aware AODV route request forwarding mechanism research
WSEAS TRANSACTIONS on COMMUNICATIONS
Routing with adaptive path and limited flooding for mobile ad hoc networks
Computers and Electrical Engineering
Model and analysis of path compression for mobile Ad Hoc networks
Computers and Electrical Engineering
Only the short die old: route optimization in MANETs by dynamic subconnection shrinking
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Dynamic path control scheme in mobile ad hoc networks using on-demand routing protocol
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
Neighbor-aware optimizing routing for wireless ad hoc networks
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Hi-index | 0.02 |
On demand routing protocols provide scalable and cost-effective solutions for packet routing in mobile wireless ad hoc networks. The paths generated by these protocols may deviate far from the optimal because of the lack of knowledge about the global topology and the mobility of nodes. Routing optimality affects network performance and energy consumption, especially when the load is high. In this paper, we define routing optimality using different metrics such as path length, energy consumption along the path, and energy aware load balancing among the nodes. We then propose a framework of Self-Healing and Optimizing Routing Techniques (SHORT) for mobile ad hoc networks. While using SHORT, all the neighboring nodes monitor the route and try to optimize it if and when a better local sub-path is available. Thus SHORT enhances performance in terms of bandwidth and latency without incurring any significant additional cost. In addition, SHORT can be also used to determine paths that result in low energy consumption or optimize the residual battery power. Thus, we have detailed two broad classes of SHORT algorithms: Path-Aware SHORT and Energy-Aware SHORT. Finally, we evaluate SHORT using the ns-2 simulator. The results demonstrate that the performance of existing routing schemes can be significantly improved using the proposed SHORT algorithms.