无线传感器网络中任务分类感知的数据聚合调度算法

Q4 Business, Management and Accounting
Hongsen Zou, Ang Li, Chen Ao, Puning Zhang, Ning Li, Zheng Wang
{"title":"无线传感器网络中任务分类感知的数据聚合调度算法","authors":"Hongsen Zou, Ang Li, Chen Ao, Puning Zhang, Ning Li, Zheng Wang","doi":"10.1504/ijmndi.2019.10027011","DOIUrl":null,"url":null,"abstract":"In order to minimise the delay of data aggregation scheduling, a task classification aware data aggregation scheduling algorithm is proposed. Through the multi-power and multi-channel approach of sensor nodes, maximum independent sets are used to construct network topology structure based on data aggregation backbone tree. According to the scheduling priority, the data aggregation scheduling within clusters is achieved by approximating the greedy algorithm. Besides, combined with sparse coefficient, sensing task type reduces the amount of data transmission, and then the level of cluster head nodes in the network is used to achieve data aggregation scheduling between clusters. Numerical results show that the proposed algorithm can reduce cluster heads data traffic and energy consumption, while shortening the data aggregation delay and enhancing the network survivability.","PeriodicalId":35022,"journal":{"name":"International Journal of Mobile Network Design and Innovation","volume":"136 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Task classification-aware data aggregation scheduling algorithm in wireless sensor networks\",\"authors\":\"Hongsen Zou, Ang Li, Chen Ao, Puning Zhang, Ning Li, Zheng Wang\",\"doi\":\"10.1504/ijmndi.2019.10027011\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to minimise the delay of data aggregation scheduling, a task classification aware data aggregation scheduling algorithm is proposed. Through the multi-power and multi-channel approach of sensor nodes, maximum independent sets are used to construct network topology structure based on data aggregation backbone tree. According to the scheduling priority, the data aggregation scheduling within clusters is achieved by approximating the greedy algorithm. Besides, combined with sparse coefficient, sensing task type reduces the amount of data transmission, and then the level of cluster head nodes in the network is used to achieve data aggregation scheduling between clusters. Numerical results show that the proposed algorithm can reduce cluster heads data traffic and energy consumption, while shortening the data aggregation delay and enhancing the network survivability.\",\"PeriodicalId\":35022,\"journal\":{\"name\":\"International Journal of Mobile Network Design and Innovation\",\"volume\":\"136 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Mobile Network Design and Innovation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijmndi.2019.10027011\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Business, Management and Accounting\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Mobile Network Design and Innovation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijmndi.2019.10027011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Business, Management and Accounting","Score":null,"Total":0}
引用次数: 2

摘要

为了最小化数据聚合调度的延迟,提出了一种任务分类感知的数据聚合调度算法。通过传感器节点的多功率多通道方法,利用最大独立集构建基于数据汇聚骨干树的网络拓扑结构。根据调度优先级,近似贪婪算法实现集群内的数据聚合调度。此外,结合稀疏系数,感知任务类型减少了数据的传输量,然后利用网络中簇头节点的级别来实现簇间的数据聚合调度。数值结果表明,该算法可以减少簇头数据流量和能量消耗,同时缩短数据聚合延迟,提高网络生存性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Task classification-aware data aggregation scheduling algorithm in wireless sensor networks
In order to minimise the delay of data aggregation scheduling, a task classification aware data aggregation scheduling algorithm is proposed. Through the multi-power and multi-channel approach of sensor nodes, maximum independent sets are used to construct network topology structure based on data aggregation backbone tree. According to the scheduling priority, the data aggregation scheduling within clusters is achieved by approximating the greedy algorithm. Besides, combined with sparse coefficient, sensing task type reduces the amount of data transmission, and then the level of cluster head nodes in the network is used to achieve data aggregation scheduling between clusters. Numerical results show that the proposed algorithm can reduce cluster heads data traffic and energy consumption, while shortening the data aggregation delay and enhancing the network survivability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Mobile Network Design and Innovation
International Journal of Mobile Network Design and Innovation Business, Management and Accounting-Management Information Systems
CiteScore
0.30
自引率
0.00%
发文量
0
期刊介绍: The IJMNDI addresses the state-of-the-art in computerisation for the deployment and operation of current and future wireless networks. Following the trend in many other engineering disciplines, intelligent and automatic computer software has become the critical factor for obtaining high performance network solutions that meet the objectives of both the network subscriber and operator. Characteristically, high performance and innovative techniques are required to address computationally intensive radio engineering planning problems while providing optimised solutions and knowledge which will enhance the deployment and operation of expensive wireless resources.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信