General Information
    • ISSN: 1793-8201 (Print), 2972-4511 (Online)
    • Abbreviated Title: Int. J. Comput. Theory Eng.
    • Frequency: Quarterly
    • DOI: 10.7763/IJCTE
    • Editor-in-Chief: Prof. Mehmet Sahinoglu
    • Associate Editor-in-Chief: Assoc. Prof. Alberto Arteta, Assoc. Prof. Engin Maşazade
    • Managing Editor: Ms. Mia Hu
    • Abstracting/Indexing: Scopus (Since 2022), INSPEC (IET), CNKI,  Google Scholar, EBSCO, etc.
    • Average Days from Submission to Acceptance: 192 days
    • E-mail:
    • Journal Metrics:

Prof. Mehmet Sahinoglu
Computer Science Department, Troy University, USA
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.

IJCTE 2011 Vol.3(1): 71-76 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2011.V3.285

Relay Placement Based on Divide-and-Conquer

Ravanbakhsh Akhlaghinia, Azadeh Kavianfar, and Mohamad Javad Rostami

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:
Azadeh Kavianfar is with Guilan University, Rasht, Iran (e-mail:
Mohamad Javad Rostami is with the Department of Computer Engineering, Bahonar University, Kerman, Iran (e-mail:


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.