Please use this identifier to cite or link to this item:
Title: A lightweight scheme for node scheduling in wireless sensor networks
Authors: Liu, M
Zheng, Y
Cao, J 
Lou, W 
Chen, G
Gong, H
Issue Date: 2007
Publisher: Springer
Source: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics), 2007, v. 4611 LNCS, p. 579-588 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: 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.
Description: 4th International Conference on Ubiquitous Intelligence and Computing: Building Smart Worlds in Real and Cyber Spaces, UIC 2007, Hong Kong, 11-13 July 2007
ISBN: 9783540735489
ISSN: 0302-9743
EISSN: 1611-3349
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Sep 17, 2017

Page view(s)

Last Week
Last month
Checked on Sep 18, 2017

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.