Original DV-Hop Algorithm Research Articles

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

Wireless Sensor Networks (WSN) are wireless networks with multiple sensor nodes covering a relatively large area. One of the weaknesses of WSNs is the relatively high energy consumption, which affects the network quality of service. Although WSN network routing using the DV-Hop algorithm is widely used because of its simplicity, improvements need to be made to improve energy efficiency, which impacts network lifetime. This article proposes a method to enhance energy efficiency by comparing the original DV-Hop algorithm with the enhanced DV-Hop algorithm. There are three approaches to enhancing the DV-Hop algorithm. Firstly, the CH node selection is based on the distance to the Base Station so that the selected CH node does not have a far distance from the base station. Secondly, the CH node selection must have a minimum number of sensor nodes as neighbors. Lastly, each selected CH node calculates the minimum distance to the previously selected CH node to ensure that the selected CH node is not in a nearby position. The proposed approach obtains better data packet transfer rate, energy efficiency, and network lifetime results using Matlab software simulation that compares the enhanced DV-Hop algorithm with the original DV-Hop algorithm and three other routing algorithms.

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

Location awareness is very crucial for almost existing sensor network applications. However, using Global Positioning System (GPS) receivers to every node is very expensive. Therefore, anchor based localization techniques are proposed. The lack of anchors in some WSNs 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 multihop 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.

Smart Agriculture Wireless Sensor Routing Protocol and Node Location Algorithm Based on Internet of Things Technology

With the increase of the world’s population, people’s demand for food is also increasing. However, due to various reasons, traditional agriculture cannot make full use of the land. Therefore, to ensure the food supply of the global population and promote the development of agriculture, the implementation of smart agriculture has become essential. The purpose of this research work is to study the smart agricultural wireless sensor routing protocols and node positioning algorithms based on the Internet of Things (IoT) technology. The present study first analyzes the classification of wireless sensor routing protocols. Based on the analysis and research of the Low Energy Adaptive Clustering Hierarchy protocol, the influence of factors such as node energy and distance are considered, and the network’s Low Energy Adaptive Clustering Hierarchy routing protocol is improved and extended its life. It introduced the classification of positioning algorithm, and then analyzed the DV-HOP positioning algorithm. Aiming at the problem of low positioning accuracy and large error of DV-HOP algorithm, an improved method of DV-HOP algorithm based on average HOP distance was proposed to make positioning more precise. Experimental results prove that the improved algorithm proposed in this paper has better performance. By testing the algorithm proposed in this paper, the improved DV-HOP algorithm reduces the positioning error by 30% compared with the original DV-HOP algorithm.

Improved DV-Hop Algorithm Using Locally Weighted Linear Regression in Anisotropic Wireless Sensor Networks

The original DV-hop algorithm performs pretty well in isotropic Wireless Sensor Networks in which nodes distribute uniformly. However, the localization accuracy degrades severely in anisotropic networks caused by uneven nodal distribution or irregularity of deployment region. In this paper, we propose a novel DV-hop algorithm based on Locally Weighted Linear Regression (LWLR-DV-hop), in which kernel method is adopted to improve the localization accuracy by raising the weight of neighboring anchor nodes. In the simulation section, algorithms are evaluated within two deployments and three topologies: the regular and random deployments, the L-shaped, O-shaped and X-shaped topologies. As performance metrics, the Average Localization Error and the Cumulative Distribution Function are used. The results of simulation and experiment reveal that LWLR-DV-hop performs better than original DV-Hop in anisotropic networks of different topologies, in which localization accuracy is improved by about 40% on average.

An Improved DV-Hop Localization Algorithm Based on Hop Distance and Hops Correction

In order to solve the problem that the DV-Hop algorithm has large error in the network topology environment of random distribution of nodes, this paper proposes a WSN localization algorithm based on hop distance correction. The algorithm uses the method of multi communication radius to correct the hop number within 1 hops, which makes it more consistent with the real situation; Then, the weighted factor is obtained by error of the average distance per hop of anchor node; Finally, the total least squares method is used to calculate the coordinates of the unknown nodes to improve the positioning accuracy of DV-Hop positioning algorithm. The simulation results show that the improved algorithm has a better accuracy and stability than the original DV-Hop algorithm.

Effect of network topology on localization algorithm’s performance

Localization is an important part of wireless network design. In many internet of things (IoT) and other applications, the information produced by an individual entity or node is of limited use without knowledge of its location. Not only it is needed to report data that is geographically meaningful, but it is also required for services such as geographic and context-based routing protocols, location-aware services, location of sensed events in the physical world, object or target tracking, coverage area management and disaster event notification, like gas leakage detection system. This work is intended to perform comprehensive study on effects of topology on performance of existing range-free localization algorithms, in particular, localization in anisotropic network (irregular areas due to holes). We extended a simulation framework, written in Python, which is specially designed for wireless network simulation and add an interactive generic topology generator module. Our simulation framework also produces interactive charts, plots, and log all relevant simulation results for further analysis. In the first phase of our research we are interested in establishing a comprehensive simulation framework or guideline by implementing the original Distance Vector or DV-Hop algorithm. We first generate multiple isotropic and anisotropic topologies of different shapes and then simulate the DV-Hop localization algorithm. We then analyze the results statistically and visually. Our proposed contribution in this paper provides a framework and guideline to systematically and statistically study and compare different network algorithms.

Position Location Scheme Using Nonlinear Programming Based on RSSI and DV-Hop

Localization is used in location-aware applications such as navigation, autonomous robotic movement, and asset tracking to position a moving object on a coordinate system. In this paper, a Nonlinear Programming algorithm is proposed based on RSSI and improved DV-Hop algorithm, called NPRDV-Hop. The algorithm makes four major contributions to the localization problem in the wireless sensor networks (WSNs). Firstly, a hop distance is improved, called Hop Distance. This scheme could assure that the most nodes receive the Hop Distance from beacon node who has the least hops between them. This practical localization scheme is relatively high accuracy and low cost for WSNs. Secondly, Heron's formula is introduced as objective function. Thirdly, Gauss distribution is introduced to select RSSI so that the error of distance is little. Lastly, the general problem is considered by the nonlinear programming to solve for the locations of the sensors. Simulation results show that the proposed method can improve location accuracy and coverage without increasing hardware cost of sensor node. The performance of this algorithm is superior to the original DV-Hop algorithm.

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

Localization 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.

Research and Improvement of DV-Hop Localization Algorithm for Wireless Sensor Network

Rang-free distributed localization algorithm has advantages of low power consumption, low cost etc, but it is weak in the localization accuracy, energy consumption of localization and the algorithm extend ability.That can not meet to the needs of practical application. To overcome the disadvantage of DV-Hop algorithm, in this paper, Two aspects improved algorithm are proposed based on the characteristics research of the original DV-Hop localization algorithm, which are the coverage area of beacon nodes and average size for one hop received by unknown nodes. Simulation results prove their validity and show the performance of the improvement algorithms is superior to the original DV-Hop algorithm.