Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18]

@

Journal of Information Science and Engineering, Vol. 25 No. 1, pp. 273-287 (January 2009)

A Fault-tolerant Adaptive Node Scheduling Scheme for Wireless Sensor Networks*

Jungeun Choi, Joosun Hahn and Rhan Ha
Department of Computer Engineering
Hongik University
Seoul, 121-791 Korea

In wireless sensor networks, the limited battery resources of sensor nodes have a direct impact on network lifetime. To improve energy efficiency, there have been a variety of sensor node scheduling methods to keep only a minimum number of sensor nodes in active mode. However, those existing sensor node scheduling methods mainly focus on the coverage problems, largely ignoring the fault-tolerance issues. In this paper, we proposes a new fault-tolerant sensor node scheduling algorithm, called FANS (Faulttolerant Adaptive Node Scheduling), that does consider not only sensing coverage but also sensing level. The proposed FANS algorithm enables to preserve sensing coverage, maximize network lifetime and achieve energy efficiency. Experimental results show that the FANS algorithm provides enhanced performance in terms of sensing coverage, energy consumption and the number of control messages.

Keywords: wireless sensor networks, sensor node scheduling, fault-tolerance, sensing coverage, sponsored coverage

Full Text () Retrieve PDF document (200901_15.pdf)

Received April 25, 2007; revised June 26 & September 3, 2007 & April 7, 2008; accepted July 25, 2008.
Communicated by Chung-Ta King.
* This work was supported by HY-SDR Research Center under the ITRC Program of IITA, and by Korea Science and Engineering Foundation under the Basic Research Program (KRF-R01-2006-000-10073-0).