Algorithmic Aspects of Wireless Sensor Networks

DOI10.1007/B98740MaRDI QIDQ5312964zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

(31)

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

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)