A Lagrangean relaxation based sensor deployment algorithm to optimize quality of service for target positioning

No abstract is available for this paper.

• Publication year

  2011

• Venue

  Expert systems with applications

• Publication date

  2011-04-01

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1016/j.eswa.2010.09.015
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Foundations of Algorithms using C++ Pseudocode, Third Edition

  2008cited by this paper
• Identifying Codes and Covering Problems

  2008cited by this paper
• International Conference on Information Fusion ( FUSION ) Sensor Deployment Optimization for Detecting Maneuvering Targets

  2006cited by this paper
• Maximum Lifetime of Sensor Networks with Adjustable Sensing Range

  2006cited by this paper
• Requirements of Quality of Service in Wireless Sensor Network

  2006cited by this paper
• A near-optimal sensor placement algorithm to achieve complete coverage-discrimination in sensor networks

  2005cited by this paper
• QoM and lifetime-constrained random deployment of sensor networks for minimum energy consumption

  2005cited by this paper
• Robust location detection with sensor networks

  2004influential reference
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

  2004cited by this paper
• Foundations of Algorithms Using C++ Pseudocode

  2003cited by this paper
• Sensor placement for effective coverage and surveillance in distributed sensor networks

  2003cited by this paper
• Robust location detection in emergency sensor networks

  2003cited by this paper
• Differentiated surveillance for sensor networks

  2003cited by this paper
• Target localization based on energy considerations in distributed sensor networks

  2003cited by this paper
• Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

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

  2002influential reference
• Identifying and locating-dominating codes: NP-Completeness results for directed graphs

  2002cited by this paper
• Sensor placement for grid coverage under imprecise detections

  2002cited by this paper
• Wireless sensor networks: a survey

  2002cited by this paper
• Location Systems for Ubiquitous Computing

  2001cited by this paper
• Power efficient organization of wireless sensor networks

  2001cited by this paper
• GPS-less low-cost outdoor localization for very small devices

  2000cited by this paper
• On a New Class of Codes for Identifying Vertices in Graphs

  1998cited by this paper
• Foundations of algorithms using C++ pseudocode (2nd ed.)

  1997cited by this paper
• An Applications Oriented Guide to Lagrangian Relaxation

  1985cited by this paper
• The Set-Covering Problem: A New Implicit Enumeration Algorithm

  1977cited by this paper
• Validation of subgradient optimization

  1974cited by this paper
• Lagrangean Relaxation and Its Uses in Integer Programming

  1972cited by this paper

• Optimization Method of RFID Reader Antenna Deployment in Obstacle Environment Based on Improved FA

  2022cites this paper
• Sensor placement determination for range-difference positioning using evolutionary multi-objective optimization

  2016cites this paper
• An improved multi-objective genetic algorithm for heterogeneous coverage RFID network planning

  2016cites this paper
• RFID network planning for wireless manufacturing considering the detection uncertainty

  2015cites this paper