Mobility prediction and routing in ad hoc wireless networks
International Journal of Network Management
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Link Stability in Mobile Wireless Ad Hoc Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Predictive distance-based mobility management for multidimensional PCS networks
IEEE/ACM Transactions on Networking (TON)
Strategies for Finding Stable Paths in Mobile Wireless Ad Hoc Networks
LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
On the behavior of communication links of a node in a multi-hop mobile environment
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Analysis of multipath Routing-Part I: the effect on the packet delivery ratio
IEEE Transactions on Wireless Communications
Multipath routing in the presence of frequent topological changes
IEEE Communications Magazine
Analyzing path dynamics in mobile ad hoc networks using a smooth mobility model
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
| Hi-index | 0.00 |
Because of connectivity richness in mobile ad hoc networks, multiple paths often exist between a source and a destination. Since many applications require uninterrupted connectivity of a session, the ability to find long-living paths can be very useful. In this paper, we propose three path-selection algorithms and evaluate their performance in a homogeneous network based on two criteria: 1) the selected path is the most likely to meet a target residual path lifetime requirement, and 2) the selected path has the longest residual path lifetime among all the available paths. We also introduce two performance metrics to compare the proposed algorithms among themselves and with a baseline random-selection algorithm. All three algorithms demonstrate comparable performance in satisfying the first criterion, although the first algorithm performs consistently better than the other two for both criteria. As the path-set size increases, the proposed algorithms yield greater performance gain over the baseline algorithm. Furthermore, we show that these algorithms perform better in a higher mobility environment than when the mobility is low.