Optimizing Sectorized Wireless Networks: Model, Analysis, and Algorithm
Optimizing Sectorized Wireless Networks: Model, Analysis, and Algorithm
复制标题
DOI：
10.1145/3565287.3610272
复制
发表时间：
2023-08
期刊：
影响因子：
--
通讯作者：
Panagiotis Promponas;Ting-Chen Chen-Ting-Chen-Chen-2117181382;L. Tassiulas
中科院分区：
文献类型：
--
作者：
Panagiotis Promponas;Ting-Chen Chen-Ting-Chen-Chen-2117181382;L. Tassiulas
未来的无线网络需要支持对高数据速率和改善覆盖范围不断增长的需求。一种有前途的解决方案是扇区化，其中基础设施节点（例如基站）配备有采用定向通信的多个扇区。尽管扇区化的概念并不新鲜，但充分了解扇区化网络的潜力至关重要，例如可以同时激活多个扇区时实现的速率增益。在本文中，我们重点关注扇区化无线网络，其中具有波束控制功能的扇区化基础设施节点形成用于数据转发和路由的多跳网状网络。我们提出了扇区节点模型并描述了这些扇区网络的容量区域。我们定义了流量扩展比和相应的扇区化增益，它们定量地衡量了节点扇区化作为网络流的函数带来的性能增益。我们的目标是找到每个节点的最佳扇区划分，以实现最大的流量扩展比，从而获得扇区划分增益。为了实现这一目标，我们制定了相应的优化问题，并开发了一种高效的分布式算法，该算法在给定的网络流量下以2/3的近似比率获得节点扇区化。通过广泛的模拟，我们评估了所提出算法在具有不同网络流量的各种网络场景中的扇区化增益和性能。仿真结果表明，近似扇区化增益作为每个节点扇区数量的函数呈次线性增加。
Future wireless networks need to support the increasing demands for high data rates and improved coverage. One promising solution is sectorization, where an infrastructure node (e.g., a base station) is equipped with multiple sectors employing directional communication. Although the concept of sectorization is not new, it is critical to fully understand the potential of sectorized networks, such as the rate gain achieved when multiple sectors can be simultaneously activated. In this paper, we focus on sectorized wireless networks, where sectorized infrastructure nodes with beam-steering capabilities form a multi-hop mesh network for data forwarding and routing. We present a sectorized node model and characterize the capacity region of these sectorized networks. We define the flow extension ratio and the corresponding sectorization gain, which quantitatively measure the performance gain introduced by node sectorization as a function of the network flow. Our objective is to find the optimal sectorization of each node that achieves the maximum flow extension ratio, and thus the sectorization gain. Towards this goal, we formulate the corresponding optimization problem and develop an efficient distributed algorithm that obtains the node sectorization under a given network flow with an approximation ratio of 2/3. Through extensive simulations, we evaluate the sectorization gain and the performance of the proposed algorithm in various network scenarios with varying network flows. The simulation results show that the approximate sectorization gain increases sublinearly as a function of the number of sectors per node.