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 layoutconstructions 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. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1023/B:MONE.0000048544.06992.f7 | Mobile Networks and Applications |
Keywords | DocType | Volume |
capacity planning,ATM networks,wireless networks,mobile users,chains | Journal | 10 |
Issue | ISSN | Citations |
1-2 | 1572-8153 | 3 |
PageRank | References | Authors |
0.38 | 23 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Michele Flammini | 1 | 681 | 70.12 |
Giorgio Gambosi | 2 | 315 | 45.52 |
Alfredo Navarra | 3 | 823 | 67.81 |