2005
DOI: 10.1023/b:mone.0000048544.06992.f7
|View full text |Cite
|
Sign up to set email alerts
|

Wireless ATM Layouts for Chain Networks

Abstract: 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,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
3
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
1
1
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 25 publications
1
3
0
Order By: Relevance
“…Finally, concerning future research directions for WATM networks, one important question left open in [25] is if the family of the canonic layouts contains optimal layouts for ¾. Even if not claimed explicitly, our constructions show that this is true for ¾ and the previous results shown in the literature seem to confirm this conjecture.…”
Section: Discussionsupporting
confidence: 71%
See 1 more Smart Citation
“…Finally, concerning future research directions for WATM networks, one important question left open in [25] is if the family of the canonic layouts contains optimal layouts for ¾. Even if not claimed explicitly, our constructions show that this is true for ¾ and the previous results shown in the literature seem to confirm this conjecture.…”
Section: Discussionsupporting
confidence: 71%
“…Such results hold under the assumption that all the VCs induce shortest paths in the underlying network. In [25] we consider the determination of WATM layouts for chains in the nonshortest path case in which the lengths of the paths induced by the VPs is not constrained. We first show that deciding the existence of a layout with maximum hop count , load Ð ½ and distance ½ is NP-complete even when the adjacency graph is a chain of base stations with the source coinciding with one of its endpoints.…”
Section: Layout Design In Wireless Atm Networkmentioning
confidence: 99%
“…Flammini et al [8] considered the construction of wireless ATM layouts for a chain of base stations, and showed that the problem studied was NP-complete for special instances, and provided optimal solutions for certain cases.…”
Section: Chain Networkmentioning
confidence: 99%
“…Many industries, today, prefer chain topology on their networks comprised of nodes connected each other consecutively throughout both long and narrow deployment areas like railways [1], highways [2], underground mines [3,4], as well as in some special type of wireless sensor and mesh networks [3][4][5][6][7] and backbones of telecommunication systems [8]. Similarly, it is also a well-known implementation to connect (wi-fi) routers in daisy-chain topology to provide internet access at each floor in towers or high buildings.…”
Section: Introductionmentioning
confidence: 99%