Abstract
Recent years have seen the deployments of wireless sensor networks (WSNs) in a variety of applications to gather the information about physical environments. A key requirement of many data-gathering WSNs is to deliver the information about dynamic physical phenomena to users at multiple temporal resolutions. In this paper, we propose a novel solution called the <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Minimum</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Incremental</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Dissemination</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Tree</i> (MIDT) for dynamic multiresolution data dissemination in WSNs. MIDT includes an online tree construction algorithm with an analytical performance bound and two lightweight tree adaptation heuristics for handling data requests with dynamic temporal resolutions. Our simulations based on realistic settings of Mica2 motes show that MIDT outperforms several typical data dissemination schemes. The two tree adaptation heuristics can effectively maintain desirable energy efficiency of the dissemination tree while reducing the overhead of tree reconfigurations under representative traffic patterns in WSNs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
