A lightweight scheme for node scheduling in wireless sensor networks

Authors:
Ming Liu;Yuan Zheng;Jiannong Cao;Wei Lou;Guihai Chen;Haigang Gong
Affiliations:
School of Computer Science & Engineering, University of Electronic Science and Technology of China, Chengdu, P.R. China;Internet and Mobile Computing Lab, Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, P.R. China;Internet and Mobile Computing Lab, Department of Computing, Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, P.R. China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China;State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China;School of Computer Science & Engineering, University of Electronic Science and Technology of China, Chengdu, P.R. China
Venue:
UIC'07 Proceedings of the 4th international conference on Ubiquitous Intelligence and Computing
Year:
2007

Citing 10
Cited 0

Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks

Proceedings of the 7th annual international conference on Mobile computing and networking
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
A Network-Centric Approach to Embedded Software for Tiny Devices

EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms

Proceedings of the 3rd international symposium on Information processing in sensor networks
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Lightweight deployment-aware scheduling for wireless sensor networks

Mobile Networks and Applications
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

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.