Mathematical programming techniques for sensor networks
From MaRDI portal
Publication:1662467
DOI10.3390/A2010565zbMATH Open1461.90211OpenAlexW2121880761MaRDI QIDQ1662467FDOQ1662467
Alexey Sorokin, Nikita Boyko, Stan Uryasev, Vladimir 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
Recommendations
- Mathematical theories of distributed sensor networks
- An integer linear programming-based tool for wireless sensor networks
- A mathematical programming approach to the multi-round topology construction problem in wireless sensor networks
- Modelling and solving optimal placement problems in wireless sensor networks
- Sensor network algorithms and applications
- Theory of semidefinite programming for sensor network localization
- Theory of semidefinite programming for sensor network localization
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints
- Optimizing a sensor deployment with network constraints computable by costly requests
Applications of mathematical programming (90C90) Network design and communication in computer systems (68M10)
Cites Work
- The wireless network jamming problem
- An Analysis and Solution of the Sensor Scheduling Problem
- Nonmyopic sensor scheduling and its efficient implementation for target tracking applications
- Theory of semidefinite programming for sensor network localization
- Simulation-based optimal sensor scheduling with application to observer trajectory planning
- Robust multi-sensor scheduling for multi-site surveillance
- Genetic algorithm convergence study for sensor network optimization
- Adaptive design optimization of wireless sensor networks using genetic algorithms
- Robust Wireless Network Jamming Problems
- A survey of application distribution in wireless sensor networks
Cited In (11)
- Maximum lifetime coverage preserving scheduling algorithms in sensor networks
- Global Optimization Approaches to Sensor Placement: Model Versions and Illustrative Results
- Ad hoc networks: optimization problems and solution methods
- Solving radar netting problem with mathematical programming
- A Lagrangean-based heuristics for the target covering problem in wireless sensor network
- Sensor Cover and Double Partition
- Sensor Scheduling for Space Object Tracking and Collision Alert
- Wireless networking, dominating and packing
- Maximum lifetime connected coverage with two active-phase sensors
- Clustering intelligent transportation sensors using public transportation
- Single range aided navigation and source localization: observability and filter design
This page was built for publication: Mathematical programming techniques for sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662467)
