A constraint programming approach to the additional relay placement problem in wireless sensor networks
From MaRDI portal
Recommendations
- Computing and Combinatorics
- On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
- SOFSEM 2006: Theory and Practice of Computer Science
- Optimal relay node placement in delay constrained wireless sensor network design
- Relay placement for fault tolerance in wireless networks in higher dimensions
Cites work
- A probabilistic heuristic for a computationally difficult set covering problem
- Combining tree partitioning, precedence, and incomparability constraints
- Constrained shortest link-disjoint paths selection: a network programming based approach
- Fault-tolerant wireless sensor network routing protocols for the supervision of context-aware physical environments
- Greedy randomized adaptive search procedures
- scientific article; zbMATH DE number 2050708 (Why is no real title available?)
- Introduction to algorithms
- Mengerian theorems for paths of bounded length
- Paths of bounded length and their cuts: parameterized complexity and algorithms
Cited in
(3)- Optimal relay node placement in delay constrained wireless sensor network design
- A conditional multi-copy strategy with multiple central nodes for more secure wireless sensor networks
- MILP, pseudo-Boolean, and OMT solvers for optimal fault-tolerant placements of relay nodes in mission critical wireless networks
This page was built for publication: A constraint programming approach to the additional relay placement problem in wireless sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903915)
