Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks

To reduce routing cost in wireless sensor networks, we study a problem of minimizing the size of connected dominating set D under constraint that for any two nodes u and v, m"D(u,v)@[email protected]@?m(u,v) where @a is a constant, m"D(u,v) is the number of intermediate nodes on a shortest path connecting u and v through D and m(u,v) is the number of intermediate nodes in a shortest path between u and v in a given unit disk graph. We show that for @a>=5, this problem has a polynomial-time approximation scheme, that is, for any @e>0, there is a polynomial-time ([email protected])-approximation.

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

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

[3]  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.

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

[5]  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.

[6]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Loren Schwiebert,et al.  Power efficient topologies for wireless sensor networks , 2001, International Conference on Parallel Processing, 2001..

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

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

[10]  Weili Wu,et al.  A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..

[11]  Weili Wu,et al.  Construction of directional virtual backbones with minimum routing cost in wireless networks , 2011, 2011 Proceedings IEEE INFOCOM.

[12]  Ding-Zhu Du,et al.  Connected Domination in Multihop Ad Hoc Wireless Networks , 2002, JCIS.

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

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

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