Hypergraph-Based Active Minimum Delay Data Aggregation Scheduling in Wireless-Powered IoT

被引:7
作者
Jiao, Xianlong [1 ]
Lou, Wei [2 ]
Guo, Songtao [1 ]
Wang, Ning [1 ]
Chen, Chao [1 ]
Liu, Kai [1 ]
机构
[1] Chongqing Univ, Coll Comp Sci, Chongqing 400044, Peoples R China
[2] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Interference; Data aggregation; Delays; Internet of Things; Wireless sensor networks; Scheduling algorithms; Wireless communication; Active data aggregation tree construction; data aggregation scheduling; hypergraph; link scheduling; wireless-powered Internet of Things (WPIoT); SENSOR NETWORKS; INTERNET; THINGS; EFFICIENT;
D O I
10.1109/JIOT.2021.3116344
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Thanks to the promising wireless power transmission (WPT) technology, wireless-powered Internet of Things (WPIoT) can significantly improve the sustainable service ability of Internet of Things (IoT) with low personnel maintenance costs, and thus, shows remarkable and broad prospects in many applications, especially under the abominable and dangerous environment. Minimum delay data aggregation scheduling (MAS) is a problem of cardinal significance in WPIoT with the objective of timely collecting the data of IoT devices. However, due to the residual energy limitation of IoT devices, WPIoT shows the special feature of adopting the store-charge-and-forward communication mode, which brings new research challenges on designing efficient solutions to the MAS problem. We show that the MAS problem under the physical interference model in WPIoT is NP-hard. To tackle this problem, we propose a delay-efficient data aggregation scheduling algorithm called HADA based on an active data aggregation tree construction method and a novel hypergraph-based link scheduling method. Extensive numerical experiments are conducted to evaluate the performance of our proposed algorithm. The results demonstrate that our HADA algorithm can efficiently improve the performance compared with the existing baseline algorithms.
引用
收藏
页码:8786 / 8799
页数:14
相关论文
共 42 条
[1]   A Novel Low-Complexity Compressed Data Aggregation Method for Energy-Constrained IoT Networks [J].
Amarlingam, M. ;
Prasad, K. V. V. Durga ;
Rajalakshmi, P. ;
Channappayya, Sumohana S. ;
Sastry, C. S. .
IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING, 2020, 4 (03) :717-730
[2]   Distributed Low-Latency Data Aggregation Scheduling in Wireless Sensor Networks [J].
Bagaa, Miloud ;
Younis, Mohamed ;
Djenouri, Djamel ;
Derhab, Abdelouahid ;
Badache, Nadjib .
ACM TRANSACTIONS ON SENSOR NETWORKS, 2015, 11 (03)
[3]  
Bagaa M, 2012, IEEE INFOCOM SER, P2671, DOI 10.1109/INFCOM.2012.6195676
[4]   Computation Rate Maximization for Wireless Powered Mobile-Edge Computing With Binary Computation Offloading [J].
Bi, Suzhi ;
Zhang, Ying Jun .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 17 (06) :4177-4190
[5]  
Chen KY, 2019, IEEE INFOCOM SER, P1018, DOI [10.1109/INFOCOM.2019.8737492, 10.1109/infocom.2019.8737492]
[6]  
Chen Q., 2017, P IEEE INFOCOM, P1
[7]  
Chen Q, 2018, IEEE INFOCOM SER, P117, DOI 10.1109/INFOCOM.2018.8486366
[8]  
Chen XJ, 2005, LECT NOTES COMPUT SC, V3794, P133
[9]   Wireless Powered Sensor Networks for Internet of Things: Maximum Throughput and Optimal Power Allocation [J].
Chu, Zheng ;
Zhou, Fuhui ;
Zhu, Zhengyu ;
Hu, Rose Qingyang ;
Xiao, Pei .
IEEE INTERNET OF THINGS JOURNAL, 2018, 5 (01) :310-321
[10]   Classification of data aggregation functions in wireless sensor networks [J].
Cui, Jin ;
Boussetta, Khaled ;
Valois, Fabrice .
COMPUTER NETWORKS, 2020, 178