Distributed Topology Control Based on Coalition Formation Game in Wireless Networks

Distributed Topology Control Based on Coalition Formation Game in Wireless Networks
复制标题

DOI:
10.1093/comjnl/bxt010
复制
发表时间:
2013-08
期刊:
Comput. J.
影响因子:
--
通讯作者:
Jiaojiao Liu;Yige Wang;G. Wei
Jiaojiao Liu;Yige Wang;G. Wei
中科院分区:
其他
文献类型:
--
作者:
Jiaojiao Liu;Yige Wang;G. Wei

文献摘要

被引文献

相似文献

将网络形成看作一个全局合作博弈,其中连接的移动的节点形成一个大联盟,从而实现网络的拓扑控制。然而,大联盟并不总是贝内的,因为它的高功率成本的信息交换减少了联盟形成的收益和群体理性不能得到萨蒂斯艾德。在本文中,我们制定的拓扑控制作为一个合作的范例与移动的节点分为联盟组,以提高网络的连通性和降低能量成本的信息交换。我们提出了一个分布式联盟形成算法,形成联盟组之间的移动的节点使用合并和分裂规则。然后在讨价还价博弈框架下,基于转移的边际效用实现联盟中的链路维护。仿真结果表明,与非合作博弈模型相比,该分布式拓扑控制模型具有更低的信息交换功率开销和更好的网络连通性.
Topology control can be realized by regarding network formation as a global cooperative game, where connected mobile nodes form a grand coalition. However, the grand coalition is not always beneficial since its high power cost for information exchange reduces the gains from coalition formation and group rationality can not be satisfied. In this paper, we formulate topology control as a cooperative paradigm with mobile nodes divided into coalition groups in order to improve network connectivity and reduce the power cost for information exchange. We propose a distributed coalition formation algorithm to form coalition groups among mobile nodes using a merge-and-split rule. Then the link maintenance in a coalition can be realized based on the transferred marginal utility in the bargaining game framework. Simulation results show that our distributed topology control incurs less power cost for information exchange and the network connectivity with the new link maintenance algorithm is better than that in the non-cooperative game framework.