• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Correlated Flooding in Low-Duty-Cycle Wireless Sensor Networks

Cached

  • Download as a PDF

Download Links

  • [www.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]
  • [www-users.cs.umn.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Shuo Guo , Song Min Kim , Ting Zhu , Yu Gu , Tian He
Citations:10 - 5 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Guo_correlatedflooding,
    author = {Shuo Guo and Song Min Kim and Ting Zhu and Yu Gu and Tian He},
    title = {Correlated Flooding in Low-Duty-Cycle Wireless Sensor Networks},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Abstract—Flooding in low-duty-cycle wireless sensor networks is very costly due to asynchronous schedules of sensor nodes. To adapt existing flooding-tree-based designs for low-duty-cycle networks, we shall schedule nodes of common parents wake up simultaneously. Traditionally, energy optimality in a designated flooding-tree is achieved by selecting parents with the highest link quality. In this work, we demonstrate that surprisingly more energy can be saved by considering link correlation. Specifically, this work first experimentally verifies the existence of link correlation and mathematically proves that the energy consumption of broadcasting can be reduced by letting nodes with higher correlation receive packets simultaneously. A novel flooding scheme, named Correlated Flooding, is then designed so that nodes with high correlation are assigned to a common sender and their receptions of a broadcasting packet are only acknowledged by a single ACK. This unique feature effectively ameliorates the ACK implosion problem, saving energy on both data packets and ACKs. We evaluate Correlated Flooding with extensive simulations and a testbed implementation with 20 MICAz nodes. We show that Correlated Flooding saves more than 66 % energy on ACKs and 15%∼50 % energy on data packets for most network settings, while having similar performance on flooding delay and reliability. I.

Keyphrases

low-duty-cycle wireless sensor network    link correlation    correlated flooding    data packet    energy consumption    designated flooding-tree    ack implosion problem    novel flooding scheme    testbed implementation    asynchronous schedule    energy optimality    unique feature    network setting    low-duty-cycle network    extensive simulation    high correlation    similar performance    link quality    sensor node    common parent    abstract flooding    single ack    common sender    flooding-tree-based design    broadcasting packet    micaz node   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University