Sciweavers

545 search results - page 3 / 109
» Minimum energy accumulative routing in wireless networks
Sort
View
BROADNETS
2007
IEEE
13 years 11 months ago
On energy aware routing in wireless networks
—Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flo...
Aravind B. Mohanoor, Sridhar Radhakrishnan, Venkat...
INFOCOM
2012
IEEE
11 years 7 months ago
On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approxima
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
Tung-Wei Kuo, Ming-Jer Tsai
MOBIHOC
2002
ACM
14 years 4 months ago
Minimum energy paths for reliable communication in multi-hop wireless networks
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...
Suman Banerjee, Archan Misra
SOFSEM
2007
Springer
13 years 11 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
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 ...
Markus Maier, Steffen Mecke, Dorothea Wagner
CISS
2010
IEEE
12 years 9 months ago
Minimum cost optimization of multicast wireless networks with network coding
— Minimum cost optimization for multicast with network coding has attracted great research interests. In this paper, based on an information model that differentiates intermediat...
Chengyu Xiong, Xiaohua Li