On the Performance of Weakly Connected Dominating Set and Loosely Coupled Dominating Set for Wireless Sensor/Mesh Networks

Article Preview

Abstract:

Using an underlying cluster-based virtual backbone induced by the weakly connected dominating set (WCDS) is a very promising approach to enhance network efficiency. This paper proposes a novel loosely-coupled dominating set (LCDS) which is adapted from the concept of WCDS by further relaxing its connectivity requirement. The main advantages of the proposed LCDS are as follows. First, it can further reduce the size of the dominating set compared with that generated by the WCDS. Second, it can decrease the average utilization of the selected cluster heads to prolong their life-cycle. Third, it can increase the edge coverage of the network to exploit the benefits of load balancing. Fourth, it provides the network with high reliability by supporting more alternative routing paths. Numerical results show that the proposed LCDS outperforms the WCDS in almost every node deployment scenarios and every performance aspects.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

929-935

Citation:

Online since:

May 2015

Export:

Price:

* - Corresponding Author

[1] J. Blum, M. Ding, A. Thaeler and X. Cheng: Connected Dominating Set in Sensor Networks and MANETs, in: Handbook of Combinatorial Optimization, edited by D.Z. Du and P. Pardalos, Kluwer Academic Publishers, 2004, pp.329-369.

DOI: 10.1007/0-387-23830-1_8

Google Scholar

[2] Y. -L. Chang and C. -C. Hsu: Routing in wireless/mobile ad-hoc networks via dynamic group construction, Mobile Networks and Applications, 5, 2000, pp.27-37.

Google Scholar

[3] B. Das and V. Bharghavan: Routing in ad-hoc networks using minimum connected dominating sets, in Proc. International Conference on Communications, Montreal, Canada, June (1997).

DOI: 10.1109/icc.1997.605303

Google Scholar

[4] S. Funke, A. Kesselman, and U. Meyer: A simple improved distributed algorithm for minimum CDS in unit disk graphs, ACM Trans. Sensor Networks, vol. 2, no. 3, 2006, pp.444-453.

DOI: 10.1145/1167935.1167941

Google Scholar

[5] Y. Li, M.T. Thai, F. Wang, C. Yi, P. -J. Wan, and D. -Z. Du: On greedy construction of connected dominating sets in wireless networks, Wireless Comm. and Mobile Computing, vol. 5, no. 8, 2005, pp.927-932.

DOI: 10.1002/wcm.356

Google Scholar

[6] H. Du, W. Wu, Q. Ye, D. Li, W. Lee and X. Xu: CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks, IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 4, April 2013, pp.652-661.

DOI: 10.1109/tpds.2012.177

Google Scholar

[7] N. Chakchouk, B. Hamdaoui and M. Frikha: WCDS-DCR: an energy-efficient data-centric routing scheme for wireless sensor networks, Wireless Communications and Mobile Computing, vol. 12, issue 2, Feb. 2012, p.195–205.

DOI: 10.1002/wcm.956

Google Scholar

[8] C. Dou and Y. Hsiao: Essential topics on constructing WCDS-based virtual backbone in wireless sensor/mesh networks, Communications and Network, vol. 5, no. 2B, May 2013, pp.1-7.

DOI: 10.4236/cn.2013.52b001

Google Scholar

[9] B. Han and W. Jia: Clustering wireless ad hoc networks with weakly connected dominating set, Journal of Parallel and Distributed Computing, 67 (2007), p.727–737.

DOI: 10.1016/j.jpdc.2007.03.001

Google Scholar

[10] N. Chakchouk, B. Hamdaoui and M. Frikha: WCDS-induced routing for data-aggregation in wireless sensor networks, in Proc. 1st International Conference on Communications and Networking, 2009, pp.1-6.

DOI: 10.1109/comnet.2009.5373558

Google Scholar

[11] L. Ding, W. Wu, J. Wilson, H. Du, W. Lee and D. Z. Du: Efficient algorithms for topology control problem with routing cost constraints in wireless networks, IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 10, Oct. 2011, pp.1601-1609.

DOI: 10.1109/tpds.2011.30

Google Scholar

[12] Y. P. Chen and A. L. Liestman: Approximating minimum size weakly connected dominating sets for clustering mobile ad hoc networks, in Proc. 3rd ACM International Symposium on Mobile Ad Hoc Networking & Computing, New York, USA: ACM, 2002, pp.165-172.

DOI: 10.1145/513800.513821

Google Scholar