Network Planning for IEEE 802.16j Relay Networks

In this chapter, a problem formulation for determining the optimal node location for base stations (BSs) and relay stations (RSs) in relay-based802.16networksis developed.A numberof techniques are proposedto solve the resulting integer programming(IP) problem—theseare comparedin terms of the time taken to find a solution and the quality of the solution obtained. Finally, there is some analysis of the impact of the ratio of BS/RS costs on the solutions obtained. Three techniques are studied to solve the IP problem: (1) a standard branch and bound mechanism, (2) an approach in which state space reduction techniques are applied in advance of the branch and bound algorithm, and (3) a clustering approach in which the problem is divided into a number of subproblems which are solved separately, followed by a final overall optimization step. These different approaches were used to solve the problem. The results show that the more basic approachcan be used to solve problemsfor small metropolitanareas; the state space reduction technique reduces the time taken to find a solution by about 50 percent. Finally, the clustering approach can be used to find solutions of approximately equivalent quality in about 30 percent of the time required in the first case. After scalability tests were performed,some rudimentary experimentswere performed in which theratioofBS/RS costwasvaried.Theinitialresultsshowthatforthescenariosstudied,reducingthe

[1]  Edoardo Amaldi,et al.  Planning UMTS base station location: optimization models with power control and algorithms , 2003, IEEE Trans. Wirel. Commun..

[2]  Ieee Microwave Theory,et al.  Part 16: Air Interface for Fixed and Mobile Broadband Wireless Access Systems — Amendment for Physical and Medium Access Control Layers for Combined Fixed and Mobile Operation in Licensed Bands , 2003 .

[3]  Yang Yu,et al.  Planning Base Station and Relay Station Locations in IEEE 802.16j Multi-Hop Relay Networks , 2008, 2008 5th IEEE Consumer Communications and Networking Conference.

[4]  Kurt Tutschku,et al.  Demand-based radio network planning of cellular mobile communication systems , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[5]  Vinko Erceg,et al.  Channel Models for Fixed Wireless Applications , 2001 .

[6]  Lawrence Joel Greenstein,et al.  Channel Models for Fixed Wireless Applications Date Submitted , 2001 .

[7]  V. S. Abhayawardhana,et al.  Comparison of empirical propagation path loss models for fixed wireless access systems , 2005, 2005 IEEE 61st Vehicular Technology Conference.

[8]  Xi Yu-geng.  Planning Algorithm for WCDMA Base Station Location Problem Based on Cluster Decomposition , 2006 .

[9]  Todor Cooklev,et al.  Air Interface for Fixed Broadband Wireless Access Systems , 2004 .

[10]  Ieee Microwave Theory,et al.  IEEE Standard for Local and Metropolitan Area Networks Part 16: Air Interface for Fixed Broadband Wireless Access Systems Draft Amendment: Management Information Base Extensions , 2007 .