Relay placement for fault tolerance in wireless networks in higher dimensions

DOI10.1016/J.COMGEO.2010.11.002MaRDI QIDQ632722zbMATH OpenOpenAlexFDO

Authors Samir Khuller, Abhishek Kumar Kashyap, Mark A. Shayman

Publication date 25 March 2011

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2010.11.002

zbMATH Keywords

fault tolerancenetwork connectivity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Internet topics (68M11)

Recommendations

• Computing and Combinatorics
• Relay placement for two-connectivity
• On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
• Improved approximation algorithms for single-tiered relay placement
• Relay node placement in two-tiered wireless sensor networks with base stations

Cites work

• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
• A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
• A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
• A matroid approach to finding edge connectivity and packing arborescences
• A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
• A weighted matroid intersection algorithm
• An application of submodular flows
• Approximating node connectivity problems via set covers
• Approximations for Steiner trees with minimum number of Steiner points
• Biconnectivity approximations and graph carvings
• Computing and Combinatorics
• Improved Approximation Algorithms for Uniform Connectivity Problems
• Low-degree minimum spanning trees
• Relay Node Placement in Wireless Sensor Networks
• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• Transitions in geometric minimum spanning trees

Cited in

(10)

• Improved approximation algorithms for single-tiered relay placement
• Localized fault tolerant algorithm based on node movement freedom degree in flying ad hoc networks
• Approximating Steiner trees and forests with minimum number of Steiner points
• Approximating Steiner trees and forests with minimum number of Steiner points
• Relay placement for two-connectivity
• Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
• Network connectivity assessment and improvement through relay node deployment
• A constraint programming approach to the additional relay placement problem in wireless sensor networks
• MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks
• Computing and Combinatorics

This page was built for publication: Relay placement for fault tolerance in wireless networks in higher dimensions

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