Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Introduction to algorithms
Time synchronization in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
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
Application-specific protocol architectures for wireless networks
Application-specific protocol architectures for wireless networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Algorithmic aspects of capacity in wireless networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Ultra-low power data storage for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
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
Data harvesting with mobile elements in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data transmission and base-station placement for optimizing network lifetime
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
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 |
In this paper, we study the fundamental optimization problem in wireless sensor networks of base-station positioning such that data from the sensors may be transmitted to it in an energy-efficient manner. We primarily consider the setting where a sensor transmits all of its data directly to the base-station or relays it via one other node. This setting provides two benefits: low duty-cycling due to limited synchronization requirements between nodes and low end-to-end delay due to the limited number of hops in the routes. Given the battery limitations of the sensor nodes, our objective is to maximize the network lifetime. First, we present efficient algorithms for computing a transmission scheme for the sensors given a fixed base-station and show how to implement these in a distributed fashion with only a constant number of messages per sensor. Next, we show that the optimization problem for the setting where sensors may transmit data through more than 2 hops is NP-Hard. Finally, we present efficient algorithms for the problem of locating the base-station and simultaneously finding a transmission scheme. We compare our algorithms with linear-programming based algorithms for more general settings through extensive simulations and outline the benefits of the different approaches.