Issue No. 06 - June (2006 vol. 17)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2006.77
Chong Liu , IEEE
Kui Wu , IEEE
Yang Xiao , IEEE
Bo Sun , IEEE
<p><b>Abstract</b>—Sensor scheduling plays a critical role for energy efficiency of wireless sensor networks. Traditional methods for sensor scheduling use either sensing coverage or network connectivity, but rarely both. In this paper, we deal with a challenging task: Without accurate location information, how do we schedule sensor nodes to save energy and meet both constraints of sensing coverage and network connectivity? Our approach utilizes an integrated method that provides statistical sensing coverage and guaranteed network connectivity. We use random scheduling for sensing coverage and then turn on extra sensor nodes, if necessary, for network connectivity. Our method is totally distributed, is able to dynamically adjust sensing coverage with guaranteed network connectivity, and is resilient to time asynchrony. We present analytical results to disclose the relationship among node density, scheduling parameters, coverage quality, detection probability, and detection delay. Analytical and simulation results demonstrate the effectiveness of our joint scheduling method.</p>
Wireless sensor networks, scheduling algorithms, performance analysis.
Y. Xiao, B. Sun, C. Liu and K. Wu, "Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 17, no. , pp. 562-575, 2006.