MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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
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
ARA - The Ant-Colony Based Routing Algorithm for MANETs
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Wireless multihop mobile networks, also known as ad hoc networks, are characterized by stochastic topology variations. Random movements of mobile hosts in and out of each other's range encumber smooth system operation and impose limitations on the network performance. Various routing protocols suitable for such networks have been proposed however implementation and performance issues are still considered top research priorities. This paper proposes a new reactive protocol that introduces the use of sequence numbers for evaluating validity of cached routing information when source routing and route caching are used. The new protocol reduces the possibility of using and spreading across the network stale routing information therefore reduces the overhead involved in finding a route. To demonstrate the performance of the proposed protocol we compare it, through a detailed simulation model, with Dynamic Source Routing (DSR) protocol which also uses source routing and route caching. Results prove that the proposed protocol effectively reduces use of stale routing information, improving performance compared to DSR in terms of both delivery ratio and routing overhead.