Discrete Mathematics - Topics on domination
Unit disk graph recognition is NP-hard
Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Theoretical aspects of connectivity-based multi-hop positioning
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
The expected uncertainty of range-free localization protocols in sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
A Theory of Network Localization
IEEE Transactions on Mobile Computing
Localization in wireless sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Wireless sensor network localization techniques
Computer Networks: The International Journal of Computer and Telecommunications Networking
Monte Carlo localization for mobile wireless sensor networks
Ad Hoc Networks
EUL: An Efficient and Universal Localization Method for Wireless Sensor Network
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Monte Carlo Localization of Mobile Sensor Networks Using the Position Information of Neighbor Nodes
ADHOC-NOW '09 Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks
Location awareness for everyday smart computing
ICT'09 Proceedings of the 16th international conference on Telecommunications
Organizing a global coordinate system from local information on an ad hoc sensor network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Accurate and Energy-Efficient Range-Free Localization for Mobile Sensor Networks
IEEE Transactions on Mobile Computing
A survey on localization for mobile wireless sensor networks
MELT'09 Proceedings of the 2nd international conference on Mobile entity localization and tracking in GPS-less environments
Hi-index | 5.23 |
A very important problem in many wireless ad-hoc networks, including wireless sensor networks, is positioning or the determination of geographical locations of the wireless nodes. Positioning is used both in infrastructural aspects of sensor networks, like geographic routing and topology maintenance, and in applications like wildlife tracking. Connectivity-based positioning algorithms in mobile wireless systems are studied in this work. These algorithms compute node positions based only on the connectivity, i.e. the neighborhood information of each node. Many algorithms have been proposed for positioning in stationary node systems and bounds on positional error of algorithms have been derived. The design and analysis of positioning algorithms for mobile node systems is a more challenging problem. Node mobility increases the amount of positional information available to a positioning algorithm. The work in this paper establishes a bound on the positional error for connectivity-based algorithms in mobile systems. The formulation from the analysis is used to investigate the benefit of this additional positional information on reducing positional error. There is a limit to the usefulness of positional information from previous node positions due to movement. This captures an important performance tradeoff: historical positional information can yield reduced positional error but requires more connectivity information from the network which requires greater computational resources.