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

NCUIR > College of Electrical Engineering & Computer Science > Department of Computer Science and information Engineering > journal & Dissertation > Item 987654321/107088

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/107088

Title:	Network planning for Type 1 and Type 1a relay nodes in LTE-Advanced networks
Authors:	周立德;Tseng, Fan‐Hsun;Chou, Li‐Der;Chao, Han‐Chieh
Contributors:	資訊電機學院資訊工程學系
Keywords:	Algorithms;Construction costs;Evolution;Graph theory;Interference;interference coordination;linear programming;LTE‐Advanced;network planning;Networks;Relay;relay node;Wireless communication
Date:	2016-08-25
Issue Date:	2026-04-23 13:55:59 (UTC+8)
Publisher:	Hindawi Limited;Oxford: John Wiley & Sons, Inc
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. Copyright © 2015 John Wiley & Sons, Ltd. In order to maximize the average throughput of all served users with the lowest communication interference, we propose interference coordination (IC) algorithm to place evolved Node Bs (eNBs) and to deploy Type 1 and Type 1a relay nodes in the center and at the edge of eNB, respectively. Results showed that the IC algorithm not only provides the lowest construction cost with slightly fewer numbers of served users but also eliminates communication interference with the highest average throughput. 出版者： Oxford: John Wiley & Sons, Inc 出版日期： 2016-08-25 出處： Wireless communications and mobile computing, 2016-08, Vol.16 (12), p.1526-1536 版權： Copyright © 2015 John Wiley & Sons, Ltd. 版權： Copyright © 2016 John Wiley & Sons, Ltd. 識別號： ISSN: 1530-8669 識別號： ISSN: 1530-8677 識別號： EISSN: 1530-8677 識別號： DOI: 10.1002/wcm.2611
Appears in Collections:	[Department of Computer Science and information Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	20	View/Open

社群 sharing

Loading...