Sciweavers

545 search results - page 2 / 109
» Minimum energy accumulative routing in wireless networks
Sort
View
TWC
2008
141views more  TWC 2008»
13 years 4 months ago
Progressive Accumulative Routing: Fundamental Concepts and Protocol
This paper considers a multi-hop network in which relay nodes cooperate to minimize the total energy consumed in transmitting a (unicast) packet from a source to a destination. We...
Raymond Yim, Neelesh B. Mehta, Andreas F. Molisch,...
VTC
2006
IEEE
118views Communications» more  VTC 2006»
13 years 11 months ago
Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
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...
Fulu Li, Andrew Lippman, Kui Wu
MOBICOM
2003
ACM
13 years 10 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
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...
Anand Srinivas, Eytan Modiano
SIGMOBILE
2002
98views more  SIGMOBILE 2002»
13 years 4 months ago
An on-demand minimum energy routing protocol for a wireless ad hoc network
Sheetalkumar Doshi, Shweta Bhandare, Timothy X. Br...
GLOBECOM
2007
IEEE
13 years 8 months ago
Distributed Energy-Efficient Cooperative Routing in Wireless Networks
Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing powerefficient ro...
Ahmed S. Ibrahim, Zhu Han, K. J. Ray Liu