A Computational Geometry Framework for Efficient Network Localization

DOI10.1109/TIT.2017.2674679zbMATH Open1390.94959MaRDI QIDQ4566705FDOQ4566705

Yuan Shen, Wenhan Dai, Moe Z. Win

Publication date: 27 June 2018

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Cited In (2)

• Communication and location discovery in geometric ring networks
• Efficient algorithms for network localization using cores of underlying graphs

   Recommendations

• Efficient algorithms for network localization using cores of underlying graphs 👍 👎
• Geometric buildup algorithms for sensor network localization 👍 👎
• Title not available (Why is that?) 👍 👎
• A Diffusion Approach to Network Localization 👍 👎
• Geometric algorithms for sensor networks 👍 👎
• Title not available (Why is that?) 👍 👎
• An Axiomatic Approach to Location on Networks 👍 👎
• Distributed localization in dynamic networks via complex Laplacian 👍 👎

This page was built for publication: A Computational Geometry Framework for Efficient Network Localization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566705)