The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems
DOI10.1016/J.TCS.2011.08.040zbMATH Open1227.68016OpenAlexW2043253127MaRDI QIDQ650928FDOQ650928
Authors: Stuart MacLean, Suprakash Datta 
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
Recommendations
- Theoretical aspects of connectivity-based multi-hop positioning
- Distributed localization in wireless sensor networks: A quantitative comparison.
- An efficient range-free localization algorithm for wireless sensor networks
- Localization in Wireless Networks
- Wireless sensor network localization techniques
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Distributed systems (68M14)
Cites Work
- Unit disk graphs
- Unit disk graph recognition is NP-hard
- Title not available (Why is that?)
- Wireless sensor network localization techniques
- Basics of Applied Stochastic Processes
- Title not available (Why is that?)
- The expected uncertainty of range-free localization protocols in sensor networks
- Title not available (Why is that?)
- Location-aided routing (LAR) in mobile ad hoc networks
- On the problem of random flights
- Theoretical aspects of connectivity-based multi-hop positioning
Cited In (4)
This page was built for publication: The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650928)
