The Research of Routing Algorithm Based on Shortest Path Tree in WSNs

2013 ◽  
Vol 347-350 ◽  
pp. 3899-3902
Author(s):  
Yu Hua Liu ◽  
Zhen Rong Luo ◽  
Ke Xu ◽  
Cui Xu

This article poses an algorithm of the hierarchical topology in wireless sensor network based on shortest path tree algorithm to cover the shortage of LAC Routing Algorithm (LAC-T), which based on SPT(Shortest Path Tree). LAC-T algorithm elects cluster head by the remaining energy of nodes and the distance between node and base station. Meanwhile, it uses SPT to communicate among cluster heads in WSNs. The result of stimulation shows that LAC-T algorithm is not only easy to achieve, but could be better balance the energy consumption of each node, extend the lifespan of WSN (Wireless Sensor Network).

2013 ◽  
Vol 765-767 ◽  
pp. 980-984
Author(s):  
Xi Rong Bao ◽  
Jia Hua Xie ◽  
Shuang Long Li

This article focused on the energy limit property of Wireless Sensor Network, and proposed a residual energy based algorithm WN-LEACH, with the classic network mode of LEACH routing algorithm. The algorithm combines the proportion of residual energy in the total energy with the cumulative number of the normal nodes supported by the cluster heads as a cluster selection reference. In order to balance the energy consumption of each cluster-head, the algorithm took both the different positions of the base station and the initial energy of the network into consideration, and weighted the two factors to balance the energy consumption between transmitting the signals and data fusion. Simulation results show that the algorithm can promote the lifetime of the uneven energy network and does not impair the effects of the LEACH algorithm.


2020 ◽  
Author(s):  
Hamid Reza Farahzadi ◽  
Mostafa Langarizadeh ◽  
Mohammad Mirhosseini ◽  
Seyed Ali Fatemi Aghda

AbstractWireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time.


2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zuo Chen ◽  
Min He ◽  
Wei Liang ◽  
Kai Chen

Wireless sensor network (WSN) is a kind of distributed and self-organizing networks, in which the sensor nodes have limited communication bandwidth, memory, and limited energy. The topology construction of this network is usually vulnerable when attacked by malicious nodes. Besides, excessive energy consumption is a problem that can not be ignored. Therefore, this paper proposes a secure topology protocol of WSN which is trust-aware and of low energy consumption, called TLES. The TLES considers the trust value as an important factor affecting the behavior of node. In detail, the TLES would take trust value, residual energy of the nodes, and node density into consideration when selecting cluster head nodes. Then, TLES constructs these cluster head nodes by choosing the next hop node according to distance to base station (BS), nodes’ degrees, and residual energy, so as to establish a safe, reliable, and energy saving network. Experimental results show that the algorithm can effectively isolate the malicious node in the network and reduce the consumption of energy of the whole network.


Author(s):  
Funom Samuel Dadah ◽  
Ajayi Ore-Ofe ◽  
Aliyu D Usman ◽  
Y A Mshelia ◽  
M O Babatunde

Owing to the limited energy of sensor nodes (SNs) in a wireless sensor network (WSN), it is important to reduce and balance the energy consumption of the SNs in order to extend the WSN lifetime. Clustering mechanism is a highly efficient and effective mechanism for minimizing the amount of energy that SNs consume during the transmission of data packets. In this paper, an election energy threshold based multi-hop routing protocol (mEEMRP) is presented. In order to minimize energy consumption, this routing protocol uses grid clustering, where the network field is divided into grid clusters. SNs in each grid cluster select a cluster head (CH) based on a weight factor that takes the node location, node’s residual energy (RE) as well as the node’s distance from the base station into consideration. An energy efficient multi-hop routing algorithm is adopted during the transmission of data packets from the cluster heads (CHs) to the base station (BS). This multi-hop routing algorithm uses an election energy threshold value, T­nhCH that takes into consideration the RE of CHs as well as the distance between CHs. Simulation results show a 1.77% and 10.65% improvement in terms of network lifetime for two network field scenarios over Energy Efficient Multi-hop Routing Protocol (EEMRP).


Author(s):  
Mohammad Sedighimanesh ◽  
Hesam Zandhesami ◽  
Ali Sedighimanesh

Background: Wireless sensor networks are considered as one of the 21st century's most important technologies. Sensors in wireless sensor networks usually have limited and sometimes non-rechargeable batteries, which they are supposed to be preserved for months or even years. That's why the energy consumption in these networks is of a great importance. Objective: One way to improve energy consumption in a wireless sensor network is to use clustering. In clustered networks, one node is known as the cluster head and other nodes as normal members, which normal nodes send the collected data to the cluster head, and the cluster head sends the information to the base station either by a single step or by multiple steps. Method: Using clustering simplifies resource management and increases scalability, reliability, and the network lifetime. Although the cluster formation involves a time- overhead and how to choose the cluster head is another problem, but its advantages are more than its disadvantages. : The primary aim of this study is to offer a solution to reduce energy consumption in the sensor network. In this study, during the selection of cluster heads, Honeybee Algorithm is used and also for routing, Harmonic Search Algorithm is used. In this paper, the simulation is performed by using MATLAB software and the proposed method is compared with the Low Energy Adaptive Clustering Hierarchy (LEACH) and the multi-objective fuzzy clustering algorithm (MOFCA). Result and Conclusion: By simulations of this study, we conclude that this research has remarkably increased the network lifetime with respect to EECS, LEACH, and MOFCA algorithms. In view of the energy constraints of the wireless sensor network and the non-rechargeable batteries in most cases, providing such solutions and using metaheuristic algorithms can result in a significant reduction in energy consumption and, consequently, increase in the network lifetime.


