Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Signal stability based adaptive routing (SSA) for ad-hoc mobile networks
Signal stability based adaptive routing (SSA) for ad-hoc mobile networks
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
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
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
A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
Sensor-aided routing for mobile ad hoc networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Performance enhancement of WiMAX by three layers topology
International Journal of Mobile Communications
Hi-index | 0.24 |
An ad hoc network can be envisioned as a collection of mobile routers, each equipped with a wireless transceiver, which are free to move about arbitrarily. In ad hoc wireless networks, even if two nodes are outside the wireless transmission range of each other, they may still be able to communicate in multiple hops using other intermediate nodes. However, the dynamics of these networks, as a consequence of mobility and disconnection of mobile hosts, pose a number of problems in designing routing schemes for effective communication between any pair of source and destination. In this paper, a stability-based unicast routing mechanism, that considers both link affinity and path stability in order to find out a stable route from source to destination, is proposed. It is then extended to support multicast routing as well where only local state information (at source) is utilized for constructing a multicast tree. The performance of the proposed scheme is evaluated on a simulated environment to show that the stability-based scheme provides a unified framework for both unicast and multicast routing and reduces the probability of route error drastically in both the cases.