Algorithmic Aspects of Wireless Sensor Networks
From MaRDI portal
Publication:5312964
Recommendations
- Theory of semidefinite programming for sensor network localization
- Theory of semidefinite programming for sensor network localization
- Sequential localization of sensor networks
- Geometric buildup algorithms for sensor network localization
- Efficient algorithms for network localization using cores of underlying graphs
Cited in
(30)- SOFSEM 2006: Theory and Practice of Computer Science
- Sequential localization of sensor networks
- Sum of squares method for sensor network localization
- High level communication functionalities for wireless sensor networks
- On stress matrices of \((d + 1)\)-lateration frameworks in general position
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Euclidean distance matrices and applications
- Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks
- An impossible combinatorial counting method in distance geometry
- Reconstruction of random geometric graphs: breaking the \(\varOmega (r)\) distortion barrier
- A block coordinate descent method for sensor network localization
- Canonical duality-triality theory: unified understanding for modeling, problems, and NP-hardness in global optimization of multi-scale systems
- Selected open problems in discrete geometry and optimization
- On embeddability of unit disk graphs onto straight lines
- A weakly robust PTAS for minimum clique partition in unit disk graphs
- Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks
- Theoretical aspects of connectivity-based multi-hop positioning
- A survey on sensor localization
- Algorithmic aspects of sensor localization
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- Numerical Estimation of the Impact of Interferences on the Localization Problem in Sensor Networks
- Global Rigidity of Unit Ball Graphs
- A framework for probabilistic numerical evaluation of sensor networks
- Shifting strategy for geometric graphs without geometry
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Centdian Computation for Sensor Networks
- Distributed localization of wireless sensor network using communication wheel
- Computational complexity analysis of the sensor location flow observability problem
- Theory of semidefinite programming for sensor network localization
- Efficient sensor network design for continuous monitoring of moving objects
This page was built for publication: Algorithmic Aspects of Wireless Sensor Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312964)