Construction Low Complexity and Low Delay CDS for Big Data Code Dissemination

Author:

Liu Xiao1ORCID,Dong Mianxiong2ORCID,Liu Yuxin1ORCID,Liu Anfeng13ORCID,Xiong Neal N.4ORCID

Affiliation:

1. School of Information Science and Engineering, Central South University, Changsha 410083, China

2. Department of Information and Electronic Engineering, Muroran Institute of Technology, Muroran, Japan

3. The State Key Laboratory of Industrial Control Technology, Zhejiang University, Hangzhou 310027, China

4. Department of Mathematics and Computer Science, Northeastern State University, Tahlequah, OK 74464, USA

Abstract

The diffusion of codes is an important processing technology for big data networks. In previous scheme, data analysis was conducted for small samples of big data and complex problems that cannot be processed by big data technology. Due to the limited capacity of intelligence device, a better method is to select a set of nodes (intelligence device) to form a connected dominating set (CDS) to save energy, and constructing CDS is proved to be a complete NP problem. However, it is a challenge to reduce the communication delay and complexity for urgent data transmission in big data. In this paper, an appropriate duty cycle control (ADCC) scheme is proposed to reduce communication delay and complexity while improving energy efficient in CDS-based WSNs. In ADCC scheme, the method for constructing CDS is proposed at lower complexity. Nodes in CDS are selected according to the degree of nodes. Then, duty cycle of dominator nodes in CDS is higher than that of dominated nodes, so the communication delay in the proposed scheme is far less than that of previous scheme. The duty cycle of dominated nodes is small to save energy. This is because the number of dominator nodes in CDS is far less than the number of dominated nodes whose duty cycle is small; thus, the total energy consumption of the network is less than that of the previous scheme. As a result, the performance of energy consumption and communication delay and complex have been improved. Its complexity Oi=0vmi+2m2vs is reduced a lot for big data. The theoretical analysis shows that compared to the previous scheme, the transmission delay can be reduced 25–92% and the energy efficiency is improved by about 80% while retaining network lifetime.

Funder

National Basic Research Program of China

Publisher

Hindawi Limited

Subject

Multidisciplinary,General Computer Science

Cited by 28 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A comprehensive analysis of fog computing task scheduling approaches;INTERNATIONAL CONFERENCE ON ADVANCES IN COMMUNICATION TECHNOLOGY AND COMPUTER ENGINEERING;2023

2. Overlapped Connected Dominating Set for Big Data Security;IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS);2022-05-02

3. A prediction model of death probability for guiding wireless recharging in sensor networks;International Journal of Sensor Networks;2021

4. Lightweight Selective Encryption for Social Data Protection Based on EBCOT Coding;IEEE Transactions on Computational Social Systems;2020-02

5. EncodeORE: Reducing Leakage and Preserving Practicality in Order-Revealing Encryption;IEEE Transactions on Dependable and Secure Computing;2020

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3