Wireless ATM Layouts for Chain Networks

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Michele Flammini Articles by Giorgio Gambosi Articles by Alfredo Navarra

International Parallel and Distributed Processing Symposium (IPDPS'03)

Nice, France

April 22-April 26

ISBN: 0-7695-1926-1

	ASCII Text	x
	Michele Flammini, Giorgio Gambosi, Alfredo Navarra, "Wireless ATM Layouts for Chain Networks," Parallel and Distributed Processing Symposium, International, pp. 220a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003.

	BibTex	x
	@article{ 10.1109/IPDPS.2003.1213403, author = {Michele Flammini and Giorgio Gambosi and Alfredo Navarra}, title = {Wireless ATM Layouts for Chain Networks}, journal ={Parallel and Distributed Processing Symposium, International}, volume = {0}, year = {2003}, issn = {1530-2075}, pages = {220a}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213403}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel and Distributed Processing Symposium, International TI - Wireless ATM Layouts for Chain Networks SN - 1530-2075 SP EP A1 - Michele Flammini, A1 - Giorgio Gambosi, A1 - Alfredo Navarra, PY - 2003 KW - ATM networks KW - wireless networks KW - mobile users KW - chains VL - 0 JA - Parallel and Distributed Processing Symposium, International ER -

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

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213403

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.