A clique base node scheduling method for wireless sensor networks

Authors:
Lei Wang;Ruizhong Wei;Yaping Lin;Bo Wang
Affiliations:
College of Software, Hunan University, Changsha, Hunan 410082, PR China and Department of Computer Science, Lakehead University, Thunder Bay, ON, Canada P7B 5E1;Department of Computer Science, Lakehead University, Thunder Bay, ON, Canada P7B 5E1;College of Software, Hunan University, Changsha, Hunan 410082, PR China;Department of Computer Science, Lakehead University, Thunder Bay, ON, Canada P7B 5E1
Venue:
Journal of Network and Computer Applications
Year:
2010

Citing 20
Cited 0

Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
RoamHBA: maintaining group connectivity in sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms

Proceedings of the 3rd international symposium on Information processing in sensor networks
Naps: scalable, robust topology management in wireless ad hoc networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
On k-coverage in a mostly sleeping sensor network

Proceedings of the 10th annual international conference on Mobile computing and networking
Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Scheduling sleeping nodes in high density cluster-based sensor networks

Mobile Networks and Applications
Localized distance-sensitive service discovery in wireless sensor networks

Proceedings of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Review: Coverage and connectivity issues in wireless sensor networks: A survey

Pervasive and Mobile Computing
ECCRA: An energy-efficient coverage and connectivity preserving routing algorithm under border effects in wireless sensor networks

Computer Communications
Energy efficiency in wireless sensor networks using sleep mode TDMA scheduling

Ad Hoc Networks
Connectivity maintenance and coverage preservation in wireless sensor networks

Ad Hoc Networks
Distributed wake-up scheduling for data collection in tree-based wireless sensor networks

IEEE Communications Letters
A connectivity based partition approach for node scheduling in sensor networks

DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Connectivity and coverage maintenance in wireless sensor networks

The Journal of Supercomputing
Coverage-Preserving Routing Protocols for Randomly Distributed Wireless Sensor Networks

IEEE Transactions on Wireless Communications
Coverage in wireless ad hoc sensor networks

IEEE Transactions on Computers
A three-tiered node scheduling scheme for sparse sensing in wireless sensor networks

Computer Communications
A survey on sensor networks

IEEE Communications Magazine
Energy-Efficient Wake-Up Scheduling for Data Collection and Aggregation

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the node scheduling problem for m-covered and connected sensor networks. A new concept of Clique is proposed in this paper. Based on that concept, a new distributed node scheduling algorithm is designed, which can allocate all nodes in the sensor network into k(k@?m) different groups {0,1,...,k-1} without requiring location information. At the same time, it can guarantee that each group will be still connected and maintain the coverage ratio as high as possible. Theoretical analysis and simulation results show that the newly proposed algorithm has better performance than previous randomized scheduling scheme proposed in Liu et al. (2006), and can prolong the lifetime of the sensor network effectively.