Algorithmic Aspects of Wireless Sensor Networks

From MaRDI portal
Publication:5312964

DOI10.1007/b98740zbMath1104.68305OpenAlexW2489302366MaRDI QIDQ5312964

James Aspnes, Y. Richard Yang, David Goldenberg

Publication date: 25 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b98740



Related Items

A block coordinate descent method for sensor network localization, Sum of squares method for sensor network localization, Probabilistic distributed algorithms for energy efficient routing and tracking in wireless sensor networks, Theory of semidefinite programming for sensor network localization, Approximation accuracy, gradient methods, and error bound for structured convex optimization, On embeddability of unit disk graphs onto straight lines, On stress matrices of \((d + 1)\)-lateration frameworks in general position, A weakly robust PTAS for minimum clique partition in unit disk graphs, Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems, Shifting strategy for geometric graphs without geometry, (Robust) edge-based semidefinite programming relaxation of sensor network localization, Algorithmic Aspects of Sensor Localization, Efficient sensor network design for continuous monitoring of moving objects, High level communication functionalities for wireless sensor networks, A survey on sensor localization, Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints, Euclidean Distance Matrices and Applications, Distributed localization of wireless sensor network using communication wheel, Global Rigidity of Unit Ball Graphs, Selected Open Problems in Discrete Geometry and Optimization, Theoretical aspects of connectivity-based multi-hop positioning