scholarly journals Elitist Genetic Algorithm Based Energy Balanced Routing Strategy to Prolong Lifetime of Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Vinay Kumar Singh ◽  
Vidushi Sharma

Wireless sensor networks have gained worldwide attention in recent years due to the advances made in wireless communication. Unequal energy dissipation causes the nodes to fail. The factors causing the unequal energy dissipation are, firstly, the distance between the nodes and base station and, secondly, the distance between the nodes themselves. Using traditional methods, it is difficult to obtain the high precision of solution as the problem is NP hard. The routing in wireless networks is a combinatorial optimization problem; hence, genetic algorithms can provide optimized solution to energy efficient shortest path. The proposed algorithm has its inherent advantage that it keeps the elite solutions in the next generation so as to quickly converge towards the global optima also during path selection; it takes into account the energy balance of the network, so that the life time of the network can be prolonged. The results show that the algorithm is efficient for finding the optimal energy constrained route as they can converge faster than other traditional methods used for combinatorial optimization problems.

Electronics ◽  
2021 ◽  
Vol 10 (22) ◽  
pp. 2760
Author(s):  
Sandrine Mukase ◽  
Kewen Xia ◽  
Abubakar Umar

Wireless sensor networks have attracted worldwide attention in recent years. The failure of the nodes is caused by unequal energy dissipation. The reasons that cause unequal energy dissipation are, first and foremost, the distance between the nodes and the base station, and secondly, the distance between the nodes themselves. In wireless sensor networks, the location of the base station has a substantial impact on the network’s lifetime effectiveness. An improved genetic algorithm based on the crossover elitist conservation genetic algorithm (CECGA) is proposed to optimize the base station location, while for clustering, the K-medoids clustering (KMC) algorithm is used to determine optimal medoids among sensor nodes for choosing the appropriate cluster head. The idea is to decrease the communication distance between nodes and the cluster heads as well as the distance among nodes. For data routing, a multi-hop technique is used to transmit data from the nodes to the cluster head. Implementing an evolutionary algorithm for this optimization problem simplifies the problem with improved computational efficiency. The simulation results prove that the proposed algorithm performed better than compared algorithms by reducing the energy use of the network, which results in increasing the lifetime of the nodes, thereby improving the whole network.


Author(s):  
Omkar Singh ◽  
Vinay Rishiwal

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.


2016 ◽  
Vol 26 (1) ◽  
pp. 17
Author(s):  
Carlos Deyvinson Reges Bessa

ABSTRACTThis work aims to study which wireless sensor network routing protocol is more suitable for Smart Grids applications, through simulation of AODV protocols, AOMDV, DSDV and HTR in the NS2 simulation environment. Was simulated a network based on a residential area with 47 residences, with one node for each residence and one base station, located about 25m from the other nodes. Many parameters, such as packet loss, throughput, delay, jitter and energy consumption were tested.  The network was increased to 78 and 93 nodes in order to evaluate the behavior of the protocols in larger networks. The tests proved that the HTR is the routing protocol that has the best results in performance and second best in energy consumption. The DSDV had the worst performance according to the tests.Key words.- Smart grid, QoS analysis, Wireless sensor networks, Routing protocols.RESUMENEste trabajo tiene como objetivo estudiar el protocolo de enrutamiento de la red de sensores inalámbricos es más adecuado para aplicaciones de redes inteligentes, a través de la simulación de protocolos AODV, AOMDV, DSDV y HTR en el entorno de simulación NS2. Se simuló una red basada en una zona residencial con 47 residencias, con un nodo para cada residencia y una estación base, situada a unos 25 metros de los otros nodos. Muchos parámetros, tales como la pérdida de paquetes, rendimiento, retardo, jitter y el consumo de energía se probaron. La red se incrementó a 78 y 93 nodos con el fin de evaluar el comportamiento de los protocolos de redes más grandes. Las pruebas demostraron que el HTR es el protocolo de enrutamiento que tiene los mejores resultados en el rendimiento y el segundo mejor en el consumo de energía. El DSDV tuvo el peor desempeño de acuerdo a las pruebas.Palabras clave.- redes inteligentes, análisis de calidad de servicio, redes de sensores inalámbricas, protocolos de enrutamiento.


