A connectivity based partition approach for node scheduling in sensor networks

Authors:
Yong Ding;Chen Wang;Li Xiao
Affiliations:
Department of Computer Science and Engineering, Michigan State University;Department of Computer Science and Engineering, Michigan State University;Department of Computer Science and Engineering, Michigan State University
Venue:
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Year:
2007

Citing 13
Cited 3

Complexity of graph partition problems

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On k-connectivity for a geometric random graph

Random Structures & Algorithms
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Span: An energy-efficient coordination algorithm for topology maintenance in Ad Hoc wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Approximation Algorithms for Connected Dominating Sets

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Routing in Ad Hoc Networks Using a Spine

IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Range-free localization schemes for large scale sensor networks

Proceedings of the 9th annual international conference on Mobile computing and networking
An adaptive energy-efficient MAC protocol for wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Latency of wireless sensor networks with uncoordinated power saving mechanisms

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
FLSS: a fault-tolerant topology control algorithm for wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
On the node-scheduling approach to topology control in ad hoc networks

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Using mobile relays to prolong the lifetime of wireless sensor networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Sleep scheduling and lifetime maximization in sensor networks: fundamental limits and optimal solutions

Proceedings of the 5th international conference on Information processing in sensor networks

A clique base node scheduling method for wireless sensor networks

Journal of Network and Computer Applications
Adaptive duty-cycling based on group size for energy balance of sensor nodes in wireless sensor networks

Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Traffic-Aware Density-Based Sleep Scheduling and Energy Modeling for Two Dimensional Gaussian Distributed Wireless Sensor Network

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensors into groups such that a connected backbone network can be maintained by keeping only one arbitrary node from each group in active status while putting others to sleep. Nodes within each group swap between active and sleeping status occasionally to balance the energy consumption. Unlike previous approaches that partition nodes geographically, CPA is based on the measured connectivity between pairwise nodes and does not depend on nodes' locations. In this paper, we formulate node scheduling as a constrained optimal graph partition problem, and propose CPA as a distributed heuristic partition algorithm. CPA can ensure k-vertex connectivity of the backbone network for its partition so as to achieve the trade-off between saving energy and preserving network communication quality. Moreover, simulation results show that CPA outperforms other approaches in complex environments where the ideal radio propagation model does not hold.