A distributed algorithmic framework for coverage problems in wireless sensor networks
From MaRDI portal
Publication:3399239
DOI10.1080/17445760902720008zbMATH Open1186.68018OpenAlexW2138515457MaRDI QIDQ3399239FDOQ3399239
Akshaye Dhawan, Sushil K. Prasad
Publication date: 29 September 2009
Published in: International Journal of Parallel, Emergent and Distributed Systems (Search for Journal in Brave)
Full work available at URL: https://digitalcommons.ursinus.edu/math_comp_fac/2
Recommendations
- Distributed algorithms for dynamic coverage in sensor networks
- Distributed Sensor Coordination Algorithms for Efficient Coverage in a Network of Heterogeneous Mobile Sensors
- DISTRIBUTED ENERGY-EFFICIENT ALGORITHMS FOR COVERAGE PROBLEM IN ADJUSTABLE SENSING RANGES WIRELESS SENSOR NETWORKS
- Coverage problems in sensor networks: a survey
- On the Cover Scheduling Problem in Wireless Sensor Networks
- scientific article; zbMATH DE number 5040104
- Distributed computation of coverage in sensor networks by homological methods
distributed algorithmsenergy efficiencyschedulingwireless sensor networksmaximum lifetimelocalised algorithms
Cites Work
Cited In (5)
- A novel gossip-based sensing coverage algorithm for dense wireless sensor networks
- Coverage problems in sensor networks: a survey
- Average case network lifetime on an interval with adjustable sensing ranges
- Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
- On the Cover Scheduling Problem in Wireless Sensor Networks
This page was built for publication: A distributed algorithmic framework for coverage problems in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399239)
