A constraint programming approach to the additional relay placement problem in wireless sensor networks

DOI10.1007/s10601-015-9188-8zbMath1329.90153OpenAlexW1997293634MaRDI QIDQ903915

Kenneth N. Brown, Lanny Sitanayah, Cormac J. Sreenan, Barry O'Sullivan, Luis O. Quesada

Publication date: 15 January 2016

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-015-9188-8

zbMATH Keywords

wireless sensor networksrelay placementconstraint optimisation problemnetwork deployment planningnode disjoint paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Uses Software

• QUICKXPLAIN

Cites Work

• Unnamed Item
• Unnamed Item
• Paths of bounded length and their cuts: parameterized complexity and algorithms
• Combining tree partitioning, precedence, and incomparability constraints
• A probabilistic heuristic for a computationally difficult set covering problem
• Mengerian theorems for paths of bounded length
• Greedy randomized adaptive search procedures
• Fault-tolerant wireless sensor network routing protocols for the supervision of context-aware physical environments
• Constrained shortest link-disjoint paths selection: a network programming based approach

This page was built for publication: A constraint programming approach to the additional relay placement problem in wireless sensor networks