2022 ◽  
Vol 2022 ◽  
pp. 1-11
Author(s):  
Yue Zhao

Based on the principle of cluster wireless sensor network, this article introduces typical routing protocols in wireless sensors, and wireless sensor network protocol in detail analyzes their advantages and disadvantages and addresses their shortcomings. First, in the clustering network, a uniform clustering protocol with multiple hops in the circular network is proposed. The circular network is divided into rings of equal width, and clusters of equal size are set on different rings. Secondly, the ordinary nodes on each layer of the ring send the collected data to the auxiliary intelligent nodes in the cluster in a single-hop manner, and the auxiliary intelligent nodes located on the outer ring transfer the data to the auxiliary intelligent nodes located on the adjacent inner ring. Finally, on the basis of studying the clustering network protocol, this paper proposes a new clustering routing algorithm, a multihop adaptive clustering routing algorithm. The simulation results show that the algorithm can effectively extend the life of the network, save network energy consumption, and achieve network load balance. At the same time, the initial energy of the auxiliary intelligent node is set according to the energy consumption of the ordinary node and the relative distance between the auxiliary intelligent node and the base station on each layer of the ring. The theoretical and simulation results prove that, compared with the clustered network and auxiliary intelligent nodes, the clustered network can extend the life of the network.


Robust and efficient algorithms for routing and other process for a wireless sensor network are under active development due to technological advancements on wireless transmission systems. Each of the sensor nodes in a wireless sensor network either transmits or forwards the data packets to the base station. The main objective of the majority of the work in the literature is to save the energy consumption efficiently. The cluster based routing mechanism helps to achieve low energy consumption within the network. The network organizes its nodes as a cluster and selects a particular node as cluster head to manage the transmission within and between clusters. The majority of the clustering approach selects the cluster head using a thresholding based approach. Nodes having energy level higher than the threshold are the candidates for the cluster head selection. In the proposed approach the nodes remaining energy and the sum of distance between individual nodes to the cluster head node is considered. Optimal cluster head selection will help to increase the overall life time of the network. The distance between the sensor nodes is estimated using RSSI (Received Signal Strength Indicator) and other parameters measured from the physical layer. Experiments are conducted with simulation environment created with the NS-2 simulator and efficiency of the approach is analyzed in detail.


2018 ◽  
Vol 232 ◽  
pp. 04050
Author(s):  
Yong-wen Du ◽  
Zhang-min Wang ◽  
Gang Cai ◽  
Jun-hui Gong

In order to solve the problem of unbalanced load consumption of nodes for wireless sensor networks (WSNs), this paper proposes a load-balanced routing algorithm based on cluster heads optimization for wireless sensor network. The proposed algorithm first applies first-order wireless transmission model to calculate the optimal number of clusters, then calculate nodes competitiveness rating by fuzzy algorithm considering the residual energy of node and distance from the node to base station, cluster head selection uses unequal clustering algorithm according to the competitiveness of nodes. By node competitiveness and energy management mechanism which cooperate with each other to select the best cluster heads. Use connected optimization between clusters to search multi-hop paths base station for reducing energy consumption of node, and consider transmission energy consumption, residual energy, transmission distance and other factors. The experimental results show that the proposed algorithm compared with LEACH and UCDP algorithm, can balance loading and effectively extend the life cycle of wireless sensor network.


2018 ◽  
Vol 7 (2.27) ◽  
pp. 138
Author(s):  
Kamini Joshi ◽  
Sandeep Singh Kang

The wireless sensor network is the decentralized type of network which can sense information and pass it to base station. The energy consumption is the major issue of WSN due to small of sensor nodes and far deployment of the network. The clustering is the efficient approach to increase lifetime of the sensor network. In the approach of clustering cluster head are selected for the data aggregation. The fuzzy logic rules are derived based on node energy, distance to base station for the cluster head selection, which increase lifetime of sensor nodes in the existing system. In this research work, cache nodes are deployed in the network which reduce energy consumption of WSN. In the proposed approach cluster head send data to cache nodes and it will forward data to base station. The simulation is performed in MATLAB and proposed technique performs well in terms of number of packets transmitted, number of dead nodes, network lifetime, throughput and remaining energy.  


Author(s):  
D. CHARANYA ◽  
G. V. UMA

A Wireless Sensor Network is a collection of sensor nodes distributed into a network to monitor the environmental conditions and send the sensed data to the Base Station. Wireless Sensor Network is one of the rapidly developing area in which energy consumption is the most important aspect to be considered while tracking, monitoring, reporting and visualization of data. An Energy Efficient Prediction-based Clustering algorithm is proposed to track the moving object in wireless sensor network. This algorithm reduces the number of hops between transmitter and receiver nodes and also the number of transmitted packets. In this method, the sensor nodes are statically placed and clustered using LEACH-R algorithm. The Prediction based clustering algorithm is applied where few nodes are selected for tracking which uses the prediction mechanism to predict the next location of the moving object. The Current Location of the target is found using Trilateration algorithm. The Current Location or Predicted Location is sent to active Cluster Head from the leader node or the other node. Based on which node send the message to the Cluster Head, the Predicted or Current Location will be sent to the base station. In real time, the proposed work is applicable in traffic tracking and vehicle tracking. The experiment is carried out using Network Stimulator-2 environment. Simulation result shows that the proposed algorithm gives a better performance and reduces the energy consumption.


Sign in / Sign up

Export Citation Format

Share Document