Real and complex analysis, 3rd ed.
Real and complex analysis, 3rd ed.
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Developments from a June 1996 seminar on Online algorithms: the state of the art
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Coverage and hole-detection in sensor networks via homology
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
A survey of energy-efficient scheduling mechanisms in sensor networks
Mobile Networks and Applications
Throughput-competitive on-line routing
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Lifetime maximization for connected target coverage in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Genetic coverage verification without location information using dimension reduction
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
On solving coverage problems in a wireless sensor network using voronoi diagrams
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Relative location estimation in wireless sensor networks
IEEE Transactions on Signal Processing
Distance Estimation Using Bidirectional Communications Without Synchronous Clocking
IEEE Transactions on Signal Processing
Performance analysis of relative location estimation for multihop wireless sensor networks
IEEE Journal on Selected Areas in Communications
Positioning in ad hoc sensor networks
IEEE Network: The Magazine of Global Internetworking
Energy-balanced sampling workload allocation in wireless sensor networks
Computers & Mathematics with Applications
Adaptive k-coverage contour evaluation and deployment in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
| Hi-index | 0.00 |
In wireless sensor networks (WSNs), a large number of sensors perform distributed sensing of a target field. A sensor cover is a subset of the set of all sensors that covers the target field. The lifetime of the network is the time from the point the network starts operation until the set of all sensors with nonzero remaining energy does not constitute a sensor cover any more. An important goal in sensor networks is to design a schedule--that is, a sequence of sensor covers to activate in every time slot--so as to maximize the lifetime of the network. In this paper, we design a polynomial-time distributed algorithm for maximizing the lifetime of the network and prove that its lifetime is at most a factor O(log n * log nB) lower than the maximum possible lifetime, where n is the number of sensors and B is an upper bound on the initial energy of each sensor. Our algorithm does not require knowledge of the locations of nodes or directional information, which is difficult to obtain in sensor networks. Each sensor only needs to know the distances between adjacent nodes in its transmission range and their sensing radii. In every slot, the algorithm first assigns a weight to each node that is exponential in the fraction of its initial energy that has been used up so far. Then, in a distributed manner, it finds an O(log n) approximate minimum weight sensor cover, which it activates in the slot.