Computational geometry in C (2nd ed.)
Computational geometry in C (2nd ed.)
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Improving APS with Anchor Selection in Anisotropic Sensor Networks
ICAS-ICNS '05 Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services
Distributed direction-based localization in wireless sensor networks
Computer Communications
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
An improved localisation algorithm for performance improvement
International Journal of Mobile Communications
Hi-index | 0.00 |
Position information in sensor networks is crucial for many applications. A large number of localization algorithms have been developed, however, most of them need special measurement tools and could not work well in irregularly shaped sensor networks. In this paper, we present an Enhanced DV-hop Localization Algorithm (EDLA) to deal with irregularly shaped network topology. With the same process of DV-hop, a reference node of EDLA can delimit approximate regular shaped regions as convex hulls. Based on the inclusion test within convex hulls, the expected average per-hop distance information is disseminated by qualified relay nodes and used for position estimation. Simulation results show that the proposed localization method outperforms DV-hop and PDM(proximity-distance map) in irregularly-shaped sensor networks if both the localization error and computational complexity are considered.