Algorithmic Aspects of Wireless Sensor Networks

DOI10.1007/B98740zbMATH Open1104.68305OpenAlexW2489302366MaRDI QIDQ5312964FDOQ5312964

Authors: James Aspnes, David Goldenberg, Y. Richard Yang 

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Cited In (30)

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

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)