Energy Saving Routing Protocol of Wireless Sensor Network by Using Particle Swarm Optimization Algorithm

2014 ◽  
Vol 986-987 ◽  
pp. 2113-2117
Author(s):  
Run Liu Wang ◽  
Yun Hui Yi

The utilization efficiency of energy is an important performance index of designing WSN routing protocol. This paper put forward an improved energy saving routing algorithm LPSOA based on LEACH, which improves the cluster head election method of LEACH algorithm. It firstly divides the entire network into multiple child regions by using the good convergence and global optimization ability of particle swarm algorithm, and then elects the cluster head by considering the residual energy of node in the child area. The experiment results show that compared with the classical routing protocol LEACH, the protocol can more effectively balance the network load and improve the utilization of energy, prolong the network lifetime.

2014 ◽  
Vol 519-520 ◽  
pp. 1214-1219
Author(s):  
Yong Chao Liu ◽  
Yue Xia Zhang ◽  
Min Miao

It is especially important to save energy and prolong the network lifetime because the WSN nodes energy is limited. Optimizing the routing algorithm for WSN is one of the important ways to reduce energy consumption. LEACH routing protocol is the first cluster-based routing protocol for wireless sensor networks. But LEACH have some deficiencies, such as agreement of uneven clustering, the nodes energy imbalance, frequent clustering and consume too much energy. The paper proposes an improved LEACH protocol to solve the above problem. It takes the residual energy of the nodes into account when nodes selected the cluster-head so that the nodes that hold high-energy have the high possibility to be selected as cluster-head. The improved algorithm uses the incomplete clustering which does not need to cluster every round but interval cluster. Simulation results show that the improved LEACH protocol effectively increases the nodes energy utilization and extends the network lifetime.


2012 ◽  
Vol 241-244 ◽  
pp. 1028-1032
Author(s):  
Li Wang ◽  
Qi Lin Zhu

In recent years, as the development of wireless sensor network, people do some deep researches on cluster-based protocol, most around the prolongation of the lifetime of WSN and decline of energy consumed by the sensors. This paper analyses of classical clustering routing protocol based on LEACH, aiming at the node energy foot presents energy improved clustering routing algorithm, the random cluster head selection algorithm of threshold to be changed, lowering the threshold, in the original threshold increases the node's remaining energy factor, reduces the communication load of cluster nodes, and simulation. The simulation results show that the LEACH-E improved algorithm, energy saving, reducing balance node energy consumption, effectively prolongs the network lifetime.


Author(s):  
M. B. Shyjith ◽  
C. P. Maheswaran ◽  
V. K. Reshma

WSN is comprised of sensor nodes that sense the data for various applications. The nodes are employed for transmitting sensed data to BS through intermediate nodes or the cluster heads in multi-hop environment. Erroneous selection of CHs may lead to large energy consumption and thereby degrades system performance. Hence, an effective technique was developed by proposing Rider-ASO for secure-aware multipath routing in the WSN. The proposed routing protocol offers security to the network concerning various trust factors. Initially, cluster head selection is done using RCSO. Then, the trust values of the cluster heads that are selected is computed to ensure security while routing. For the multipath routing, proposed Rider-ASO is developed by combining ASO and ROA. Thus, the proposed algorithm finds multiple secured paths from the source into destination based on selected CHs. The developed Rider-ASO outperformed other methods with minimal delay of 0.009 sec, maximal average residual energy 0.5494 J, maximal PDR of 97.82%, maximal throughput rate of 96.07%, respectively.


2017 ◽  
Vol 13 (07) ◽  
pp. 100
Author(s):  
Yecong He ◽  
Min Tan

<p><span style="font-family: 宋体;">Considering the indoor temperature monitoring and energy saving control technology, based on the traditional low energy adaptive clustering hierarchy (LEACH), a multi-hop clustering routing algorithm is proposed. By adding a threshold in LEACH, the algorithm makes the nodes with high residual energy and high nodes become cluster heads. The results show that the improved algorithm can effectively prolong the life cycle of wireless sensor networks. Based on above findings, it is concluded that the proposed algorithm can save the system energy and improve the network energy efficiency.</span></p>


Sensors ◽  
2020 ◽  
Vol 20 (10) ◽  
pp. 2760 ◽  
Author(s):  
Karim Fathallah ◽  
Mohamed Abid ◽  
Nejib Ben Hadj-Alouane

Internet of things (IoT) for precision agriculture or Smart Farming (SF) is an emerging area of application. It consists essentially of deploying wireless sensor networks (WSNs), composed of IP-enabled sensor nodes, in a partitioned farmland area. When the surface, diversity, and complexity of the farm increases, the number of sensing nodes increases, generating heavy exchange of data and messages, and thus leading to network congestion, radio interference, and high energy consumption. In this work, we propose a novel routing algorithm extending the well known IPv6 Routing Protocol for Low power and Lossy Networks (RPL), the standard routing protocol used for IPv6 over Low-Power Wireless Personal Area Networks (6LoWPAN). It is referred to as the Partition Aware-RPL (PA-RPL) and improves the performance of the standard RPL. In contrast to RPL, the proposed technique builds a routing topology enabling efficient in-network data aggregation, hence dramatically reducing data traffic through the network. Performance analysis of a typical/realistic precision agriculture case, considering the potato pest prevention from the well-known late blight disease, shows that PA-RPL improves energy saving up to 40 % compared to standard RPL.


2011 ◽  
Vol 230-232 ◽  
pp. 377-383 ◽  
Author(s):  
An Xin Ye ◽  
Jian Bin Wu

Unicast routing service is becoming a important requirement of computer networks supporting multimedia applications. And unicast routing problem has been demonstrated technically as a NP-complete. This paper proposes a novel QoS-based unicast routing algorithm using the Chaotic Particle Swarm Optimization algorithm (CPSO).The algorithm enhance the global searching ability when some particles have trapped in local minimums by chaotic series .The novel algorithm makes use of the ergodicity of chaotic search to improve the capability of precise search and keep the balance between the global search and the local search. The result of QoS shows that the CPSO algorithm has the advantage over the conventional algorithms in efficiency.


2016 ◽  
Vol 2016 ◽  
pp. 1-9
Author(s):  
Mingchuan Zhang ◽  
Ruijuan Zheng ◽  
Ying Li ◽  
Qingtao Wu ◽  
Liang Song

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.


2013 ◽  
Vol 787 ◽  
pp. 1050-1055 ◽  
Author(s):  
Zhi Gui Lin ◽  
Hui Qi Zhang ◽  
Xu Yang Wang ◽  
Fang Qin Yao ◽  
Zhen Xing Chen

To the disadvantages, such as high energy consumption and the energy consumption imbalance, we proposed an energy-efficient routing protocol on mobile sink (MSEERP) in this paper. In the MSEERP, the network is divided into several square virtual grids based on GAF, each grid is called a cluster, and the cluster head election method of GAF is improved. In addition, the MSEERP introduces a mobile sink in the network, the sink radios in limited number of hops and uses control moving strategy, namely the sink does not collect the information until it moves to a cluster with highest residual energy. We applied NS2 to evaluate its performance and analyze the simulation results by the energy model. Simulation results show that the MSEERP balances the energy consumption of the network, saves nodes energy and extends the network lifetime.


Sign in / Sign up

Export Citation Format

Share Document