Support for mobile communications planning
Decision Support Systems
Communications of the ACM
Discrete Optimization Algorithms with Pascal Programs
Discrete Optimization Algorithms with Pascal Programs
Designing Least-Cost Survivable Wireless Backhaul Networks
Journal of Heuristics
An Efficient Link Allocation Algorithm for ATM-Based Personal Communication Networks
Wireless Personal Communications: An International Journal
Multi-period design of survivable wireless access networks under capacity constraints
Decision Support Systems
Technologies on the horizon-deploying personal communication networks
IEEE Communications Magazine
Providing fault tolerance in wireless access networks
IEEE Communications Magazine
An efficient algorithm for the link allocation problem on ATM-based personal communication networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
The integration of the issue of survivability of wireless networks in the design process of the backbone network is addressed in this paper. The effectiveness of this integration plays a critical role in the success of the wireless network and the satisfaction of its mobile users. In this paper, we consider the design problem of allocating the backbone links in ATM-based personal communication networks (PCNs) that are survivable under single backbone link failures. Survivability is achieved by selecting two link-disjoint routes in the backbone network between every pair of ATM switches. We also take the novel approach of not only minimizing the diameter of the network as a primary objective but also minimizing the total length of the network as a secondary objective. We propose a new heuristic algorithm to optimize the design of the network based on both objectives. We report the results of an extensive simulation study that show that our algorithm generates backbone networks that can withstand single link failures, have shorter average diameters and smaller total lengths and achieve a higher percentage of admitted calls under a mobile environment.