Distributed Gateway Placement for Cost Minimization in Wireless Mesh Networks

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.

[1]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[2]  Sriram V. Pemmaraju,et al.  Finding Facilities Fast , 2009, ICDCN.

[3]  Ion I. Mandoiu,et al.  Selecting Forwarding Neighbors in Wireless Ad Hoc Networks , 2001, DIALM '01.

[4]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Esther M. Arkin,et al.  Minimum-cost coverage of point sets by disks , 2006, SCG '06.

[6]  WanPeng-Jun,et al.  Coverage by randomly deployed wireless sensor networks , 2006 .

[7]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[8]  Thomas Erlebach,et al.  Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs , 2006, APPROX-RANDOM.

[9]  Xiang-Yang Li,et al.  Coverage in Wireless Ad Hoc Sensor Networks , 2003, IEEE Trans. Computers.

[10]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[11]  Cheng Li,et al.  Wireless Mesh Networks: A Survey , 2007 .

[12]  Weili Wu,et al.  A better constant-factor approximation for weighted dominating set in unit disk graph , 2009, J. Comb. Optim..

[13]  Himanshu Gupta,et al.  Connected K-coverage problem in sensor networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[14]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[15]  József Balogh,et al.  On k-coverage in a mostly sleeping sensor network , 2004, MobiCom '04.

[16]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[18]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[19]  Petr Vojtechovský,et al.  An Improved Approximation Factor For The Unit Disk Covering Problem , 2006, CCCG.

[20]  Matthew J. Katz,et al.  Covering Points by Unit Disks of Fixed Location , 2007, ISAAC.

[21]  Lan Lin,et al.  Optimal coverage paths in ad-hoc sensor networks , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[22]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.