Details of Research Outputs

Status已发表Published
TitleAdding Duty Cycle only in Connected Dominating Sets for Energy Efficient and Fast Data Collection
Creator
Date Issued2019
Source PublicationIEEE Access
ISSN2169-3536
Volume7Pages:120475-120499
Abstract

In wireless sensor networks (WSNs), energy efficiency and low delay are two pivotal issues for data collection. Wireless sensor networks are composed of energy-constrained sensor nodes. While sensing the environment, the rapid transmission of data to the sink is critical for many applications. In order to save energy, the duty cycle based mode is adopted in most studies, but this method increases the data transmission delay. Thus, an Adding Duty Cycle Only in Connected Dominating Sets (ADCOCDS) approach is proposed in this paper, which can effectively reduce network energy consumption and delay. The main innovations of the ADCOCDS scheme are as follows: (1) Unlike the mode of the duty cycle for all nodes in the previous WSNs, in ADCOCDS scheme, we choose a part of nodes to construct as a connected dominating set, and these nodes adopt the mode of duty cycle. For other nodes in the network, the radio transmitter is turned off to save energy when there is no data to transmit, and when these nodes have data to send, they turn on the radio transmitter and send the data to nodes in the dominating set, then nodes in the dominating set transfer the data to sink. In ADCOCDS scheme, since only a small number of nodes adopt the duty cycle mode, the energy efficiency of the network is high; (2) In WSNs, we observed that the energy consumption of nodes in the near-sink area is higher than that in the far-sink area. Therefore, in the ADCOCDS scheme, we increase the duty cycle of nodes according to their energy consumption to reduce the delay. Through theoretical analysis and experimental results, the ADCOCDS scheme can effectively reduce energy consumption and delay by 12.09%-43.17% and 21.85%-57.96%, respectively, while improving network lifetime by 10.71%-24.13% compared with previous strategies.

Keywordconnected dominating set data collection delay duty cycle lifetime Wireless sensor networks
DOI10.1109/ACCESS.2019.2937626
URLView source
Indexed BySCIE
Language英语English
WOS Research AreaComputer Science ; Engineering ; Telecommunications
WOS SubjectComputer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications
WOS IDWOS:000489637400001
Scopus ID2-s2.0-85073630703
Citation statistics
Cited Times:12[WOS]   [WOS Record]     [Related Records in WOS]
Document TypeJournal article
Identifierhttp://repository.uic.edu.cn/handle/39GCC9TT/7140
CollectionResearch outside affiliated institution
Corresponding AuthorZhi, Guoming
Affiliation
1.School of Computer Science and Engineering, Central South University, Changsha, China
2.School of Informatics, Hunan University of Chinese Medicine, Changsha, China
3.College of Computer Science and Technology, Huaqiao University, Xiamen, China
Recommended Citation
GB/T 7714
Shi, Weiwei,Liu, Wei,Wang, Tianet al. Adding Duty Cycle only in Connected Dominating Sets for Energy Efficient and Fast Data Collection[J]. IEEE Access, 2019, 7: 120475-120499.
APA Shi, Weiwei, Liu, Wei, Wang, Tian, Zeng, Zhiwen, & Zhi, Guoming. (2019). Adding Duty Cycle only in Connected Dominating Sets for Energy Efficient and Fast Data Collection. IEEE Access, 7, 120475-120499.
MLA Shi, Weiwei,et al."Adding Duty Cycle only in Connected Dominating Sets for Energy Efficient and Fast Data Collection". IEEE Access 7(2019): 120475-120499.
Files in This Item:
There are no files associated with this item.
Related Services
Usage statistics
Google Scholar
Similar articles in Google Scholar
[Shi, Weiwei]'s Articles
[Liu, Wei]'s Articles
[Wang, Tian]'s Articles
Baidu academic
Similar articles in Baidu academic
[Shi, Weiwei]'s Articles
[Liu, Wei]'s Articles
[Wang, Tian]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Shi, Weiwei]'s Articles
[Liu, Wei]'s Articles
[Wang, Tian]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.