Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
复制标题
DOI：
10.1016/j.tcs.2015.04.035
复制
发表时间：
2015-07-26
影响因子：
1.1
通讯作者：
Ponce, Oscar Morales
中科院分区：
文献类型：
--
作者：
Kranakis, Evangelos;MacQuarrie, Fraser;Ponce, Oscar Morales
我们考虑以下天线定向问题：给定由n个相同的全向传感器形成的连通单元盘图（UDG），什么是最佳范围这对于给定的天线波束宽度是必要的和足够的（或角度）使得在用波束宽度的定向天线替换全向传感器之后，可以找到每个天线的适当取向，使得得到的图为紧密相连？在本文中，我们研究波束宽度/范围权衡天线定向问题。也就是说，对于区间[0，2 π]中的角度的全范围，我们将由定向算法提供的天线范围与给定波束宽度的最佳可能范围进行比较。我们提出了新的天线定向算法，以确保改进的边界为给定的角度ranges. We的复杂性分析，我们还研究了天线定向问题与常数拉伸因子，我们希望优化的传输范围和hop-stretch因子的诱导通信网络。我们提出了近似天线角度为π/2这个问题
We consider the following Antenna Orientation Problem: Given a connected Unit Disk Graph (UDG) formed by n identical omnidirectional sensors, what is the optimal range (or radius) which is necessary and sufficient for a given antenna beamwidth (or angle) phi so that after replacing the omnidirectional sensors by directional antennas of beamwidth phi it is possible to find an appropriate orientation of each antenna so that the resulting graph is strongly connected?In this paper we study beamwidth/range tradeoffs for the Antenna Orientation Problem. Namely, for the full range of angles in the interval [0, 2 pi] we compare the antenna range provided by an orientation algorithm to the optimal possible for the given beamwidth. We propose new antenna orientation algorithms that ensure improved bounds for given angle ranges and analyze their complexity.We also examine the Antenna Orientation Problem with Constant Stretch Factor, where we wish to optimize both the transmission range and the hop-stretch factor of the induced communication network. We present approximations to this problem for antennas with angles pi/2