Abstract—In this paper, we define a relay placement problem to cover a large number of sensors according to multiple purposes using a minimal number of relays. Finding the best solution requires exponential run time that takes years in large networks. Therefore, we divide the main problem into sub-problems and design a polynomial-time algorithm for finding an approximate solution. We developed a software tool for running the algorithm and graphical representation of placement. Using this tool, our evaluation experiments show the performance of the polynomial-time algorithm in comparison with the best solution.
Index Terms—Wireless sensor network, placement, coverage, clusterhead, relay.
Ravanbakhsh Akhlaghinia is with the Department of Engineering, Azad University of Gachsaran, Gachsaran, Iran (e-mail: akhlaghinia.r@gmail.com).
Azadeh Kavianfar is with Guilan University, Rasht, Iran (e-mail: azadeh_kaviyanfar@yahoo.com).
Mohamad Javad Rostami is with the Department of Computer Engineering, Bahonar University, Kerman, Iran (e-mail: mjrostamy@yahoo.com).
Cite: Ravanbakhsh Akhlaghinia, Azadeh Kavianfar, and Mohamad Javad Rostami, "Relay Placement Based on Divide-and-Conquer," International Journal of Computer Theory and Engineering vol. 3, no. 1, pp. 71-76, 2011.
Copyright © 2008-2024. International Association of Computer Science and Information Technology. All rights reserved.
