Sciweavers

344 search results - page 12 / 69
» Maximum Energy Welfare Routing in Wireless Sensor Networks
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
DIALM
2008
ACM
139views Algorithms» more  DIALM 2008»
13 years 9 months ago
Approximating maximum integral flows in wireless sensor networks via weighted-degree constrained k-flows
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
Zeev Nutov
ALGOSENSORS
2004
Springer
14 years 29 days ago
Balanced Data Gathering in Energy-Constrained Sensor Networks
We consider the problem of gathering data from a wireless multi-hop network of energy-constrained sensor nodes to a common base station. Specifically, we aim to balance the total...
Emil Falck, Patrik Floréen, Petteri Kaski, ...
ICWN
2007
13 years 9 months ago
PBR: Priority Based Routing in Multi-Sink Sensor Networks
- Wireless sensor networks have been widely used in many fields with the developments of the related techniques. But there are many problems in traditional single sink sensor netwo...
Min Meng, Hui Xu, Xiaoling Wu, Brian J. d'Auriol, ...
MOBIHOC
2005
ACM
14 years 7 months ago
Hybrid sensor networks: a small world
In this paper, we investigate the use of limited infrastructure, in the form of wires, for improving the energy efficiency of a wireless sensor network. We call such a sensor netw...
Gaurav Sharma, Ravi Mazumdar