Energy conservation in wireless sensor networks and connectivity of graphs

Authors:
Hao Li;Huifang Miao;Li Liu;Lian Li;Heping Zhang
Affiliations:
LRI, Univ Paris-sud and CNRS, Orsay F-91405, France and School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, PR China;LRI, Univ Paris-sud and CNRS, Orsay F-91405, France and School of Mathematical Sciences, Xiamen University, Xiamen Fujian 361005, PR China;LRI, Univ Paris-sud and CNRS, Orsay F-91405, France and School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, PR China;School of Information Science and Technology, Lanzhou University, Lanzhou 730000, PR China;School of Mathematics and Statistics, Lanzhou University, Lanzhou 730000, PR China
Venue:
Theoretical Computer Science
Year:
2008

Citing 10
Cited 1

Energy-conserving access protocols for identification networks

IEEE/ACM Transactions on Networking (TON)
On calculating connected dominating set for efficient routing in ad hoc wireless networks

DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
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
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
On Constructing k-Connected k-Dominating Set in Wireless Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Graph Theory With Applications

Graph Theory With Applications
Improving wireless sensor network lifetime through power aware organization

Wireless Networks
The design space of wireless sensor networks

IEEE Wireless Communications

Connectivity and coverage maintenance in wireless sensor networks

The Journal of Supercomputing

Quantified Score

Hi-index	5.23

Visualization

Abstract

In wireless sensor networks (WSNs), the energy source is usually a battery cell, which is impossible to recharge while WSNs are working. Therefore, one of the main issues in wireless sensor networks is how to prolong the network lifetime of WSNs with certain energy sources as well as how to maintain coverage and connectivity. In this paper, we consider wireless sensor networks satisfying the case that each node either monitors one target or is just for connection. Assume that the wireless sensor network has l targets, and that each is monitored by k sensor nodes. If k=2 and the graph G corresponding to the wireless sensor network is (l+max{1,l-4})-connected, or k=3 and G is (l(k-1)+1)-connected, then we can find k (the maximum number) disjoint sets, each of which completely covers all the targets and remains connected to one of the central processing nodes. The disjoint sets are activated successively, and only the sensor nodes from the active set are responsible for monitoring the targets and connectivity; all other nodes are in a sleep mode. In addition, we also give the related algorithms to find the k disjoint sets.