Planning base station and relay station locations for IEEE 802.16j network with capacity constraints

Authors:
Yang Yu;Seán Murphy;Liam Murphy
Affiliations:
School of Computer Science and Informatics, University College Dublin, Dublin, Ireland;School of Computer Science and Informatics, University College Dublin, Dublin, Ireland;School of Computer Science and Informatics, University College Dublin, Dublin, Ireland
Venue:
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Year:
2010

Citing 3
Cited 4

A review of hierarchical facility location models

Computers and Operations Research
Optimal relay station placement in IEEE 802.16j networks

IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Analysis of transparent mode IEEE 802.16j system performance with varying numbers of relays and associated transmit power

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference

A scheduling algorithm with MAP multiplexing in IEEE 802.16 mobile multi-hop relay

Mobility '08 Proceedings of the International Conference on Mobile Technology, Applications, and Systems
An efficient scheduling algorithm for radio resource reuse in IEEE 802.16j multi-hop relay networks

Computers and Electrical Engineering
Multihop cellular network optimization using genetic algorithms

Proceedings of the 7th International Conference on Network and Services Management
WiMAX network design and optimization using multi-hop relay stations

AIC'10/BEBI'10 Proceedings of the 10th WSEAS international conference on applied informatics and communications, and 3rd WSEAS international conference on Biomedical electronics and biomedical informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.