Advanced Search
Volume 44 Issue 2
Feb.  2022
Turn off MathJax
Article Contents
WANG Heng, DUAN Sixie, XIE Xin. Scheduling Method for Multi-channel Wireless Networks Based on Optimization of Age of Information[J]. Journal of Electronics & Information Technology, 2022, 44(2): 702-709. doi: 10.11999/JEIT210107
Citation: WANG Heng, DUAN Sixie, XIE Xin. Scheduling Method for Multi-channel Wireless Networks Based on Optimization of Age of Information[J]. Journal of Electronics & Information Technology, 2022, 44(2): 702-709. doi: 10.11999/JEIT210107

Scheduling Method for Multi-channel Wireless Networks Based on Optimization of Age of Information

doi: 10.11999/JEIT210107
Funds:  The National Key R&D Program of China (2018YFB1702000), The Natural Science Foundation of Chongqing (cstc2019jcyjjqX0012, cstc2019jcyj-msxmX0444), The Ph.D. Talent Training Program of Chongqing University of Posts and Telecommunications (BYJS202001)
  • Received Date: 2021-01-21
  • Rev Recd Date: 2021-05-25
  • Available Online: 2021-06-09
  • Publish Date: 2022-02-25
  • Age of Information (AoI) is a novel metric that describes the timeliness of data delivery for time-sensitive applications, which measures the freshness of the most recently received packet from the perspective of destination node. In the multi-channel wireless network scenario with limited channel resources, the constraints of channel resources and link conflicts should be considered in the link scheduling with respect to AoI. To address this issue, in this paper, a time slot based scheduling method for data transmission to minimize the average AoI in the network is proposed. In this method, the optimization problem of AoI is first formulated into a Lyapunov optimization problem. Then the multi-channel conflict problem is converted to find the maximum matching policy of bipartite graph, which is solved by Kuhn-Munkres (KM) algorithm. Thus, a scheduling policy under constraints is obtained. The simulation results demonstrate that the proposed method optimizes effectively the average AoI and improves the freshness of data in the network.
  • loading
  • [1]
    CHEN Maohong, XIAO Yong, LI Qiang, et al. Minimizing age-of-information for fog computing-supported vehicular networks with deep Q-learning[C]. 2020 IEEE International Conference on Communications, Dublin, Ireland, 2020: 1–6.
    [2]
    LI Jie, ZHOU Yong, and CHEN He. Age of information for multicast transmission with fixed and random deadlines in IoT systems[J]. IEEE Internet of Things Journal, 2020, 7(9): 8178–8191. doi: 10.1109/JIOT.2020.2981144
    [3]
    KAUL S, YATES R, and GRUTESER M. Real-time status: How often should one update?[C]. 2012 Proceedings IEEE INFOCOM, Orlando, USA, 2012: 2731–2735.
    [4]
    KAM C, KOMPELLA S, NGUYEN G D, et al. On the age of information with packet deadlines[J]. IEEE Transactions on Information Theory, 2018, 64(9): 6419–6428. doi: 10.1109/TIT.2018.2818739
    [5]
    KUANG Qiaobin, GONG Jie, CHEN Xiang, et al. Age-of-information for computation-intensive messages in mobile edge computing[C]. 2019 11th International Conference on Wireless Communications and Signal Processing (WCSP), Xi’an, China, 2019: 1–6.
    [6]
    KUANG Qiaobin, GONG Jie, CHEN Xiang, et al. Analysis on computation-intensive status update in mobile edge computing[J]. IEEE Transactions on Vehicular Technology, 2020, 69(4): 4353–4366. doi: 10.1109/TVT.2020.2974816
    [7]
    KADOTA I, SINHA A, UYSAL-BIYIKOGLU E, et al. Scheduling policies for minimizing age of information in broadcast wireless networks[J]. IEEE/ACM Transactions on Networking, 2018, 26(6): 2637–2650. doi: 10.1109/TNET.2018.2873606
    [8]
    HSU Y P, MODIANO E, and DUAN Lingjie. Age of information: Design and analysis of optimal scheduling algorithms[C]. 2017 IEEE International Symposium on Information Theory, Aachen, German, 2017: 561–565.
    [9]
    KADOTA I, SINHA A, and MODIANO E. Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints[J]. IEEE/ACM Transactions on Networking, 2019, 27(4): 1359–1372. doi: 10.1109/TNET.2019.2918736
    [10]
    TANG Haoyue, WANG Jintao, SONG Linqi, et al. Minimizing age of information with power constraints: multi-user opportunistic scheduling in multi-state time-varying channels[J]. IEEE Journal on Selected Areas in Communications, 2020, 38(5): 854–868. doi: 10.1109/JSAC.2020.2980911
    [11]
    路新华, MANCHÓN C N, 王忠勇, 等. 大规模MIMO系统上行链路时间-空间结构信道估计算法[J]. 电子与信息学报, 2020, 42(2): 519–525. doi: 10.11999/JEIT180676

    LU Xinhua, MANCHÓN C N, WANG Zhongyong, et al. Channel estimation algorithm using temporal-spatial structure for up-link of massive MIMO systems[J]. Journal of Electronics &Information Technology, 2020, 42(2): 519–525. doi: 10.11999/JEIT180676
    [12]
    赵悦超, 杨涛, 胡波. 无线传感器网络中基于信息年龄的状态更新策略[J]. 微电子学与计算机, 2020, 37(11): 29–34.

    ZHAO Yuechao, YANG Tao, and HU Bo. A status updating policy based on age of information in wireless sensor network[J]. Microelectronics &Computer, 2020, 37(11): 29–34.
    [13]
    SOMBABU B and MOHARIR S. Age-of-information based scheduling for multi-channel systems[J]. IEEE Transactions on Wireless Communications, 2020, 19(7): 4439–4448. doi: 10.1109/TWC.2020.2983670
    [14]
    TALAK R, KARAMAN S, and MODIANO E. Improving age of information in wireless networks with perfect channel state information[J]. IEEE/ACM Transactions on Networking, 2020, 28(4): 1765–1778. doi: 10.1109/TNET.2020.2996237
    [15]
    TALAK R, KARAMAN S, and MODIANO E. Minimizing age-of-information in multi-hop wireless networks[C]. 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, USA, 2017: 486–493.
    [16]
    TALAK R, KADOTA I, KARAMAN S, et al. Scheduling policies for age minimization in wireless networks with unknown channel state[C]. 2018 IEEE International Symposium on Information Theory (ISIT), Vail, USA, 2018: 2564–2568.
    [17]
    ZHOU Bo and SAAD W. Minimum age of information in the internet of things with non-uniform status packet sizes[J]. IEEE Transactions on Wireless Communications, 2020, 19(3): 1933–1947. doi: 10.1109/LWC.2019.2891598
    [18]
    LIU Chenfeng and BENNIS M. Taming the tail of maximal information age in wireless industrial networks[J]. IEEE Communications Letters, 2019, 23(12): 2442–2446. doi: 10.1109/LCOMM.2019.2940965
    [19]
    XIAO Qinkun, LUO Yichuang, and LÜ Zhongkai. Motion retrieval based on graph matching and revised Kuhn-Munkres algorithm[C]. 2013 IEEE International Conference on Signal Processing, Communication and Computing, Kunming, China, 2013: 1–4.
    [20]
    吕敬祥, 罗文浪. 无线传感网络量化及能量优化策略[J]. 电子与信息学报, 2020, 42(5): 1118–1124. doi: 10.11999/JEIT190185

    LÜ Jingxiang and LUO Wenlang. Quantization and energy optimization strategy of wireless sensor networks[J]. Journal of Electronics &Information Technology, 2020, 42(5): 1118–1124. doi: 10.11999/JEIT190185
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Figures(5)  / Tables(2)

    Article Metrics

    Article views (2819) PDF downloads(268) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return