Cluster-Head and Border-Node Based Cluster Routing Protocol for LR-WPAN

2016 ◽  
Author(s):  
Ying Huang ◽  
Hongli Ge ◽  
Jangsu Lee ◽  
Yuehua Dai ◽  
Dong Xu ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Cluster Head ◽  
Border Node

scholarly journals EZ-SEP: Extended Z-SEP Routing Protocol with Hierarchical Clustering Approach for Wireless Heterogeneous Sensor Network

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1021
Author(s):  
Zhanserik Nurlan ◽  
Tamara Zhukabayeva ◽  
Mohamed Othman
Keyword(s):  
Sensor Network ◽  
Hierarchical Clustering ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Cluster Head ◽  
Average Power ◽  
Base Station ◽  
Average Power Consumption ◽  
Clustering Approach ◽  
Heterogeneous Sensor Network

Wireless sensor networks (WSN) are networks of thousands of nodes installed in a defined physical environment to sense and monitor its state condition. The viability of such a network is directly dependent and limited by the power of batteries supplying the nodes of these networks, which represents a disadvantage of such a network. To improve and extend the life of WSNs, scientists around the world regularly develop various routing protocols that minimize and optimize the energy consumption of sensor network nodes. This article, introduces a new heterogeneous-aware routing protocol well known as Extended Z-SEP Routing Protocol with Hierarchical Clustering Approach for Wireless Heterogeneous Sensor Network or EZ-SEP, where the connection of nodes to a base station (BS) is done via a hybrid method, i.e., a certain amount of nodes communicate with the base station directly, while the remaining ones form a cluster to transfer data. Parameters of the field are unknown, and the field is partitioned into zones depending on the node energy. We reviewed the Z-SEP protocol concerning the election of the cluster head (CH) and its communication with BS and presented a novel extended mechanism for the selection of the CH based on remaining residual energy. In addition, EZ-SEP is weighted up using various estimation schemes such as base station repositioning, altering the field density, and variable nodes energy for comparison with the previous parent algorithm. EZ-SEP was executed and compared to routing protocols such as Z-SEP, SEP, and LEACH. The proposed algorithm performed using the MATLAB R2016b simulator. Simulation results show that our proposed extended version performs better than Z-SEP in the stability period due to an increase in the number of active nodes by 48%, in efficiency of network by the high packet delivery coefficient by 16% and optimizes the average power consumption compared to by 34.

Research and Improvement about LEACH Routing Protocol for Wireless Sensor Networks

2012 ◽  
Vol 241-244 ◽  
pp. 1028-1032
Author(s):  
Li Wang ◽  
Qi Lin Zhu
Keyword(s):  
Routing Protocol ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Cluster Head Selection ◽  
Selection Algorithm ◽  
Energy Factor ◽  
Random Cluster ◽  
Simulation Results ◽  
Node Energy

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.

scholarly journals Proficient Car Parking System Based on Cluster Head Routing Protocol Utilizing IEEE 802.15.4

2016 ◽  
Vol 12 (06) ◽  
pp. 58
Author(s):  
Razi Iqbal ◽  
Sharif Arif ◽  
H.H.R Sherazi
Keyword(s):  
Communication Technology ◽  
Routing Protocol ◽  
Ieee 802.15.4 ◽  
Low Cost ◽  
Cluster Head ◽  
Power Efficient ◽  
Proposed Model ◽  
Efficient Communication ◽  
Parking System ◽  
The Coordinator

The paper discusses a proposed model for car parking system based on cluster head routing protocol utilizing a low cost and power efficient communication technology, ZigBee (IEEE 802.15.4). The model is designed in a way that car parking is divided into different clusters and each cluster has a head which acts a messenger for transmitting information to other heads and the coordinator of the network. Each cluster head is a ZigBee Host (Router) which collects the information of car presence in the parking slot. This information is then passed to the coordinator of the network which is used to display the information of available parking slots in a specific car parking area. Since there is only one coordinator in the network, so heads can transmit information to the coordinator using multi-hop communication if direct communication is not possible. Several simulations were performed to gauge the efficiency of the proposed model, and results show that the proposed model is reliable in communication and efficient in its operation.

Secure-Aware Multipath Routing Using Atom Search Rider Optimization Algorithm in Wireless Sensor Networks

2021 ◽  
Vol 12 (2) ◽  
pp. 36-55
Author(s):  
M. B. Shyjith ◽  
C. P. Maheswaran ◽  
V. K. Reshma
Keyword(s):  
Routing Protocol ◽  
Multipath Routing ◽  
Cluster Head ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Throughput Rate ◽  
Cluster Heads ◽  
Average Residual ◽  
Maximal Average ◽  
Selection Of

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.

scholarly journals A PSO-Based Uneven Dynamic Clustering Multi-Hop Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Energy Efficient Routing

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.

scholarly journals Energy-Efficient Unequal Chain Length Clustering for Wireless Sensor Networks in Smart Cities

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Mohammad Baniata ◽  
Jiman Hong
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Chain Length ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Smart Cities ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor

The recent advances in sensing and communication technologies such as wireless sensor networks (WSN) have enabled low-priced distributed monitoring systems that are the foundation of smart cities. These advances are also helping to monitor smart cities and making our living environments workable. However, sensor nodes are constrained in energy supply if they have no constant power supply. Moreover, communication links can be easily failed because of unequal node energy depletion. The energy constraints and link failures affect the performance and quality of the sensor network. Therefore, designing a routing protocol that minimizes energy consumption and maximizes the network lifetime should be considered in the design of the routing protocol for WSN. In this paper, we propose an Energy-Efficient Unequal Chain Length Clustering (EEUCLC) protocol which has a suboptimal multihop routing algorithm to reduce the burden on the cluster head and a probability-based cluster head selection algorithm to prolong the network lifetime. Simulation results show that the EEUCLC mechanism enhanced the energy balance and prolonged the network lifetime compared to other related protocols.

Sign in / Sign up

Export Citation Format

Share Document