Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs

DOI10.1007/978-3-642-30642-6_12MaRDI QIDQ2907493zbMATH OpenOpenAlexFDO

Authors Stefan Dobrev, Oscar Morales-Ponce, Milan Plžík, Evangelos Kranakis

Publication date 10 September 2012

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30642-6_12

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Sensor graphs for guaranteed cooperative localization performance
• Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks
• Universal Rigidity and Edge Sparsification for Sensor Network Localization
• scientific article; zbMATH DE number 5961780
• Strategic sensor placement on graphs
• Graph Drawing
• Distributed Graph Layout for Sensor Networks
• Sensor network localization, Euclidean distance matrix completions, and graph realization
• Application of vertex subset degree preserving spanning trees in sensor networks

Cited in

(9)

• Euclidean bottleneck bounded-degree spanning tree ratios
• Bounded-angle minimum spanning trees
• Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
• Strong connectivity in sensor networks with given number of directional antennae of bounded angle
• Strongly connected spanning subgraph for almost symmetric networks
• Strong orientations of planar graphs with bounded stretch factor
• Connectivity with directional antennas in the symmetric communication model
• Approximating average bounded-angle minimum spanning trees
• Strong connectivity of sensor networks with double antennae

This page was built for publication: Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs

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