Mobile wireless sensor network connectivity repair with k-redundancy

DOI10.1007/978-3-642-00312-7_3MaRDI QIDQ3079451zbMATHOpenAlexFDO

Authors Nuzhet Atay, Osman Burçhan Bayazit

Publication date 2 March 2011

Published in Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00312-7_3

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40) Computer system organization (68M99)

Recommendations

• Energy conservation in wireless sensor networks and connectivity of graphs
• Distributed Tree Rearrangements for Reachability and Robust Connectivity
• Decentralized estimation and control of graph connectivity for mobile sensor networks
• Online hole healing for sensor coverage
• Energy efficient connectivity maintenance in wireless sensor networks

Cited in

(5)

• Existence of connected intersection-free subgraphs in graphs with redundancy and coexistence property
• Nature-inspired donkey and smuggler algorithm for optimal data gathering in partitioned wireless sensor networks for restoring network connectivity
• Network connectivity assessment and improvement through relay node deployment
• Analysis of a local search algorithm for the \(k\)-facility location problem
• Enhancing the availability of wireless visual sensor networks: selecting redundant nodes in networks with occlusion

This page was built for publication: Mobile wireless sensor network connectivity repair with \(k\)-redundancy

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