545 search results - page 13 / 109 » Minimum energy accumulative routing in wireless networks |
ADHOCNOW
2005
Springer
14 years 1 months ago
2005
Springer
We study the problem of computing multicast trees with minimal bandwidth consumption in multi-hop wireless mesh networks. For wired networks, this problem is known as the Steiner t...
IPSN
2005
Springer
14 years 1 months ago
2005
Springer
— We consider the problem of energy efficient random deployment of sensor network. Our goal is to find the sensor node density, or alternatively, the energy resource density at e...
NETWORKING
2007
13 years 9 months ago
2007
Most routing algorithms for sensor networks focus on finding energy efficient paths to prolong the lifetime of sensor networks. As a result, the sensors on the efficient paths are ...
LION
2007
Springer
14 years 1 months ago
2007
Springer
The problem of finding the broadcast scheme with minimum power consumption in a wireless ad-hoc network is NP-hard. This work presents a new hybrid algorithm to solve this problem...
AINA
2005
IEEE
14 years 1 months ago
2005
IEEE
The network lifetime for wireless sensor network plays an important role to survivability. Thus, we indicate the importance of routing protocol to network lifetime, and model the ...