Optimal relay node placement in delay constrained wireless sensor network design
From MaRDI portal
Recommendations
- On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
- Relay node placement in two-tiered wireless sensor networks with base stations
- Computing and Combinatorics
- A constraint programming approach to the additional relay placement problem in wireless sensor networks
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A strong lower bound for the Node Weighted Steiner Tree Problem
- An SST-based algorithm for the steiner problem in graphs
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
- Approximation schemes for node-weighted geometric Steiner tree problems
- Column Generation
- Design of survivable networks using three- and four-partition facets
- Dioïds and semirings: Links to fuzzy sets and other applications
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- Facets of two Steiner arborescence polyhedra
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- Network flows. Theory, algorithms, and applications.
- Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- On formulations and methods for the hop-constrained minimum spanning tree problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Some generalizations of the steiner problem in graphs
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- Strong lower bounds for the prize collecting Steiner problem in graphs
- The Steiner problem in distributed computing systems
- The Steiner tree problem with hop constraints
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The Steiner tree problem. II: Properties and classes of facets
- The network design problem with relays
- The node-weighted steiner tree problem
- Tighter Bounds for Graph Steiner Tree Approximation
Cited in
(7)- SOFSEM 2006: Theory and Practice of Computer Science
- EQAR: Effective QoS-Aware Relay Node Placement Algorithm for Connecting Disjoint Wireless Sensor Subnetworks
- An adaptive virtual relaying set scheme for loss-and-delay sensitive WSNs
- A constraint programming approach to the additional relay placement problem in wireless sensor networks
- Relay node placement in two-tiered wireless sensor networks with base stations
- Relay Node Placement in Wireless Sensor Networks
- scientific article; zbMATH DE number 5155833 (Why is no real title available?)
This page was built for publication: Optimal relay node placement in delay constrained wireless sensor network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297218)
