ALLOCATION OF BACKBONE LINKS IN ATM-BASED PERSONAL COMMUNICATION NETWORKS

Abstract

The wireless personal communication networks (PCN) will play an important role' throughout the next century. Due to the demand for extending the wireless services to integrated services such as data, voice, image, and video, a high-speed backbone network to connect the base stations in the microcells is required. One of the possible solutions is to apply the ATM-based backbone networks. In such an ATM-based PCN, the communication path between a pair of mobile terminals might be elongated due to the mobility of the terminals. Generally, there are two ways to resolve the 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. In this dissertation later approach is considered and three algorithms have been implemented for allocating the backbone links and their way of finding the diameter of geographical area or subgraph is compared. As the number of ATM switch increases the diameter of geographical area increases. It is also shown that, insertion backbone links in final subgraph leads to reduction in the diameter of geographical area to some extent. Link allocation algorithms decide this insertion of links. This dissertation is implemented in C++ and compiled in DOS platform.