arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2412.01192cs.NI
收藏

能量收集随机接入网络中的信息年龄

Age of Information in Random Access Networks with Energy Harvesting

Fangming Zhao, Nikolaos Pappas, Meng Zhang, Howard H. Yang

AI总结:

本文研究能量收集随机接入网络中的信息年龄,通过联合优化更新速率和块长度,发现能量受限时最优更新速率为1,且小缓冲区即可满足需求。

摘要:

我们研究了由多个源-目的节点对组成的随机接入网络中的信息年龄(AoI),其中每个源节点具备能量收集能力。每个源节点仅使用收集到的能量向其目的节点传输一系列数据包。每个数据包采用有限长度码字进行编码,这体现了随机接入网络中短码字传输的特性。通过将批量服务马尔可夫链与随机几何相结合,我们推导出网络平均AoI的解析表达式,并在两种特殊情形下(即小能量缓冲区和大能量缓冲区场景)获得了闭式结果。我们的分析揭示了能量积累时间与传输成功概率之间的权衡。随后,我们通过联合调整更新速率和数据包块长度来优化网络平均AoI。我们的研究结果表明,在能量消耗率超过能量到达率的能量受限区域,最优更新速率应设为1。这也意味着,如果预先配置了数据包的最优块长度,那么仅支持一次传输的能量缓冲区大小就足够了。

英文摘要:

We study the age of information (AoI) in a random access network consisting of multiple source-destination pairs, where each source node is empowered by energy harvesting capability. Every source node transmits a sequence of data packets to its destination using only the harvested energy. Each data packet is encoded with finite-length codewords, characterizing the nature of short codeword transmissions in random access networks. By combining tools from bulk-service Markov chains with stochastic geometry, we derive an analytical expression for the network average AoI and obtain closed-form results in two special cases, i.e., the small and large energy buffer size scenarios. Our analysis reveals the trade-off between energy accumulation time and transmission success probability. We then optimize the network average AoI by jointly adjusting the update rate and the blocklength of the data packet. Our findings indicate that the optimal update rate should be set to one in the energy-constrained regime where the energy consumption rate exceeds the energy arrival rate. This also means if the optimal blocklength of the data packet is pre-configured, an energy buffer size supporting only one transmission is sufficient.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