Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
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
Neighborhood aware source routing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Towards Middleware Services for Mobile Ad-Hoc Network Applications
FTDCS '03 Proceedings of the The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems
Analysis of Randomized Congestion Control in DSDV Routing
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
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
Supporting Hierarchy and Heterogeneous Interfaces in Multi-Hop Wireless Ad Hoc Networks
ISPAN '99 Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks
IEEE Communications Magazine
The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
A distributed data caching framework for mobile ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
Information Sciences: an International Journal
Information Sciences: an International Journal
A location-aware multicasting protocol for Bluetooth Location Networks
Information Sciences: an International Journal
A stable weight-based on-demand routing protocol for mobile ad hoc networks
Information Sciences: an International Journal
Packet construction for secure conference call request in ad hoc network systems
Information Sciences: an International Journal
Information Sciences: an International Journal
Improving ACK reply of DSR protocol for mobile ad hoc network
EHAC'09 Proceedings of the 8th WSEAS international conference on Electronics, hardware, wireless and optical communication
Enhancing DSR protocol performance in mobile ad hoc network using ACK reply
WSEAS TRANSACTIONS on COMMUNICATIONS
Energy efficient all-to-all broadcast in all-wireless networks
Information Sciences: an International Journal
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Neighbor supported reliable multipath multicast routing in MANETs
Journal of Network and Computer Applications
Traffic-aware and low-overhead routing protocol for mobile ad hoc networks
International Journal of Communication Networks and Distributed Systems
Hi-index | 0.07 |
Mobile Ad Hoc Networks (MANETs), which provide data networking without infrastructure, represent one kind of wireless networks. A MANET is a self-organizating and adaptive wireless network formed by the dynamic gathering of mobile nodes. Due to the mobility of mobile nodes, the topology of a MANET frequently changes and thus results in the disability of originally on-the-fly data transmission routes. The dynamic properties of MANETs are therefore challenging to protocol design. To cope with the intrinsic properties of MANETs, Dynamic Backup Routes Routing Protocol (DBR^2P), a backup node mechanism for quick reconnection during link failures, is proposed in this paper. DBR^2P is an on-demand routing protocol and it can set up many routes to reach a destination node in a given period. Even when a link fails, those routes from the source node to the destination node can be analyzed to obtain backup routes to sustain quick reconnection. The information of backup routes can be saved in a specific on-the-route node and enables backup routes to be found immediately in situation regarding disconnection. As a result, DBR^2P could more thoroughly improve the quality of routing protocol than those proposed in the past.