International Parallel and Distributed Processing Symposium (IPDPS'03) Wireless ATM Layouts for Chain Networks Nice, France April 22-April 26 ISBN: 0-7695-1926-1
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.
Index Terms:
ATM networks, wireless networks, mobile users, chains
Citation:
Michele Flammini, Giorgio Gambosi, Alfredo Navarra, "Wireless ATM Layouts for Chain Networks," ipdps, pp.220a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||