Spatial Transmitter Density Allocation for Frequency-Selective Wireless Ad Hoc Networks
Spatial Transmitter Density Allocation for Frequency-Selective Wireless Ad Hoc Networks
复制标题
DOI：
10.1109/twc.2018.2881707
复制
发表时间：
2019-01-01
影响因子：
10.4
通讯作者：
Wang, Zhengdao
中科院分区：
文献类型：
--
作者：
Lu, Songtao;Wang, Zhengdao
我们考虑一个网络的节点对执行ad hoc同时通信频率选择性信道。我们假设整个频带被划分为多个子带，并且每个发射机只能使用一个子带。假设网络是几何无限的，我们使用传输容量（TC）作为衡量网络吞吐量。我们考虑的问题，分配节点的子带，使总TC最大化，在一个固定的总空间节点密度的约束下。最优化问题原来是非凸的。我们调查的详细结构的优化中所涉及的功能，并确定一组属性的最佳发射机密度的子带。一个迭代的资源分配方案，具有低复杂度，以获得TC最大化问题的全局最优解。该解决方案可以松散地解释为一个非凸优化问题的注水解决方案。通过数值模拟，表明理论分析得到的最优解与穷举搜索得到的最优解是一致的，表明中断概率和空间发射机总密度是决定网络TC的关键.
We consider a network of pairs of nodes that perform ad hoc simultaneous communications over frequency-selective channels. We assume that the whole frequency band is divided into a number of subbands, and each transmitter can only use one subband. Assuming that the network is geometrically infinite, we use the transmission capacity (TC) as a measure of the network throughput. We consider the problem of allocating nodes to the subbands so that the total TC is maximized, under the constraint of a fixed total spatial node density. The optimization problem turns out to be nonconvex. We investigate the detailed structure of the functions involved in the optimization and identify a set of properties of the optimal transmitter density over the subbands. An iterative resource allocation scheme with low complexity is derived to obtain the global optimal solution of the TC maximization problem. The solution can be loosely interpreted as a water-filling solution for a nonconvex optimization problem. Based on numerical simulations, it is shown that the optimal solution obtained through the theoretical analysis is consistent with the one obtained through an exhaustive search, which reveals that the outage probability and the total spatial transmitter density are the keys to determining the network TC.