Skip to main content
SpringerLink
Log in

2-m-Domatic Partition in Homogeneous Wireless Sensor Networks

  • Conference paper
Wireless Algorithms, Systems, and Applications (WASA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8491))

Abstract

Due to limited battery power, energy efficiency is an important issue to design efficient protocols in wireless sensor networks, which greatly affects the lifetime of the networks. Fault tolerance is an important approach to design efficient protocols, with which the networks has strong robustness. In this paper, we propose r-m-domatic partition (r-m-DP) problem to design energy efficient fault tolerance. In a wireless sensor network, the r-m-DP problem is to find some disjoint r-m-dominating sets in the network. Based on the uniform clustering, a constant-factor approximation algorithm for 2-m-DP is proposed. To the best of our knowledge, this is the first algorithm for 2-m-DP. The correctness and performance of the algorithm are confirmed by theoretical analysis.

The work is supported by NNSF of China for contract(61373027, 11101243) and NSF of Shandong Province for contract(ZR2012FM023).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Labrador, M.A., Wightman, P.M.: Topology control in wireless sensor networks. Springer Science + Business Media BV (2009)

    Google Scholar 

  2. Wu, J., Wu, B., Stojmenovic, I.: Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets. In: Proc. IASTED International Conference on Wireless and Optical Communication, WOC 2002 (2002)

    Google Scholar 

  3. Das, B., Bharghavan, V.: Routing in ad hoc networks using minimum connected dominating sets. In: ICC 1997, Montreal, Canada (June 1997)

    Google Scholar 

  4. Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374–387 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Wan, P., Alzoubi, K.M., Frieder, O.: Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. In: Proc. IEEE Conference on Computer Communications (INFOCOM), pp. 141–149 (2002)

    Google Scholar 

  6. Funke, S., Kesselman, A., Meyer, U., Segal, M.: A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sensor Network 2(3), 444–453 (2006)

    Article  Google Scholar 

  7. Wu, J., Dai, F., Yang, S.: Iterative local solutions for connected dominating set in ad hoc wireless networks. IEEE Transactions on Computers 57(5), 702–715 (2008)

    Article  MathSciNet  Google Scholar 

  8. Li, Y., Kim, D., Zou, F., Du, D.: Constructing minimum connected dominating sets with bounded diameters in wireless networks. IEEE Transactions on Parallel and Distributed System 20(2), 147–157 (2009)

    Article  Google Scholar 

  9. Yu, J., Wang, N., Wang, G.: Heuristic algorithms for constructing minimum connected dominating sets with bounded diameters in wireless networks. In: Pandurangan, G., Anil Kumar, V.S., Ming, G., Liu, Y., Li, Y. (eds.) WASA 2010. LNCS, vol. 6221, pp. 11–20. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  10. Wu, J.: Extended dominating-set-based routing in ad hoc wireless networks with unidirectional links. IEEE Trans. Parallel and Distributed Computing 13(9), 866–881 (2002)

    Article  Google Scholar 

  11. Yu, J., Wang, N., Wang, G.: Constructing minimum weakly connected dominating sets for clustering in ad hoc networks. J. Parallel Distrib. Comput. 72(1), 35–47 (2012)

    Article  MATH  Google Scholar 

  12. Han, B., Jia, W.: Clustering wireless ad hoc networks with weakly connected dominating set. J. Parallel Distrib. Comput. 67, 727–737 (2007)

    Article  MATH  Google Scholar 

  13. Yu, J., Qi, Y., Wang, G.: An energy-driven unequal clustering protocol for heterogeneous wireless sensor networks. Journal of Control Theory and Applications 9(1), 133–139 (2011)

    Article  MathSciNet  Google Scholar 

  14. Yu, J., Qi, Y., Wang, G., Gu, X.: A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution. AEÜ - International Journal of Electronics and Communications 66(1), 54–61 (2012)

    Article  Google Scholar 

  15. Yu, J., Qi, Y., Guo, Q., Gu, X.: EADUC: An energy-aware distributed unequal clustering protocol for wireless sensor networks. International Journal of Distributed Sensor Networks 2011, Article ID 202145, 8 (2011), doi:10.1155/2011/202145

    Google Scholar 

  16. Zhou, X., Wu, M., Xu, J.: BPEC: An Energy-aware distributed clustering algorithm in WSNs. Journal of Computer Research and Development 46(5), 723–730 (2009)

    Google Scholar 

  17. Cardei, M., Maccallum, D., Cheng, M., Jia, X., Li, D., Du, D.: Wireless sensor networks with energy effcient organization. Journal of Interconnection Networks 3(3-4), 213–229 (2002)

    Article  Google Scholar 

  18. Islam, K., Akl, S., Meijer, H.: Maximizing the lifetime of a sensor network through domatic partition. In: Proccedings of IEEE Conference on Local Computer Networks (2009)

    Google Scholar 

  19. Feige, U., Halldorsson, M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM Journal of Computing 32(1), 172–195 (2003)

    Article  MathSciNet  Google Scholar 

  20. Moscibroda, T., Wattenhofer, R.: Maximizing the Lifetime of Dominating Sets. Parallel and Distributed Processing Symposium 4, 8–15 (2005)

    Google Scholar 

  21. Pemmaraju, S., Pirwani, I.: Energy conservation via domatic partitions. In: Proccedings of ACM MobiHoc, pp. 143–154 (May 2006)

    Google Scholar 

  22. Pandit, S., Pemmaraju, S., Varadarajan, K.: Approximation algorithms for domatic partitions of unit disk graphs. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol. 5687, pp. 312–325. Springer, Heidelberg (2009)

    Google Scholar 

  23. Mahjoub, D., Matula, D.: Employing (1 − ε) dominating set partitions as backbones in wireless sensor networks. In: Proccedings of Workshop on Algorithm Engineering and Experiments, ALENEX 2010, pp. 98–111 (2010)

    Google Scholar 

  24. Mahjoub, D., Matula, D.W.: Building (1 − ε) dominating sets partition as backbones in wireless sensor networks using distributed graph coloring. In: Rajaraman, R., Moscibroda, T., Dunkels, A., Scaglione, A. (eds.) DCOSS 2010. LNCS, vol. 6131, pp. 144–157. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  25. Misra, R., Mandal, C.: Cluster head rotation via Domatic partition in self-organizing sensor networks. In: Proccedings of the International Symposium of Wireless Pervasive Computing (COMSWARE 2007), pp. 5–7 (January 2007)

    Google Scholar 

  26. Misra, R., Mandal, C.: Efficient Clusterhead rotation via domatic partition in self-organizing sensor networks. Wireless Communications and Mobile Computing 9(8), 1040–1058 (2009)

    Article  Google Scholar 

  27. Misra, R., Mandal, C.: Rotation of CDS via connected domatic partition in ad hoc sensor networks. Proc. IEEE Transactions on Mobile Computing 8(4), 488–499 (2009)

    Article  Google Scholar 

  28. Yu, J., Zhang, Q., Yu, D., Chen, C., Wang, G.: Domatic partition in homogeneous wireless sensor networks. Journal of Network and Computer Applications 37, 186–193 (2014)

    Article  Google Scholar 

  29. Zhang, Z., Liu, Q., Li, D.: Two algorithms for connected r-hop k-dominating set. Discrete Mathematics, Algorithms and Applications 1(4), 485–498 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  30. Li, D., Liu, L., Yang, H.: Minimum connected r-hop k-dominating set in wireless networks. Discrete Mathematics, Algorithms and Applications 1(1), 45–57 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  31. Dai, F., Wu, J.: On Constructing k-connected k-dominating set in wireless network. In: IEEE International Parallel and Distributed Processing Symposium, p. 81a (April 2005)

    Google Scholar 

  32. Wang, F., Thai, M., Li, Y.: On the construction of 2-connected virtual backbone in wireless networks. IEEE Transactions on Wireless Communications 8(3), 1230–1237 (2007)

    Article  Google Scholar 

  33. Wu, Y., Fang, F., Thai, M., Li, Y.: Constructing k-connected m-dominating sets in wireless sensor networks. In: Military Communications Conference(MILCOM 2007), pp. 29–31 (October 2007)

    Google Scholar 

  34. Thai, M., Zhang, N., Tiwari, R., Xu, X.: On approximation algorithms of k-connected m-dominating sets in disk graphs. Theoretical Computer Science 385(1-3), 49–59 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  35. Wu, Y., Li, Y.: Construction algorithms for k-connected m-dominating sets in wireless sensor networks. In: Proc the 9th ACM International Symposium on Mobile Ad hoc Networking and Computing, Hong Kong, China, pp. 83–90 (2008)

    Google Scholar 

  36. Shang, W., Yao, F., Wan, P., Hu, X.: Algorithms for minimum m-connected k-tuple dominating set problem. Theor. Comput. Sci. 381(1-3), 241–247 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  37. Shang, W., Yao, F., Wan, P.-J., Hu, X.: Algorithms for Minimum m-Connected k-Dominating Set Problem. In: Dress, A.W.M., Xu, Y., Zhu, B. (eds.) COCOA. LNCS, vol. 4616, pp. 182–190. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  38. Tiwari, R., Mishra, T., Li, Y., Thai, M.: k-Strongly Connected m-dominating and absorbing Set in wireless ad hoc networks with unidirectional links. In: International Conference on Wireless Algorithms, Systems and Applications, pp. 103–112 (August 2007)

    Google Scholar 

  39. Yu, J., Wang, N., Wang, G., Yu, D.: Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey. Computer Communications 36(2), 121–134 (2013)

    Article  Google Scholar 

  40. Du, D., Wan, P.: Connected Dominating Set: Theory and Applications (Springer Optimization and Its Applications). Springer (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Qufu Normal University, Ri-zhao, Shandong, 276826, P.R. China

    Lili Jia, Jiguo Yu & Qingbo Zhang

  2. Department of Computer Science, The University of Hong Kong, Pokfulam, Hong Kong, China

    Dongxiao Yu

Authors
  1. Lili Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jiguo Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dongxiao Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Qingbo Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Georgia State University, 34 Peachtree Street, 30303, Atlanta, GA, USA

    Zhipeng Cai

  2. School of Software, Tsinghua University, East Main Building, 100084, Beijing, China

    Chaokun Wang

  3. School of Computer Science and Technology, Harbin Institute of Technology, Zonghe Building, No. 92 West Dazhi Street, 150001, Harbin, China

    Siyao Cheng , Hongzhi Wang  & Hong Gao ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Jia, L., Yu, J., Yu, D., Zhang, Q. (2014). 2-m-Domatic Partition in Homogeneous Wireless Sensor Networks. In: Cai, Z., Wang, C., Cheng, S., Wang, H., Gao, H. (eds) Wireless Algorithms, Systems, and Applications. WASA 2014. Lecture Notes in Computer Science, vol 8491. Springer, Cham. https://doi.org/10.1007/978-3-319-07782-6_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07782-6_35

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07781-9

  • Online ISBN: 978-3-319-07782-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation