Title :
Wireless ATM layouts for chain networks
Author :
Flammini, Michele ; Gambosi, Giorgio
Author_Institution :
Dipt. di Informatica, L´Aquila Univ., Italy
Abstract :
In this paper we consider the problem of constructing ATM layouts for wireless networks in which mobile users can move along a chain of base stations. We first show that deciding the existence of a layout with maximum hop count h, load l and channel distance d is NP-complete for every fixed value of d greater or equal to 1. We then provide optimal layout constructions for the case d ≤ 2. Finally, optimal layout constructions are obtained also for any d within the class of the so-called canonic layouts, that so far have always been shown to be the optimal ones.
Keywords :
asynchronous transfer mode; computational complexity; radio access networks; NP-complete problem; asynchronous transfer mode; chain networks; maximum hop count; wireless ATM layouts; wireless networks; Asynchronous transfer mode; Base stations; Communication switching; Distributed processing; Quality of service; Routing; Space stations; Switches; Virtual colonoscopy; Wireless networks;
Conference_Titel :
Parallel and Distributed Processing Symposium, 2003. Proceedings. International
Print_ISBN :
0-7695-1926-1
DOI :
10.1109/IPDPS.2003.1213403