Exploring Connected Dominating Sets in Energy Harvest Networks

Duty-cycle scheduling is an effective way to balance energy consumptions and prolong network lifetime of wireless sensor networks (WSNs), which usually requires a connected dominating set (CDS) to guarantee network connectivity and coverage. Therefore, the problem of finding the largest number of CD...

Full description

Saved in:
Bibliographic Details
Published inIEEE/ACM transactions on networking Vol. 25; no. 3; pp. 1803 - 1817
Main Authors Shi, Tuo, Cheng, Siyao, Cai, Zhipeng, Li, Yingshu, Li, Jianzhong
Format Journal Article
LanguageEnglish
Published New York IEEE 01.06.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithm design and analysis
Algorithms
Approximation algorithms
Computer simulation
Connected dominating sets
Distributed algorithms
Energy consumption
Energy harvesting
energy-harvest networks
IEEE transactions
Nodes
Remote sensors
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:Duty-cycle scheduling is an effective way to balance energy consumptions and prolong network lifetime of wireless sensor networks (WSNs), which usually requires a connected dominating set (CDS) to guarantee network connectivity and coverage. Therefore, the problem of finding the largest number of CDSs is important for WSNs. The previous works always assume all the nodes are non-rechargeable. However, WSNs are now taking advantages of rechargeable nodes to become energy harvest networks (EHNs). To find the largest number of CDSs then becomes completely different. This is the first work to investigate, how to identify the largest number of CDSs in EHNs to prolong network lifetime. The investigated novel problems are proved to be NP-Complete and we propose four approximate algorithms, accordingly. Both the solid theoretical analysis and the extensive simulations are performed to evaluate our algorithms.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2017.2657688