arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.06215cs.NIcs.GTcs.SYeess.SY
收藏

无线网络中短暂中继节点的竞争选择

Competitive Selection of Ephemeral Relays in Wireless Networks

INRIA Saclay(INRIA 萨克雷);Indian Institute of Science(印度科学学院);INRIA

K. P. Naveen, Anurag Kumar, Eitan Altman

AI总结:

研究无线网络中转发节点如何在中继节点短暂可用时进行竞争选择,分析完全可观察和部分可观察两种情况下的纳什均衡策略对,探讨地理转发中的性能优化。

摘要:

我们考虑一种场景,其中两个节点(称为转发节点)竞争选择一个中继节点,因为这些中继节点短暂可用(例如从睡眠状态唤醒)。每个中继节点到达时,会为每个转发节点提供(可能不同的)奖励。每个转发节点的目标是最小化选择中继节点所导致的延迟和所选中继节点提供的奖励。例如,我们为地理转发问题开发了奖励结构。我们研究了通用中继选择问题的两种变体,即完全可观察(CO)情况,其中中继节点到达时,两个转发节点都能观察到两个奖励,以及部分可观察(PO)情况,其中每个转发节点只能观察到自己的奖励。将问题建模为两人随机博弈,我们以纳什均衡策略对(NEPPs)来表征解。对于CO情况,我们提供了NEPPs的一般结构。对于PO情况,我们证明在阈值策略对类中存在NEPPs。然后,我们考虑在共享睡眠-唤醒周期无线中继网络中数据包地理转发的应用。对于该问题,在特定奖励结构下,使用对应于TelosB无线 mote 的真实参数值,我们数值比较了各种NEPPs的性能(以转发节点的成本为衡量标准),并得出关键见解:即使两个转发节点之间有中等分离度,各种NEPPs的性能接近于一个简单策略,即每个转发节点假设另一个转发节点不存在。我们还进行了模拟实验以研究简单转发策略的端到端性能。

英文摘要:

We consider a setting in which two nodes (referred to as forwarders) compete to choose a relay node from a set of relays, as they ephemerally become available (e.g., wake up from a sleep state). Each relay, when it arrives, offers a (possibly different) "reward" to each forwarder. Each forwarder's objective is to minimize a combination of the delay incurred in choosing a relay and the reward offered by the chosen relay. As an example, we develop the reward structure for the specific problem of geographical forwarding over a network of sleep-wake cycling relays. We study two variants of the generic relay selection problem, namely, the completely observable (CO) case where, when a relay arrives, both forwarders get to observe both rewards, and the partially observable (PO) case where each forwarder can only observe its own reward. Formulating the problem as a two person stochastic game, we characterize solution in terms of Nash Equilibrium Policy Pairs (NEPPs). For the CO case we provide a general structure of the NEPPs. For the PO case we prove that there exists an NEPP within the class of threshold policy pairs. We then consider the particular application of geographical forwarding of packets in a shared network of sleep-wake cycling wireless relays. For this problem, for a particular reward structure, using realistic parameter values corresponding to TelosB wireless mote, we numerically compare the performance (in terms of cost to both forwarders) of the various NEPPs and draw the following key insight: even for moderate separation between the two forwarders, the performance of the various NEPPs is close to the performance of a simple strategy where each forwarder behaves as if the other forwarder is not present. We also conduct simulation experiments to study the end-to-end performance of the simple forwarding policy.

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

↑