Exact capacity study for a class of MANETs
Exact capacity study for a class of MANETs
复制标题
DOI：
10.1109/iccchina.2012.6356873
复制
发表时间：
2012-11
期刊：
影响因子：
--
通讯作者：
Juntao Gao;Jiajia Liu;Xiaohong Jiang;O. Takahashi;N. Shiratori
中科院分区：
文献类型：
--
作者：
Juntao Gao;Jiajia Liu;Xiaohong Jiang;O. Takahashi;N. Shiratori
由于对移动的自组织网络（Ad Hoc Network，MANN）的容量缺乏深入的了解，在过去的十年中，一直阻碍着其应用。可用容量的研究主要集中在探索顺序感知容量的缩放规律，在某些特定的路由协议下的封闭形式的容量，或确切的容量没有仔细考虑无线干扰的问题，在移动自组网。在本文中，我们探讨了确切的网络容量为一类的移动自组网，其中采用基于组的调度调度同时进行链路传输。我们首先确定一个一般的封闭形式的容量上限所考虑的移动自组网，这适用于任何可能的路由协议，在这样的网络。然后，我们表明，对于任何流量输入速率的上限内，存在一个相应的两跳中继算法来稳定网络，这证明了我们确定的上限是这类移动自组网的确切容量。最后，仿真研究验证了我们的理论结果。
The lacking of a thorough understanding on the capacity in mobile ad hoc networks (MANETs) has been stunting their applications in the last decade. Available capacity studies focus on exploring either the order sense capacity scaling laws, the closed-form capacity under some specific routing protocols, or the exact capacity without careful consideration of wireless interference issue in MANETs. In this paper, we explore the exact network capacity for a class of MANETs, where the group-based scheduling is adopted to schedule simultaneous link transmissions. We first determine a general closed-form capacity upper bound for the considered MANETs, which holds for any possible routing protocols in such networks. We then show that for any traffic input rate within the upper bound, there exists a corresponding two-hop relay algorithm to stabilize the network, which proves that the upper bound we determined is the exact capacity for this class of MANETs. Finally, simulation studies are presented to validate our theoretical results.