arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0908.2542cs.NIcs.GT
收藏

具有中断和重传的移动自组网的稳定性和分布式功率控制

Stability and Distributed Power Control in MANETs with Outages and Retransmissions

Anastasios Giovanidis, Slawomir Stanczak

摘要:

在目前的工作中,通过ARQ协议的逐跳分组丢失和重传的影响进行了研究内的移动自组网(MANET)。由于中断而发生错误,并且成功概率函数与每个链路相关,其可以通过功率和速率分配来控制。我们首先推导出网络容量区域的表达式,其中成功函数起着至关重要的作用。后者的性质以及相关的最大有效吞吐量函数的介绍和证明。一个具有稳定性约束的网络效用最大化问题(NUM)被进一步表述为(a)输入速率控制问题和(b)调度问题。在一定的假设条件下,问题(b)被放宽为一个加权和最大化问题,其中求和项的个数等于节点的个数。这进一步允许制定一个非合作的游戏,其中每个节点通过一个选定的链路独立地决定其发射功率。使用超模博弈理论提出了一种基于价格的算法,该算法收敛到满足(b)的必要最优性条件的功率分配。实施问题被认为是干扰节点之间的最小信息交换是必需的。仿真结果表明,该算法取得了接近最优的结果。

英文摘要:

In the current work the effects of hop-by-hop packet loss and retransmissions via ARQ protocols are investigated within a Mobile Ad-hoc NET-work (MANET). Errors occur due to outages and a success probability function is related to each link, which can be controlled by power and rate allocation. We first derive the expression for the network's capacity region, where the success function plays a critical role. Properties of the latter as well as the related maximum goodput function are presented and proved. A Network Utility Maximization problem (NUM) with stability constraints is further formulated which decomposes into (a) the input rate control problem and (b) the scheduling problem. Under certain assumptions problem (b) is relaxed to a weighted sum maximization problem with number of summants equal to the number of nodes. This further allows the formulation of a non-cooperative game where each node decides independently over its transmitting power through a chosen link. Use of supermodular game theory suggests a price based algorithm that converges to a power allocation satisfying the necessary optimality conditions of (b). Implementation issues are considered so that minimum information exchange between interfering nodes is required. Simulations illustrate that the suggested algorithm brings near optimal results.

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

↑