Path selection algorithms in homogeneous mobile ad hoc networks

EY Hua, ZJ Haas - Proceedings of the 2006 international conference on …, 2006 - dl.acm.org
Because of connectivity richness in mobile ad hoc networks, multiple paths often exist
between a source and a destination. Since many applications require uninterrupted …

Backup path set selection in ad hoc wireless network using link expiration time

A Dana, AK Zadeh, SAS Noori - Computers & Electrical Engineering, 2008 - Elsevier
Topological changes in mobile ad hoc networks frequently render routing paths unusable.
Such recurrent path failures have detrimental effects on quality of service. A suitable …

[PDF][PDF] Study of the effects of mobility on residual path lifetime in mobile ad hoc networks

EY Hua, ZJ Haas - Second IEEE Upstate NY Workshop on …, 2005 - people.ece.cornell.edu
In mobile ad hoc networks, a communication path often spans multiple hops. Knowledge of
the residual path lifetime may be quite useful in path selection algorithms, where the source …

Maximizing path durations in mobile ad-hoc networks

Y Han, RJ La - 2006 40th Annual Conference on Information …, 2006 - ieeexplore.ieee.org
We study the problem of path selection in mobile ad-hoc networks. Based on our earlier
results we propose a novel scheme that (i) maximizes the expected durations of selected …

Path set selection in mobile ad hoc networks

P Papadimitratos, ZJ Haas, EG Sirer - … on Mobile ad hoc networking & …, 2002 - dl.acm.org
Topological changes in mobile ad hoc networks frequently render routing paths unusable.
Such recurrent path failures have detrimental effects on the network ability to support QoS …

Exploring long lifetime routing (llr) in ad hoc networks

Z Cheng, WB Heinzelman - Proceedings of the 7th ACM international …, 2004 - dl.acm.org
In mobile ad hoc networks, node mobility causes links between nodes to break frequently,
thus terminating the lifetime of the routes containing those links. An alternative route has to …

An improvement over incremental approach for guaranteed identification of multiple node-disjoint paths in mobile ad hoc networks

AM Abbas, TA Abbasi - 2007 2nd International Conference on …, 2007 - ieeexplore.ieee.org
Identifying a maximal set of node-disjoint paths between a given source and a destination is
a challenging task in mobile ad hoc networks. One cannot guarantee to identify the maximal …

Transparent influence of path selection in heterogeneous ad hoc networks

ID Chakeres, EM Belding-Royer - 2004 IEEE 15th International …, 2004 - ieeexplore.ieee.org
In wireless ad hoc networks, heterogeneity is inherent and each node has different
characteristics, resources, and policies. Most current ad hoc routing protocols do not …

[PDF][PDF] A hybrid protocol for identification of a maximal set of node disjoint paths in mobile Ad hoc networks.

A Abbas - Int. Arab J. Inf. Technol., 2009 - ccis2k.org
Identifying a maximal set of node-disjoint paths between a given source and a destination is
a challenging task in mobile ad hoc networks. One cannot guarantee to identify the maximal …

Link lifetime prediction for optimal routing in mobile ad hoc networks

R Korsnes, K Ovsthus, FY Li… - MILCOM 2005-2005 …, 2005 - ieeexplore.ieee.org
Routing appears to be the most well studied aspect in ad hoc networking. However, existing
routing protocols usually do not take link lifetime into account for route establishment or …