Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs

The strongly connected dominating and absorbing set (DAS) is used as a virtual backbone in heterogeneous wireless sensor. To reduce routing cost, we introduce a routing-cost constraint and study the problem of computing the minimum strongly connected DAS under routing-cost constraint. An approximation algorithm with guaranteed performance will be presented.

[1]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[2]  N. Oler,et al.  An inequality in the geometry of numbers , 1961 .

[3]  Deying Li,et al.  CDS-Based Virtual Backbone Construction with Guaranteed Routing Cost in Wireless Sensor Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[4]  Zhao Zhang,et al.  A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph , 2013 .

[5]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[6]  Weili Wu,et al.  Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[7]  Mahtab Seddigh,et al.  Internal nodes based broadcasting in wireless networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[8]  Wei Wang,et al.  A PTAS for minimum d-hop connected dominating set in growth-bounded graphs , 2010, Optim. Lett..

[9]  Weili Wu,et al.  An exact algorithm for minimum CDS with shortest path constraint in wireless networks , 2011, Optim. Lett..

[10]  Helmut Groemer,et al.  Über die Einlagerung von Kreisen in einen konvexen Bereich , 1960 .

[11]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[12]  Panos M. Pardalos,et al.  Wireless networking, dominating and packing , 2010, Optim. Lett..

[13]  Weili Wu,et al.  A greedy algorithm for the fault-tolerant connected dominating set in a general graph , 2014, J. Comb. Optim..

[14]  Deying Li,et al.  Algorithms for the minimum weight k-fold (connected) dominating set problem , 2012, J. Comb. Optim..

[15]  Yi Zhu,et al.  Efficient Distributed Algorithms for Topology Control Problem with Shortest Path Constraints , 2009, Discret. Math. Algorithms Appl..

[16]  Weili Wu,et al.  Efficient Algorithms for Topology Control Problem with Routing Cost Constraints in Wireless Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[17]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[18]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[19]  Panos M. Pardalos,et al.  Analysis of greedy approximations with nonsubmodular potential functions , 2008, SODA '08.

[20]  Deying Li,et al.  Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks , 2011, 2011 Proceedings IEEE INFOCOM.