Network planning for Type 1 and Type 1a relay nodes in LTE-Advanced networks

Fan Hsun Tseng, Li Der Chou, Han Chieh Chao

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Abstract

In this paper, the planning problem of multiple evolved Node Bs (eNBs) and two types of relay nodes is defined base on linear programming. Type 1 relay nodes are placed in the center of eNB, and Type 1a relay nodes are deployed at cell edge. Three algorithms are proposed to investigate the Type 1a relay node placement and communication interference. All algorithms are designed on the basis of graph theory and analyzed in planning case and simulation results. The ultimate goal is to maximize the average throughput of all served users with minimum communication interference. Results showed that the proposed interference coordination algorithm not only provides the lowest construction cost with slightly fewer numbers of served users but also eliminates the communication interference with the highest average throughput. Most importantly, it achieves the best communication quality for next generation mobile networks.

Original languageEnglish
Pages (from-to)1526-1536
Number of pages11
JournalWireless Communications and Mobile Computing
Volume16
Issue number12
DOIs
Publication statusPublished - 2016 Aug 25

All Science Journal Classification (ASJC) codes

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

Fingerprint

Dive into the research topics of 'Network planning for Type 1 and Type 1a relay nodes in LTE-Advanced networks'. Together they form a unique fingerprint.

Cite this