scholarly journals PDTR: Probabilistic and Deterministic Tree-based Routing for Wireless Sensor Networks

Sensors ◽  
2020 ◽  
Vol 20 (6) ◽  
pp. 1697
Author(s):  
Rafia Ghoul ◽  
Jing He ◽  
Sana Djaidja ◽  
Mohammed A. A. Al-qaness ◽  
Sunghwan Kim
Keyword(s):  
Residual Energy ◽  
Distance Distribution ◽  
Wireless Sensor ◽  
Control Parameters ◽  
Transmission Distance ◽  
Routing Table ◽  
Count Distribution ◽  
Probabilistic Routing ◽  
Simulation Results ◽  
The Impact

This paper proposed a “Probabilistic and Deterministic Tree-based Routing for WSNs (PDTR)”. The PDTR builds a tree from the leaves to the head (sink), according to the best elements in the initial probabilistic routing table, measured by the product of hops-count distribution, and transmission distance distribution, to select the best tree-paths. Each sender node forwards the received data to the next hop via the deterministic built tree. After that, when any node loses of its energy, PDTR updates the tree at that node. This update links probabilistically one of that node’s children to a new parent, according to the updated probabilistic routing table, measured by the product of the updated: Hops-count distribution, transmission distance distribution, and residual energy distribution at the loss of ℓ e energy. By implementing the control parameters in each distribution, PDTR shows the impact of each distribution in the routing path. These control parameters are oriented by the user for different performances. The simulation results prove that selecting the initial best paths to root the packets via unicast, then improving the tree at the node with loss of energy by rooting the packets via anycast, leads to better performance in terms of energy consumption and network lifetime.

A Probability-Based Clustering Algorithm with CH Election for Expanding WSN Life Span

2020 ◽  
Vol 9 (1) ◽  
pp. 1-14
Author(s):  
Dimitris N. Kanellopoulos ◽  
Pratik Gite
Keyword(s):  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Signal Power ◽  
Aggregated Data ◽  
Simulation Results ◽  
Buffer Length ◽  
Energy Buffer

Clustering achieves energy efficiency and scalable performance in wireless sensor networks (WSNs). A cluster is formed by several sensors nodes, and one of them is elected as Cluster-head (CH). A CH collects information from the cluster members and sends aggregated data to the base station or another CH. This article proposes a new clustering algorithm (EMESISC) that is based on each node's probability of becoming a CH. This node's probability depends on its residual energy, buffer length, and received signal power. We compared EMESISC with LEACH algorithm. Simulation results showed that EMESISC is superior to LEACH.

scholarly journals R-bUCRP: A Novel Reputation-Based Uneven Clustering Routing Protocol for Cognitive Wireless Sensor Networks

2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Mingchuan Zhang ◽  
Ruijuan Zheng ◽  
Ying Li ◽  
Qingtao Wu ◽  
Liang Song
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Selfish Nodes ◽  
Simulation Results ◽  
Establishment Phase ◽  
Optimal Cluster

Energy of nodes is an important factor that affects the performance of Wireless Sensor Networks (WSNs), especially in the case of existing selfish nodes, which attracted many researchers’ attention recently. In this paper, we present a reputation-based uneven clustering routing protocol (R-bUCRP) considering both energy saving and reputation assessment. In the cluster establishment phase, we adopt an uneven clustering mechanism which controls the competitive scope of cluster head candidates to save the energy of WSNs. In the cluster heads election phase, the residual energy and reputation value are used as the indexes to select the optimal cluster head, where the reputation mechanism is introduced to support reputation assessment. Simulation results show that the proposed R-bUCRP can save node energy consumption, balance network energy distribution, and prolong network lifetime.

scholarly journals Routing of emergency data in a wireless sensor network for mining applications

2021 ◽  
Author(s):  
Mandana Jafarian
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Residual Energy ◽  
Mesh Network ◽  
Wireless Sensor ◽  
End To End Delay ◽  
Simulation Results ◽  
End To End

