Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Wireless Communications
A Theory of Network Localization
IEEE Transactions on Mobile Computing
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Dissecting the routing architecture of self-organizing networks
IEEE Wireless Communications
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Large-Scale Networked Systems: From Anarchy to Geometric Self-structuring
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Error analysis of non-collaborative wireless localization in circular-shaped regions
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sub-area localization: a simple calibration free approach
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
A comprehensive multi-factor analysis on RFID localization capability
Advanced Engineering Informatics
Hi-index | 0.00 |
In topology-based localization, each node in a network computes its hop-count distance to a finite number of reference nodes, or "landmarks". This paper studies the impact of landmark placement on the accuracy of the resulting coordinate systems. The coordinates of each node are given by the hop-count distance to the landmarks. We show analytically that placing landmarks on the boundary of the topology yields more accurate coordinate systems than when landmarks are placed in the interior. Moreover, under some conditions, we show that uniform landmark deployment on the boundary is optimal. This work is also the first empirical study to consider not only uniform, synthetic topologies, but also nonuniform topologies resembling more concrete deployments. Our simulation results show that, in general, if enough landmarks are used, random landmark placement yields comparative performance to placing landmarks on the boundary randomly or equally spaced. This is an important result since boundary placement, especially at equal distances, may turn out to be infeasible and/or prohibitively expensive (in terms of communication, processing overhead, and power consumption) in networks of nodes with limited capabilities.