Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/81679
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLi, Zimaoen
dc.contributor.authorWang, Yingyingen
dc.contributor.authorMa, Maodeen
dc.date.accessioned2016-07-12T01:25:02Zen
dc.date.accessioned2019-12-06T14:35:58Z-
dc.date.available2016-07-12T01:25:02Zen
dc.date.available2019-12-06T14:35:58Z-
dc.date.issued2016en
dc.identifier.citationLi, Z., Wang, Y., & Ma, M. (2016). Efficient Deployment of Base Stations in Wireless Communication Networks. Journal of Communications, 11(6), 609-615.en
dc.identifier.issn1796-2021en
dc.identifier.urihttps://hdl.handle.net/10356/81679-
dc.description.abstractIn the design of wireless communication networks, we may have to interconnect n stations locating at given points in the plane such that the distance among each stations is as small as possible by introducing at most k extra stations subjective to a budget limit. In this paper, our goal is to determine the locations of the extra k stations interconnecting the existing n stations to minimize the longest distance among stations. This is so-called bottleneck Steiner tree problem, which also has applications in VLSI routing, WDM optical networks design and phylogenetic tree reconstruction. The problem has been proved to be NP-hard and cannot be approximated in the performance ratio 2 in polynomial time in both Euclidean and rectilinear plane and approximation algorithms in the best possible performance ratios presented for the problem in both planes. In this paper, we improve the time complexity of the approximation algorithms and conduct simulations to demonstrate the validness of our improvements.en
dc.format.extent7 p.en
dc.language.isoenen
dc.relation.ispartofseriesJournal of Communicationsen
dc.rights© 2016 Journal of Communications. This paper was published in Journal of Communications and is made available as an electronic reprint (preprint) with permission of Academy Publisher. The published version is available at: [http://www.jocm.us/index.php?m=content&c=index&a=show&catid=162&id=996]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.en
dc.subjectWireless communication networksen
dc.subjectbottleneck Steiner treeen
dc.titleEfficient Deployment of Base Stations in Wireless Communication Networksen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.identifier.doi10.12720/jcm.11.6.609-615en
dc.description.versionPublished versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:EEE Journal Articles
Files in This Item:
File Description SizeFormat 
Efficient Deployment of Base Stations in Wireless Communication Networks.pdf1.72 MBAdobe PDFThumbnail
View/Open

Page view(s)

310
Updated on May 27, 2022

Download(s) 20

270
Updated on May 27, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.