Cluster based node scheduling method for wireless sensor networks

By researching on the node scheduling problem of m-covered and connected sensor networks, a new concept of two-hops-cluster is proposed in this paper, and based on it, a new distributed node scheduling algorithm THCNS for allocating all nodes in the sensor network into k（k ≤ m） different groups {0,...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences 2012-04, Vol.55 (4), p.755-764
Main Authors: Wang, Lei, Wei, RuiZhong, Tian, ZiHong
Format: Article
Language:English
Subjects:
Algorithms
China
Clusters
Computer Science
Computer simulation
Information Systems and Communication Service
Networks
Nodes
Position (location)
Research Paper
Scheduling
Sensors
Wireless sensor networks
传感器网络
基础
无线传感器
网络节点
调度方法
调度算法
调度问题
集群
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:By researching on the node scheduling problem of m-covered and connected sensor networks, a new concept of two-hops-cluster is proposed in this paper, and based on it, a new distributed node scheduling algorithm THCNS for allocating all nodes in the sensor network into k（k ≤ m） different groups {0, 1,..., k - 1} is designed, without requiring location information. Our algorithm guarantees that each group to be connected and maintains the coverage ratio with high possibility. Theoretical analysis and simulation results show that it has better performance than previous randomized scheduling scheme, and can prolong the lifetime of the sensor network effectively.
ISSN:1674-733X
1869-1919
DOI:10.1007/s11432-011-4336-2