智能反射面輔助短包通信中時(shí)效與能效間的折衷
doi: 10.11999/JEIT240666 cstr: 32379.14.JEIT240666
-
1.
陸軍工程大學(xué)通信工程學(xué)院 南京 210007
-
2.
中國人民解放軍32319部隊(duì) 烏魯木齊 830002
-
3.
中國人民解放軍32579部隊(duì) 桂林 541000
Tradeoff between Age of Information and Energy Efficiency for Intelligent Reflecting Surface Assisted Short Packet Communications
-
1.
College of Communication Engineering, Army Engineering University of PLA, Nanjing 210007, China
-
2.
Unit 32319 of PLA, Urumqi 830002, China
-
3.
Unit 32579 of PLA, Guilin 541000, China
-
摘要: 在監(jiān)控物聯(lián)網(wǎng)中,一些感知設(shè)備需要在能耗受限條件下及時(shí)地將采集信息回傳給接入節(jié)點(diǎn)(AP),信息年齡(AoI)和能量效率(EE)對系統(tǒng)都很重要。該文研究了多設(shè)備監(jiān)控物聯(lián)網(wǎng)中時(shí)效與能效之間的折衷問題,其中感知設(shè)備在智能反射面(IRS)輔助下通過短包傳輸監(jiān)控信息給AP。為了避免多個(gè)感知設(shè)備占用同一資源塊導(dǎo)致包的碰撞,該文提出了一個(gè)接入控制協(xié)議,并推導(dǎo)了平均AoI和EE的閉式表達(dá)式。在此基礎(chǔ)上,引入了平均AoI和EE之比這個(gè)指標(biāo),通過優(yōu)化傳輸功率來最小化平均AoI和EE之比,以折衷時(shí)效性能與能效性能。仿真結(jié)果驗(yàn)證了該文理論分析的正確性,并且表明所提協(xié)議能夠?qū)崿F(xiàn)更好的時(shí)效和能效性能。此外,所提算法能夠有效找出最優(yōu)的時(shí)效-能效折衷點(diǎn)。Abstract:
Objective: In monitoring Internet of Things (IoT) systems, it is essential for sensor devices to transmit collected data to the Access Point (AP) promptly. The timely transmission of information can be enhanced by increasing transmission power, as higher power levels tend to improve the reliability of data transfer. However, sensor devices typically have limited transmission power, and beyond a certain threshold, increases in power yield diminishing returns in terms of transmission timeliness. Therefore, effectively managing transmission power to balance timeliness and Energy Efficiency (EE) is crucial for sensor devices. This paper investigates the trade-off between the Age of Information (AoI) and EE in multi-device monitoring systems, where sensor devices communicate monitoring data to the AP using short packets with support from Intelligent Reflective Surface (IRS). To address packet collisions that occur when multiple devices access the same resource block, an access control protocol is developed, and closed-form expressions are derived for both the average AoI and EE. Based on these expressions, the average AoI-EE ratio is introduced as a metric that can be minimized to achieve an optimal balance between AoI and EE through transmission power optimization. Methods: Deriving the closed-form expression for the average AoI is challenging due to two factors. Firstly, obtaining the exact distribution of the composite channel gain is difficult. Secondly, in short-packet communications, the packet error rate expression involves a complementary cumulative distribution function with a complex structure, complicating the averaging process. However, the Moment Matching (MM) technique can approximate the probability distribution of the composite channel gain as a gamma distribution. To address the second challenge, a linear function is used to approximate the packet error rate, yielding an approximate expression for the average packet error rate. Additionally, to examine the relationship between the ratio of average AoI and EE with transmission power, the second derivative of this ratio is calculated and analyzed. Finally, the optimal transmission power is determined using the binary search algorithm. Results and Discussions: Firstly, the paper examines the division of a time slot into varying numbers of resource blocks and analyzes their AoI performances. The findings indicate that AoI performance does not increase monotonically with an increase in the number of resource blocks. Specifically, while a greater number of resource blocks enhances the probability of device access, it concurrently reduces the size of each resource block, leading to an increase in packet error rates during information transmission. Therefore, it is essential to strategically plan the number of resource blocks allocated for each time slot. Additionally, the results demonstrate that the AoI performance of the proposed access control scheme exceeds that of traditional random access and periodic sampling schemes. In the random access scheme, devices occupy resource blocks at random, which may lead to multiple devices occupying the same block and resulting in transmission collisions that compromise the reliability of information transmission. Conversely, while devices in the periodic sampling scheme can reliably access resource blocks within each cycle, one cycle includes multiple time slots, thus necessitating a prolonged wait for information transmission. Moreover, it is noted that at lower information transmission power levels, the periodic sampling scheme can achieve higher EE. This is attributed to the low transmission power resulting in substantially higher packet error rates across all schemes; however, the periodic sampling scheme manages to secure larger resource blocks, leading to lower packet error rates and a reduced likelihood of energy waste during signal transmission. As information transmission power increases, the advantages of the periodic sampling scheme begin to diminish, and the EE of the proposed access control scheme ultimately exceeds that of the periodic sampling scheme. Finally, the paper investigates the relationship between the ratio of average AoI and EE with the information transmission power. The analysis reveals that this ratio is a convex function that initially decreases and subsequently increases with rising transmission power, indicating the existence of an optimal power level that minimizes the ratio. Conclusions: This study examines the trade off between timeliness and EE in IRS-assisted short-packet communication systems. An access control protocol is proposed to mitigate packet collisions, and both timeliness and EE are analyzed. The ratio of average AoI to EE is introduced as a metric to balance AoI and EE, with optimization of transmission power shown to minimize this ratio. Simulation results validate the theoretical analysis and demonstrate that the proposed access control protocol achieves an improved AoI-EE trade off. Future research will focus on optimizing the deployment location of the IRS to further enhance the balance between timeliness and EE. -
1 信號傳輸功率優(yōu)化算法
初始化:$ {P_{{\text{low}}}} = {\sigma ^2}u/{\left( {{\varPsi } - \sqrt {\varTheta } } \right)^2} $, $ {P_{{\mathrm{up}}}} = {\sigma ^2}u/{\left( {\varPsi - 3\sqrt \varTheta } \right)^2} $ Repeat If $ {\left. {{\textq7j3ldu95}\lambda /{\textq7j3ldu95}P} \right|_{P = \left( {{P_{{\text{low}}}} + {P_{{\text{up}}}}} \right)/2}} < 0 $ $ {P_{{\text{low}}}} = \left( {{P_{{\text{low}}}} + {P_{{\text{up}}}}} \right)/2 $ Else $ {P_{{\text{up}}}} = \left( {{P_{{\text{low}}}} + {P_{{\text{up}}}}} \right)/2 $ Until $ {P_{{\text{up}}}} - {P_{{\text{low}}}} \le \delta $ 輸出:最優(yōu)信號傳輸功率為$ {P^ * } = \left( {{P_{{\text{low}}}} + {P_{{\text{up}}}}} \right)/2 $ 下載: 導(dǎo)出CSV
-
[1] XIE Mangang, JIA Xiangdong, YIN Jiaxiang, et al. Age of information for partial earliest relay aided short packet status update with energy harvesting[J]. IEEE Transactions on Wireless Communications, 2024, 23(1): 699–719. doi: 10.1109/TWC.2023.3281736. [2] XIONG Qinqin, ZHU Xu, JIANG Yufei, et al. Status prediction and data aggregation for AoI-oriented short-packet transmission in industrial IoT[J]. IEEE Transactions on Communications, 2023, 71(1): 611–625. doi: 10.1109/TCOMM.2022.3226188. [3] WANG Jia, CAO Xianghui, YIN Bo, et al. Sleep–wake sensor scheduling for minimizing AoI-penalty in industrial internet of things[J]. IEEE Internet of Things Journal, 2022, 9(9): 6404–6417. doi: 10.1109/JIOT.2021.3112211. [4] XIE Mangang, GONG Jie, JIA Xiangdong, et al. Age and energy analysis for L th best relay enabled cooperative status update systems with short packet communications[J]. IEEE Transactions on Vehicular Technology, 2023, 72(5): 6294–6308. doi: 10.1109/TVT.2022.3233406. [5] KAUL S, YATES R, and GRUTESER M. Real-time status: How often should one update?[C]. 2012 IEEE INFOCOM, Orlando, America, 2012: 2731–2735. doi: 10.1109/INFCOM.2012.6195689. [6] YU Baoquan, CAI Yueming, DIAO Xianbang, et al. Adaptive packet length adjustment for minimizing age of information over fading channels[J]. IEEE Transactions on Wireless Communications, 2023, 22(10): 6641–6653. doi: 10.1109/TWC.2023.3244930. [7] 于寶泉, 楊煒偉, 王權(quán), 等. 無人機(jī)輔助通感一體化系統(tǒng)中的信息年齡分析優(yōu)化[J]. 電子與信息學(xué)報(bào), 2024, 46(5): 1996–2003. doi: 10.11999/JEIT231175.YU Baoquan, YANG Weiwei, WANG Quan, et al. Age of information analysis and optimization in unmanned aerial vehicles-assisted integrated sensing and communication systems[J]. Journal of Electronics & Information Technology, 2024, 46(5): 1996–2003. doi: 10.11999/JEIT231175. [8] XIE Mangang, GONG Jie, JIA Xiangdong, et al. Age and energy tradeoff for multicast networks with short packet transmissions[J]. IEEE Transactions on Communications, 2021, 69(9): 6106–6119. doi: 10.1109/TCOMM.2021.3092758. [9] CAO Jie, ZHU Xu, SUN Sumei, et al. Toward industrial metaverse: Age of information, latency and reliability of short-packet transmission in 6G[J]. IEEE Wireless Communications, 2023, 30(2): 40–47. doi: 10.1109/MWC.2001.2200396. [10] 陳泳, 蔡躍明, 王萌. 認(rèn)知物聯(lián)網(wǎng)短包通信中雙向中繼系統(tǒng)的信息年齡分析[J]. 電子與信息學(xué)報(bào), 2023, 45(12): 4254–4261. doi: 10.11999/JEIT221377.CHEN Yong, CAI Yueming, and WANG Meng. Age of information for short-packet two-way relay system in cognitive IoT network[J]. Journal of Electronics & Information Technology, 2023, 45(12): 4254–4261. doi: 10.11999/JEIT221377. [11] DURISI G, KOCH T, and POPOVSKI P. Toward massive, ultrareliable, and low-latency wireless communication with short packets[J]. Proceedings of the IEEE, 2016, 104(9): 1711–1726. doi: 10.1109/JPROC.2016.2537298. [12] POLYANSKIY Y, POOR H V, and VERDU S. Channel coding rate in the finite blocklength regime[J]. IEEE Transactions on Information Theory, 2010, 56(5): 2307–2359. doi: 10.1109/TIT.2010.2043769. [13] CHEN Guangji, WU Qingqing, LIU Ruiqi, et al. IRS aided MEC systems with binary offloading: A unified framework for dynamic IRS beamforming[J]. IEEE Journal on Selected Areas in Communications, 2023, 41(2): 349–365. doi: 10.1109/JSAC.2022.3228605. [14] ZHANG Yangyi, GUAN Xinrong, WU Qingqing, et al. Optimizing age of information in UAV-mounted IRS assisted short packet systems[J]. IEEE Transactions on Vehicular Technology, 2024, 73(11): 17760–17764. doi: 10.1109/TVT.2024.3417701. [15] GUAN Xinrong, WU Qingqing, and ZHANG Rui. Intelligent reflecting surface assisted secrecy communication: Is artificial noise helpful or not?[J]. IEEE Wireless Communications Letters, 2020, 9(6): 778–782. doi: 10.1109/LWC.2020.2969629. [16] HASHEMI R, ALI S, MAHMOOD N H, et al. Average rate and error probability analysis in short packet communications over RIS-aided URLLC systems[J]. IEEE Transactions on Vehicular Technology, 2021, 70(10): 10320–10334. doi: 10.1109/TVT.2021.3105878. [17] WANG Manlin, XIA Bin, YAO Yao, et al. Fundamental limit among covertness, reliability, latency and throughput for IRS-enabled short-packet communications[J]. IEEE Transactions on Wireless Communications, 2024, 23(4): 3886–3900. doi: 10.1109/TWC.2023.3312796. [18] SINGH K, SINGH S K, and LI C P. On the performance analysis of RIS-assisted infinite and finite blocklength communication in presence of an eavesdropper[J]. IEEE Open Journal of the Communications Society, 2023, 4: 854–872. doi: 10.1109/OJCOMS.2023.3262485. [19] LE N P and LE K N. Distributed-RIS assisted wireless powered communication networks in the finite blocklength regim[J]. IEEE Communications Letters, 2022, 26(12): 2884–2888. doi: 10.1109/LCOMM.2022.3205005. [20] YU Baoquan, CAI Yueming, and WU Dan. Joint access control and resource allocation for short-packet-based mMTC in status update systems[J]. IEEE Journal on Selected Areas in Communications, 2021, 39(3): 851–865. doi: 10.1109/JSAC.2020.3018801. [21] GUAN Xinrong, WU Qingqing, and ZHANG Rui. Anchor-assisted channel estimation for intelligent reflecting surface aided multiuser communication[J]. IEEE Transactions on Wireless Communications, 2022, 21(6): 3764–3778. doi: 10.1109/TWC.2021.3123674. [22] REN Hong, WANG Kezhi, and PAN Cunhua. Intelligent reflecting surface-aided URLLC in a factory automation scenario[J]. IEEE Transactions on Communications, 2022, 70(1): 707–723. doi: 10.1109/TCOMM.2021.3125057. -