Skip to main content
SpringerLink
Log in

An Algorithm for Constructing Strongly Connected Dominating and Absorbing Sets in Wireless Networks with Unidirectional Links

  • Conference paper
Advances in Wireless Sensor Networks (CWSN 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 418))

Included in the following conference series:

  • 1130 Accesses

Abstract

It is effective to construct a strongly connected dominating and absorbing set (SCDAS) instead of a virtual backbone network in a wireless network with unidirectional links. However, there exist few studies on the strongly connected dominating and absorbing sets in wireless networks. In this paper, we propose an addition-based localized heuristic algorithm for constructing a SCDAS in a wireless network. The algorithm can obtain a small SCDAS with a constant approximation ratio through three executive phases. Theoretical analysis demonstrates the correctness of our algorithm.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Tseng, Y.C., Ni, S.Y., Chen, Y.S., Sheu, J.P.: The broadcast storm problem in a mobile ad hoc network. Wireless Networks 8(2-3), 153–167 (2002)

    Article  MATH  Google Scholar 

  2. Das, B., Bharghavan, V.: Routing in ad-hoc networks using minimum connected dominating sets. In: Proceedings of ICC 1997, pp. 376–380 (1997)

    Google Scholar 

  3. Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness (1979)

    Google Scholar 

  4. Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 7–14 (1999)

    Google Scholar 

  5. Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings of INFOCOM 2002, pp. 1597–1604 (2002)

    Google Scholar 

  6. Sakai, K., Shen, F., Kim, K.M., Sun, M.T., Okada, H.: Multi-initiator connected dominating set construction for mobile ad hoc networks. In: Proceedings of ICC 2008, pp. 2431–2436 (2008)

    Google Scholar 

  7. Zhou, D., Sun, M.T., Lai, T.H.: A timer-based protocol for connected dominating set construction in ieee 802.11 multihop mobile ad hoc networks. In: Proceedings of Symposium on Applications and the Internet 2005, pp. 2–8 (2005)

    Google Scholar 

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

    Article  Google Scholar 

  9. Dai, F., Wu, J.: An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems 15(10), 908–920 (2004)

    Article  Google Scholar 

  10. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  13. Chen, Y.P., Liestman, A.L.: Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In: Proceedings of the 3rd ACM international Symposium on Mobile Ad Hoc Networking and Computing, pp. 165–172 (2002)

    Google Scholar 

  14. Qayyum, A., Viennot, L., Laouiti, A.: Multipoint relaying for flooding broadcast messages in mobile wireless networks. In: Proceedings of HICSS 2002, pp. 3866–3875 (2002)

    Google Scholar 

  15. Park, M.A., Willson, J., Wang, C., Wu, W., Farago, A.: A dominating and absorbent set in a wireless ad-hoc network with different transmission ranges. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 22–31 (2007)

    Google Scholar 

  16. Tiwari, R., Mishra, T., Li, Y., Thai, M.T.: K-Strongly connected m-dominating and absorbing set in wireless ad hoc networks with unidirectional links. In: Proceedings of WASA 2007, pp. 103–112 (2007)

    Google Scholar 

  17. Thai, M.T., Wang, F., Liu, D., Zhu, S., Du, D.Z.: Connected dominating sets in wireless networks with different transmission ranges. IEEE Transactions on Mobile Computing 6(7), 721–730 (2007)

    Article  Google Scholar 

  18. Du, D.-Z., Thai, M.T., Li, Y., Liu, D., Zhu, S.: Strongly connected dominating sets in wireless sensor networks with unidirectional links. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds.) APWeb 2006. LNCS, vol. 3841, pp. 13–24. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Thai, M.T., Tiwari, R., Du, D.Z.: On construction of virtual backbone in wireless ad hoc networks with unidirectional links. IEEE Transactions on Mobile Computing 7(9), 1098–1109 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Qufu Normal University, Rizhao, 276826, Shandong, P.R. China

    Shengli Wan, Jiguo Yu, Nannan Wang, Cui Wang & Fang Liu

Authors
  1. Shengli Wan
    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. Nannan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cui Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Fang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Chinese Academy of Sciences, Beijing, China

    Limin Sun

  2. Beijing Key Lab of Intelligent Telecomm. Software and Multimedia, Beijing University of Posts and Telecomm., 100876, Beijing, China

    Huadong Ma

  3. Department of Computer Science, Ocean University of China, 266100, QingDao, P.R. China

    Feng Hong

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wan, S., Yu, J., Wang, N., Wang, C., Liu, F. (2014). An Algorithm for Constructing Strongly Connected Dominating and Absorbing Sets in Wireless Networks with Unidirectional Links. In: Sun, L., Ma, H., Hong, F. (eds) Advances in Wireless Sensor Networks. CWSN 2013. Communications in Computer and Information Science, vol 418. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54522-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54522-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54521-4

  • Online ISBN: 978-3-642-54522-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Societies and partnerships

Search

Navigation