Optimal relay node placement in delay constrained wireless sensor network design

DOI10.1016/J.EJOR.2013.08.031zbMATH Open1339.90200OpenAlexW2001295286MaRDI QIDQ297218FDOQ297218

Authors: Ashutosh Nigam, Y. K. Agarwal 

Publication date: 24 June 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.031

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

zbMATH Keywords

projectionbranch and cutcutting plane/facetLagrangian-relaxationpolyhedral theoryrelay node placement

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Cites Work

• Network flows. Theory, algorithms, and applications.
• A Linear Programming Approach to the Cutting-Stock Problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• Strong lower bounds for the prize collecting Steiner problem in graphs
• Dioïds and semirings: Links to fuzzy sets and other applications
• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• Title not available (Why is that?)
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Tighter Bounds for Graph Steiner Tree Approximation
• Some generalizations of the steiner problem in graphs
• Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• Column Generation
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Facets of two Steiner arborescence polyhedra
• The Steiner tree problem with hop constraints
• The Steiner problem in distributed computing systems
• The Steiner tree problem. II: Properties and classes of facets
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• Approximation schemes for node-weighted geometric Steiner tree problems
• 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
• Analysis of Preflow Push Algorithms for Maximum Network Flow
• Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
• The node-weighted steiner tree problem
• An SST-based algorithm for the steiner problem in graphs
• A strong lower bound for the Node Weighted Steiner Tree Problem
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
• On formulations and methods for the hop-constrained minimum spanning tree problem
• Design of survivable networks using three- and four-partition facets
• The network design problem with relays

Cited In (7)

• Title not available (Why is that?)
• EQAR: Effective QoS-Aware Relay Node Placement Algorithm for Connecting Disjoint Wireless Sensor Subnetworks
• SOFSEM 2006: Theory and Practice of Computer Science
• 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
• An adaptive virtual relaying set scheme for loss-and-delay sensitive WSNs
• Relay Node Placement in Wireless Sensor Networks

Uses Software

• CPLEX

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)