scholarly journals DV-Hop Node Location Algorithm Based on GSO in Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-9 ◽  
Author(s):  
Ling Song ◽  
Liqin Zhao ◽  
Jin Ye
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Least Square Method ◽  
High Energy ◽  
Least Square ◽  
Wireless Sensor ◽  
Linear Solution ◽  
Node Location ◽  
Location Algorithm

Node location is one of the most important problems to be solved in practical application of WSN. As a typical location algorithm without ranging, DV-Hop is widely used in node localization of wireless sensor networks. However, in the third phase of DV-Hop, a least square method is used to solve the nonlinear equations. Using this method to locate the unknown nodes will produce large coordinate errors, poor stability of positioning accuracy, low location coverage, and high energy consumption. An improved localization algorithm based on hybrid chaotic strategy (MGDV-Hop) is proposed in this paper. Firstly, a glowworm swarm optimization of hybrid chaotic strategy based on chaotic mutation and chaotic inertial weight updating (MC-GSO) is proposed. The MC-GSO algorithm is used to control the moving distance of each firefly by chaos mutation and chaotic inertial weight when the firefly falls into a local optimum. The experimental results show that MC-GSO has better convergence and higher accuracy and avoids the premature convergence. Then, MC-GSO is used to replace the least square method in estimating node coordinates to solve the problem that the localization accuracy of the DV-Hop algorithm is not high. By establishing the error fitness function, the linear solution of coordinates is transformed into a two-dimensional combinatorial optimization problem. The simulation results and analysis confirm that the improved algorithm (MGDV-Hop) reduces the average location error, increases the location coverage, and decreases and balances the energy consumption as compared to DV-Hop and the location algorithm based on classical GSO (GSDV-Hop).

scholarly journals Oppo-Flood: An Energy-Efficient Data Dissemination Protocol for Asynchronous Duty-Cycled Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Hyeonsang Cho ◽  
Jungmin So
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Dissemination ◽  
High Energy ◽  
Wireless Sensor ◽  
Neighboring Node ◽  
Duty Cycling ◽  
Opportunistic Forwarding ◽  
Efficient Data

In this paper, we propose a data dissemination protocol for asynchronous duty-cycling wireless sensor networks. In an asynchronous duty-cycling network, each node independently selects its wake-up time. In this environment, data dissemination becomes energy consuming, because broadcasting a packet does reach all neighbors but only the neighbors that are awake at the time. A node can forward its packet to all neighbors by continuously transmitting the packet for a whole wake-up interval, but it leads to high energy consumption and high dissemination delay. The idea proposed in this paper is to use opportunistic forwarding, where each node forwards the packet to a neighbor that wakes up early and receives the packet. Each node forwards the packet, as long as there is a neighboring node that has not received the packet yet. The main benefit of this opportunistic forwarding-based dissemination is that every time a packet is disseminated, it may take a different path to reach the nodes. At the beginning of dissemination, a sender needs to transmit for a very short duration of time because there are plenty of neighboring nodes to receive the packet. As more nodes receive the packet, the transmit duration of the sender becomes longer, thus consuming more energy. Since the order of dissemination is different every time, energy consumption is naturally balanced among the nodes, without explicit measures. Through extensive simulations, we show that the proposed protocol achieves longer network lifetime and shorter dissemination delay compared to other dissemination protocols in various network environments.

scholarly journals Reliable Link Level Routing Algorithm in Pipeline Monitoring Using Implicit Acknowledgements

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 968
Author(s):  
Carlos Egas Acosta. ◽  
Felipe Gil-Castiñeira ◽  
Enrique Costa-Montenegro ◽  
Jorge Sá Silva
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Explicit Knowledge ◽  
Routing Algorithm ◽  
Linear Structure ◽  
High Energy ◽  
Wireless Sensor ◽  
Tree Topologies ◽  
End To End

