An Efficient Link Allocation Algorithm for ATM-Based Personal Communication Networks

  • Authors:

  • Nen-Fu Huang;Rui-Chi Wang

  • Affiliations:

  • Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China (Tel.: 88635731063/ Fax: 88635723694/ E-mail: nfhuang@cs.nthu.edu.tw);Department of Computer Science, National Tsing Hua University, Hsinchu, Taiwan 30043, Republic of China (Tel.: 88635731063/ Fax: 88635723694/ E-mail: nfhuang@cs.nthu.edu.tw)

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

The wireless personal communication networks (PCN) will play animportant role throughout the 1990s and into the next century. Due to the demand for extending the wireless services to integrated services such as data, voice, images and video, a high-speed backbone network to connect the base stations in the microcells isrequired. One of the possible solutions is to apply the ATM-based backbone network. In such an ATM-based PCN, the communication path between a pair of mobile terminals might be elongated due to the mobility of terminals. Generally, there are two ways to resolvethis problem. The first is to migrate the elongated path to a better one when necessary. The other is to design an appropriate backbone network by considering the mobile environment. Recently, several mechanisms based on the former approach have been proposed.In this paper, the latter approach is considered and the design problemof allocating the backbone links among the ATM switches so that the network performance affected by the terminal mobility is kept as less as possible is investigated. We show that this link allocation problem is NP-hard. A simple and efficient heuristic isalso proposed for this problem. Simulation results show that based on the backbone obtained by the heuristic, the average length of each communication path is kept as short as possible even under the mobile environment. As a result, the number of successfully established paths in the network is increased significantly.