无线自组织网络极限信道容量增长规律研究

 为了分析和提高无线自组织网络的吞吐能力，提出了无线自组织网络的极限信道容量增长规律(capacity scaling laws)的一般表达式，研究发现单个节点的策略决定了整个无线自组织网络的吞吐能力，证明了使得整个网络吞吐能力最大化的最优策略的存在性。进一步通过应用博弈论，推导得出最优策略，并验证其满足纳什均衡且是演化稳定策略。

Improved Capacity Scaling of Wireless Ad Hoc Networks

Some works have been done in analyzing and improving the throughput capacity of ad hoc networks, by exploiting the properties of physical constraints such as mutual interference, limited bandwidth, characteristics of nodes’ distribution and so on. In particular, scaling laws have received the most attention as they quantify the capacity of an ad hoc wireless network. In this paper, the general expressions are derived for the capacity scaling laws. It is found that the strategy of an individual node dominates the throughput capacity of a wireless ad hoc network. We show that there exist some optimal strategies that can maximize the throughput capacity of the network. Using a game theoretic approach, we further illustrate that the optimal strategies can achieve Nash equilibria and maintain evolutionarily stable.