Skip to main navigation Skip to search Skip to main content

Distributed gateway placement for cost minimization in wireless mesh networks

  • Illinois Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 Scopus citations

Abstract

We study the problem of gateway placement for cost minimization (GPCM) in two-dimensional wireless mesh networks. We are given a set of mesh routers, assume they have identical transmission range r, represented by unit transmission disks around them. A router may be selected as a gateway at certain placing cost. A router is served by a gateway if and only if the gateway is within its transmission range. The goal of this work is to select a set of mesh routers as gateways to serve the rest routers with minimum overall cost. This problem is NP-hard. To the best of our knowledge, no distributed algorithm with a constant approximation ratio has been given before. When all weights are uniform, the best approximation ratio is 38. We present both centralized and distributed algorithms which can achieve approximation ratios 6 + ε and 20 respectively. Our algorithms greatly improve the best approximation ratios.

Original languageEnglish
Title of host publicationICDCS 2010 - 2010 International Conference on Distributed Computing Systems
Pages507-515
Number of pages9
DOIs
StatePublished - 2010
Event30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010 - Genova, Italy
Duration: Jun 21 2010Jun 25 2010

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Conference

Conference30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010
Country/TerritoryItaly
CityGenova
Period06/21/1006/25/10

Fingerprint

Dive into the research topics of 'Distributed gateway placement for cost minimization in wireless mesh networks'. Together they form a unique fingerprint.

Cite this