Rescuing moribund NVM-based sensor nodes by an energy-efficient WCV routing algorithm

2016 ◽  
Author(s):  
Chi-Heng Lee ◽  
Tseng-Yi Chen ◽  
Shuo-Han Chen ◽  
Hsin-Wen Wei ◽  
Heng-Yin Chen ◽  
...  
Keyword(s):  
Energy Efficient ◽  
Routing Algorithm ◽  
Sensor Nodes

Energy Efficient Clustering and Routing Algorithm for WSN

2019 ◽  
Vol 12 ◽  
Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Hot Spot ◽  
Routing Algorithm ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Clustering ◽  
Hot Spot Problem

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.

scholarly journals Energy Efficient and Reliable Routing Algorithm for Wireless Sensors Networks

2020 ◽  
Vol 10 (5) ◽  
pp. 1885 ◽  
Author(s):  
Liangrui Tang ◽  
Zhilin Lu ◽  
Bing Fan
Keyword(s):  
Energy Efficient ◽  
Routing Algorithm ◽  
Evidence Theory ◽  
Fusion Rule ◽  
Residual Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Entropy Weight ◽  
Reliable Routing ◽  
Index Value

In energy-constrained wireless sensor networks, low energy utilization and unbalanced energy distribution are seriously affecting the operation of the network. Therefore, efficient and reasonable routing algorithms are needed to achieve higher Quality of Service (QoS). For the Dempster–Shafer (DS) evidence theory, it can fuse multiple attributes of sensor nodes with reasonable theoretical deduction and has low demand for prior knowledge. Based on the above, we propose an energy efficient and reliable routing algorithm based on DS evidence theory (DS-EERA). First, DS-EERA establishes three attribute indexes as the evidence under considering the neighboring nodes’ residual energy, traffic, the closeness of its path to the shortest path, etc. Then we adopt the entropy weight method to objectively determine the weight of three indexes. After establishing the basic probability assignment (BPA) function, the fusion rule of DS evidence theory is applied to fuse the BPA function of each index value to select the next hop. Finally, each node in the network transmits data through this routing strategy. Theoretical analysis and simulation results show that DS-EERA is promising, which can effectively prolong the network lifetime. Meanwhile, it can also reach a lower packet loss rate and improve the reliability of data transmission.

scholarly journals Energy-Efficient Unequal Clustering Routing Algorithm for WSNs

2019 ◽  
Vol 8 (3) ◽  
pp. 5540-5548
Keyword(s):  
Energy Consumption ◽  
Energy Efficient ◽  
Sensor Node ◽  
Routing Algorithm ◽  
Base Station ◽  
Sensor Nodes ◽  
Energy Balancing ◽  
Unequal Clustering ◽  
Network Nodes ◽  
New Energy

Wireless sensor networks(WSNs) are used to monitor the environment where the networks are deployed. The Lifetime of WSNs can be increased by energy-efficient or energy balancing algorithms. Balanced energy consumption among all nodes is the main issue. In this paper, a new energy-efficient unequal clustering routing protocol (EEUCR) has been presented. In this protocol, the area of the network is divided into the number of rings of unequal size and each ring is further divided into a number of clusters. Rings nearer to the base station(BS) have a smaller area and the area of rings keeps on increasing as the distance from BS increases. This helps to balance the energy consumption among the sensor nodes. The nodes with heterogeneous energy are deployed in the network. Nodes nearer to the base station have higher energy as compared to farther nodes. Static clustering is used but cluster heads(CHs) are not fixed and are elected on the basis of the remaining energy of the sensor node. Simulation results are compared with existing protocols and show improvement in energy consumption, which, in turn, increases the network lifetime of WSN and also balance the energy consumption of sensor node

scholarly journals An Energy-Efficient Fail Recovery Routing in TDMA MAC Protocol-Based Wireless Sensor Network

Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 444 ◽  
Author(s):  
Odilbek Urmonov ◽  
HyungWon Kim
Keyword(s):  
Energy Consumption ◽  
Data Collection ◽  
Energy Efficient ◽  
Mac Protocol ◽  
Routing Algorithm ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Media Access Control ◽  
Fault Recovery

Conventional IoT applications rely on seamless data collection from the distributed sensor nodes of Wireless Sensor Networks (WSNs). The energy supplied to the sensor node is limited and it depletes after each cycle of data collection. Therefore, data flow from the network to the base station may cease at any time due to the nodes with a dead battery. A replacement of the battery in WSNs is often challenging and requires additional efforts. To ensure the robust operation of WSNs, many fault recovery routing mechanisms have been proposed. Most of the previous fault recovery routing methods incur considerable delays in recovery and high overhead in either energy consumption or device cost. We propose an energy-efficient fail recovery routing method that is aimed to operate over a data aggregation network topology using a TDMA media access control (MAC). This paper introduces a novel fault recovery routing algorithm for TDMA-based WSNs. It finds an optimal neighbor backup parent (NBP) for each node in a way that reduces the energy consumption. The proposed method allows the NBPs to utilize the time slot of the faulty parent nodes, so it eliminates the overhead of TDMA rescheduling for NBPs. To evaluate the fault recovery performance and energy efficiency of the proposed method, we implemented it in C++ simulation program. Simulation experiments with an extensive set of network examples demonstrate that the proposed method can extend the network lifetime by 21% and reduce the energy consumption by 23% compared with the reference methods.

