Skip to main content
SpringerLink
Log in

Approximate Minimum-Transmission Broadcasting in Duty-Cycled WSNs

  • Conference paper
  • First Online:
Book cover Wireless Algorithms, Systems, and Applications (WASA 2018)

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

  • 3995 Accesses

Abstract

Broadcast is an essential operation for disseminating messages in multihop wireless networks. Unfortunately, the problem of Minimum Transmission Broadcast (MTB) in duty-cycled scenarios is not well studied. Existing works always have rigid assumption that each node is only active once per working cycle. Aiming at making the work more practical and general, MTB problem in duty-cycled network where each node is allowed to active multiple times in each working cycle (MTBDCA) is investigated in this paper. Firstly, the MTBDCA problem is proved to be NP-hard and unlikely to have an \((1-o(1))ln \varDelta \)-approximation algorithm, where \(\varDelta \) denotes the maximum node degree. A novel covering problem is proposed based on an auxiliary graph, which is constructed to integrating the transmitting time slots into the network. Then, a \(ln(\varDelta +1)\)-approximation algorithm is proposed for MTBDCA. Finally, the theoretical analysis and experimental results verify the efficiency of the proposed 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 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.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

References

  1. Cheng, S., Cai, Z., Li, J., Gao, H.: Extracting kernel dataset from big sensory data in wireless sensor networks. TKDE 29(4), 813–827 (2017)

    Google Scholar 

  2. Li, J., Cheng, S., Cai, Z., et al.: Approximate holistic aggregation in wireless sensor networks. ACM Trans. Sens. Netw. 13(2), 11 (2017)

    Article  Google Scholar 

  3. Yu, J., Qi, Y., Wang, G., Gu, X.: A cluster-based routing protocol for wireless sensor networks with nonuniform node distribution. Int. J. Electron. Commun. 66(1), 54–61 (2012)

    Article  Google Scholar 

  4. Cheng, S., Cai, Z., Li, J.: Curve query processing in wireless sensor networks. IEEE Trans. Veh. Technol. 64(11), 5198–5209 (2015)

    Article  Google Scholar 

  5. He, Z., Cai, Z., Cheng, S., et al.: Approximate aggregation for tracking quantiles and range countings in wireless sensor networks. Theoret. Comput. Sci. 607(3), 381–390 (2015)

    Article  MathSciNet  Google Scholar 

  6. Han, M., Li, L., Xie, Y., et al.: Cognitive approach for location privacy protection. IEEE Access 6, 13466–13477 (2018)

    Article  Google Scholar 

  7. Han, M., Wang, J., Duan, Z., et al.: Near-complete privacy protection: cognitive optimal strategy in location-based services. In: Proceedings of IIKI (2017)

    Google Scholar 

  8. Chlamtac, I., Kutten, S.: Tree-based broadcasting in multihop radio networks. IEEE Trans. Comput. 36(10), 1209–1223 (1987)

    Article  Google Scholar 

  9. Lou, W., Wu, J.: A cluster-based backbone infrastructure for broadcasting in MANETs. In: Proceedings of IPDPS (2003)

    Google Scholar 

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

    Google Scholar 

  11. Wu, J., Li, H.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of DIALM, pp. 7–14 (1999)

    Google Scholar 

  12. Lou, W., Wu, J.: On reducing broadcast redundancy in ad hoc wireless networks. IEEE Trans. Mob. Comput. 1(2), 111–123 (2002)

    Article  Google Scholar 

  13. Wu, J., Lou, W.: Forward-node-set-based broadcast in clustered mobile ad hoc networks. Wirel. Commun. Mob. Comput. 3(2), 155–173 (2003)

    Article  Google Scholar 

  14. Wu, J.: An enhanced approach to determine a small forward node set based on multipoint relays. In: Proceedings of VTC, pp. 2774–2777 (2003)

    Google Scholar 

  15. Adjih, C., Jacquet, P., Viennot, L.: Computing connected dominated sets with multipoint relays. Ad Hoc Sens. Wirel. Netw. 1(1), 27–39 (2005)

    Google Scholar 

  16. Wu, J., Lou, W., Dai, F.: Extended multipoint relays to determine connected dominating sets in MANETs. IEEE Trans. Comput. 55(3), 334–347 (2006)

    Article  Google Scholar 

  17. Chen, Q., Gao, H., Cheng, S., et al.: Centralized and distributed delay-bounded scheduling algorithms for multicast in duty-cycled wireless sensor networks. IEEE/ACM Trans. Netw. 25(6), 3573–3586 (2017)

    Article  Google Scholar 

  18. Chen, Q., Gao, H., Cheng, S., et al.: Distributed non-structure based data aggregation for duty-cycle wireless sensor networks. In: Proceedings of IEEE INFOCOM, pp. 145–153 (2017)

    Google Scholar 

  19. Hong, J., Cao, J., Li, W., et al.: Minimum-transmission broadcast in uncoordinated duty-cycled wireless ad hoc networks. IEEE TVT 59(1), 307–318 (2010)

    Google Scholar 

  20. Le-Duc, T., Le, D., Choo, H., et al.: On minimizing the broadcast redundancy in duty-cycled wireless sensor networks. In: ACM International Conference on Ubiquitous Information Management and Communication (2013)

    Google Scholar 

  21. Le-Duc, T., Le, D., Choo, H., et al.: Level-based approach for minimum-transmission broadcast in duty-cycled wireless sensor networks. Pervasive Mob. Comput. 27, 116–132 (2016)

    Article  Google Scholar 

  22. Le-Duc, T., Le, D., Zalyubovskiy, V.: Towards broadcast redundancy minimization in duty-cycled wireless sensor networks. Int. J. Commun. Syst. 30(6), 1–21 (2017)

    Google Scholar 

  23. Wan, P.-J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless ad hoc networks. Mob. Netw. Appl. 9(2), 141–149 (2004)

    Article  Google Scholar 

  24. Wan, P.-J., Wang, L., Yao, F.: Two-phased approximation algorithms for minimum CDS in wireless ad hoc networks. In: Proceedings of ICDCS, pp. 337–344 (2008)

    Google Scholar 

  25. Shi, T., Cheng, S., Li, J., et al.: Constructing connected dominating sets in battery-free networks. In: Proceedings of INFOCOM, pp. 1–9 (2017)

    Google Scholar 

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

    Article  Google Scholar 

  27. Yu, J., Ning, X., Sun, Y., et al.: Constructing a self-stabilizing CDS with bounded diameter in wireless networks under SINR. In: IEEE INFOCOM (2017)

    Google Scholar 

  28. Han, K., Liu, Y., Luo, J.: Duty-cycle-aware minimum-energy multicasting in wireless sensor networks. IEEE Trans. Netw. 21(3), 910–923 (2013)

    Article  Google Scholar 

  29. Feige, U.: A threshold of for ln \(n\) approximating set cover. J. ACM 45, 634–652 (1998)

    Article  MathSciNet  Google Scholar 

  30. Chen, Q., Gao, H., Li, Y., et al.: Edge-based beaconing schedule in duty-cycled multihop wireless networks. In: Proceedings of INFOCOM (2017)

    Google Scholar 

  31. NetworkX. http://networkx.lanl.gov

Download references

Acknowledgement

This work is partly supported by the National Science Foundation (NSF) under grant NOs. 1252292, 1741277 and 1704287, the National Natural Science Foundation of China (NSFC) under Grant NOs. 61632010, 61502116, 61502110 and the major PSTP of Guangdong 2015B010104005 and 2017A010101017.

Author information

Authors and Affiliations

  1. School of Computers, Guangdong University of Technology, Guangzhou, China

    Quan Chen & Lianglun Cheng

  2. Department of Computer Technology, Harbin Institute of Petroleum, Harbin, China

    Tianbai Le

  3. Department of Computer Science, Georgia State University, Atlanta, USA

    Zhipeng Cai

  4. Department of Computer Science, Harbin Engineering University, Harbin, China

    Zhipeng Cai

  5. School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China

    Hong Gao

Authors
  1. Quan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tianbai Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lianglun Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhipeng Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Quan Chen .

Editor information

Editors and Affiliations

  1. University of South Florida, Tampa, Florida, USA

    Sriram Chellappan

  2. Virginia Commonwealth University, Richmond, Virginia, USA

    Wei Cheng

  3. Georgia State University, Atlanta, Georgia, USA

    Wei Li

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, Q., Le, T., Cheng, L., Cai, Z., Gao, H. (2018). Approximate Minimum-Transmission Broadcasting in Duty-Cycled WSNs. In: Chellappan, S., Cheng, W., Li, W. (eds) Wireless Algorithms, Systems, and Applications. WASA 2018. Lecture Notes in Computer Science(), vol 10874. Springer, Cham. https://doi.org/10.1007/978-3-319-94268-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94268-1_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94267-4

  • Online ISBN: 978-3-319-94268-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation