Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
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
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Multihop Ad Hoc Networking: The Theory
IEEE Communications Magazine
Hi-index | 0.00 |
Mobile ad hoc networks are being development quickly due to the availability of cheap 802.11 chips nowadays. A lot of algorithms are proposed to enhance the performance of mobile ad hoc networks. The main challenge in mobile ad hoc networks is mobility. Due to the moving node in the mobile ad hoc network, the route breaks frequently. In most of algorithms in the mobile ad hoc network, when constituting a route to destination node, the previous relay node will select as furthest node as possible to construct shortest path. The furthest node the previous node selects as the next hop relay node, the more possibly the link of the route will break in a short time. Researches need to be done in order to study the relation between the link and route maintenance probability and factors that affect the link and route maintenance probability. In this paper, we suggested the link maintenance probability model. And based on the link maintenance probability, route maintenance probability model was provided for mobile ad hoc networks.