Show simple item record

dc.contributor.authorXhafa Xhafa, Fatos
dc.contributor.authorSánchez Lopez, Christian
dc.contributor.authorBarolli, Leonard
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2011-09-21T15:11:31Z
dc.date.available2011-09-21T15:11:31Z
dc.date.created2009
dc.date.issued2009
dc.identifier.citationXhafa, F.; Sánchez, C.; Barolli, L. Ad hoc and neighborhood search methods for placement of mesh routers in Wireless Mesh Networks. A: International Conference on Distributed Computing Systems. "29th IEEE International Conference on Distributed Computing Systems workshops, 2009: ICDCS workshops'09; 22-26 June 2009, Montreal, Quebec, Canada; proceedings". 2009, p. 400-405.
dc.identifier.isbn978-1-4244-4446-5
dc.identifier.urihttp://hdl.handle.net/2117/13289
dc.description.abstractWith the fast development in wireless technologies and wireless devices, Wireless Mesh Networks (WMN) are becoming and important networking infrastructure, especially due to their low cost of deployment and maintenance. A main issue in deploying WMNs is the optimal placement of mesh routers to achieve network connectivity and stability through the maximization of the size of the giant component in the network and user coverage. In this work we evaluate ad hoc and neighborhood search methods for placement of mesh routers in WMNs. Routers are assumed having their own coverage area, oscillating between minimum and maximum values. Given a deployment area where to distribute the mesh router nodes and a number of fixed clients a priori distributed in the given area, ad hoc methods explore different topologies such as placement in diagonals, in corners of the area, in hotspots, etc. and the resulting network connectivity and user coverage are measured. We have experimentally evaluated the considered ad hoc methods through a benchmark of generated instances as stand alone methods and as initializing methods of evolutionary algorithms. For each ad hoc method, different distributions of mesh clients (Normal, Exponential and Weibull), are considered and the size of the giant component and user coverage parameters are reported. Further, we considered neighborhood search methods for optimal placement of mesh routers as more powerful methods for achieving near optimal placements of mesh router nodes. The experimental evaluation showed the good performance of a swap-based movement neighborhood search, which achieved good connectivity of the network in few phases of neighborhood search exploration.
dc.format.extent6 p.
dc.language.isoeng
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
dc.subject.lcshWireless communications systems
dc.subject.lcshRouting (Computer network management)
dc.subject.lcshAd hoc networks (Computer networks)
dc.subject.otherWeibull distribution
dc.subject.otherAd hoc networks
dc.subject.otherEvolutionary computation
dc.subject.otherSearch problems
dc.subject.otherTelecommunication network routing
dc.titleAd hoc and neighborhood search methods for placement of mesh routers in Wireless Mesh Networks
dc.typeConference report
dc.subject.lemacComunicació sense fil, Sistemes de
dc.subject.lemacEncaminadors (Xarxes d'ordinadors)
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.identifier.doi10.1109/ICDCSW.2009.37
dc.relation.publisherversionhttp://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=05158884
dc.rights.accessOpen Access
local.identifier.drac2594727
dc.description.versionPostprint (published version)
local.citation.authorXhafa, F.; Sánchez, C.; Barolli, L.
local.citation.contributorInternational Conference on Distributed Computing Systems
local.citation.publicationName29th IEEE International Conference on Distributed Computing Systems workshops, 2009: ICDCS workshops'09; 22-26 June 2009, Montreal, Quebec, Canada; proceedings
local.citation.startingPage400
local.citation.endingPage405


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder