skip to main content
10.1145/2448556.2448659acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

On minimizing the broadcast redundancy in duty-cycled wireless sensor networks

Published: 17 January 2013 Publication History

Abstract

Broadcast is a fundamental activity in wireless sensor networks (WSNs) and many problems related to broadcast thus have been formulated and investigated in the literature. Among them, the minimum-transmission broadcast (MTB) problem, which aims to reduce the broadcast redundancy, has been well studied in conventional wireless ad hoc networks, where network nodes are assumed to be active all the time. In this paper, we study MTB problem in duty-cycled WSNs (MTB-DC problem) where sensor nodes operate under active/dormant cycles; then propose a novel scheme to solve it. The proposed Level-Based Approximation Scheme (LBAS) first identifies the minimum sets of forwarding nodes for all time slots. Then the broadcast backbone is constructed efficiently through a two-stage traversal which completely exploits duty transmission of forwarding nodes when connecting them to the broadcast source. We have also conducted extensive simulations to evaluate the performance of our proposed scheme. The results indicate that our scheme outperforms existing ones significantly.

References

[1]
B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Math., 86(1--3): 165--177, 1990.
[2]
Y. Duan, S. Ji, and Z. Cai. Generalized broadcast scheduling in duty-cycle multi-hop wireless networks. In Proc. of IEEE IPCCC, 2011.
[3]
S. Guo, Y. Gu, B. Jiang, and T. He. Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links. In Proc. ACM MobiCom, 2009.
[4]
J. Hong, J. Cao, W. Li, S. Lu, and D. Chen. Minimum-transmission broadcast in uncoordinated duty-cycled wireless ad hoc networks. IEEE Trans. Veh. Technol., 59(1): 307--318, January 2010.
[5]
X. Jiao, W. Lou, J. Ma, J. Cao, X. Wang, and X. Zhou. Minimum latency broadcast scheduling in duty-cycled multihop wireless networks. IEEE Trans. Parallel Distrib. Syst., 23(1): 110--117, January 2012.
[6]
H. Lim and C. Kim. Flooding in wireless networks. J. Computer Communications, 24(3--4): 353--363, February 2012.
[7]
W. Lou and J. Wu. On reducing broadcast redundancy in ad hoc wireless networks. IEEE Trans. Mobile Comput., 1(2): 111--123, April-June 2002.
[8]
W. Lou and J. Wu. A cluster-based backbone infrastructure for broadcasting in MANETs. In Proc. of IPDPS, 2003.
[9]
M. Miller, C. Sengul, and I. Gupta. Exploring the energy-latency tradeoff for broadcasts in energy-saving sensor networks. In Proc. of IEEE ICDCS, 2005.
[10]
A. Qayyum, L. Viennot, and A. Laouiti. Multipoint relaying for flooding broadcast message in mobile wireless networks. In Proc. of IEEE HICSS, 2002.
[11]
T. van Dam and K. Langendoen. An adaptive energy-efficient mac protocol for wireless sensor networks. In Proc. of ACM SenSys, 2003.
[12]
F. Wang and J. Liu. On reliable broadcast in low duty-cycle wireless sensor networks. IEEE Trans. Mobile Comput., 11(5): 767--779, May 2012.
[13]
J. Wu and W. Lou. Forward-node-set-based broadcast in clustered mobile ad hoc networks. Wirel. Commun. Mob. Comput., 3(2): 155--173, 2003.
[14]
J. Wu, W. Lou, and F. Dai. Extended multipoint relays to determine connected dominating sets in MANETs. IEEE Trans. Comput., 55(3): 334--347, March 2006.
[15]
W. Ye, J. Heidemann, and D. Estrin. An energy-efficient MAC protocol for wireless sensor networks. In Proc. of IEEE INFOCOM, 2002.

Cited By

View all

Index Terms

  1. On minimizing the broadcast redundancy in duty-cycled wireless sensor networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      ICUIMC '13: Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
      January 2013
      772 pages
      ISBN:9781450319584
      DOI:10.1145/2448556
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 17 January 2013

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. approximation algorithm
      2. broadcast
      3. duty cycle
      4. level based approach
      5. scheduling
      6. wireless sensor network

      Qualifiers

      • Research-article

      Conference

      ICUIMC '13
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 251 of 941 submissions, 27%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 08 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media