Improvement of range-free localization technology by a novel DV-hop protocol in wireless sensor networks

International audienceLocalization is a fundamental issue for many applications in wireless sensor networks. Without the need of additional ranging devices, the range-free localization technology is a cost-effective solution for low-cost indoor and outdoor wireless sensor networks. Among range-free algorithms, DV-hop (Distance Vector - hop) has the advantage to localize the mobile nodes which has less than three neighbour anchors. Based on the original DV-hop algorithm, this paper presents two improved algorithms (Checkout DV-hop and Selective 3-Anchor DV-hop). Checkout DV-hop algorithm estimates the mobile node position by using the nearest anchor, while Selective 3-Anchor DV-hop algorithm chooses the best 3 anchors to improve localization accuracy. Then, in order to implement these DV-hop based algorithms in network scenarios, a novel DV-hop localization protocol is proposed. This new protocol is presented in detail in this paper, including the format of data payloads, the improved collision reduction method E-CSMA/CA, as well as parameters used in deciding the end of each DV-hop step. Finally, using our localization protocol, we investigate the performance of typical DV-hop based algorithms in terms of localization accuracy, mobility, synchronization and overhead. Simulation results prove that Selective 3-Anchor DV-hop algorithm offers the best performance compared to Checkout DV-hop and the original DV-hop algorithm

Performance Evaluation of DV-HOP and Amorphous Algorithms based on Localization Schemes in Wireless Sensor Networks

In the field of high-risk observation, the nodes in Wireless Sensor Network (WSN) are distributed randomly. The result from sensing becomes meaningless if it is not known from where the originating node is. Therefore, a sensor node positioning scheme, known as the localization scheme, is required. The localization scheme consists of distance estimation and position computing. Thus, this research used connectivity as distance estimation within range free algorithm DV-Hop and Amorphous, and then trilateral algorithm for computing the position. Besides that, distance estimation using the connectivity between nodes is not needed for the additional hardware ranging as required by a range-based localization scheme. In this research compared the localization algorithm based on range free localization, which are DV-Hop algorithm and Amorphous algorithm. The simulation result shows that the amorphous algorithm have achieved 13.60% and 24.538% lower than dv-hop algorithm for each parameter error localization and energy consumption. On node density variations, dv-hop algorithm gained a localization error that is 26.95% lower than amorphous algorithm, but for energy consumption parameter, amorphous gained 14.227% lower than dv-hop algorithm. In the communication range variation scenario, dv-hop algorithm gained a localization error that is50.282% lower than amorphous. However, for energy consumption parameter, amorphous algorithm gained 12.35%. lower than dv-hop algorithm

Enhanced DV-Hop Algorithm for Energy Efficiency and Network Quality in Wireless Sensor Networks

Wireless Sensor Networks (WSN) are wireless networks with many sensor nodes covering a relatively large area. One of the weaknesses of WSN is the use of relatively high energy consumption, which affects the quality of network services. Although the WSN network routing using the DV-Hop algorithm is widely used because of its simplicity, improvements need to be made to improve energy efficiency so that the network lifetime is more optimal. This article proposes an enhanced DV-Hop algorithm compared to other algorithms to improve network energy efficiency and quality of service. There are three approaches to improving the DV-Hop algorithm. First, the selection of the CH node is based on the distance to the Base Station so that the selected CH node does not have a long distance from the base station. Second, the selection of CH nodes must have a number of neighbouring nodes above the average of other sensor nodes. Finally, each selected CH node calculates the minimum distance to the previously selected CH node to ensure that the selected CH nodes are not adjacent to each other. The proposed approach obtains better total data packets sent to the base station, energy efficiency, and network age using Matlab simulation software by comparing the enhanced DV-Hop algorithm with the original DV-Hop algorithm and three other routing algorithms

Novel DV-hop Method Based on Krill Swarm Algorithm Used for Wireless Sensor Network Localization

Wireless sensor network (WSN) is self-organizing network; it consists of a large number of sensor nodes with perception, calculation ability and communication ability. As we all know, the floor, walls or people moving has an effect on indoor localization, so it will result in multi-path phenomena and decrease signal strength, also the received signal strength indicator (RSSI) is unable to gain higher accuracy of positioning. When using multilateral measurement method to calculate the unknown node coordinates, it will generate big error in range-free distance vector-hop (DV-hop) localization algorithm of WSN. In order to improve the WSN positioning accuracy in indoor condition, more reasonable distribute network resources, in this paper, we firstly propose krill swarm algorithm used for WSN localization. First, we detailed analyze the multilateral measurement method in DV-hop localization algorithm. The position problem can be transformed into a global optimization problem. Then, we adequately utilize the advantage of calculating optimization problem. We apply the krill swarm algorithm into the stage of estimating unknown node coordinates in DV-hop algorithm to realize localization. Finally, the simulation experience results show that the localization with krill swarm algorithm has an obviously higher positioning precision and accuracy stability with different anchor node proportion and nodes. We also make comparison with DV-hop algorithm and the newest localization algorithm

Localization Research on Fruit Fly Optimization Algorithm-based Wireless Sensor Network

On the basis of conventional DV-Hop algorithm, Fruit fly Optimization Algorithm (FOA) is applied to improving its disadvantages. Simulation result shows that the average localization error and localization coverage of FOA are better than that of DV-Hop algorithm. Besides being less than that of DV-Hop, Fruit fly's average localization error tends to decrease as the number of nodes increase

ANALISIS PERBANDINGAN PERFORMANSI ALGORITMA DV-HOP DAN AMORPHOUS UNTUK SKEMA LOKALISASI PADA JARINGAN SENSOR NIRKABEL

ABSTRAK Dengan perkembangan yang begitu pesat khususnya di bidang teknologi informasi. Dibutuhkan suatu teknologi yang berfungsi untuk monitoring,controling,dan tracking. Yang dapat di aplikasikan ke berbagai bidang contohnya untuk pengontrolan reaktor nuklir, pendeteksi api serta monitoring lalu lintas. Teknologi tersebut adalah Wireless Sensor Network. Dimana Wireless Sensor Network terdiri dari node-node sensor yang dapat memonitor gejala fisik atau lingkungan seperti suhu, suara, getaran, gelombang elektromagnetik, tekanan, gerakan, dan lain-lain. Dalam bidang observasi yang beresiko tinggi node-node disebar secara acak. Hasil sensing tidak bermakna jika tidak disertai darimana node tersebut berasal. Sehingga dalam hal ini dibutuhkan metode lokalisasi yang terdiri dari estimasi jarak dan komputasi posisi untuk mengetahui posisi node-node tersebut. Metode lokalisasi berdasarkan estimasi jarak dibagi menjadi 2 yaitu metode range free dan metode range based. Tugas akhir ini penulis membahas topik tentang Wireless Sensor Network Localization, dengan fokus pada analisis performansi algoritma DV-hop dan Amorphous dengan menggunakan metode range free. Untuk komputasi posisi penulis sama-sama menggunakan algoritma Trilateral untuk menentukan posisi unknown node. Alasan utama menggunakan metode range free karena dalam penerapannya metode range free membutuhkan sedikit konsumsi energi, rendah biaya,dan cocok untuk diterapkan pada wilayah yang luas serta pada bidang observasi yang beresiko tinggi. Dari hasil simulasi yang dilakukan dengan skema lokalisasi berbasis range free, pada skenario variasi anchor node nilai localization error algoritma amorphous 13,60% lebih rendah daripada algoritma dv-hop dan nilai energy consumption algoritma amorphous 24,538% lebih rendah daripada algoritma dv-hop. Untuk variasi kepadatan node nilai localization error algoritma dv-hop 26,95% lebih rendah daripada algoritma amorphous namun nilai energy consumption algoritma amorphous 14,227% lebih rendah daripada algoritma dv-hop. Pada skenario variasi range komunikasi nilai localization error algoritma dv-hop 50,282% lebih rendah daripada algoritma amorphous namun nilai energy consumption algoritma amorphous 12,35% lebih rendah daripada algoritma dv-hop. Kata kunci : Wireless Sensor Network , Metode Range Free, Algoritma Amorphous, Algoritma DV-hop, Algoritma Trilateral, Error Position, Energy Consumptio

Selected RSSI-based DV-Hop Localization for Wireless Sensor Networks

With the increasing demand on wireless sensor networks (WSNs) applications, acquiring the information of sensor node locations becomes one of the most important issues. Up to now, available localization approaches can be categorized into range-free and range-based methods. Range-free localizations are being pursued as a more cost-effective method. However, range-based schemes have better localization accuracy. This paper proposes the selected RSSI-based DV-Hop localization, which improves localization accuracy from the existing schemes by applying a combined technique that inherits the benefits from both methods. Our proposed technique firstly employs the DV-Hop approach of range-free algorithms, then uses the received signal strength indicator (RSSI) estimation technique of range-based algorithms to estimate the distances of selected hops. This paper also includes basic studies, which have been performed via computer simulations as well as testbed experiments, for distance calculation from RSSI measurement and location estimation in order to prove the credibility of our simulator. The proposed technique is implemented and tested via our developed WSN simulation model. Results in terms of distance error in comparison with traditional DV-Hop, RDV-Hop, and weighted RSSI algorithms show significant performance improvement by using our proposed method for both low-density and high-density wireless sensor network test scenarios

基于粒子群优化的无线传感器网络节点定位改进

针对无线传感器网络低成本、低功耗的要求, 提出了一种DV-Hop改进算法, 利用节点间的估计距离和锚节点的位置, 在DV-Hop算法的第三阶段使用粒子群优化的方法校正DV-Hop得到的估算位置。该算法不需要任何额外硬件设备和不增加通信量。仿真表明, 改进的算法可以使DV-Hop的平均定位误差下降30%, 并有效降低了成本

Regularized Least Square Multi-Hops Localization Algorithm for Wireless Sensor Networks

Abstract: Position awareness is very important for many sensor network applications. However, the use of Global Positioning System receivers to every sensor node is very costly. Therefore, anchor based localization techniques are proposed. The lack of anchors in some Wireless Sensor Networks lead to the appearance of multi-hop localization, which permits to localize nodes even if they are far from anchors. One of the well-known multi-hop localization algorithms is the Distance Vector-Hop algorithm (DV-Hop). Although its simplicity, DV-Hop presents some deficiencies in terms of localization accuracy. Therefore, to deal with this issue, we propose in this paper an improvement of DV-Hop algorithm, called Regularized Least Square DV-Hop Localization Algorithm for multi-hop wireless sensors networks. The proposed solution improves the location accuracy of sensor nodes within their sensing field in both isotropic and anisotropic networks. We used the double Least Square localization method and the statistical filtering optimization strategy, which is the Regularized Least Square method. Simulation results prove that the proposed algorithm outperforms the original DV-Hop algorithm with up to 60%, as well as other related works, in terms of localization accuracy