[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

Randomly Duty-cycled Wireless Sensor Networks: Dynamics of Coverage

Published: 01 November 2006 Publication History

Abstract

This paper studies wireless sensor networks that operate in low duty cycles, measured by the percentage of time a sensor is on or active. The dynamic change in topology as a result of such duty-cycling has potentially disruptive effect on the performance of the network. We limit our attention to a class of surveillance and monitoring applications and random duty-cycling schemes, and analyze certain coverage property. Specifically, we consider coverage intensity defined as the probability distribution of durations within which a target or an event is uncovered/unmonitored. We derive this distribution using a semi-Markov model, constructed using the superposition of alternating renewal processes. We also present the asymptotic (as the number of sensors approaches infinity) distribution of the target uncovered duration when at least one sensor is required to cover the target, and provide an asymptotic lower bound when multiple sensors are required to cover the target. The analysis using the semi-Markov model serves as a tool with which we can find suitable random duty-cycling schemes satisfying a given performance requirement. Our numerical observations show that the stochastic variation of duty-cycling durations affects performance only when the number of sensors is small, whereas the stochastic mean of duty-cycling durations impacts performance in all cases studied. We also show that there is a close relationship between coverage intensity and the measure of path availability, defined as the probability distribution of durations within which a path (of a fixed number of nodes) remains available. Thus the results presented here are readily applicable to the study of path availability in a low duty-cycled sensor network

Cited By

View all
  • (2022)Lifetime enhancement through event-based data reporting and transmission in a wireless sensor networkMicrosystem Technologies10.1007/s00542-021-05231-228:2(601-613)Online publication date: 1-Feb-2022
  • (2018)Maximizing throughput for low duty-cycled sensor networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2018.03.017139:C(48-59)Online publication date: 5-Jul-2018
  • (2017)Hyper-geometric energy factor based semi-Markov prediction mechanism for effective cluster head election in WSNsJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-16925432:4(3111-3120)Online publication date: 1-Jan-2017
  • Show More Cited By
  1. Randomly Duty-cycled Wireless Sensor Networks: Dynamics of Coverage

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Wireless Communications
    IEEE Transactions on Wireless Communications  Volume 5, Issue 11
    November 2006
    352 pages

    Publisher

    IEEE Press

    Publication History

    Published: 01 November 2006

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 09 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Lifetime enhancement through event-based data reporting and transmission in a wireless sensor networkMicrosystem Technologies10.1007/s00542-021-05231-228:2(601-613)Online publication date: 1-Feb-2022
    • (2018)Maximizing throughput for low duty-cycled sensor networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2018.03.017139:C(48-59)Online publication date: 5-Jul-2018
    • (2017)Hyper-geometric energy factor based semi-Markov prediction mechanism for effective cluster head election in WSNsJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-16925432:4(3111-3120)Online publication date: 1-Jan-2017
    • (2017)Two chances forwarding in real-time routing for low-duty-cycle sensor networksInternational Journal of Sensor Networks10.1504/IJSNET.2017.08423724:1(14-25)Online publication date: 1-Jan-2017
    • (2016)Cluster-level based link redundancy with network coding in duty cycled relay wireless sensor networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2016.02.00399:C(15-36)Online publication date: 22-Apr-2016
    • (2016)Power saving mechanism with network coding in the bottleneck zone of multimedia sensor networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2015.07.00596:C(58-68)Online publication date: 26-Feb-2016
    • (2015)An efficient cluster head selection approach for collaborative data processing in wireless sensor networksInternational Journal of Distributed Sensor Networks10.1155/2015/7945182015(132-132)Online publication date: 1-Jan-2015
    • (2013)Energy-neutral scheduling and forwarding in environmentally-powered wireless sensor networksAd Hoc Networks10.1016/j.adhoc.2013.01.00511:3(1202-1220)Online publication date: 1-May-2013
    • (2011)Coverage problems in sensor networksACM Computing Surveys10.1145/1978802.197881143:4(1-53)Online publication date: 18-Oct-2011
    • (2009)Optimal sleep/wake scheduling for time-synchronized sensor networks with QoS guaranteesIEEE/ACM Transactions on Networking10.1109/TNET.2008.201045017:5(1508-1521)Online publication date: 1-Oct-2009

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media