2013 ◽  
Vol 347-350 ◽  
pp. 975-979
Author(s):  
Rong Zhao ◽  
Cai Hong Li ◽  
Yun Jian Tan ◽  
Jun Shi ◽  
Fu Qiang Mu ◽  
...  

This paper presents a Debris Flow Disaster Faster-than-early Forecast System (DFS) with wireless sensor networks. Debris flows carrying saturated solid materials in water flowing downslope often cause severe damage to the lives and properties in their path. Faster-than-early or faster-than-real-time forecasts are imperative to save lives and reduce damage. This paper presents a novel multi-sensor networks for monitoring debris flows. The main idea is to let these sensors drift with the debris flow, to collect flow information as they move along, and to transmit the collected data to base stations in real time. The Raw data are sent to the cloud processing center from the base station. And the processed data and the video of the debris flow are display on the remote PC. The design of the system address many challenging issues, including cost, deployment efforts, and fast reaction.


2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Chin-Ling Chen ◽  
Chih-Cheng Chen ◽  
De-Kui Li

In recent years, wireless sensor network (WSN) applications have tended to transmit data hop by hop, from sensor nodes through cluster nodes to the base station. As a result, users must collect data from the base station. This study considers two different applications: hop by hop transmission of data from cluster nodes to the base station and the direct access to cluster nodes data by mobile users via mobile devices. Due to the hardware limitations of WSNs, some low-cost operations such as symmetric cryptographic algorithms and hash functions are used to implement a dynamic key management. The session key can be updated to prevent threats of attack from each communication. With these methods, the data gathered in wireless sensor networks can be more securely communicated. Moreover, the proposed scheme is analyzed and compared with related schemes. In addition, an NS2 simulation is developed in which the experimental results show that the designed communication protocol is workable.


2017 ◽  
Vol 13 (05) ◽  
pp. 122 ◽  
Author(s):  
Bo Feng ◽  
Wei Tang ◽  
Guofa Guo

In wireless sensor networks, the nodes around the base station have higher energy consumption due to the forwarding task of all the detected data. In order to balance the energy consumption of the nodes around the base station, a reasonable and effective mechanism of node rotation dormancy is put forward. In this way, a large number of redundant nodes in the network are in a dormant state, so as to reduce the load of important nodes around the base station. The problems of the redundant nodes in the sensor network are analyzed, and a new method is proposed to distinguish the redundant nodes based on local Delaunay triangulation and multi node election dormancy mechanism. The experimental results showed that this method could effectively distinguish the redundant nodes in the network; at the same time, through the multi round election mechanism, parts of redundant nodes are made dormant. In summary, they can reduce the network energy consumption on the condition of guaranteeing the original coverage.


2017 ◽  
Vol 13 (04) ◽  
pp. 45 ◽  
Author(s):  
Liping LV

<p class="0abstract"><span lang="EN-US">Wireless sensor network is a new field of computer science and technology research. It has a very broad application prospects. In order to improve the network survival time, it is very important to design efficient energy-constrained routing protocols. In this paper, we studied the characteristics of wireless sensor networks, and analyzed the design criteria of sensor network routing algorithms. In view of the shortcomings of traditional algorithms, we proposed an energy-aware multi-path algorithm. When selecting a data transmission path, the energy-aware multi-path algorithm can avoid nodes with low energy levels. At the same time, it takes the remaining energy of the node and the number of hops as one of the measures of the path selection. The multi-path routing algorithm realized the low energy consumption of the data transmission path, thus effectively prolonging the network lifetime. Compared with the traditional algorithm, the results show that our method has high reliability and energy efficiency.</span></p>


2017 ◽  
Vol 10 (34) ◽  
pp. 1-6
Author(s):  
R. Deepthi ◽  
D. Sai Eswari ◽  
Afreen Rafiq ◽  
K. Srinivas ◽  
◽  
...  

Sign in / Sign up

Export Citation Format

Share Document