Sciweavers

21 search results - page 1 / 5
» On k-coverage in a mostly sleeping sensor network
Sort
View
DCOSS
2006
Springer
13 years 8 months ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
Wei Mo, Daji Qiao, Zhengdao Wang
INFOCOM
2007
IEEE
13 years 11 months ago
Randomized k-Coverage Algorithms For Dense Sensor Networks
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...
Mohamed Hefeeda, M. Bagheri
MOBICOM
2004
ACM
13 years 10 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
ICCS
2007
Springer
13 years 10 months ago
Reliability of Wireless Sensor Network with Sleeping Nodes
Abstract. Energy efficiency is an important technology of sensor networks development. In this paper we offer a method of sensors lifetime maximizing under required level of netwo...
Vladimir V. Shakhov, Hyunseung Choo
PIMRC
2008
IEEE
13 years 11 months ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung