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

面向车联网拥塞控制的分布式公平信标速率自适应

Distributed and Fair Beaconing Rate Adaptation for Congestion Control in Vehicular Networks

Esteban Egea-Lopez, Pablo Pavon-Mariño

摘要:

车辆间的合作应用依赖于车辆之间的广播单跳状态消息的交换,称为信标。由于周期性信标而在无线信道上聚集的负载可以阻止其他类型的消息的传输,这被称为由于信标活动而导致的信道拥塞。在本文中,我们接近的问题,控制每辆车的信标率建模为一个网络效用最大化(NUM)的问题。这使我们能够正式应用车载网络中信标速率分配的公平性概念,并控制效率和公平性之间的权衡。NUM方法提供了一个严格的框架来设计一个广泛的简单和分散的算法,证明收敛保证公平的分配解决方案。在这种情况下,我们专注于信标速率控制,并提出了公平的自适应信标速率车间通信(FABRIC)算法,它使用一个特定的缩放梯度投影算法来解决的NUM问题的对偶。分配中期望的公平性概念可以用算法参数来建立。仿真结果验证了我们的方法,并表明FABRIC收敛到公平的速率分配在多跳和动态的场景。

英文摘要:

Cooperative inter-vehicular applications rely on the exchange of broadcast single-hop status messages among vehicles, called beacons. The aggregated load on the wireless channel due to periodic beacons can prevent the transmission of other types of messages, what is called channel congestion due to beaconing activity. In this paper we approach the problem of controlling the beaconing rate on each vehicle by modeling it as a Network Utility Maximization (NUM) problem. This allows us to formally apply the notion of fairness of a beaconing rate allocation in vehicular networks and to control the trade-off between efficiency and fairness. The NUM methodology provides a rigorous framework to design a broad family of simple and decentralized algorithms, with proved convergence guarantees to a fair allocation solution. In this context, we focus exclusively in beaconing rate control and propose the Fair Adaptive Beaconing Rate for Intervehicular Communications (FABRIC) algorithm, which uses a particular scaled gradient projection algorithm to solve the dual of the NUM problem. The desired fairness notion in the allocation can be established with an algorithm parameter. Simulation results validate our approach and show that FABRIC converges to fair rate allocations in multi-hop and dynamic scenarios.

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

↑