Planning Base Station and Relay Station Locations for IEEE 802.16j Network with Capacity Constraints

被引：17

作者：

Yu, Yang ^{[1
]}

Murphy, Sean ^{[1
]}

Murphy, Liam ^{[1
]}

机构：

[1] Univ Coll Dublin, Sch Comp Sci & Informat, Dublin 2, Ireland

来源：

2010 7TH IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE-CCNC 2010 | 2010年

关键词：

D O I：

10.1109/AICI.2010.322

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, two formulations for planning Base Station (BS) and Relay Station (RS) locations are proposed: a rather complex 0-1 integer programming model which can be used to determine which set of locations should be selected from a given set of BS and RS locations and a simpler decomposition approach which focuses first on the BS location problem followed by the RS location determination. The two approaches are compared and the results show that the simpler decomposition approach can find solutions using significantly less resources which are very minimally lower in quality than that found by the more complex formulation. Hence, the decomposition approach can be used to solve larger 802.16j network planning problems.

引用

页码：405 / 409

页数：5

共 11 条

[1]

GENC V, 2009, IEEE WCNC

[2]

HOYMANN C, P EUR WIR 2007

[3]

*IEEE, 2009, 80216J IEEE

[4]

*IEEE 802 16J MULT, 2007, MULT REL SYST EV MET

[5]

IRMER R, 2008, IEEE INT S PERS IND

[6]

LIN B, 2008, IEEE WCNC

[7]

LIN B, 2007, P 2007 INT C WIR COM

[8]

SAHIN G, 2007, COMPUTERS OPERATIONS, V34

[9]

VISOTSKY E, 2008, IEEE WCNC

[10] A clustering approach to planning base station and relay station locations in IEEE 802.1 multi-hop relay networks [J].

Yu, Yang ;

Murphy, Sean ;

Murphy, Liam .

2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, :2586-2591

← 1 2 →