Wireless Sensor Network Localization using Hexagonal Intersection

摘要

Device localization or positioning is a key issue in wireless sensor networks applications. One solution widely used to estimate the position of a node in the network consists in using the intersection of coverage areas. For the sake of simplicity, these areas have traditionally been modeled by rectangles, assuming some extra inaccuracy. In this paper we propose a localization algorithm based on hexagonal intersection. Results show that the only substitution of the geometric shape provides better results in the localization of the devices composing the network.