arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.01975cs.ITmath.IT
收藏

多重感知中的信息时代

Age of Information in Multiple Sensing

Alireza Javani, Marwen Zorgui, Zhiying Wang

摘要:

在各种应用程序中,及时了解信息源的当前状态至关重要。特别地,由于处理和通信延迟,状态更新可能比其生成时间晚得多地到达目的地。目的地的状态更新的新鲜度由信息的年龄的概念捕获。在这项研究中,我们首先分析了一个网络与一个单一的来源,$n$服务器和监视器(目的地)。服务器独立地检测信息源并将状态更新发送到监视器。然后,我们将我们的结果扩展到多个独立的信息源中存在的$n$服务器。我们假设更新到达服务器根据泊松随机过程。每个服务器都通过一个直接链接将其更新发送到监视器,该链接被建模为一个队列。传输更新的服务时间被认为是指数随机变量。我们研究同质和异质的服务和到达率的单源的情况下,只有同质的到达率和服务率的多源的情况下。我们推导出一个封闭形式的表达式的平均年龄下的信息的最后来先服务(LCFS)队列为一个单一的源和任意$n$同构服务器。对于$n=2,3$,我们推导出显式的平均年龄的信息为任意源和同构服务器,并为一个单一的源和异构服务器。对于$n=2$,我们找到了最佳的到达率给定一个固定的总和到达率和服务率。

英文摘要:

Having timely and fresh knowledge about the current state of information sources is critical in a variety of applications. In particular, a status update may arrive at the destination much later than its generation time due to processing and communication delays. The freshness of the status update at the destination is captured by the notion of age of information. In this study, we first analyze a network with a single source, $n$ servers, and the monitor (destination). The servers independently sense the source of information and send the status update to the monitor. We then extend our result to multiple independent sources of information in the presence of $n$ servers. We assume that updates arrive at the servers according to Poisson random processes. Each server sends its update to the monitor through a direct link, which is modeled as a queue. The service time to transmit an update is considered to be an exponential random variable. We examine both homogeneous and heterogeneous service and arrival rates for the single-source case, and only homogeneous arrival and service rates for the multiple sources case. We derive a closed-form expression for the average age of information under a last-come-first-serve (LCFS) queue for a single source and arbitrary $n$ homogeneous servers. For $n=2,3$, we derive the explicit average age of information for arbitrary sources and homogeneous servers, and for a single source and heterogeneous servers. For $n=2$ we find the optimal arrival rates given a fixed sum arrival rate and service rates.

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

↑