An efficient algorithm for the link allocation problem on ATM-based personal communication networks

The personal communication network (PCN) is an emerging wireless network that promises many new services for the telecommunication industry. The proliferation of demands for extending wireless services to integrated services which supports the transmission of data and multimedia information has resu...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications 2000-07, Vol.18 (7), p.1279-1288
Main Author: Low, Chor Ping
Format: Article
Language:English
Subjects:
Algorithms
Allocations
Asynchronous transfer mode
Communication industry
Communication switching
Intserv networks
Links
Mobile communication
Multimedia systems
Networks
PCN
Personal communication networks
Spine
Studies
Switches
Switching theory
Terminals
Wireless networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The personal communication network (PCN) is an emerging wireless network that promises many new services for the telecommunication industry. The proliferation of demands for extending wireless services to integrated services which supports the transmission of data and multimedia information has resulted in the need for broadband wireless systems that are able to provide service capabilities similar to those of wireline networks. The ATM cell-relay paradigm is one possible approach to provide broadband wireless transmission with PCNs using the ATM switching networks for interconnection of PCN cells. In an ATM-based PCN, the communication path between a pair of mobile terminals might be elongated due to the mobility of the terminals. The link allocation problem is that of allocating backbone links among ATM switches to reduce the effects of terminal mobility on the performance of ATM-based PCNs. Huang and Wang (1997) have shown that this problem is NP-complete. In this paper, we propose a new efficient heuristic algorithm for the link allocation problem. One novel feature of our algorithm is that we are able to derive sufficient conditions under which our algorithm is able to guarantee optimal solutions. Our empirical study shows that the average lengths of communication paths obtained by our algorithm are shorter than those obtained by Huang and Wang's algorithm. In addition, the number of successfully established paths obtained by our algorithm is significantly more than that obtained by the aforementioned.
ISSN:0733-8716
1558-0008
DOI:10.1109/49.857928