Cart (Loading....) | Create Account
Close category search window
 

Hybrid Wireless-Optical Broadband Access Network (WOBAN): Network Planning Using Lagrangean Relaxation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sarkar, S. ; Cisco Syst., San Jose, CA, USA ; Hong-Hsu Yen ; Dixit, S. ; Mukherjee, B.

The concept of a hybrid wireless-optical broadband access network (WOBAN) is a very attractive one. This is because it may be costly in several situations to run fiber to every home (or equivalent end-user premises) from the telecom central office (CO); also, providing wireless access from the CO to every end user may not be possible because of limited spectrum. Thus, running fiber as far as possible from the CO toward the end user and then having wireless access technologies take over may be an excellent compromise. How far should fiber penetrate before wireless takes over is an interesting engineering design and optimization problem, which we address in this paper. We propose and investigate the characteristics of an analytical model for network planning, namely optimum placements of base stations (BSs) and optical network units (ONUs) in a WOBAN (called the primal model, or PM). We develop several constraints to be satisfied: BS and ONU installation constraints, user assignment constraints, channel assignment constraints, capacity constraints, and signal-quality and interference constraints. To solve this PM with reasonable accuracy, we use ldquoLagrangean relaxationrdquo to obtain the corresponding ldquoLagrangean dualrdquo model. We solve this dual problem to obtain a lower bound (LB) of the primal problem. We also develop an algorithm (called the primal algorithm) to solve the PM to obtain an upper bound (UB). Via simulation, we compare this PM to a placement heuristic (called the cellular heuristic) and verify that the placement problem is quite sensitive to a set of chosen metrics.

Published in:

Networking, IEEE/ACM Transactions on  (Volume:17 ,  Issue: 4 )

Date of Publication:

Aug. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.