Emergency situations in mines result in loss of precious human lives. In this thesis we discussed architecture of a Wireless Sensor Network (WSN) that can be deployed in mines, which takes care of severe geographical and environmental constraints found inside mines. The proposed architecture is a two-level hierarchy of small sized WSNs that employs a wireless Mesh network as the backbone connecting small sized WSNs scattered inside mines. We proposed a routing protocol for that WSN that is optimized for both emergency and non-emergency data routing. Since our main goal is to provide safety in the mining environment, the main consideration of the routing protocol is to provide reliability and reduce the end-to-end delay for vital emergency traffic while optimizing for network longevity for non-emergency traffic. We present a new cost-based routing protocol called MDML, which provides Minimum Delay and Maximum Lifetime routing for such networks. The proposed MDML routing defines separate cost metrics for emergency and non-emergency traffic. It finds the least-cost path for the reliable delay-constrained emergency traffic with regards to link error rate but also gives secondary consideration to nodes' residual energy. It is an energy efficient routing scheme for non-emergency or regular data traffic routing that maximizes the network lifetime. However, for emergency traffic energy efficiency is compromised to achieving minimal delay. Regular traffic is generated through periodic monitoring and is delay-insensitive. For regular traffic delivery, a shortest path routinig algorithm is employed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. Simulation results show that using the proposed emergency routes reduces the end-to-end delay for emergency traffic. The effect of protocol update cycle on increasing the network lifetime is verified true simulation. MDML is also compared with a simulated non-MDML approach to compare the lifetime and delay performance. Simulation results have demonstrated the effectiveness of our approach.

Energy Balance Routing Algorithm Based on Energy Heterogeneous WSN

2014 ◽  
Vol 687-691 ◽  
pp. 3976-3979 ◽  
Author(s):  
Ming Xin Liu ◽  
Xiao Meng Wang
Keyword(s):  
Energy Balance ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Energy Balancing ◽  
Network Nodes ◽  
Cluster Head Election ◽  
Balancing Energy ◽  
Simulation Results

Balancing energy load is a key problem in wireless sensor network (WSN) research. For balancing node energy consumption and prolong the network lifetime, this paper proposes an improved routing algorithm EBRA (Energy Balancing Routing Algorithm) based on energy heterogeneous WSN. To maximize the energy efficiency of network nodes, the EBRA weights the probability of cluster head election. According to the estimate value of the network average remaining energy and the residual energy of network nodes, we can calculate the new cluster head election threshold. The simulation results show that the utilization of energy balance of EBRA algorithm is improved 74%, 30% and 23%, compare with LEACH, SEP and DCHS, respectively.

Certain Investigation on Secured Data Transmission in Wireless Sensor Networks

2020 ◽  
pp. 1372-1385
Author(s):  
P. Padmaja ◽  
G.V. Marutheswar
Keyword(s):  
Data Aggregation ◽  
Energy Efficient ◽  
Cluster Head ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Trust Value ◽  
Security Issues ◽  
Deviation Factor ◽  
Simulation Results ◽  
Secured Data

Wireless Sensor Network (WSN) need to be more secure while transmitting data as well as should be deployed properly to reduce redundancy and energy consumption. WSNs suffer from many constraints, including low computation capability, small memory, limited energy resources, susceptibility to physical capture and the use of insecure wireless communication channels. These constraints make security in WSNs a challenge. In this paper, a survey of security issues in WSNs is presented and a new algorithm TESDA is proposed, which is an optimized energy efficient secured data aggregation technic. The cluster head is rotated based on residual energy after each round of aggregation so that network lifetime increases. Based on deviation factor calculated, the trust weight is assigned, if more deviation, then the trust value is less. Simulation results observed by using NS-2. From network animator and x-graphs the result are analyzed. Among all protocols tesda is an energy efficient secured data aggregation method.

Fuzzy Logic Based Clustering Algorithm for Wireless Sensor Networks

2020 ◽  
pp. 351-371 ◽  
Author(s):  
Hassan El Alami ◽  
Abdellah Najid
Keyword(s):  
Fuzzy Logic ◽  
Clustering Algorithm ◽  
Cluster Formation ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Modern Life ◽  
Routing Schemes ◽  
Network Operation ◽  
Simulation Results ◽  
Ch Selection

WSNs have many applications in modern life. Thus, optimization of the network operation is required to maximize its lifetime. The energy is a major issue in order to increase the lifetime of WSNs. The clustering algorithm is one of the proposed algorithms to enhance the lifetime of WSNs. The operation of the clustering algorithm is divided into cluster heads (CHs) selection and cluster formation. However, most of the previous works have focused on CHs selection, and have not considered the cluster formation process, which is the important issue in clustering algorithm based routing schemes, and it can drastically affect the lifetime of WSNs. In this paper, a Fuzzy Logic based Clustering Algorithm for WSN (CAFL) has been proposed to improve the lifetime of WSNs. This approach uses fuzzy logic for CHs selection and clusters formation processes by using residual energy and closeness to the sink as fuzzy inputs in terms of CH selection, and residual energy of CH and closeness to CHs as fuzzy inputs in terms of clusters formation. Simulation results justify its efficiency.

scholarly journals A Routing Protocol Based on Both of Density Variation and Distance-Aware for WSNs

