Relay placement for fault tolerance in wireless networks in higher dimensions
From MaRDI portal
Publication:632722
DOI10.1016/J.COMGEO.2010.11.002zbMATH Open1208.90038OpenAlexW2025373161MaRDI QIDQ632722FDOQ632722
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
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
Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Internet topics (68M11)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An application of submodular flows
- A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points
- Low-degree minimum spanning trees
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- Relay Node Placement in Wireless Sensor Networks
- A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
- Improved Approximation Algorithms for Uniform Connectivity Problems
- Approximations for Steiner trees with minimum number of Steiner points
- Biconnectivity approximations and graph carvings
- A matroid approach to finding edge connectivity and packing arborescences
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- A weighted matroid intersection algorithm
- Approximating node connectivity problems via set covers
- Computing and Combinatorics
- Transitions in geometric minimum spanning trees
- A 3-Approximation Algorithm for Finding Optimum 4,5-Vertex-Connected Spanning Subgraphs
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)
