Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1023720.1023735acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
Article

On k-coverage in a mostly sleeping sensor network

Published: 26 September 2004 Publication History
  • Get Citation Alerts
  • Abstract

    Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their lifetime. On the other hand, surveillance kind of applications require guaranteed k-coverage of the protected region at all times. As a result, determining the appropriate number of sensors to deploy that achieves both goals simultaneously becomes a challenging problem. In this paper, we consider three kinds of deployments for a sensor network on a unit square - a √n x √n grid, random uniform (for all n points), and Poisson (with density n). In all three deployments, each sensor is active with probability p, independently from the others. Then, we claim that the critical value of the function npπr2/log(np) is 1 for the event of k-coverage of every point. We also provide an upper bound on the window of this phase transition. Although the conditions for the three deployments are similar, we obtain sharper bounds for the random deployments than the grid deployment, which occurs due to the boundary condition. In this paper, we also provide corrections to previously published results for the grid deployment model. Finally, we use simulation to show the usefulness of our analysis in real deployment scenarios.

    References

    [1]
    N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley & Sons, 2000.]]
    [2]
    A. Arora and et al. Line in the sand: A wireless sensor network for target detection, classification, and tracking. Technical report, OSU-CISRC-12/03-TR71, Ohio State University, 2003.]]
    [3]
    C. Bettstetter. On the Minimum Node Degree and Connectivity of a Wireless Multihop Network. In Proceedings of ACM MobiHoc, pages 80--91, Lausanne Switzerland, 2002.]]
    [4]
    B. Bollobas. Random Graphs. Cambridge University Press, 2001.]]
    [5]
    Crossbow. Power management and batteries. Application Notes, Available at http://www.xbow.com/Support/appnotes.htm, 2004.]]
    [6]
    J. Elson, L. Girod, and D. Estrin. Fine-grained network time synchronization using reference broadcasts. In Proceedings of the Fifth Symposium on Operating System Design and Implementation (OSDI), pages 147--163, Boston, MA, 2002.]]
    [7]
    S. Ganeriwal, R. Kumar, and M. B. Srivastava. Timing-sync protocol for sensor networks. In ACM Sensys, pages 138--149, Los Angeles, CA, 2003.]]
    [8]
    P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. In IEEE 37th Conference on Decision and Control, pages 1106--1110, Tampa, FL, 1998.]]
    [9]
    D. L. Hall and J. Llinas. Handbook of Multisensor Data Fusion. CRC Press, 2001.]]
    [10]
    P. Hall. Introduction to the Theory of Coverage Processes. John Wiley & Sons, 1988.]]
    [11]
    T. He and et al. Energy-efficient surveillance system using wireless sensor networks. In Proceedings of ACM Mobisys, Boston, MA, 2004.]]
    [12]
    M. Horton, D. E. Culler, K. Pister, J. Hill, R. Szewczyk, and A. Woo. The commercialization of microsensor motes, In Sensors, volume 19, no. 4, pages 40--48, April 2002.]]
    [13]
    C. Huang and Y. Tseng. The coverage problem in a wireless sensor network. In Proceedings of WSNA, pages 115--121, San Diego, CA, 2003.]]
    [14]
    J. Hui, Z. Ren, and B. H. Krogh. Sentry-based power management in wireless sensor networks. In Proceedings of IPSN, pages 458--472, Palo Alto, CA, 2003.]]
    [15]
    X. Li, P. Wan, Y. Wang and C. Yi. Fault Tolerant Deployment and Topology Control in Wireless Networks. In Proceedings of ACM MobiHoc, pages 117--128, Annapolis, MD, 2003.]]
    [16]
    R. Meester and R. Roy. Continuum Percolation. Cambridge University Press, 1996.]]
    [17]
    S. M. Ross. Introduction to Probability Models. Academic Press, 2000.]]
    [18]
    S. Shakkottai, R. Srikant, and N. B. Shroff. Unreliable sensor grids: Coverage, connectivity and diameter. In Proceedings of IEEE INFOCOM, volume 2, pages 1073--1083, San Francisco, CA, 2003.]]
    [19]
    R. Szewczyk, J. Polastre, A. M. Mainwaring, and D. E. Culler. Lessons from a sensor network expedition. In EWSN, Berlin, Germany, 2004.]]
    [20]
    X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill. Integrated coverage and connectivity configuration in wireless sensor networks. In Proceedings of ACM Sensys, pages 28--39, Los Angeles, CA, 2003.]]
    [21]
    H. Zhang and J. Hou. On deriving the upper bound of α-lifetime for large sensor networks. In Proceedings of ACM MobiHoc, pages 121--132, Tokyo, Japan, 2004.]]
    [22]
    J. Zhao and R. Govindan. Understanding packet delivery performance in dense wireless sensor networks. In Proceedings of ACM Sensys, pages 1-13, Los Angeles, CA, 2003.]]

    Cited By

    View all
    • (2024)Barrier Penetration Routing Against Wireless Spy SensorsIEEE Transactions on Mobile Computing10.1109/TMC.2023.3294415(1-14)Online publication date: 2024
    • (2024)A Purpose-Oriented 3-D Voronoi Algorithm for Deployment of a Multitype Sensor Network in Complex 3-D Indoor Environments in Support of the Mobility of People With Motor DisabilitiesIEEE Transactions on Instrumentation and Measurement10.1109/TIM.2024.339808773(1-13)Online publication date: 2024
    • (2023)A Computational Geometry-based Approach for Planar k-Coverage in Wireless Sensor NetworksACM Transactions on Sensor Networks10.1145/356427219:2(1-42)Online publication date: 3-Feb-2023
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    MobiCom '04: Proceedings of the 10th annual international conference on Mobile computing and networking
    September 2004
    384 pages
    ISBN:1581138687
    DOI:10.1145/1023720
    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: 26 September 2004

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. connectivity
    2. coverage
    3. deterministic deployment
    4. power management
    5. random deployment
    6. sensor network

    Qualifiers

    • Article

    Conference

    MobiCom04
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 440 of 2,972 submissions, 15%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)42
    • Downloads (Last 6 weeks)5
    Reflects downloads up to 11 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Barrier Penetration Routing Against Wireless Spy SensorsIEEE Transactions on Mobile Computing10.1109/TMC.2023.3294415(1-14)Online publication date: 2024
    • (2024)A Purpose-Oriented 3-D Voronoi Algorithm for Deployment of a Multitype Sensor Network in Complex 3-D Indoor Environments in Support of the Mobility of People With Motor DisabilitiesIEEE Transactions on Instrumentation and Measurement10.1109/TIM.2024.339808773(1-13)Online publication date: 2024
    • (2023)A Computational Geometry-based Approach for Planar k-Coverage in Wireless Sensor NetworksACM Transactions on Sensor Networks10.1145/356427219:2(1-42)Online publication date: 3-Feb-2023
    • (2023)An Optimized Radar Sensors Schedule Using Genetic Algorithms2023 International Telecommunications Conference (ITC-Egypt)10.1109/ITC-Egypt58155.2023.10206163(79-82)Online publication date: 18-Jul-2023
    • (2023)Maximum Double Coverage by Wireless Sensor Network with Fixed Number of Sensors2023 13th International Conference on Dependable Systems, Services and Technologies (DESSERT)10.1109/DESSERT61349.2023.10416468(1-7)Online publication date: 13-Oct-2023
    • (2022)Collaborative Sensing in Internet of Things: A Comprehensive SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2022.318713824:3(1435-1474)Online publication date: Nov-2023
    • (2022)Distributed Multilevel k-Coverage Energy-Efficient Fault-Tolerant Scheduling for Wireless Sensor NetworksWireless Personal Communications10.1007/s11277-022-09495-3124:4(2893-2922)Online publication date: 22-Jan-2022
    • (2021)Dual sensing scheduling algorithm for WSN based road network surveillanceAIMS Electronics and Electrical Engineering10.3934/electreng.20210035:1(38-54)Online publication date: 2021
    • (2021)Optimization of a k-covering of a bounded set with circles of two given radiiOpen Computer Science10.1515/comp-2020-021911:1(232-240)Online publication date: 29-Jan-2021
    • (2021)An Approximation Algorithm for General Energy Restricted Sweep Coverage ProblemTheoretical Computer Science10.1016/j.tcs.2021.02.028Online publication date: Mar-2021
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media