A group mobility model for ad hoc wireless networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
GPS-free Positioning in Mobile Ad Hoc Networks
Cluster Computing
Poster abstract: anchor-free distributed localization in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Approximate Aggregation Techniques for Sensor Databases
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Wireless Sensor Networks: An Information Processing Approach
Wireless Sensor Networks: An Information Processing Approach
Low-dimensional embedding with extra information
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Performance of dead reckoning-based location service for mobile ad hoc networks: Research Articles
Wireless Communications & Mobile Computing
Overview of radiolocation in CDMA cellular systems
IEEE Communications Magazine
Distributed Qualitative Localization for Wireless Sensor Networks
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Centralized mobile SensorGroup for exploring border of target area
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Mobile anchor-free localization for wireless sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Managing cohort movement of mobile sensors via GPS-free and compass-free node localization
Journal of Parallel and Distributed Computing
Minimum cost localization problem in wireless sensor networks
Ad Hoc Networks
GPS-free directional localization via dual wireless radios
Computer Communications
Reducing the number of flips in trilateration with noisy range measurements
Proceedings of the 12th International ACM Workshop on Data Engineering for Wireless and Mobile Acess
Cut-and-sew: a distributed autonomous localization algorithm for 3D surface wireless sensor networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Hi-index | 0.00 |
An important problem in mobile ad-hoc wireless sensor networks is the localization of individual nodes, i.e., each node's awareness of its position relative to the network. In this paper, we introduce a variant of this problem (directional localization) where each node must be aware of both its position and orientation relative to the network. This variant is especially relevant for the applications in which mobile nodes in a sensor network are required to move in a collaborative manner. Using global positioning systems for localization in large scale sensor networks is not cost effective and may be impractical in enclosed spaces. On the other hand, a set of pre-existing anchors with globally known positions may not always be available. To address these issues, in this work we propose an algorithm for directional node localization based on relative motion of neighboring nodes in an ad-hoc sensor network without an infrastructure of global positioning systems (GPS), anchor points, or even mobile seeds with known locations. Through simulation studies, we demonstrate that our algorithm scales well for large numbers of nodes and provides convergent localization over time, even with errors introduced by motion actuators and distance measurements. Furthermore, based on our localization algorithm, we introduce mechanisms to preserve network formation during directed mobility in mobile sensor networks. Our simulations confirm that, in a number of realistic scenarios, our algorithm provides for a mobile sensor network that is stable over time irrespective of speed, while using only constant storage per neighbor.