A location-free algorithm of energy-efficient connected coverage for high density wireless sensor networks

DOI10.1007/S10626-006-0005-9MaRDI QIDQ2643635zbMATH OpenOpenAlexFDO

Authors Hongxing Bai, Xi Chen, Bin Li, Dianfei Han

Publication date 27 August 2007

Published in Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10626-006-0005-9

zbMATH Keywords

ConnectivityCoverageLocation-free algorithmStatic wireless sensor networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• A location-independent connected coverage protocol for wireless sensor networks
• Designing k-coverage schedules in wireless sensor networks
• Cluster based node scheduling method for wireless sensor networks
• DISTRIBUTED ENERGY-EFFICIENT ALGORITHMS FOR COVERAGE PROBLEM IN ADJUSTABLE SENSING RANGES WIRELESS SENSOR NETWORKS
• Energy-efficient sensing coverage and communication for wireless sensor networks

Cites work

• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• Distributed localization in wireless sensor networks: A quantitative comparison.

Cited in

(5)

• Coordinate-free \(k\)-coverage hole detection algorithm in wireless sensor networks
• Energy-efficient sensing coverage and communication for wireless sensor networks
• A Morse index theorem for elliptic operators on bounded domains
• A location-independent connected coverage protocol for wireless sensor networks
• Coverage problem in battery-free sensor networks with multi-level communication radius

This page was built for publication: A location-free algorithm of energy-efficient connected coverage for high density wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643635)