669 search results - page 7 / 134 » Constructing minimum energy mobile wireless networks |
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
VTC
2006
IEEE
15 years 3 months ago
2006
IEEE
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
MOBICOM
2003
ACM
15 years 2 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...
SOFSEM
2007
Springer
15 years 3 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
114
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
Current algorithms for minimum-energy routing in wireless networks typically select minimum-cost multi-hop paths. In scenarios where the transmission power is fixed, each link has...