A Neighbor-information-based Node-Scheduling Scheme in Wireless Sensor Networks
In wireless sensor networks that consist of a large number of Iow-power, short-lived, unreliable sensors,one of the main design challenges is to obtain long system lifetime, as well as maintain sufficient sensing coverage and energy reliability. In this paper, we propose a node-scheduling scheme which can reduce system overall energy consumption,therefore increasing system lifetime, by turning off some redundant nodes. Some nodes can be put into the sleep state while other sensor nodes remain active for the sensing and communication tasks. In our scheme each node decides its state by using its own and its neighbors- location information.And we compare the scheme to ACK scheme.
Coverage Node scheduling Reliability Wireless sensor networks
CHEN Dan ZHAO Erdun
Department of Computer Science, Central China Normal University Wuhan, Hubei Province, China, 430079
国际会议
厦门
英文
737-741
2006-07-27（万方平台首次上网日期，不代表论文的发表时间）