Multi-period design of survivable wireless access networks under capacity constraints

Authors:
Indranil Bose;Enes Eryarsoy;Ling He
Affiliations:
Department of Information Systems, School of Business, University of Hong Kong, Room 730, Meng Wah Complex, Pokfulam Road, Hong Kong, China;Department of Decision and Information Sciences, Warrington College of Business Administration, University of Florida, Gainesville, FL;Department of Decision and Information Sciences, Warrington College of Business Administration, University of Florida, Gainesville, FL
Venue:
Decision Support Systems
Year:
2005

Citing 7
Cited 2

Designing Least-Cost Survivable Wireless Backhaul Networks

Journal of Heuristics
Design of the Access Network Segment of Future Mobile Communications Systems

Wireless Personal Communications: An International Journal
Reliability and Survivability of Wireless and Mobile Networks

Computer
Measuring the Reliability and Survivability of Infrastructure-Oriented Wireless Networks

LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Providing fault tolerance in wireless access networks

IEEE Communications Magazine
Planning reliable UMTS terrestrial access networks

IEEE Communications Magazine
Survivability in optical networks

IEEE Network: The Magazine of Global Internetworking

An efficient link allocation algorithm for survivable ATM-based personal communication networks

Computers and Operations Research
Composite quality of service and decision making perspectives in wireless networks

Decision Support Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Design of survivable wireless access networks plays a key role in the overall design of a wireless network. In this research, the multi-period design of a wireless access network under capacity and survivability constraints is considered. Given the location of the cells and hubs, the cost of interconnection, and the demands generated by the cells, the goal of the designer is to find the best interconnection between cells and hubs so that the overall connection cost is minimized and the capacity and the survivability constraints are met. Integer programming formulations for this problem are proposed and the problems are solved using heuristic methods. Using different combination of network sizes, demand patterns and various time periods, a number of numerical experiments are conducted and all of them are found to yield high quality solutions.