IEEE Transactions on Computers · 2009 · 79 citations · 27 references
ComputingComputer SystemsProbability TheorySensorsWireless CommunicationsCoverage ControlDistributed Sensor NetworksSensor NetworksWireless NetworksWireless Sensor NetworksAsymptotic CoverageDetection DelayEnergy ConsumptionNetwork LifetimeProbability Of Detection AnalysisSensor NodesSensor SchedulingSleep
In wireless sensor networks, some sensor nodes are put in sleep mode while other sensor nodes are in active mode for sensing and communication tasks in order to reduce energy consumption and extend network lifetime. This approach is a special case (k=2) of a randomized scheduling algorithm, in which k subsets of sensors work alternatively. In this paper, we first study the randomized scheduling algorithm via both analysis and simulations in terms of network coverage intensity, detection delay, and detection probability. We further study asymptotic coverage and other properties. Finally, we analyze a problem of maximizing network lifetime under quality of service constraints such as bounded detection delay, detection probability, and network coverage intensity. We prove that the optimal solution exists, and provide conditions of the existence of the optimal solutions.
27
Coverage problems in wireless ad-hoc sensor networks
Saro Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak et al. · 2002 · 1.7K citations
Benjie Chen, Kyle Jamieson, Hari Balakrishnan et al. · 2001 · 1.4K citations
Integrated coverage and connectivity configuration in wireless sensor networks
Xiaorui Wang, Guoliang Xing, Yuanfang Zhang et al. · 2003 · 1.3K citations · Full text