Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Time synchronization in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
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
Time Synchronization for Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Fine-grained network time synchronization using reference broadcasts
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Time-diffusion synchronization protocol for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Optimal Base-Station Locations in Two-Tiered Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Global Clock Synchronization in Sensor Networks
IEEE Transactions on Computers
Algorithm design for base station placement problems in sensor networks
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Positioning of Base Stations in Wireless Sensor Networks
IEEE Communications Magazine
Time synchronization in sensor networks: a survey
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
We study the problem of transmitting data from a set of sensors to a base-station where the data is to be gathered. Each sensor continuously generates data and has to transmit it through the network (via other sensor nodes) to the base-station. Considering the battery limitations of the sensors, our goal is to find an optimum location of the base-station and a corresponding data transmission scheme for routing the data from the sensors, such that the network is operating for the longest possible time. We focus mainly on tree networks for 2-level trees, with at most 2 hops from sensor to the base-station. For such networks we give efficient algorithms for forwarding data from sensors to the base-station and for locating the base-station optimally for maximizing network lifetime. Further, we show that determining a transmission protocol for trees with 3 or more levels is NP-hard. We demonstrate the effectiveness of our methods with experimental results on simulated data, comparing our 2-level tree algorithm with methods based on linear programming.