Sensor Network Deployment under Distance Uncertainty with Robust Optimization

We consider the sensor deployment problem in the context of distance uncertainty. It is characterized by differentiated arrangement of specific detection probability thresholds at different locations. The problem is formulated as an integer linear programming (ILP) model firstly, aiming at optimizing the number of sensors and their locations. Based on the robust discrete optimization methodology, the uncertain model is transformed into an equivalent ILP problem considering distance uncertainty. The proposed approach can control the tradeoff between optimality and robustness by varying the parameters named protection levels. Uniform and non-uniform event detection probabiliy distributions are considered in the experiment. The results show that, as the distance uncertainty increases, the constraint violation can be avoided in the robust model and the robust solution can provide a significant improvement at the expense of a small loss in optimality when compared to the optimal solution of a deterministic scenario.

• Publication year

  2015

• Venue

  International Journal of Online Engineering (iJOE)

• Publication date

  2015-10-29

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.3991/ijoe.v11i9.5061
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• UNCERTAIN PROBABILITIES

  2016cited by this paper
• A practical guide to robust optimization

  2015cited by this paper
• On Robust Optimization

  2015cited by this paper
• A Survey of Coverage Problems in Wireless Sensor Networks

  2014cited by this paper
• Throughput of the Magnetic Induction Based Wireless Underground Sensor Networks: Key Optimization Techniques

  2014cited by this paper
• Recent advances in robust optimization: An overview

  2014cited by this paper
• Classification of Wireless Sensor Networks Deployment Techniques

  2014cited by this paper
• Deriving robust counterparts of nonlinear uncertain inequalities

  2014cited by this paper
• Quantifying connectivity in wireless sensor networks with grid-based deployments

  2013cited by this paper
• Robust Solutions of Optimization Problems Affected by Uncertain Probabilities

  2013cited by this paper
• Connectivity constrained wireless sensor deployment using multiobjective evolutionary algorithms and fuzzy decision making

  2012cited by this paper
• Efficient uncertainty-aware deployment algorithms for wireless sensor networks

  2012cited by this paper
• Nodes self-deployment for coverage maximization in mobile robot networks using an evolving neural network

  2012cited by this paper
• Artificial potential field approach in WSN deployment: Cost, QoM, connectivity, and lifetime constraints

  2011cited by this paper
• Best and worst-case coverage problems for arbitrary paths in wireless sensor networks

  2010cited by this paper
• Theory and Applications of Robust Optimization

  2010cited by this paper
• Coverage Control in Sensor Networks

  2010cited by this paper
• Introduction to Stochastic Programming

  2009cited by this paper
• Robust Optimization Models for Energy-Limited Wireless Sensor Networks under Distance Uncertainty

  2008influential reference
• Deployment Strategies for Differentiated Detection in Wireless Sensor Networks

  2006cited by this paper
• Uncertainty-aware and coverage-oriented deployment for sensor networks

  2004influential reference
• Robust discrete optimization and network flows

  2003influential reference
• Sensor placement for effective coverage and surveillance in distributed sensor networks

  2003cited by this paper
• Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

  2002cited by this paper
• Technical Note - Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

  1973cited by this paper

• No citing papers are available for this paper.