Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Negotiation-based protocols for disseminating information in wireless sensor networks
Wireless Networks - Selected Papers from Mobicom'99
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation
SNPD-SAWN '06 Proceedings of the Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM (JACM)
Fast algorithm for multicast and data gathering in wireless networks
Information Processing Letters
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Query Processing in Sensor Networks
IEEE Pervasive Computing
On construction of minimum energy k-fault resistant topologies
Ad Hoc Networks
Processing Event-Monitoring Queries in Sensor Networks
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
INFOCOM'10 Proceedings of the 29th conference on Information communications
Reliable and real-time data gathering in multi-hop linear wireless sensor networks
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
| Hi-index | 0.00 |
This paper studies the problem of data gathering in hierarchical wireless ad hoc networks. In this scenario, a set of wireless devices generates messages which are addressed to the base station. As not all nodes can reach the base station through a direct transmission, messages are relayed by other devices in a multi-hop fashion. We consider data gathering without aggregation, i.e. all the generated messages are required to reach the base station -- this is in contrast to the well studied problem of data gathering with aggregation, which appears to be significantly simpler. The above scheme may have poor performance in wireless networks with hierarchical architecture. The devices in the layer closest to the base station form a bottleneck in terms of energy consumption as they experience a very high volume of forward requests. Eventually, these nodes will be the first to run out of their battery charges which will cause connectivity losses. In this paper we focus on prolonging the network lifetime of hierarchical networks through efficient balancing of forward requests, which is NP-hard. We develop an approximation scheme which produces a data gathering tree with network lifetime which is at most k times less than the optimal one, where k is the number of hierarchical layers. Our results are analytically proved and validated through simulations.