Energy-Optimal and Energy-Balanced Sorting in a Single-Hop Wireless Sensor Network
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Energy-balanced task allocation for collaborative processing in wireless sensor networks
Mobile Networks and Applications
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Maximizing the functional lifetime of sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Energy optimal data propagation in wireless sensor networks
Journal of Parallel and Distributed Computing
Control Techniques for Complex Networks
Control Techniques for Complex Networks
Maximum energy welfare routing in wireless sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
An optimal data propagation algorithm for maximizing the lifespan of sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
An adaptive blind algorithm for energy balanced data propagation in wireless sensors networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Maximizing network lifetime online by localized probabilistic load balancing
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Close-to-optimal energy balanced data propagation via limited, local network density information
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
A new random walk for efficient data collection in sensor networks
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Energy balanced data propagation in wireless sensor networks with diverse node mobility
Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Exploiting limited density information towards near-optimal energy balanced data propagation
Computer Communications
| Hi-index | 0.00 |
This paper studies the data gathering problem in wireless networks, where data generated at the nodes has to be collected at a single sink. We investigate the relationship between routing optimality and fair resource management. In particular, we prove that for energy balanced data propagation, Pareto optimal routing and flow maximization are equivalent, and also prove that flow maximization is equivalent to maximizing the network lifetime. We algebraically characterize the network structures in which energy balanced data flows are maximal. Moreover, we algebraically characterize communication links which are not used by an optimal flow. This leads to the characterization of minimal network structures supporting the maximal flows. We note that energy balance, although implying global optimality, is a local property that can be computed efficiently and in a distributed manner. We suggest online distributed algorithms for energy balance in different optimal network structures and numerically show their stability in particular setting. We remark that although the results obtained in this paper have a direct consequence in energy saving for wireless networks they do not limit themselves to this type of networks neither to energy as a resource. As a matter of fact, the results are much more general and can be used for any type of network and different type of resources.