Network planning for mobile multi-hop relay networks

Chi Yuan Chen, Fan Hsun Tseng, Chin-Feng Lai, Han Chieh Chao

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In this paper, the coverage problem of network planning in mobile multi-hop relay networks is defined on the basis of integer linear programming. In order to provide desired utilities and also meet deployment limitations for network planning, we propose a supergraph tree algorithm to place base stations and relay stations at the lowest cost position. Furthermore, another algorithm for avoiding the interference between base stations, which is called interference aware tree algorithm is also proposed. Both the proposed algorithms are formulated on the basis of a graph theoretic technique and analyzed in the simulation results. The results show that the supergraph tree algorithm provides the lowest construction cost with different network scenarios, and the interference aware tree algorithm provides the highest communication quality for mobile multi-hop relay infrastructure-based communication network planning.

Original languageEnglish
Pages (from-to)1142-1154
Number of pages13
JournalWireless Communications and Mobile Computing
Volume15
Issue number7
DOIs
Publication statusPublished - 2015 May 1

Fingerprint

Planning
Base stations
Linear programming
Telecommunication networks
Costs
Communication

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Chen, Chi Yuan ; Tseng, Fan Hsun ; Lai, Chin-Feng ; Chao, Han Chieh. / Network planning for mobile multi-hop relay networks. In: Wireless Communications and Mobile Computing. 2015 ; Vol. 15, No. 7. pp. 1142-1154.
@article{fd5ca834bbd84d2ca2670682ba8f2be5,
title = "Network planning for mobile multi-hop relay networks",
abstract = "In this paper, the coverage problem of network planning in mobile multi-hop relay networks is defined on the basis of integer linear programming. In order to provide desired utilities and also meet deployment limitations for network planning, we propose a supergraph tree algorithm to place base stations and relay stations at the lowest cost position. Furthermore, another algorithm for avoiding the interference between base stations, which is called interference aware tree algorithm is also proposed. Both the proposed algorithms are formulated on the basis of a graph theoretic technique and analyzed in the simulation results. The results show that the supergraph tree algorithm provides the lowest construction cost with different network scenarios, and the interference aware tree algorithm provides the highest communication quality for mobile multi-hop relay infrastructure-based communication network planning.",
author = "Chen, {Chi Yuan} and Tseng, {Fan Hsun} and Chin-Feng Lai and Chao, {Han Chieh}",
year = "2015",
month = "5",
day = "1",
doi = "10.1002/wcm.2396",
language = "English",
volume = "15",
pages = "1142--1154",
journal = "Wireless Communications and Mobile Computing",
issn = "1530-8669",
publisher = "John Wiley and Sons Ltd",
number = "7",

}

Network planning for mobile multi-hop relay networks. / Chen, Chi Yuan; Tseng, Fan Hsun; Lai, Chin-Feng; Chao, Han Chieh.

In: Wireless Communications and Mobile Computing, Vol. 15, No. 7, 01.05.2015, p. 1142-1154.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Network planning for mobile multi-hop relay networks

AU - Chen, Chi Yuan

AU - Tseng, Fan Hsun

AU - Lai, Chin-Feng

AU - Chao, Han Chieh

PY - 2015/5/1

Y1 - 2015/5/1

N2 - In this paper, the coverage problem of network planning in mobile multi-hop relay networks is defined on the basis of integer linear programming. In order to provide desired utilities and also meet deployment limitations for network planning, we propose a supergraph tree algorithm to place base stations and relay stations at the lowest cost position. Furthermore, another algorithm for avoiding the interference between base stations, which is called interference aware tree algorithm is also proposed. Both the proposed algorithms are formulated on the basis of a graph theoretic technique and analyzed in the simulation results. The results show that the supergraph tree algorithm provides the lowest construction cost with different network scenarios, and the interference aware tree algorithm provides the highest communication quality for mobile multi-hop relay infrastructure-based communication network planning.

AB - In this paper, the coverage problem of network planning in mobile multi-hop relay networks is defined on the basis of integer linear programming. In order to provide desired utilities and also meet deployment limitations for network planning, we propose a supergraph tree algorithm to place base stations and relay stations at the lowest cost position. Furthermore, another algorithm for avoiding the interference between base stations, which is called interference aware tree algorithm is also proposed. Both the proposed algorithms are formulated on the basis of a graph theoretic technique and analyzed in the simulation results. The results show that the supergraph tree algorithm provides the lowest construction cost with different network scenarios, and the interference aware tree algorithm provides the highest communication quality for mobile multi-hop relay infrastructure-based communication network planning.

UR - http://www.scopus.com/inward/record.url?scp=84927568854&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84927568854&partnerID=8YFLogxK

U2 - 10.1002/wcm.2396

DO - 10.1002/wcm.2396

M3 - Article

VL - 15

SP - 1142

EP - 1154

JO - Wireless Communications and Mobile Computing

JF - Wireless Communications and Mobile Computing

SN - 1530-8669

IS - 7

ER -