| Summary: | 碩士 === 元智大學 === 資訊工程學系 === 96 === Wireless sensor networks (WSNs) are widely used in different kinds of applications, e.g. Target tracking, environment monitoring. One of important research issues in the WSNs is Localization of the nodes. By providing sufficient node information, applications can be more efficiency in computation and minimize power consumption. As a result, several localization algorithms have been proposed to find accurate location information. A novel localization algorithm called DIstributed localization algorithm (DIL) is proposed in this paper. The DIL algorithm estimates the location information of the normal nodes with help of few beacon nodes and angle information of the anchor nodes. Our localization scheme can be used less than three beacon nodes to and location information of any normal node in a distributed manner. Besides, we give the theoretical basis for determining the localization error using probability distribution function. Our performance analysis shows that there is a tradeoff between deployed number of beacon nodes and localization error and average localization time of the network can be increased with deployed number of normal nodes. Besides, we also make comparison with other two algorithms, approximate point in triangular (APIT) algorithm and Concentric Anchor Beacon (CAB) localization algorithm. Experiment results shows that we obtained more accurate localization result then other two algorithms.
|
|---|
