A new complexity result on minimization of a quadratic function with a sphere constraint
Recent advances in global optimization
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Minimizing a Quadratic Over a Sphere
SIAM Journal on Optimization
Propagation and Leader Election in a Multihop Broadcast Environment
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Robust distributed network localization with noisy range measurements
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
A New Map Stitching Method for Anchor-free Localization in Wireless Sensor Networks
CIT '06 Proceedings of the Sixth IEEE International Conference on Computer and Information Technology
Estimation of the distribution of randomly deployed wireless sensors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Collaborative signal and information processing in wireless sensor networks: a review
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
RSSI-based relative localisation for mobile robots
Ad Hoc Networks
| Hi-index | 0.00 |
Node localization is an essential problem in ad hoc wireless sensor networks. The map stitching is a type of localization algorithm that has received a great deal of attention recently. In this algorithm, the network is divided into small overlapping subregions, each of which creates a local map. Then, the local maps are stitched together to form a single global map. In this paper, we first propose a new technique for map-to-map stitching which exploits every available distances between two maps. Next, we propose a few anchor-free localization algorithms based on our stitching technique. We experimentally studied the performance of our algorithms under various settings. The results show that our method achieves a significant performance improvement upon the existing method.