Technical Program

Paper Detail

Paper Title A Fast Node Arrangement Algorithm of Wireless Sensor Networks for Two-dimensional Constraints
Paper IdentifierWE1.R6.4
Authors Takahiro Ota, Ryoji Nakamura, Nagano Prefectural Institute of Technology, Japan; Akiko Manada, Shonan Institute of Technology, Japan
Session Wireless Networks
Location Sorbonne, Level 5
Session Time Wednesday, 10 July, 09:50 - 11:10
Presentation Time Wednesday, 10 July, 10:50 - 11:10
Manuscript  Click here to download the manuscript
Abstract 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.