2020 ◽  
Author(s):  
Dongmei Xing
Keyword(s):  
Energy Consumption ◽  
Influence Factor ◽  
Routing Algorithm ◽  
Propagation Distance ◽  
Residual Energy ◽  
Density Variation ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Balanced Energy Consumption ◽  
Simulation Results

A hierarchical routing algorithm for wireless sensor networks (WSNs) is discussed. We select cluster heads according to related distances and residual energy. Both effects of the number of nodes dissipated and the energy consumption act on propagation distances. In addition, the related density effects on the propagation distance. We Define comprehensive influence factor and propagation influence factor, adjust the initial probability of nodes participating in cluster heads’ election, make propagation distances of nodes gradually increase within a certain range. Simulation results show that both cluster heads and failure nodes are evenly distributed in the whole sensor network. The residual energy of nodes are balanced inter the living nodes, which extends the survival time of the network. The routing algorithm we have designed has the characteristics of better balanced energy consumption.

scholarly journals En-Route Message Authentication Scheme for Filtering False Data in WSNs

2021 ◽  
Vol 2021 ◽  
pp. 1-18
Author(s):  
Chuanjun Yi
Keyword(s):  
Residual Energy ◽  
Authentication Scheme ◽  
Wireless Sensor ◽  
Security Level ◽  
Message Authentication ◽  
Effective Mechanism ◽  
Injection Attacks ◽  
Selective Forwarding ◽  
Simulation Results ◽  
Reporting Mechanism

In wireless sensor networks, the adversary can easily control the compromised nodes to inject false data reports. En-route filtering is an effective mechanism to resist such attacks, where the forwarding nodes of the reports can identify and drop the false reports. However, the existing en-route filtering strategies are vulnerable to report disruption attacks and selective forwarding attacks, and the probabilities and efficiencies of en-route filtering false reports are low. To address these problems, a precheck mechanism performed by the CoS (Center-of-Stimulus) node is presented to resist report disruption attacks, a report forwarding strategy with balancing the residual energy of the nodes is designed to resist selective forwarding attacks, and an en-route message authentication scheme (EMAS) based on monitoring and reporting mechanism is proposed to resist false data injection attacks. The theoretical analysis and simulation results show that in most cases, EMAS provides a higher security level and higher en-route filtering probability and efficiency and is very efficient in energy saving.

An energy minimizing score based optimal data gathering in wireless sensor networks

2018 ◽  
Vol 7 (2.31) ◽  
pp. 161
Author(s):  
P Balamurugan ◽  
M Shyamala Devi ◽  
V Sharmila
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Gathering ◽  
Residual Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Efficient Manner ◽  
High Level ◽  
The Impact

In wireless sensor networks, Sensor nodes are arranged randomly in unkind physical surroundings to collect data and distribute the data to the remote base station. However the sensor nodes have to preserve the power source that has restricted estimation competence. The sensed information is difficult to be transmitted over the sensor network for a long period of time in an energy efficient manner.  In this paper, it finds the problem of communication data between sink nodes and remote data sources via intermediate nodes in sensor field. So this paper proposes a score based data gathering algorithm in wireless sensor networks. The high-level contribution of this study is the enhancement of a score- based data gathering algorithm and the impact of energy entity for Wireless Sensor Networks.  Then the energy and delay of data gathering are evaluated. Unlike PEGASIS and LEACH, the delay for every process of data gathering is considerably lower when SBDG is employed.  The energy consumed per round of data gathering for both SBDG and EE-SBDG is less than half of that incurred with PEGASIS and LEACH. Compared with LEACH and PEGASIS, SBDG and EE-SBDG are fair with node usage because of the scoring system and residual energy respectively.  Overall, the Score-based data gathering algorithm provides a significant solution to maximize the network lifetime as well as minimum delay per round of data gathering.

The Impact of Environment on the Node Coverage Modeling in Wireless Sensor Network

2013 ◽  
Vol 760-762 ◽  
pp. 647-651
Author(s):  
Zhi Qiang Pei ◽  
Chang Qing Xu ◽  
Li Hong Wan
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Significant Influence ◽  
Wireless Sensor ◽  
Sensing Model ◽  
Key Issues ◽  
Simulation Results ◽  
The Impact

The coverage and localization are two key issues in wireless sensor network (WSN), and they are related with the sensing model of sensors. That is, the different sensing models will lead to the different coverage patterns and localization schemes. However, the environment has a significant influence on the sensing model of sensors in some applications. Thus, this paper will study this impact and propose a sensing model, according to which, the coverage and localization will be re-studied. Finally, the simulation results demonstrate the validity of this impact, the feasibility of the sensing model, and the superiority of coverage and localization.

Sign in / Sign up

Export Citation Format

Share Document