The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems

DOI10.1016/j.tcs.2011.08.040zbMath1227.68016OpenAlexW2043253127MaRDI QIDQ650928

Suprakash Datta, Stuart MacLean

Publication date: 7 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.040

zbMATH Keywords

boundlocalizationwireless sensor networkspositioningrange-freeconnectivity-basedmobile

Mathematics Subject Classification ID

Distributed systems (68M14) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wireless sensor network localization techniques
• On the problem of random flights
• Unit disk graphs
• Unit disk graph recognition is NP-hard
• Location-aided routing (LAR) in mobile ad hoc networks
• Theoretical aspects of connectivity-based multi-hop positioning
• The expected uncertainty of range-free localization protocols in sensor networks
• Basics of Applied Stochastic Processes

This page was built for publication: The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems