Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A routing protocol for packet radio networks
MobiCom '95 Proceedings of the 1st annual 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
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
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
Ad Hoc On-Demand Backup Node Setup Routing Protocol
ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
Graph Theory With Applications
Graph Theory With Applications
CEDAR: a core-extraction distributed ad hoc routing algorithm
IEEE Journal on Selected Areas in Communications
A simulation study of table-driven and on-demand routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
The Robustness of RM-DSR Multipath Routing Protocol with Different Network Size in MANET
International Journal of Mobile Computing and Multimedia Communications
Analyzing and Improving Network Availability in Interdomain Routing
Wireless Personal Communications: An International Journal
Hi-index | 0.00 |
Numerous routing protocols have recently been developed for ad hoc mobile networks. Routing protocols to date can be categorized as either `table-driven' or `on-demand'. Many of the proposed routing protocols take the on-demand approach because this does not require keeping lots of routing information. However, these kinds of protocols are not able to react fast enough to maintain routing. In this paper, we propose a new protocol to improve existing on-demand routing protocols by constructing multiple backup routes; when the network topology changed, the proposed protocol could transmit data packets dynamically through backup routes. We then developed an analytic model to estimate the reconnection probability of the proposed algorithm. We also examined the performance by simulating the protocol using ns2. The experimental results showed that the protocol had fewer control packages, lower routing packet overhead, and a higher receiving ratio than others.