Published Articles >> Table of Contents >> Abstract

International Parallel and Distributed Processing Symposium (IPDPS'03)   p. 220a
Wireless ATM Layouts for Chain Networks
Michele Flammini, University of L’Aquila
Giorgio Gambosi, University of Rome "Tor Vergata"
Alfredo Navarra, University of L’Aquila and Université de Nice-Sophia Antipolis

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213403
Send link to a friend

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.
Back to Top Additional Information
Index Terms- ATM networks, wireless networks, mobile users, chains Citation:  Michele Flammini, Giorgio Gambosi, Alfredo Navarra, "Wireless ATM Layouts for Chain Networks," ipdps, p. 220a,  International Parallel and Distributed Processing Symposium (IPDPS'03),  2003