End-to-end reliability for Wireless Sensor Network communications is usually provided by upper stack layers. Furthermore, most of the studies have been related to star, mesh, and tree topologies. However, they rarely consider the requirements of the multi-hop linear wireless sensor networks, with thousands of nodes, which are universally used for monitoring applications. Therefore, they are characterized by long delays and high energy consumption. In this paper, we propose an energy efficient link level routing algorithm that provides end-to-end reliability into multi-hop wireless sensor networks with a linear structure. The algorithm uses implicit acknowledgement to provide reliability and connectivity with energy efficiency, low latency, and fault tolerance in linear wireless sensor networks. The proposal is validated through tests with real hardware. The energy consumption and the delay are also mathematically modeled and analyzed. The test results show that our algorithm decreases the energy consumption and minimizes the delays when compared with other proposals that also apply the explicit knowledge technique and routing protocols with explicit confirmations, maintaining the same characteristics in terms of reliability and connectivity.

scholarly journals An Energy Efficient Routing Protocol Based on Layers and Unequal Clusters in Underwater Wireless Sensor Networks

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Fang Zhu ◽  
Junfang Wei
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
High Energy ◽  
Wireless Sensor ◽  
Underwater Wireless Sensor Networks ◽  
Energy Efficient Routing ◽  
Unequal Cluster

Underwater Wireless Sensor Networks (UWSNs) have drawn tremendous attentions from all fields because of their wide application. Underwater wireless sensor networks are similar to terrestrial Wireless Sensor Networks (WSNs), however, due to different working environment and communication medium, UWSNs have many unique characteristics such as high bit error rate, long end-to-end delay and low bandwidth. These characteristics of UWSNs lead to many problems such as retransmission, high energy consumption and low reliability. To solve these problems, many routing protocols for UWSNs are proposed. In this paper, a localization-free routing protocol, named energy efficient routing protocol based on layers and unequal clusters (EERBLC) is proposed. EERBLC protocol consists of three phases: layer and unequal cluster formation, transmission routing, maintenance and update of clusters. In the first phase, the monitoring area under the water is divided into layers, the nodes in the same layer are clustered. For balancing energy of the whole network and avoiding the “hotspot” problem, a novel unequal clustering method based on layers for UWSNs is proposed, in which a new calculation method of unequal cluster size is presented. Meanwhile, a new cluster head selection mechanism based on energy balance and degree is given. In the transmission phase, EERBLC protocol proposes a novel next forwarder selection method based on the forwarding ratio and the residual energy. In the third phase, Intra and inter cluster updating method is presented. The simulation results show that the EERBLC can effectively balance the energy consumption, prolong the network lifetime, and increase the amount of data transmission compared with DBR and EEDBR protocols.

scholarly journals Performance Analysis of Wireless Sensor Networks Based on Trust Mechanism

2021 ◽  
Vol 9 (12) ◽  
pp. 243-249
Author(s):  
Subiksha. V
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
High Energy ◽  
Wireless Sensor ◽  
Malicious Nodes ◽  
Network Attacks ◽  
Trust Value ◽  
Direct Trust ◽  
Indirect Trust

Abstract: Due to the characteristics like limited resources and dynamic topology, wireless sensor networks (WSNs) are facing two major problems such as security and energy consumption. To deal with various improper behaviors of nodes the trust-based solutions are possible but still exist a variety of attacks, high energy consumption, and communication congestion between nodes. Therefore, this paper proposes an advanced and efficient trust-based secure and energy-efficient routing protocol (TBSEER) to solve these network problems and to avoid malicious nodes. Efficient Adaptable Ant Colony Optimization Algorithm (EAACO) calculates the comprehensive trust value through adaptive direct trust value, indirect trust value, and energy trust value, which can be resistant to internal network attacks such as sinkhole, black hole, selective forwarding, and hello flood attacks. In addition, to fast identify the malicious nodes in the WSN, the adaptive penalty mechanism and volatilization factor are used. Moreover, the nodes only need to calculate the direct trust value, and the indirect trust value is obtained by the sink, so as to further reduce the energy consumption caused by iterative calculations. To actively avoid network attacks, the cluster heads find the safest multi-hop routes based on the comprehensive trust value. The simulation results show that the proposed EAACO reduces network energy consumption, speeds up the identification of malicious nodes, as well as resists all common attacks. Keywords: Comprehensive trust value, direct trust value, indirect value, EAACO, network attacks, wireless sensor networks

Sign in / Sign up

Export Citation Format

Share Document