A Fast Node Arrangement Algorithm of Wireless Sensor Networks for Two-dimensional Constraints
A Fast Node Arrangement Algorithm of Wireless Sensor Networks for Two-dimensional Constraints
复制标题
一种二维约束下无线传感器网络快速节点排列算法
DOI：
10.1109/isit.2019.8849534
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Akiko Manada
中科院分区：
文献类型：
--
作者：
Takahiro Ota;Ryoji Nakamura;Akiko Manada
无线传感器网络在物联网 (IoT) 中发挥着关键作用。包括无线网络终端设备的传感器对其布置有限制，使得相邻传感器具有适当的距离以实现稳定通信。可以通过一组二维 (2D) 禁止块（例如 2D (d,k) 游程限制 (RLL) 约束）对排列进行建模。先前有针对二维约束的容量分析的研究，但是满足给定二维约束的块的构造算法很少。此外，在最坏的情况下，算法需要相对于块大小呈指数级的计算时间。在本文中，我们提出了一种满足给定二维约束的块构造算法，该算法在相对于块大小的线性时间内工作。此外，我们通过通用来源评估了所提出的算法构造的块的数量。
Wireless sensor networks play a key role in Internet of Things (IoT). Sensors including wireless network terminal devices have restrictions on their arrangement such that adjacent sensors have proper distance for stable communication. An arrangement can be modeled by a set of two-dimensional (2D) forbidden blocks such as 2D (d,k) Run-Length-Limited (RLL) constraints. There are previous studies for analysis of capacity for 2D constraints, however, there are few construction algorithms of blocks satisfying given 2D constraints. Moreover, the algorithms require exponential computational time with respect to block size in the worst case. In this paper, we propose a construction algorithm of blocks satisfying given 2D constraints which works in linear time with respect to block size. Furthermore, we evaluate the number of blocks constructed by the proposed algorithm by means of a general source.