TY - GEN
T1 - A lightweight scheme for node scheduling in wireless sensor networks
AU - Liu, Ming
AU - Zheng, Yuan
AU - Cao, Jiannong
AU - Lou, Wei
AU - Chen, Guihai
AU - Gong, Haigang
PY - 2007/12/1
Y1 - 2007/12/1
N2 - The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of the WSN by turning off redundant nodes. In this paper, we propose a mathematical method for calculating the coverage fraction in WSNs. According to the method, each active node can evaluate its sensing area whether covered by its active neighbors. We assume that the network is sufficiently dense and the deployed nodes can cover the whole monitored area. In this scenario, if a node's sensing area is covered by its active neighbor nodes, it can be treated as a redundant node. Based on this idea, we propose a lightweight node scheduling (LNS) algorithm that prolongs the network lifetime of the sensor network by turning off redundant nodes without using location information. Simulation study shows that LNS scheme can save considerable energy for data gathering while meeting the desired coverage fraction imposed by application.
AB - The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the lifetime of the WSN by turning off redundant nodes. In this paper, we propose a mathematical method for calculating the coverage fraction in WSNs. According to the method, each active node can evaluate its sensing area whether covered by its active neighbors. We assume that the network is sufficiently dense and the deployed nodes can cover the whole monitored area. In this scenario, if a node's sensing area is covered by its active neighbor nodes, it can be treated as a redundant node. Based on this idea, we propose a lightweight node scheduling (LNS) algorithm that prolongs the network lifetime of the sensor network by turning off redundant nodes without using location information. Simulation study shows that LNS scheme can save considerable energy for data gathering while meeting the desired coverage fraction imposed by application.
UR - http://www.scopus.com/inward/record.url?scp=38049086377&partnerID=8YFLogxK
M3 - Conference article published in proceeding or book
SN - 9783540735489
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 579
EP - 588
BT - Ubiquitous Intelligence and Computing - 4th International Conference, UIC 2007, Proceedings
T2 - 4th International Conference on Ubiquitous Intelligence and Computing: Building Smart Worlds in Real and Cyber Spaces, UIC 2007
Y2 - 11 July 2007 through 13 July 2007
ER -