Mathematical programming techniques for sensor networks
From MaRDI portal
Publication:1662467
DOI10.3390/a2010565zbMath1461.90211OpenAlexW2121880761MaRDI QIDQ1662467
Alexey Sorokin, Nikita Boyko, Stan Uryasev, Vladimir L. Boginski, Panos M. Pardalos
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a2010565
Applications of mathematical programming (90C90) Network design and communication in computer systems (68M10)
Related Items (9)
Maximum lifetime connected coverage with two active-phase sensors ⋮ Sensor Scheduling for Space Object Tracking and Collision Alert ⋮ Single range aided navigation and source localization: observability and filter design ⋮ Wireless networking, dominating and packing ⋮ Maximum lifetime coverage preserving scheduling algorithms in sensor networks ⋮ Clustering intelligent transportation sensors using public transportation ⋮ A Lagrangean-based heuristics for the target covering problem in wireless sensor network ⋮ Sensor Cover and Double Partition ⋮ Global Optimization Approaches to Sensor Placement: Model Versions and Illustrative Results
Cites Work
- Robust multi-sensor scheduling for multi-site surveillance
- Adaptive design optimization of wireless sensor networks using genetic algorithms
- Theory of semidefinite programming for sensor network localization
- Simulation-based optimal sensor scheduling with application to observer trajectory planning
- The wireless network jamming problem
- Nonmyopic sensor scheduling and its efficient implementation for target tracking applications
- A survey of application distribution in wireless sensor networks
- An Analysis and Solution of the Sensor Scheduling Problem
- Robust Wireless Network Jamming Problems
- Genetic algorithm convergence study for sensor network optimization
This page was built for publication: Mathematical programming techniques for sensor networks
