61 search results - page 1 / 13 » Minimum energy disjoint path routing in wireless ad-hoc netw... |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint...
IPCCC
2006
IEEE
13 years 10 months ago
2006
IEEE
We study the routing problem for multi-hop wireless ad hoc networks based on cooperative transmission. We prove that the Minimum Energy Cooperative Path (MECP) routing problem, i....
WOWMOM
2005
ACM
13 years 10 months ago
2005
ACM
In this work we study energy efficient routing strategies for wireless ad-hoc networks. In this kind of networks, energy is a scarce resource and its conservation and efficient us...
ADHOC
2007
13 years 4 months ago
2007
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
MOBICOM
2003
ACM
13 years 9 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...