Analysis on a Localized Pruning Method for Connected Dominating Sets

While restricted rule-k has been succeeded in generating a connected dominating set (CDS) of small size, not much theoretical analysis on the size has been done. In this paper, an analysis on the expected size of a CDS generated by such algorithm and its relation to different node density is presented. Assume N nodes are deployed uniformly and randomly in a square of size L(subscript N)×L(subscript N) (where N and L(subscript N)→∞∞); three results are obtained. (1) It is proved that the node degree distribution of such a network follows a Poisson distribution. (2) The expected size of a CDS that is derived by the restricted pruning rule-k is a decreasing function with respect to the node density (The Symbol is abbreviated). For (The Symbol is abbreviated)≥30. it is found that the expected size is close to N/(The Symbol is abbreviated). (3) It is proved that the lower bound on the expected size of a CDS for a Poissonian network of node density (The Symbol is abbreviated) is given by (The equation is abbreviated)N. The second result is of paramount importance for practitioners. It provides the information about the expected size of a CDS when the node density (The Symbol is abbreviated) is between 6 and 30. The data (expected CDS size) for this range can hardly be provided by simulations.

[1]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2004, Mob. Networks Appl..

[2]  Jie Wu,et al.  Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets , 2003, Wirel. Commun. Mob. Comput..

[3]  I. Stojmenovic,et al.  A Dominating Sets and Target Radius Based Localized Activity Scheduling and Minimum Energy Broadcast Protocol for Ad Hoc and Sensor Networks. , 2004 .

[4]  Jie Wu,et al.  Efficient broadcasting with guaranteed coverage in mobile ad hoc networks , 2005, IEEE Transactions on Mobile Computing.

[5]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[6]  Jie Wu,et al.  Mobility control and its applications in mobile ad hoc networks , 2004, IEEE Network.

[7]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[8]  Jie Wu,et al.  Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links , 2002, IEEE Trans. Parallel Distributed Syst..

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

[10]  Eric Schmutz,et al.  The Expected Size of the Rule k Dominating Set , 2004, Algorithmica.

[11]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

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

[13]  Yi Pan,et al.  An Improved Distributed Algorithm for Connected Dominating Sets in Wireless Ad Hoc Networks , 2004, ISPA.

[14]  Jie Wu,et al.  Extended multipoint relays to determine connected dominating sets in MANETs , 2006, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[15]  Mario Gerla,et al.  Adaptive Clustering for Mobile Wireless Networks , 1997, IEEE J. Sel. Areas Commun..

[16]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.