Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Rate allocation in wireless sensor networks with network lifetime requirement
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Spatio-temporal correlation: theory and applications for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Power conservation and quality of surveillance in target tracking sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
IEEE Journal on Selected Areas in Communications
The optimum sensor redeployment scheme using the most frangible clusters set
Computer Communications
Near-lifetime-optimal data collection in wireless sensor networks via spatio-temporal load balancing
ACM Transactions on Sensor Networks (TOSN)
Efficient algorithm for maximum lifetime many-to-one data aggregation in wireless sensor networks
International Journal of Sensor Networks
Hi-index | 0.00 |
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to develop algorithms and techniques that minimize the data gathering latency and at the same time balance the energy consumption among the nodes, so as to maximize the network lifetime. Following an incremental-complexity approach, several mathematical programming problems are proposed with focus on different network performance metrics. First, the static routing problem is formulated for large and dense WSNs. Optimal data-gathering trees are analyzed and the effects of several sensor capabilities and constraints are discussed, e.g., radio power constraints, energy consumption model, and data aggregation functionalities. Then, dynamic re-routing and scheduling are considered. An accurate network model is proposed that captures the tradeoff between the data gathering latency and the energy consumption, by modeling the interactions among the routing, medium access control and physical layers.For each problem, extensive simulation results are provided. The proposed models provide a deeper insight into the problem of timely and energy efficient data gathering. Useful guidelines for the design of efficient WSNs are derived and discussed.