Adaptive Mobile Sink for Energy Efficient WSN Using Biogeography-Based Optimization

2019 ◽  
Vol 10 (3) ◽  
pp. 1-22
Author(s):  
Ajay Kaushik ◽  
S. Indu ◽  
Daya Gupta
Keyword(s):  
Energy Efficient ◽  
Data Transfer ◽  
Routing Algorithm ◽  
Early Death ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Matlab Simulation ◽  
Energy Hole ◽  
Distributed Load

Early death of cluster heads (CHs) located near the sink due to excessive data relay load causes energy holes in wireless sensor networks (WSNs). A widely adopted solution to energy hole problem is to divide the deployment region into multiple sub regions and use mobile sink (MS) to aggregate data from each sub-region. However, inside a sub-region, CHs close to MS dissipate their energy quickly and die despite of the sink mobility. The authors map the problem of distributing data relay load optimally to multiple CHs and locating MS near these multiple CHs using metaheuristic algorithm biogeography-based optimization (BBO). Furthermore, there is a need of optimum routing of data to the MS inside each sub-region of a MS WSN. Proposed mobile sink distributed load routing algorithm (MSDR-BBO) selects the optimum routing CHs in MS WSN as per data transfer requirements of sensor nodes (SNs) and CHs. MSDR-BBO is validated using Matlab simulation as well as Netsim emulator, and it outperforms latest MS WSN algorithms like nested routing, SENMA, and CMS2TO by 4.6%, 11.7%, and 17.4%, respectively.

scholarly journals A Research on Energy Efficient Cluster Routing for the Wireless Sensor Networks

2019 ◽  
Vol 8 (6S4) ◽  
pp. 1344-1347
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Life Time ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Small Clusters

Clustering with energy efficient routing is the most important technique for the wireless sensor networks. Cluster converts group of sensor nodes into small clusters and electing the cluster heads with energy efficient cluster routing for all the clusters in the Wireless sensor networks. By selecting the proper energy efficient cluster routing algorithm we can increase the life time of the wireless sensor networks. Lot of techniques are used for energy efficient cluster routing for Wireless sensor networks like Particle Swarm Optimization, Artificial Bees Colony Optimization, Crow Search Algorithm, Energy-efficient Intracluster Routing (EIR) algorithm and Dolphin Echolocation Algorithm (DEA). In this paper we have given the comparative analysis report of energy efficient cluster routing algorithms for the wireless sensor networks in terms of energy efficiency and sensor node lifetime of the networks.

scholarly journals Improved Energy Efficient Wireless Sensor Networks Using Balanced Multi-Hop Routing Protocol

2018 ◽  
Vol 7 (3.6) ◽  
pp. 24
Author(s):  
C Sivakumar ◽  
P Latha Parthiban
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Routing Algorithm ◽  
Mobile Network ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Dijkstra Algorithm ◽  
Wireless Sensor Nodes ◽  
Combined Technique

In this paper, consumption of energy by the sensor nodes in Wireless Sensor Nodes (WSNs) is been handled effectively using a combined technique. The objective of the paper is to increase the network lifetime with dynamic routing protocol. Here, the proposed routing algorithm, named Balanced Multi-Hop (BMH) protocol combines the multi-hop and direct transmission communication. This method further uses Dijkstra algorithm to route the packets between the sensor nodes and base station in mobile network. This method avoids the use of central router to control the other nodes. The results of the proposed method is tested against various result metrics. The evaluation over other existing methods prove that the BMH method achieves higher lifetime and high network throughput.  

Distributed Entropy Energy-Efficient Clustering algorithm for cluster head selection (DEEEC)

2020 ◽  
Vol 39 (6) ◽  
pp. 8139-8147
Author(s):  
Ranganathan Arun ◽  
Rangaswamy Balamurugan
Keyword(s):  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Second Stage ◽  
Energy Efficient Clustering ◽  
Two Stages ◽  
Ch Selection

In Wireless Sensor Networks (WSN) the energy of Sensor nodes is not certainly sufficient. In order to optimize the endurance of WSN, it is essential to minimize the utilization of energy. Head of group or Cluster Head (CH) is an eminent method to develop the endurance of WSN that aggregates the WSN with higher energy. CH for intra-cluster and inter-cluster communication becomes dependent. For complete, in WSN, the Energy level of CH extends its life of cluster. While evolving cluster algorithms, the complicated job is to identify the energy utilization amount of heterogeneous WSNs. Based on Chaotic Firefly Algorithm CH (CFACH) selection, the formulated work is named “Novel Distributed Entropy Energy-Efficient Clustering Algorithm”, in short, DEEEC for HWSNs. The formulated DEEEC Algorithm, which is a CH, has two main stages. In the first stage, the identification of temporary CHs along with its entropy value is found using the correlative measure of residual and original energy. Along with this, in the clustering algorithm, the rotating epoch and its entropy value must be predicted automatically by its sensor nodes. In the second stage, if any member in the cluster having larger residual energy, shall modify the temporary CHs in the direction of the deciding set. The target of the nodes with large energy has the probability to be CHs which is determined by the above two stages meant for CH selection. The MATLAB is required to simulate the DEEEC Algorithm. The simulated results of the formulated DEEEC Algorithm produce good results with respect to the energy and increased lifetime when it is correlated with the current traditional clustering protocols being used in the Heterogeneous WSNs.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Sign in / Sign up

Export Citation Format

Share Document