This article is
- freely available
Range-Free Localization in Wireless Sensor Networks with Neural Network Ensembles
Department of Computer Science and Engineering, New Mexico Institute of Mining and Technology, 801 Leroy Place, Socorro, NM 87801, USA
* Author to whom correspondence should be addressed.
Received: 19 September 2012; in revised form: 8 November 2012 / Accepted: 15 November 2012 / Published: 28 November 2012
Abstract: In wireless sensor networks (WSNs), the location information of sensor nodes are important for implementing other network applications. In this paper, we propose a range-free Localization algorithm based on Neural Network Ensembles (LNNE). The location of a sensor node is estimated by LNNE solely based on the connectivity information of the WSN. Through simulation study, the performance of LNNE is compared with that of two well-known range-free localization algorithms, Centroid and DV-Hop, and a single neural network based localization algorithm, LSNN. The experimental results demonstrate that LNNE consistently outperforms other three algorithms in localization accuracy. An enhanced mass spring optimization (EMSO) algorithm is also proposed to further improve the performance of LNNE by utilizing the location information of neighboring beacon and unknown nodes.
Keywords: localization; wireless sensor networks; neural network ensembles; mass spring optimization
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Zheng, J.; Dehghani, A. Range-Free Localization in Wireless Sensor Networks with Neural Network Ensembles. J. Sens. Actuator Netw. 2012, 1, 254-271.
Zheng J, Dehghani A. Range-Free Localization in Wireless Sensor Networks with Neural Network Ensembles. Journal of Sensor and Actuator Networks. 2012; 1(3):254-271.
Zheng, Jun; Dehghani, Asghar. 2012. "Range-Free Localization in Wireless Sensor Networks with Neural Network Ensembles." J. Sens. Actuator Netw. 1, no. 3: 254-271.