scholarly journals An Intelligent Vice Cluster Head Election Protocol in WSN

Author(s):  
Ghassan Samara ◽  
Mohammad Hassan ◽  
Yahya Zayed

Wireless sensor networks (WSNs) has a practical ability to link a set of sensors to build a wireless network that can be accessed remotely; this technology has become increasingly popular in recent years. Wi-Fi-enabled sensor networks (WSNs) are used to gather information from the environment in which the network operates. Many obstacles prevent wireless sensor networks from being used in a wide range of fields. This includes maintaining network stability and extending network life. In a wireless network, sensors are the most essential component. Sensors are powered by a battery that has a finite amount of power. The battery is prone to power loss, and the sensor is therefore rendered inoperative as a result. In addition, the growing number of sensor nodes off-site affects the network's stability. The transmission and reception of information between the sensors and the base consumes the most energy in the sensor. An Intelligent Vice Cluster Head Selection Protocol is proposed in this study (IVC LEACH). In order to achieve the best performance with the least amount of energy consumption, the proposed hierarchical protocol relies on a fuzzy logic algorithm using four parameters to calculate the value of each node in the network and divides them into three hierarchical levels based on their value. This improves network efficiency and reliability while extending network life by 50 percent more than the original Low Energy Adaptive Clustering Hierarchy protocol. Keywords: Wireless Sensor Networks, Sensors, Communication Protocol, Fuzzy logic, Leach protocol.

2017 ◽  
Vol 7 (1.5) ◽  
pp. 111
Author(s):  
S. Ramakrishnan ◽  
S. Prayla Shyry

Wireless sensor networks (WSNs) is considered as the predominant technology due to their high suitability and adaptability that makes it possible to be deployed in wide range of applications like civil and military domain. But energy-constraint is the significant feature that needs to be addressed for sensor networks since energy drain of sensor nodes affects network lifetime, stability and co-operation of sensor nodes in the event of enforce reliable data dissemination. Cluster head election has to been performed periodically in order to handle energy balance for facilitating reliable packet delivery. Most of the cluster head election schemes of the literature elect a node as cluster head either randomly or by elucidating their stochastic probabilities. Hence a Distributed Fuzzy Logic based Cluster Head Election Scheme (DFLCHES) that discriminates and discards packets from the sensor nodes that has the least probability of being elected as cluster head is proposed. DFLCHES utilizes five significant parameters such as trust, energy, node density, hop count and centrality measure for quantifying the probability of cluster head election. This DFLCHES is run on each neighbor nodes of the cluster members to facilitate the action of discrimination. DFLCHES also balances the energy consumption of the cluster members during transmission as it discards packets from ineligible nodes. Further the action of cluster head election has to be optimized periodically for reducing and balancing energy consumption for prolonging the network lifetime. In DFLCHES, the process of optimizing cluster head depends on the incorporation of the concept of Genetic algorithms for enabling and ensuring reliable routing.


Fault Tolerant Reliable Protocol (FTRP) is proposed as a novel routing protocol designed for Wireless Sensor Networks (WSNs). FTRP offers fault tolerance reliability for packet exchange and support for dynamic network changes. The key concept used is the use of node logical clustering. The protocol delegates the routing ownership to the cluster heads where fault tolerance functionality is implemented. FTRP utilizes cluster head nodes along with cluster head groups to store packets in transient. In addition, FTRP utilizes broadcast, which reduces the message overhead as compared to classical flooding mechanisms. FTRP manipulates Time to Live values for the various routing messages to control message broadcast. FTRP utilizes jitter in messages transmission to reduce the effect of synchronized node states, which in turn reduces collisions. FTRP performance has been extensively through simulations against Ad-hoc On-demand Distance Vector (AODV) and Optimized Link State (OLSR) routing protocols. Packet Delivery Ratio (PDR), Aggregate Throughput and End-to-End delay (E-2-E) had been used as performance metrics. In terms of PDR and aggregate throughput, it is found that FTRP is an excellent performer in all mobility scenarios whether the network is sparse or dense. In stationary scenarios, FTRP performed well in sparse network; however, in dense network FTRP’s performance had degraded yet in an acceptable range. This degradation is attributed to synchronized nodes states. Reliably delivering a message comes to a cost, as in terms of E-2-E. results show that FTRP is considered a good performer in all mobility scenarios where the network is sparse. In sparse stationary scenario, FTRP is considered good performer, however in dense stationary scenarios FTRP’s E-2-E is not acceptable. There are times when receiving a network message is more important than other costs such as energy or delay. That makes FTRP suitable for wide range of WSNs applications, such as military applications by monitoring soldiers’ biological data and supplies while in battlefield and battle damage assessment. FTRP can also be used in health applications in addition to wide range of geo-fencing, environmental monitoring, resource monitoring, production lines monitoring, agriculture and animals tracking. FTRP should be avoided in dense stationary deployments such as, but not limited to, scenarios where high application response is critical and life endangering such as biohazards detection or within intensive care units.


2016 ◽  
Vol 2016 ◽  
pp. 1-11 ◽  
Author(s):  
Asmaa Ez-Zaidi ◽  
Said Rakrak

Wireless sensor networks have been the subject of intense research in recent years. Sensor nodes are used in wide range of applications such as security, military, and environmental monitoring. One of the most interesting applications in wireless sensor networks is target tracking, which mainly consists in detecting and monitoring the motion of mobile targets. In this paper, we present a comprehensive survey of target tracking approaches. We then analyze them according to several metrics. We also discuss some of the challenges that influence the performance of tracking schemes. In the end, we conduct detailed analysis and comparison between these algorithms and we conclude with some future directions.


Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).


Author(s):  
C. R. Bharathi ◽  
Alapati Naresh ◽  
Arepalli Peda Gopi ◽  
Lakshman Narayana Vejendla

In wireless sensor networks (WSN), the majority of the inquiries are issued at the base station. WSN applications frequently require collaboration among countless sensor nodes in a network. One precedent is to persistently screen a region and report occasions. A sensor node in a WSN is initially allocated with an energy level, and based on the tasks of that sensor node, energy will be reduced. In this chapter, two proposed methods for secure network cluster formation and authentication are discussed. When a network is established then all the nodes in it must register with cluster head and then authentication is performed. The selection of cluster head is done using a novel selection algorithm and for authenticating the nodes. Also, a novel algorithm for authentication is used in this chapter. The validation and authorization of nodes are carried over by managing the keys in WSN. The results have been analyzed using NS2 simulator with an aid of list of relevant parameters.


IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 185816-185829
Author(s):  
Asmaa Mohamed ◽  
Walaa Saber ◽  
Ibrahim Elnahry ◽  
Aboul Ella Hassanien

2017 ◽  
Vol 2017 ◽  
pp. 1-12 ◽  
Author(s):  
Mohammad Baniata ◽  
Jiman Hong

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