doi: 10.7763/IJCTE.2011.V3.285
Relay Placement Based on Divide-and-Conquer
Ravanbakhsh Akhlaghinia1
,
Azadeh Kavianfar2 ,
Mohamad Javad Rostami3
- 1Department of Engineering, Azad University of Gachsaran, Gachsaran, Iran.
- 2Guilan University, Rasht, Iran.
- 3Department of Computer Engineering, Bahonar University, Kerman, Iran.
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.
Keywords
- Wireless sensor network
- placement
- coverage
- clusterhead
- relay
How to 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. https://doi.org/10.7763/IJCTE.2011.V3.285
Copyright & License
Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).