In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Various Clustering Techniques in Wireless Sensor NetworkEditor IJCATR
This document describes the various clustering techniques used in wireless sensor networks. Wireless sensor networks are
having vast applications in all fields which utilize sensor nodes. Clustering techniques are required so that sensor networks can
communicate in most efficient way.
SECTOR TREE-BASED CLUSTERING FOR ENERGY EFFICIENT ROUTING PROTOCOL IN HETEROG...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease...IJCSEA Journal
Decrease energy consumption and maximizing network lifetime are important parameters in designing and protocols for wireless sensor network (WSN).Clustering is one of the efficient methods in energy consumption by Cluster-Head in WSN. Besides, CH can process and aggregate data sent by cluster members, thus reducing network traffic for sending data to sink. In this paper presents a new cluster routing algorithm by dividing network into grids. In each grid computes the center-gravity and threshold of energy for selecting the node that has the best condition base on these parameters in grid for selecting Cluster-Head in current round, also SLGC selecting Cluster-Heads for next rounds thereby this CHs reduce the volume of controlling messages for next rounds and inform nodes for sending data into CH of respective round. This algorithm prolong network lifetime and decrease energy consumption by selecting CH in grid and sending data of grid to sink by this CH. Result of simulation shows that SLGC algorithm in comparison with the previous clustering algorithm has maximizing network lifetime and decrease energy consumption in network.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
In the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Energy Consumption Reduction in Wireless Sensor Network Based on ClusteringIJCNCJournal
ABSTRACT
One of the important issues in the routing protocol design in Wireless Sensor Networks (WSNs) is minimizing energy consumption and maximizing network lift time. Nowadays networks and information systems are one of the main parts of modern life that without them, people cannot live. On the hand, the impairment of these networks leads to great and incalculable costs. In this paper, a new method based on clustering has presented that problem of energy consumption is solved. The proposed algorithm is that energy-based clustering can create clusters of the same energy level and distribute energy efficiency across the WNS nodes. This proposed clustering protocol classify network nodes based on energy and neighbourhood criteria and attempts to better balance energy in clusters and ultimately increase network lifetime and maintain network coverage. Results are shown that the proposed algorithm is on average 40% better than LEACH algorithm and 14% better than IBLEACH algorithm.
KEYWORDS
Wireless Sensor Network, Clustering, LEACH Algorithm, IBLEACH Algorithm
Abstract Link : http://aircconline.com/abstract/ijcnc/v11n2/11219cnc03.html
Full Details : http://aircconline.com/ijcnc/V11N2/11219cnc03.pdf
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksCSCJournals
A wireless sensor network (WSN) consists of large number of sensor nodes where each node operates by a finite battery for sensing, computing, and performing wireless communication tasks. Energy aware routing and MAC protocols were proposed to prolong the lifetime of WSNs. MAC protocols reduce energy consumption by putting the nodes into sleep mode for a relatively longer period of time; thereby minimizing collisions and idle listening time. On the other hand, efficient energy aware routing is achieved by finding the best path from the sensor nodes to the Base Sta-tion (BS) where energy consumption is minimal. In almost all solutions there is always a tradeoff between power consumption and delay reduction. This paper presents an improved hierarchical coordination for data gathering (HCDG) routing schema for WSNs based on multi-level chains formation with data aggregation. Also, this paper provides an analytical model for energy consumption in WSN to compare the performance of our proposed HCDG schema with the near optimal energy reduction methodology, PEGASIS. Our results demonstrate that the proposed routing schema provides relatively lower energy consumption with minimum delay for large scale WSNs.
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical
issue that degrades the network performance. Recharging and providing security to the sensor devices is
very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an
important and suitable approach to increase energy efficiency and transmitting secured data which in turn
enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC)
works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the
rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the
network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on
the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all
the cluster heads are formed at a time and selected on rotation based on considering the highest energy of
the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum
flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access
(CSMA), a contention window based protocol is used at the MAC layer for collision detection and to
provide channel access prioritization to HWSN of different traffic classes with reduction in End to End
delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the
cluster head for transmission without depleting the energy. Simulation parameters of the proposed system
such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing
system.
Sector Tree-Based Clustering for Energy Efficient Routing Protocol in Heterog...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
A CLUSTER-BASED ROUTING PROTOCOL AND FAULT DETECTION FOR WIRELESS SENSOR NETWORKIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be
deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a
consequence, the main goal is to reduce the overall energy consumption using clustering protocols which
have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and
routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend
the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices
and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated
widely and the results are compared with related works. The experimental results show that the proposed
algorithm provides an effective improvement in terms of energy consumption, data accuracy and network
lifetime
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
An energy efficient optimized cluster establishment methodology for sensor n...nooriasukmaningtyas
The compatibility of WSN is with various applications such as; healthcar eand environmental monitoring. Whereas nodes present in that network have limited ‘battery-life’ that cause difficulty to replace and recharge those batteries after deployment. Energy efficiency is a major problem in the present situation. In present, many algorithms based on energy efficiency have been introduced to improvise the conservation of energy in WSN. The LEACH algorithm improvises the network lifetime in comparison to direct transmission and multi-hop, but it has several limitations. The selection of CHs can be randomly done that doesn’t confirm the optimal solution, proper distribution and it lacks during complete network management. The centralized EE optimized cluster establishment approach (OCEA) for sensor nodes is proposed to decrease the average energy dissipation and provide significant improvement. The proposed EE WSN model with the sensor nodes is examined under a real-time scenario and it is compared with stateof-art techniques where it balances the energy consumption of the network and decreasing the cluster head number.
SLGC: A New Cluster Routing Algorithm in Wireless Sensor Network for Decrease...IJCSEA Journal
Decrease energy consumption and maximizing network lifetime are important parameters in designing and protocols for wireless sensor network (WSN).Clustering is one of the efficient methods in energy consumption by Cluster-Head in WSN. Besides, CH can process and aggregate data sent by cluster members, thus reducing network traffic for sending data to sink. In this paper presents a new cluster routing algorithm by dividing network into grids. In each grid computes the center-gravity and threshold of energy for selecting the node that has the best condition base on these parameters in grid for selecting Cluster-Head in current round, also SLGC selecting Cluster-Heads for next rounds thereby this CHs reduce the volume of controlling messages for next rounds and inform nodes for sending data into CH of respective round. This algorithm prolong network lifetime and decrease energy consumption by selecting CH in grid and sending data of grid to sink by this CH. Result of simulation shows that SLGC algorithm in comparison with the previous clustering algorithm has maximizing network lifetime and decrease energy consumption in network.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
AN OPTIMUM ENERGY CONSUMPTION HYBRID ALGORITHM FOR XLN STRATEGIC DESIGN IN WSN’SIJCNCJournal
In this paper, X-Layer protocol is originated which executes mobility error prediction (MEP) algorithm to calculate the remaining energy level of each node. This X-Layer protocol structure employs the mobility aware protocol that senses the mobility concerned to each node with the utilization of Ad-hoc On-Demand Distance Vector (AODV), which shares the information or data specific to the distance among individual nodes. With the help of this theory, the neighbour list will be updated only to those nodes which are mobile resulting in less energy consumption when compared to all (static/mobile) other nodes in the network. Apart from the MEP algorithm, clustering head (CH) election algorithm has also been specified to identify the relevant clusters whether they exists within the network region or not. Also clustering multi-hop routing (CMHR) algorithm was implemented in which the node can identify the cluster to which it belongs depending upon the distance from each cluster surrounding the node. Finally comprising the AODV routing protocol with the Two-Ray Ground method, we implement X-Layer protocol structure by considering MAC protocol in accordance to IEEE 802.15.4 to obtain the best results in energy consumption and also by reducing the energy wastage with respect to each node. The effective results had been illustrated through Network Simulator-II platform.
Energy Efficient LEACH protocol for Wireless Sensor Network (I-LEACH)ijsrd.com
In the wireless sensor networks (WSNs), the sensor nodes (called motes) are usually scattered in a sensor field an area in which the sensor nodes are deployed. These motes are small in size and have limited processing power, memory and battery life. In WSNs, conservation of energy, which is directly related to network life time, is considered relatively more important souse of energy efficient routing algorithms is one of the ways to reduce the energy conservation. In general, routing algorithms in WSNs can be divided into flat, hierarchical and location based routing. There are two reasons behind the hierarchical routing Low Energy Adaptive Clustering Hierarchy (LEACH) protocol be in explored. One, the sensor networks are dense and a lot of redundancy is involved in communication. Second, in order to increase the scalability of the sensor network keeping in mind the security aspects of communication. Cluster based routing holds great promise for many to one and one to many communication paradigms that are pre valentines or networks.
Energy Consumption Reduction in Wireless Sensor Network Based on ClusteringIJCNCJournal
ABSTRACT
One of the important issues in the routing protocol design in Wireless Sensor Networks (WSNs) is minimizing energy consumption and maximizing network lift time. Nowadays networks and information systems are one of the main parts of modern life that without them, people cannot live. On the hand, the impairment of these networks leads to great and incalculable costs. In this paper, a new method based on clustering has presented that problem of energy consumption is solved. The proposed algorithm is that energy-based clustering can create clusters of the same energy level and distribute energy efficiency across the WNS nodes. This proposed clustering protocol classify network nodes based on energy and neighbourhood criteria and attempts to better balance energy in clusters and ultimately increase network lifetime and maintain network coverage. Results are shown that the proposed algorithm is on average 40% better than LEACH algorithm and 14% better than IBLEACH algorithm.
KEYWORDS
Wireless Sensor Network, Clustering, LEACH Algorithm, IBLEACH Algorithm
Abstract Link : http://aircconline.com/abstract/ijcnc/v11n2/11219cnc03.html
Full Details : http://aircconline.com/ijcnc/V11N2/11219cnc03.pdf
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
Hierarchical Coordination for Data Gathering (HCDG) in Wireless Sensor NetworksCSCJournals
A wireless sensor network (WSN) consists of large number of sensor nodes where each node operates by a finite battery for sensing, computing, and performing wireless communication tasks. Energy aware routing and MAC protocols were proposed to prolong the lifetime of WSNs. MAC protocols reduce energy consumption by putting the nodes into sleep mode for a relatively longer period of time; thereby minimizing collisions and idle listening time. On the other hand, efficient energy aware routing is achieved by finding the best path from the sensor nodes to the Base Sta-tion (BS) where energy consumption is minimal. In almost all solutions there is always a tradeoff between power consumption and delay reduction. This paper presents an improved hierarchical coordination for data gathering (HCDG) routing schema for WSNs based on multi-level chains formation with data aggregation. Also, this paper provides an analytical model for energy consumption in WSN to compare the performance of our proposed HCDG schema with the near optimal energy reduction methodology, PEGASIS. Our results demonstrate that the proposed routing schema provides relatively lower energy consumption with minimum delay for large scale WSNs.
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical
issue that degrades the network performance. Recharging and providing security to the sensor devices is
very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an
important and suitable approach to increase energy efficiency and transmitting secured data which in turn
enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC)
works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the
rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the
network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on
the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all
the cluster heads are formed at a time and selected on rotation based on considering the highest energy of
the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum
flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access
(CSMA), a contention window based protocol is used at the MAC layer for collision detection and to
provide channel access prioritization to HWSN of different traffic classes with reduction in End to End
delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the
cluster head for transmission without depleting the energy. Simulation parameters of the proposed system
such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing
system.
Sector Tree-Based Clustering for Energy Efficient Routing Protocol in Heterog...IJCNCJournal
One of the main challenges for researchers to build routing protocols is how to use energy efficiently to extend the lifespan of the whole wireless sensor networks (WSN) because sensor nodes have limited battery power resources. In this work, we propose a Sector Tree-Based clustering routing protocol (STB-EE) for Energy Efficiency to cope with this problem, where the entire network area is partitioned into dynamic sectors (clusters), which balance the number of alive nodes. The nodes in each sector only communicate with their nearest neighbour by constructing a minimum tree based on the Kruskal algorithm and using mixed distance from candidate node to base station (BS) and remaining energy of candidate nodes to determine which node will become the cluster head (CH) in each cluster? By calculating the duration of time in each round for suitability, STB-EE increases the number of data packets sent to the BS. Our simulation results show that the network lifespan using STB-EE can be improved by about 16% and 10% in comparison to power-efficient gathering in sensor information system (PEGASIS) and energy-efficient PEGASIS-based protocol (IEEPB), respectively.
ENERGY-EFFICIENT MULTI-HOP ROUTING WITH UNEQUAL CLUSTERING APPROACH FOR WIREL...IJCNCJournal
The development of an energy-efficient routing protocol, capable of extending the life of the network, is one of the main constraints of wireless sensor networks (WSN). Research studies on WSN routing prove that clustering offers an effective approach to prolong the lifetime of a WSN, particularly when it is combined with multi-hop communication that can reduces energy costs by minimizing the distance between transmitter and receiver. Most clustering algorithms using multi-hop in data transmission encounter the hotspot problem. In this work, an Energy-efficient Multi-hop routing with Unequal Clustering approach (EMUC) is proposed, to create clusters of different sizes, which depend on the distance between the sensor node and the base station. Equilibrate the energy dissipation between the cluster heads is the purpose of this approach by adopting multi-hop communication to relay data to the base station. The implementation of multi-hop mode to transmit data to the base station reduces the energy cost of transmission over long distances. The effectiveness of this approach is validated through performed simulations, which prove that EMUC balances energy consumption between sensor nodes, mitigates the hotspots problem, saves more energy and significantly extends the network lifetime.
A CLUSTER-BASED ROUTING PROTOCOL AND FAULT DETECTION FOR WIRELESS SENSOR NETWORKIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be
deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a
consequence, the main goal is to reduce the overall energy consumption using clustering protocols which
have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and
routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend
the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices
and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated
widely and the results are compared with related works. The experimental results show that the proposed
algorithm provides an effective improvement in terms of energy consumption, data accuracy and network
lifetime
A Cluster-Based Routing Protocol and Fault Detection for Wireless Sensor NetworkIJCNCJournal
In Wireless Sensors Networks (WSN) based application, a large number of sensor devices must be deployed. Energy efficiency and network lifetime are the two most challenging issues in WSN. As a consequence, the main goal is to reduce the overall energy consumption using clustering protocols which have to ensure reliability and connectivity in large-scale WSN. This work presents a new clustering and routing algorithm based on the properties of the sensor networks. The main goal of this work is to extend the network lifetime via charge equilibration in the WSN. According to many errors with sensing devices and to have greater data accuracy, we use a quorum mechanism. The proposed algorithms are evaluated widely and the results are compared with related works. The experimental results show that the proposed algorithm provides an effective improvement in terms of energy consumption, data accuracy and network lifetime.
An energy efficient optimized cluster establishment methodology for sensor n...nooriasukmaningtyas
The compatibility of WSN is with various applications such as; healthcar eand environmental monitoring. Whereas nodes present in that network have limited ‘battery-life’ that cause difficulty to replace and recharge those batteries after deployment. Energy efficiency is a major problem in the present situation. In present, many algorithms based on energy efficiency have been introduced to improvise the conservation of energy in WSN. The LEACH algorithm improvises the network lifetime in comparison to direct transmission and multi-hop, but it has several limitations. The selection of CHs can be randomly done that doesn’t confirm the optimal solution, proper distribution and it lacks during complete network management. The centralized EE optimized cluster establishment approach (OCEA) for sensor nodes is proposed to decrease the average energy dissipation and provide significant improvement. The proposed EE WSN model with the sensor nodes is examined under a real-time scenario and it is compared with stateof-art techniques where it balances the energy consumption of the network and decreasing the cluster head number.
Cluster Based Routing using Energy and Distance Aware Multi-Objective Golden ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such as communication, electronics, and information technologies. When the clustering algorithm incorporates both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal of this research is to reduce energy consumption for prolong the lifetime of the network. In order to achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces retransmissions and delays to improve the performance metrics. And so, this research carried out two major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN. Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss during the transmission. For generating the routing path between the source and the Base Station (BS), the ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio (0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
CLUSTER BASED ROUTING USING ENERGY AND DISTANCE AWARE MULTI-OBJECTIVE GOLDEN ...IJCNCJournal
In recent years, WSNs have attracted significant attention due to the improvements in various sectors such
as communication, electronics, and information technologies. When the clustering algorithm incorporates
both Euclidean distance and energy, it automatically decreases the energy consumption. So, the major goal
of this research is to reduce energy consumption for prolong the lifetime of the network. In order to
achieve an energy-efficient process, Energy and Distance Aware Multi-Objective Golden Eagle
Optimization (ED-MOGEO) is proposed in this research. In addition, this proposed solution reduces
retransmissions and delays to improve the performance metrics. And so, this research carried out two
major fitness functions (Euclidean distance and energy) for creating an energy-efficient WSN.
Furthermore, energy consideration is used to reduce the nodes unavailability which results in packet loss
during the transmission. For generating the routing path between the source and the Base Station (BS), the
ED-MOGEO algorithm is used. From the simulation results, it shows that Proposed ED-MOGEO achieves
better performances in terms of residual energy (14.36 J), end-to-end delay (12.9 ms), packet delivery ratio
(0.994), normalized routing overhead (0.11), and throughput (1.131 Mbps) when compared to existing
Cluster-Based Data Aggregation (CBDA) and Elephant Herding Optimization (EHO)-Greedy methods.
Energy balanced on demand clustering algorithm based on leach-cijwmn
As the use of Wireless Sensor Networks (WSNs) has grown enormously, the need for energy-efficient management has also risen. With advances in ubiquitous computing environment, WSNs have been broadly studied and many energy-efficient routing protocols had been proposed. LEACH (Low Energy Adaptive Clustering Hierarchy) is a popular cluster-based protocol, which provides distributed adaptive clustering and periodic cluster head (CH) selection rotation. As extension to LEACH, LEACH-C (LEACH Centralized) was proposed, in which the energy is utilized to select CH. However, both can’t guarantee cluster head distribution, in addition to considerable periodic clustering overhead. Furthermore, network topology change is a critical characteristic that has influence on communication path and load distribution among nodes. To resolve such problems, Energy-Balance on Demand Clustering Algorithm Based on LEACH-C is proposed. The algorithm adopts centralized cluster formation and distributed CH selection methods. Minimum energy clustering is used to divide the network into clusters, while energy and total communication distance are considered as secondary criteria to select optimal CH. From simulation results the proposed algorithm outperforms LEACH-C in life time, stability period and performance efficiency.
Energy balanced improved leach routing protocol for wireless sensor networkscsandit
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
ENERGY-BALANCED IMPROVED LEACH ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKScscpconf
A proper sensor node clustering is an effective topology control that can balance energy
consumption among sensor nodes and increase network scalability and life time. As the use of
wireless sensor networks (WSNs) has grown enormously, the need for energy-efficient routing
and data aggregation has also risen. LEACH
(
Low Energy Adaptive Cluster Hierarchy
)
is a
hierarchical clustering protocol that provides an elegant solution for such protocols. Random
clustering is the main deficiency of LEACH. In this paper an energy balanced clustering
approach is proposed, in which the K-mean clustering algorithm is applied. It is centralized
clustering algorithm that based on minimum energy clustering to form optimal clusters. For the
candidate nodes, the location and the residual energy are used as key parameters to select the
cluster head (CH). The method shows that the proposed approach outperforms LEACH in terms
of energy conservation and network life time prolonging.
Improved LEACH protocol for increasing the lifetime of WSNsIJECEIAES
Recently, wireless sensor network (WSN) is taking a high place in several applications: military, industry, and environment. The importance of WSNs in current applications makes the WSNs the most developed technology at the research level and especially in the field of communication and computing. However, WSN’s performance deals with a number of challenges. Energy consumption is the most considerable for many researchers because nodes use energy to collect, treat, and send data, but they have restricted energy. For this reason, numerous efficient energy routing protocols have been developed to save the consumption of power. Low energy adaptive clustering hierarchy (LEACH) is considered as the most attractive one in WSNs. In the present document, we evaluate the LEACH approach effectiveness in the cluster-head (CH) choosing and in data transmission, then we propose an enhanced protocol. The proposed algorithm aims to improve energy consumption and prolong the lifetime of WSN through selecting CHs depending on the remaining power, balancing the number of nodes in clusters, determining abandoned nodes in order to send their data to the sink. Then CHs choose the optimal path to achieve the sink. Simulation results exhibit that the enhanced method can decrease the consumption of energy and prolong the life-cycle of the network.
Recent Developments in Routing Algorithms for Achieving Elongated Life in WSNijsrd.com
Battery life is a key issue for an elongated life in WSN. Clustering of nodes is done to achieve the energy conservation in LEACH algorithm. The main objectives of clustering are equal distribution of energy and equal distribution of nodes in space so that less energy is consumed and early deaths of nodes can be delayed. In LEACH both of these objectives can’t be achieved. Further Max-Energy LEACH is able to achieve energy equi-distribution but not the space equi-distribution because CH can be selected from one region only leading to large energy consumption by nodes to send data to CHs. The clustering algorithm while doing its work should pay attention toward the number of nodes a cluster is having. If we can equi-distribute all nodes to cluster then we assume that it may lead to better energy efficiency. This paper discusses the recent developments in WSN in this direction.
A NOVEL ENERGY EFFICIENCY PROTOCOL FOR WSN BASED ON OPTIMAL CHAIN ROUTINGKhushbooGupta145
Energy Efficiency in Wireless Sensor Network is one of the most significant aspects of routing in these networks. WSN consist of thousands of sensory nodes densely distributed over wide geographical network. As these nodes are deployed in remote areas where recharging is not possible, even if it is possible it will incur high cost. So there is a need of a protocol which facilitates less energy dissipation and thereby enhances the overall performance of the network. We surveyed several protocols such as LEACH, PEGASIS, ACT etc. and concluded that important performance measures are First Node Die (FND), Half Node Alive (HNA) and Last Node Alive (LNA). Values for above mentioned parameters vary for different protocols. In this paper we present a new protocol Energy Efficient Optimal Chain Protocol (EEOC) which outperforms all above mentioned protocols. We compared the results of all these protocols with EEOC and found that with respect to FND, HNA and LNA EEOC performs way better than others.
CLUSTER HEAD SELECTION ALGORITHMS FOR ENHANCED ENERGY EFFICIENCY IN WIRELESS ...IJCSES Journal
The extension of the sensor node's life span is an essential requirement in a Wireless Sensor Network.
Cluster head selection algorithms undertake the task of cluster head election and rotation among nodes,
and this has significant effects on the network's energy consumption. The objective of this paper is to
analyze existing cluster head selection algorithms and the parameters they implement to enhance energy
efficiency. To achieve this objective, systematic literature review methodology was used. Relevant papers
were extracted from major academic databases Elsevier, Springer, Wiley, IEEE, ACM Digital Library,
Citeseer Library, and preprints posted on arXiv. The results show that there are many existing Cluster
Head Selection Algorithms and they are categorized as deterministic, adaptive and hybrid. These
algorithms use different parameters to elect Cluster Heads. In future the researchers should derive more
parameters that can be used to elect cluster heads to improve on energy consumption
CLUSTER HEAD SELECTION ALGORITHMS FOR ENHANCED ENERGY EFFICIENCY IN WIRELESS ...IJCSES Journal
The extension of the sensor node's life span is an essential requirement in a Wireless Sensor Network.
Cluster head selection algorithms undertake the task of cluster head election and rotation among nodes,
and this has significant effects on the network's energy consumption. The objective of this paper is to
analyze existing cluster head selection algorithms and the parameters they implement to enhance energy
efficiency. To achieve this objective, systematic literature review methodology was used. Relevant papers
were extracted from major academic databases Elsevier, Springer, Wiley, IEEE, ACM Digital Library,
Citeseer Library, and preprints posted on arXiv. The results show that there are many existing Cluster
Head Selection Algorithms and they are categorized as deterministic, adaptive and hybrid. These
algorithms use different parameters to elect Cluster Heads. In future the researchers should derive more
parameters that can be used to elect cluster heads to improve on energy consumption.
An Improved LEACH-C Algorithm for Energy Efficiency in WSN Routingijsrd.com
this paper considered a multi-objective LEACH-C algorithm in the selection of Cluster Head (CH) in such a way so that its energy is used uniformly with load balancing among clusters for delayed disintegration of network. LEACH-C algorithm based single objective clustering approach has been replaced by multi-objective clustering approach where we not only considered the residual energy of nodes but the size of cluster in creating a cluster structure. The improved LEACH-C protocol has been compared with random LEACH and Max Energy LEACH or existing LEACH-C algorithm for energy equi-distribution and load balancing among clusters. Wireless sensor network (WSN) is simulated using a MATLAB programming and power consumption algorithms take into consideration all aspects of power consumption in the operation of the node. The modified LEACH-C routing protocol shows improvements in lifetime as well as in network disintegration criterion
DYNAMIC RE-CLUSTERING LEACH-BASED (DR-LEACH) PROTOCOL FOR WIRELESS SENSOR NET...IJCNCJournal
A Wireless Sensor Network (WSN) contains a large number of sensor nodes equipped with limited energy supplies. In most applications, sensor nodes are deployed in a random fashion. Therefore, battery replacement or charging is considered not practical. As a result, routing protocols must be energy-efficient to prolong the network’s lifetime. In this paper, we propose a new Dynamic Re-clustering LEACH-Based protocol (DR-LEACH) which aims to reduce the energy consumption and extending the network’s lifetime. The idea is to balance energy consumption of Cluster Heads (CHs) by generating clusters with almost equal number of nodes during each round of the network life time. To perform this, we first calculate the optimal number of CHs in each round, and based on that we calculate the optimal size of each cluster. Results show that the proposed protocol improves network lifetime and reduces overall energy consumption compared to LEACH and BCDCP protocols.
Performance evaluation of hierarchical clustering protocols with fuzzy C-means IJECEIAES
The longevity of the network and the lack of resources are the main problems within the WSN. Minimizing energy dissipation and optimizing the lifespan of the WSN network are real challenges in the design of WSN routing protocols. Load balanced clustering increases the reliability of the system and enhances coordination between different nodes within the network. WSN is one of the main technologies dedicated to the detection, sensing, and monitoring of physical phenomena of the environment. For illustration, detection, and measurement of vibration, pressure, temperature, and sound. The WSN can be integrated into many domains, like street parking systems, smart roads, and industrial. This paper examines the efficiency of our two proposed clustering algorithms: Fuzzy C-means based hierarchical routing approach for homogeneous WSN (F-LEACH) and fuzzy distributed energy efficient clustering algorithm (F-DEEC) through a detailed comparison of WSN performance parameters such as the instability and stability duration, lifetime of the network, number of cluster heads per round and the number of alive nodes. The fuzzy C-means based on hierarchical routing approach is based on fuzzy C-means and low-energy adaptive clustering hierarchy (LEACH) protocol. The fuzzy distributed energy efficient clustering algorithm is based on fuzzy C-means and design of a distributed energy efficient clustering (DEEC) protocol. The technical capability of each protocol is measured according to the studied parameters.
IMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM I...IJCNCJournal
One of the most important issues discussed in Wireless Sensor Networks (WSNs) is how to transfer information from nodes within the network to the base station and select the best possible route for transmission of this information, taking into account energy consumption for the network lifetime with
maximum reliability and security. Hence, it would be useful to provide a suitable method that would have the features mentioned. This paper uses an Ad-hoc On-demand Multipath Distance Vector (AOMDV) as a routing protocol. This protocol has high energy consumption due to its multipath. However, it is a big challenge if it can reduce AOMDV energy consumption. Therefore, clustering operations for nodes are of high priority to determine the head of clusters which LEACH protocol and fuzzy logic and Particle Swarm Optimization (PSO) algorithm are used for this purpose. Simulation results represent 5% improvement in energy consumption in a WSN compared to AOMDV method.
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Quality defects in TMT Bars, Possible causes and Potential Solutions.PrashantGoswami42
Maintaining high-quality standards in the production of TMT bars is crucial for ensuring structural integrity in construction. Addressing common defects through careful monitoring, standardized processes, and advanced technology can significantly improve the quality of TMT bars. Continuous training and adherence to quality control measures will also play a pivotal role in minimizing these defects.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
Democratizing Fuzzing at Scale by Abhishek Aryaabh.arya
Presented at NUS: Fuzzing and Software Security Summer School 2024
This keynote talks about the democratization of fuzzing at scale, highlighting the collaboration between open source communities, academia, and industry to advance the field of fuzzing. It delves into the history of fuzzing, the development of scalable fuzzing platforms, and the empowerment of community-driven research. The talk will further discuss recent advancements leveraging AI/ML and offer insights into the future evolution of the fuzzing landscape.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Planning Of Procurement o different goods and services
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSN
1. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
DOI: 10.5121/ijcnc.2021.13404 53
OPTIMIZED CLUSTER ESTABLISHMENT AND
CLUSTER-HEAD SELECTION APPROACH IN WSN
Shivshanker. P. Biradar1
and Dr. T. S. Vishwanath2
1
ECE department, LAEC, Bidar, Karnataka, India
2
ECE department, BKIT, Bhalki, Karnataka, India
ABSTRACT
In recent years, limited resources of user products and energy-saving are recognized as the major
challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all
energy consumption and provide stability of workload that causes a larger difference in energy depletion
among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for
maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS
(Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to
improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of
this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically
chooses the optimal set of the CHs according to the speed of the average node and average-node energy.
This is considerably distinguished from node-based clustering that utilizes a distributed clustering
algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more
than one factor is assumed for the detached node to join the optimal cluster. In the result section, we
discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs,
maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
KEYWORDS
Wireless Sensor Networks (WSNs), Cluster Heads (CHs), Clustering Approach, Energy Efficient (EE),
LEACH.
1. INTRODUCTION
The improvement in communication technology and the increase in the demand for smart devices
generated novel dimensions for WSNs. WSNs contain different/same types of nodes and BS
(Base Station). The BS transmits commands to the nodes in the region of sense. It gathers data
from SNs (sensor-nodes), executes very simple processing, and transmits the data through the
internet to end-users. WSNs are self-managed network systems that contain several distributed
SNs. The main purpose of WSN is to monitor the conditions like environment, temperature, and
humidity or to recognize monitoring environment, disaster monitoring, traffic-management, and
warfare monitoring [1-2]. Anyways, WSNs have resource constraints. This constraint adds less
memory, limited battery power, and limited bandwidth. Among these, the power of a limited
battery is one of the main constraints. When the energy efficiency, it is pretty challenging to
replace or recharge the battery. There exist many mechanisms like radio optimization, EE
(energy-efficient) routing, duty routing, clustering [3-5] in order to minimize energy
consumption. The diverse applications and resource constraints of WSNs pose higher challenges.
WSNs nodes generally have essential limitations in terms of available energy as well as
communication and computing capabilities.
2. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
54
EE is a most eminent feature of the routing protocols for the WSNs, required to prolong the
network-lifetime and to improvise the performance of communication and also receives much
attention. Different communication nodes and cluster formation of sending data have been the
most popular methods. In general, compared to the cluster-based routing-protocols and non-
clustering-protocols can proficiently utilize SNs in a network [6]. A CH, called cluster leader, is
in removing charge as correlated data that can reduce the volume of final data. Afterward, CH
will send aggregated data to BS [7-8]. In the protocols of cluster-based routing, SNs are parted
into several clusters to minimize the consumption of energy for longer communication distances.
The clustering can reduce all energy consumption and also balance workload that causes a larger
difference in energy depletion among other nodes and CHs. Furthermore, clustering is the
solution of EE for maximizing the network longevity and improvising energy-efficiency.
Anyways, clustering protocols implement optimal CH-selection to evade the death of SNs and
further improvise the network lifetime [9-10].
According to [11], SNs consume more energy through communication during the process of
computation. Few protocols assume more than one hop communication and nodes nearer to BS
that has excessive transmission overhead leading to the energy gaps in the field of the sensor
[12]. In order to address the problem of energy and improvise the lifetime of the network, several
clustering protocols have been introduced for the WSNs. The LEACH is an eminent hierarchical
routing protocol with respect to saving energy with routing protocols [13]. In this, all networks
are parted into many clusters and every single cluster chooses the node in a probabilistic manner
as the CH, which is in sending the data, receiving a charge, compressing from non-CH-nodes to
BS. In order to reduce the WSNs-energy consumption, the protocol of LEACH routing defines
only one CH-node in every single cluster and chooses on a rotation basis. Although the efficiency
of the LEACH-protocol has been studied, it has some disadvantages that need improvement due
to choosing the CH based on round-robin, the number of CHs is not reasonable in every single
round, and nodes at the network will be selected as CH. On the other side, there is a consideration
of threshold condition, distribution of CHs, and remaining energy of every single node after the
end of every single round.
The routing protocol of WSNs is categorized into hierarchical, plane, location-based routing [14].
The routing protocol is utilizing as the LEACH protocol. The LEACH protocol is a representative
protocol between the protocols of hierarchical routing [15]. The protocol of LEACH improvised
EE of the network with the help of the clustering method but it doesn’t assume the movement of
situation nodes. Therefore, if the nodes are less as the rate of DT (data-transmission). The
protocol of LEACH-mobile is defined as a protocol, which develops the issue of node
movements [16]. In the protocol of LEACH-mobile, the given nodes are failed and moved to
transmit the data, the issue was resolved by generating a failed node to re-transmitting and re-
cluster the data. Anyways, the energy is consumed for the identification of moved nodes and the
consumption of energy is higher than the LEACH protocol.
In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection)
approach for SNs is represented to improvise the PDR (packet delivery-ratio) and reduce the
average energy-dissipation. The main contribution of this paper is 2-fold, first, the CA (clustering
algorithm) is improvised that periodically chooses the optimal set of the CHs according to the
speed of the average node and average-node energy. This is considerably distinguished from
node-based clustering that utilizes a distributed-clustering algorithm to choose CHs based on the
speed of the current node and remaining node energy. Second, more than one factor is assumed
for the detached node to join the optimal cluster.
The complete paper is organized in such a way that second section demonstrate the complete
literature survey of considered topic, 3rd
section demonstrates the important equation and their
3. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
55
respective explanation of our proposed approach. In addition, result and simulation analysis using
proposed model has shown in section 4 and at last we conclude our proposed approach in section
5.
2. LITERATURE SURVEY
Since the SNs are powered by batteries, once a few nodes are exhausted, the network may not
work properly. Therefore, energy constraint has been the main key to operate an efficient WSN.
Few traditional techniques minimize energy consumption and transmission distance of path, thus
extending all network lifetime [17,18]. Authors in [17] choose neighbor-node with fewer hops
from a source node to SN (sink-node) is utilized as a determinant. In paper [18], introduced
ladder-algorithm based ACO (ant-colony-optimization) to solve the issue of the energy
consumption in the routing. The algorithm utilized the ACO method to define the transmit paths
that can efficiently minimize the consumption of energy. In another way, this algorithm basically
based on min-hop count is similar to min-energy routing [19]. Although this type of method can
minimize the consumption of energy, it has some drawbacks that undertake the DT (data
transmission) in a period of time while the other nodes are idle. They select a forwarding node
that doesn’t assume residual energy that is very easy to generate few nodes and an outcome is not
even energy distribution among the nodes. Thus, the lifetime of a network is at less level.
The routing protocols like GBR (gradient-based-routing) [20], LEACH [21], PEGASIS [22], DD
(directed diffusion) [23], SPIN (Sensor-Protocol for Information through Negotiation) [24] were
proposed for the efficient routing of multi-hop in the WSNs [25] [26]. SPIN can’t ensure a
hundred percent packet delivery from the source node to BS. Moreover, the SPIN requires
complete topology knowledge. DD is known as the protocol of data-centric and it is required for
sink-node to generate, re-route, and transfer intermittent-updates packets. The main object of
designing DD was efficiency in the consumption of energy, resulting in maximizing the
expectancy of network life. In order to minimize the consumption of energy, DD utilized data
processing and compression within the network.
A number of various protocols have been introduced for WSN-node location and localization-
based routing protocol. These contain GEDIR [27], GAF [28], SPAN [29], GEAR, GOAFR [30]
and MFR. These papers referred to fact that the main benefit of these given protocols is the
capability to recognize the correct location of SN within sensor-network. The localization of the
node is connected to the efficiency of energy-WSN. It saves the resources of energy-WSN [31].
Anyways, these protocols outcome in the loss of power because of its node-distribution and
geographical-topology in WSN. Whereas in paper [32], the author has exploited a novel load-
balancing protocol for handling the consumed energy by SNs in WSN in 2019. The simulation
was done by utilizing MATLAB, the performance comparison was estimated utilizing 2 protocols
like SEP and LEACH.
The authors [33], introduced GWO (grey-wolf-optimization) to solve the problem of CH
selection. The function of suitable fitness was used to confirm WSN coverage and it is fed in
GWO to discover the optimum. The introduced model outcomes are associated with the routing
protocol of LEACH. Four different models such as performance, a lifetime of residual energy,
network throughput are analyzed. Lastly, the proposed model outperforms LEACH in entire
topologies by various indicators. Whereas in [34], the author introduced an EE-CH-selection
algorithm that is based on WOA-C and WOA (whale-optimization-algorithm) was introduced.
Therefore, it supports the selection of an energy-aware CH-based fitness function that assumes
the remaining energy node and the sum of the adjacent energy nodes. Lastly, an implemented
algorithm was estimated based on throughput, overall stability, EE, a lifetime of the network.
4. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
56
Moreover, the WOA-C performance was evaluated against protocols of another standard
contemporary routing to represent its superiority over another model.
The cluster-based routing has been proposed with various contributions. They are classified into
constraints for CH-selection and algorithms for CH-selection. The constraints for the selection
process of CH for routing protocol have been introduced in [35] whereas [36] introduces the
algorithm of metaheuristic optimization for the selection process of CH. Since this research aims
to improvise the optimization algorithm for the selection process of CH, they assume [35-36] for
further analysis and study. Moreover, their paper focused on FA and DA that take the update
based on random solutions, distribution, and encircling. It leads an algorithm to coverage prior to
traditional algorithms.
This paper [37] introduces an improvised function of heuristic in an ACO and assumes residual
energy and distances of nodes to discover an optimal path of DT. In [38], the mechanism for the
WSN-routing that can be more effective regarding node energy, criteria of the route length, end-
to-end delay is represented. This technique utilized ant-colony based on the routing algorithm and
the local inquiries is to discover an optimal route. The above algorithm [37-38] plays much
attention to residual path and path-length while ignoring the effects of energy-statistics like
minimum energy and average energy that could lead to an imbalance in an energy-dissipation of
all networks. Whereas, paper [39] represent ACO based routing-protocol for the WSNs
containing the stationary nodes. It gives an effective method of multi-path-DT to obtain reliable
communication in node faults while assuming the levels of energy level. Anyways, an algorithm
considers the given network, which is static and can’t be implemented in more than one sink
node.
3. OPTIMIZED CLUSTER ESTABLISHMENT AND CLUSTER-HEAD
SELECTION
The cluster-based WSN-SN (sensor-node) with single hop-communication and gateways inside
the cluster is represented in below figure-1. The advantages of cluster-based WSN are given as
follows: per cluster one representative node requires to be involved in the routing process and DA
(data-aggregation), it significantly minimizes the consumption of energy. Additionally, it
conserves bandwidth of communication as the SNs requires to interact with CHs and evades
redundant messages between them. The cluster can be managed in terms of energy; it improvises
the network-scalability. However, it is most crucial if SNs are not-properly allocated to CHs for
the formation of the cluster, then a few CHs may have overloaded with a higher number of SNs.
Such overloaded may maximize the latency in the communication and degrade the performance
of the WSN.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
57
Figure 1. Sensor-node and Cluster-based WSN
The WSN model is examined with the SNs. It is considered as a network model that contains
SNs scattered in an area of meters. An assumption of the network model is represented
below:
The BS (Base station) is fixed and it is located in the field of the sensor.
The BS and FNs are neither energy-constraint while the SNs are energy-constraint.
Every single node knows its energy level, velocity, and current position.
Every single node can use the power-setting in order to change transmitted power through
RSSI (received signal-strength-location).
We believe that given assumptions are reasonable for real networks. The FNs are powered by
energy-harvesting and thus have the continuous power of supply. Every single node identifies its
current positions and speed that can be achieved by the algorithms of GPS and location.
Additionally, every single node can estimate its energy level based on specific hardware of the
energy model. GPS is to estimate the position. Anyways, it is very expensive to train with all
nodes and that can’t function in the indoor-applications while there is no way to for LOS (line-of-
sight) to a satellite.
The consumption of SNs is measured by the same model as energy dissipation of radio-hardware
where transmitter dissipates of energy is to run power amplifier and radio electronics, and also
receiver disperses the energy to rum radio electronics. Where is defined as the distance between
transmitter and receiver. If distance is less to the assumed threshold the open model of
channel space is assumed with the loss of energy ( or else multipath channel model ( ) is
assumed. In order to receive and transmit a number of the bit message signal at the distance ,
the cost of receiving and transmitting is given by: .
Where distance is less then
(1)
6. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
58
Where distance is higher or similar to
(2)
Here, defines the energy bit/dissipation at the receiving and transmitting process, where
defines for an amplified energy parameter and also corresponds to the open model of space
channel. Furthermore, is defined as the amplified energy parameter and corresponds to the
model of the multipath channel.
From the given network, all SNs is given as , defines the scale of time
polling ( ). Begin stage, the round for every single message towards the BS, where
range value of from 1 to . Anyways, a transferred message consists of node-location,
node level of energy and present the node speed. According to the transmitted message,
firstly BS calculates the average energy node followed by
.
Also, we calculate the average speed of the node as:
(3)
Where . The BS selects the number of nodes from set ( ) and assumed as:
(4)
The given symbol defines for the optimal CHs number, represents node sets, and
represents cardinality. Furthermore, the level of energy nodes is given above,
then the value of average/threshold energy and calculated current speeds are given below, then
the speed of the average value can be given as and
.
While assuming a condition, where , this implies that the number of set nodes in
have higher energy levels and lower speeds are trained to become the CHs during the particular
round. Whereas assuming a condition , this condition implies that the set of nodes
in having higher energy levels and lower speeds that are probable to become the CHs at the
time of a particular round.
The number of set nodes is assumed to carry the process of optimization to obtain optimal CHs
from that becomes the CHs at a specific round. Here, we have many processing levels in order
to obtain the optimal CHs like completion/final level, initialization level, and neighborhood level.
Firstly, the set of stochastically CHs is created and defined by from the given
and to confirm . is assumed to discover out a new set of the nodes
which represents the random perturbation of the nodes at the finding level of the
7. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
59
neighborhood. Furthermore, novel coordinates of nodes in are calculated via the
coordinates of in .
(5)
(6)
Where the function of the rand is assumed to create a random number and defines the
maximal change at present random perturbation.
Afterward, it found neighborhood-nodes in that placed around , so node chooses a new
CHs set and defined with the help of (this can be written as ). The current
state is represented via CHs set with the help of cost-function whereas the neighborhood
state is represented via CHs set with the cost-function .
Let assume iteration, the current state will alter to the state of the neighborhood and
probability is calculated as follows:
(7)
The given eq. (11) is true when , otherwise the the probability will be only
one. Where, defined as the parameter of the control factor and given by:
(8)
Whereas, is defined as the value of hyperparameter that ranges from 100-1000. The
calculated value help to decide better clusters and denotes the function of cost:
(9)
Where, the distance among channel head and is specified by the help of . if current
state becomes the state of the neighborhood, then .
is assumed as total iterations in the final level, where is equal and greater to then the
algorithm can be dismissed otherwise it will go to the level of neighborhood find. Once a
determination of an optimal CHs is finished, BS is utilized to broadcast the message that contains
CH’s-ID for every single node which is present in the network. Anyways, the particular ID of a
node is similar to CH’s ID then it became the CH. Else, the node selects its TDMA-slot for the
process of data transfer and the given node falls dead until the time that has come to the forward
signal to its CH.
As node and its CH has moved out of the communication range with each other, the
transmitted data packet is assumed to be lost from to . We refer a node that is separated
from its CH as DN (detached-node). In this case, the DN differs the quantity of the transmitted
power and then shows data to all given CHs in a network. On the other side, in order to define an
optimal-CH for DN, every single CH sends small messages to BS. This small message contains
8. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
60
distance among CH and DN , the energy level of CH i.e., and the speed of
current CH i.e, . Then, BS calculates integrated weights for the CH as follows:
(10)
Where, , , and C is the CHs set within a present round. Moreover, is defined as a
weighted factor and . Besides, simplifies the range of maximum
transmission and defines the speed of max MNs. Since BS is in the area center, we describe
where is defined as the side length of square-area. Thus, an optimal CH for
DN is given by:
(11)
After, BS discovers an optimum CH for DN, it sends messages that contain an optimal CH-ID
to DN, which transmits a joint-request message to the CH Next, the CH allots free-timeslot to
DN. During its allotted timeslot, DN attached itself and sends sensed data to its CH .
4. RESULT AND ANALYSIS
The SNs are powered by batteries, if some of the nodes are fatigued, the network may not work
properly. Therefore, energy constraint has been the main key to operate an efficient WSN. The
cluster-based routing has been proposed with various contributions. In this research, our aim is to
improvise the algorithm for the selection process of CH, increase the throughput and minimize
energy consumption. This section provides the result and analysis at the proposed OCE-CHS
approach. The complete simulation has done in MATLAB 2018a with system configuration; Intel
i5 processor, 12GB RAM, and Windows operating system.
Here, WSN is analyzed under various sensor nodes such as; 700, 800, 1900 and 2000 which
consistently scattered in the 400 x 400-meter squared network coverage area. In addition, real
time environment of network is replicated; where energy level, nodes current position and
velocity known by node. Before exploring further result analysis, let’s have discuss about
LEACH, it’s a well-known hierarchical routing protocol with respect to saving energy with
routing protocols. In order to reduce the WSNs-energy consumption, the protocol of LEACH
routing defines only one CH-node in every single cluster and chooses on a rotation basis, which
is not efficient to manage energy consumption. The proposed approach utilizes a distributed-
clustering algorithm to choose CHs based on the speed of the current node and remaining node
energy. For analysis and evolution purpose; packet success rate, error rate, throughput and energy
consumption has considered. Finally, state-of-art methods such as; ACO, LEACH and energy
balance clustering routing algorithm (EB-CRA) [40] has considered for comparison.
Table 1. Simulation parameters details
Initial Energy 0.1 dB
Optimal Election Probability for CH 0.2
Sensor Nodes 700, 800, 1900 and 2000
Network Size 400 x 400m2
Hyperparameter value 1
Maximum number of polling 500
Existing Approach ACO, LEACH and EB-CRA [40]
9. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
61
Figure 2. Cluster formation and CHs Localization
Figure 3. Impact of Polling Number on Packet Success Rate at 700 Nodes
10. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
62
Figure 4. Impact of Polling Number on Packet Success Rate at 2000 Nodes
The representation of cluster formation and CHs localization is shown in figure 2, where blue is
dividing the clusters in a 400 x 400-m2
network and yellow covered dot shows the CH for each
cluster.
Figure 5. Impact of Polling Number on Throughput at 700 & 800 Nodes
The impact of Polling Number on Packet Success Rate (PSR) at 700 Nodes is shown in figure 3,
it’s a box plot that represents the standard deviation of 100 poll for PSR values. The x-axis shows
in the interval at 100 polling number. Red line inside box represents the mean value of PSR at
11. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
63
total 100 polling number. In figure, it clearly seen that mean value of initial 100 poll is 93.2%,
whereas at last 400 to 500 poll we achieve 99.95% of PSR.
Figure 6. Impact of Polling Number on Throughput at 1900 & 2000 Nodes
Figure 7. Error Rate w.r.t Polling Number at 700 & 800 Nodes
12. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
64
Figure 8. Error Rate w.r.t Polling Number at 1900 & 2000 Nodes
Similarly, when 2000 nodes were considered for analysis of polling number w.r.t PSR as shown
in figure 4, at 0 to 100 poll we got PSR mean value as 84.5% and at 400 to 500 poll we achieved
98.24 PSR. Both figure 3 and 4 shows that as per increment in polling number the PSR is also
increasing. The Impact of polling number on throughput at 700 & 800 nodes are shown in figure
5, cyan line shows for 700 nodes, while the yellow line represents for 800 nodes. In figure 5, a
growth in throughput can be seen from 100 to 300 polls, afterwards it increasing a bit because of
its optimal reach of space.
Figure 9: Impact of Polling Number on Energy Consumption at 700 Nodes
13. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
65
Similarly, the Impact of polling number on throughput at 1900 & 2000 nodes can be seen in
figure 6, at shown 1900 nodes, we have got 58 Kbits/Hz at 500 polling number while at 2000
nodes got 65 Kbits/Hz. Figure 7 shows an error rate w.r.t polling number at 700 & 800 nodes,
where blue bar shows for 700 nodes and yellow bar shows for 800 nodes.
Figure 10. Impact of Polling Number on Energy Consumption at 2000 Nodes
Figure 11. Presentation of energy comparison at different polling number
In figure 7 polling number 1, the error rate is 0.0583 for 700 nodes and 0.0573 error rate for 800
nodes. But increasing in polling number, the error rate is more in high number of nodes. When
we further increase the number of nodes to 1900 and 2000, the error rate w.r.t polling number can
be seen in figure 8. Where at 1 polling number, 0.141 error rate at 1900 nodes and 0.148 error
rate at 2000 nodes.
14. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
66
Table 2. Comparison analysis at energy consumption with state-of-art model
Poll No. ACO LEACH EB-CRA OCE-CHS
100 0.228 0.3501 0.1394 0.1215
200 0.2709 0.3 0.1141 0.1022
300 0.2 0.2649 0.0791 0.0763
400 0.1723 0.3248 0.1376 0.0723
500 0.175 0.2511 0.1243 0.059
Figure 12. Latency impact as per polling number at 700 nodes
Figure 13. Latency impact as per polling number at 2000 nodes
15. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
67
Figure 9 represents the impact of polling number on energy consumption at 700 nodes. In 0 to
100 polling number, average power consumption is 0.067 J as seen in fig 9, whereas from 400 to
500 polling number average power consumption is 0.0004 J that is very less compared to
previous polling range. Similarly, the impact of polling number on energy consumption at 2000
nodes is shown in figure 10, where average power consumption is 0.15 J at 0 to 100 polling
number and 0.0175 J at 400 to 500 polling numbers. Figure 11 presents energy comparison at
different polling number and the detailed numerical analysis is shown in table 1. For this
particular energy comparison, a WSN model with the SNs is observed and our network model
consists of 200 number of SNs that uniformly distributed in monitoring area of 100 x 100 meter.
At 100 polling number, our proposed OCE-CHS approach has got 0.1215 J, which is 46%, 65%
and 12% less energy consumption compared to ACO, LEACH and EB-CRA techniques. At 400
poll number, our proposed OCE-CHS approach has got 58%, 77% and 47% less energy
consumption compared to ACO, LEACH and EB-CRA techniques. Transmission of data from
source node to destination node is considered in order to achieve the delay requirements.
Therefore, the less latency is required to improve used experience and higher reliability. Network
transmission latency impact as per polling number at 700 nodes is shown in figure 12 and for
2000 nodes is shown in figure 13. While analyzing both the figs 12 and 13, its clearly seen that
normalize the value of time has achieved as per increasing in polling number.
5. CONCLUSIONS
In WSN, the deployment of large and autonomous SNs is a very difficult task to perform. There
are various other challenges as well; EE protocol to minimalize power consumption, high
throughput, and packet transmission. The major advantage of cluster-based WSN are: per cluster
one representative node requires to be involved in the routing method and DA, which
significantly reduces the energy consumption. In addition, it conserves bandwidth of
communication as the SNs requires to interact with CHs and avoids redundant messages in
transmission. In this study, the OCE-CHS approach for SNs is represented to improvise the
throughput, PDR and reduce the average energy-dissipation and error rate. The entire analysis has
done under a large network scenario, where simulation has set up in MATLAB tool with user’s
alteration. The routing protocol such as LEACH protocol, ACO, and EB-CRA has considered for
energy comparison is considered real-time network environment. The analysis of our result has
shown in the above section clearly state that our proposed approach is much more efficient and
stable for data transmission in WSN. Here, our optimized cluster-based approach managed in
terms of energy and it improvises the network scalability. However, this approach is not tested
under a complete 5G environment, so this can be considered as future scope of work.
CONFLICTS OF INTEREST
The authors declare no conflict of interest.
ACKNOWLEDGMENTS
Both authors contributed to the design and implementation of the research, to the analysis of the
results, and to the writing of the manuscript.
REFERENCES
[1] Li Li, Xiaoguang Hu, Ke Chen, Ketai He (2011) “The applications of wifi-based wireless sensor
network in internet of things and smart grid.” In 2011 6th IEEE Conference on Industrial Electronics
and Applications, pages 789–793.
16. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
68
[2] Bressan Nicola, Bazzaco Leonardo, Bui Nicola, (2010) “The deployment of a smart monitoring
system using wireless sensor and actuator net-works.” In 2010 First IEEE International Conference
on Smart Grid Communications, pages 49–54.
[3] Rezaei Zahra, Mobininejad Shima (2012) “Energy saving in wire-less sensor networks.” Int Journal
Comp Sci Eng Surv 3(1): Comp Net 38(4):393–422.
[4] Rault Tifenn, Bouabdallah Abdelmadjid, Challal Yacine (2014) “Energy efficiency in wireless sensor
networks: A top-down survey.” Comp Net 67:104–122
[5] S. Srivastava, M. Singh and S. Gupta, (2018) "Wireless Sensor Network: A Survey," International
Conference on Automation and Computational Engineering (ICACE), Greater Noida, India, pp. 159-
163.
[6] Zungeru Adamu Murtala, Ang Li-Minn, Seng Kah Phooi (2012) “Classical and swarm intelligence-
based routing protocols for wire-less sensor networks: A survey and comparison.” Journal Net Comp
Appl 35(5):1508–1536.
[7] Vijayalakshmi K, Anandan P (2019) “A multi objective tabu particle swarm optimization for
effective cluster head selection in wsn.” Cluster computing 22(5):12275–12282.
[8] Solaiman Basma (2016) “Energy optimization in wireless sensor networks using a hybrid k-means
pso clustering algorithm.” Turkish Journal of Electrical Eng Comp Science 24(4):2679–2695.
[9] T. Kaur and D. Kumar, (2018) "Particle Swarm Optimization-Based Unequal and Fault Tolerant
Clustering Protocol for Wireless Sensor Networks," in IEEE Sensors Journal, vol. 18, no. 11, pp.
4614-4622, 1.
[10] S. Jain and N. Agrawal, (2020) "Development of Energy Efficient Modified LEACH Protocol for IoT
Applications," 12th International Conference on Computational Intelligence and Communication
Networks (CICN), Bhimtal, India, pp. 160-164.
[11] Obaidat, M.S.; Misra, S. (2014) “Principles of Wireless Sensor Networks”; Cambridge Univ. Press:
Cambridge, UK.
[12] Alnawafa, E.; Marghescu, I. (2018) “New energy efficient multi-hop routing techniques for wireless
sensor networks: Static and dynamic techniques”. Sensors, 18, 1863.
[13] Jadoon, R.; Zhou, W.; Jadoon, W.; Ahmed Khan, I. (2018) “RARZ: Ring-zone based routing protocol
for wireless sensor networks.” Appl. Sci., 8, 1023.
[14] Mahfuz, S., & Yesmin, F. (2014). “An approach to wireless nano sensing network routing protocol
based on energy and lifetime.” Int J Sci Technol Res, 3(2), 127-130.
[15] Heinzelman, W. R., Chandrakasan, A., & Balakrishnan, H. (2000). “Energy-efficient communication
protocol for wireless microsensor networks.” Proceedings of the 33rd annual Hawaii international
conference on System sciences IEEE, pp.10.
[16] Kim, D. S., & Chung, Y. J. (2006, June). Self-organization routing protocol supporting mobile nodes
for wireless sensor network. In Computer and Computational Sciences, IMSCCS'06. First
International Multi-Symposiums, Vol. 2, pp. 622-626.
[17] Chiang, S.; Huang, C.; Chang, K. (2007) “A Minimum Hop Routing Protocol for Home Security
Systems Using Wireless Sensor Networks” IEEE Press: New York, NY, USA, Volume 53, pp. 1483–
1489, ISBN 1558–4127.
[18] Ho, J.; Shih, H.; Liao, B. (2012) Chu, S. “A ladder diffusion algorithm using ant colony optimization
for wireless sensor networks.” Inf. Science, 192, 204–212.
[19] Suh, Y.; Kim, K.; Shin, D.; Youn, H. (August 2015) “Traffic-Aware Energy Efficient Routing
(TEER) Using Multi-Criteria Decision Making for Wireless Sensor Network.” In Proceedings of the
2015 5th International Conference on IT Convergence and Security (ICITCS), Kuala Lumpur,
Malaysia, 24–27.
[20] Migabo, M. E., Djouani, K., Kurien, A. M., and Olwal, T. O. (2015). “A stochastic energy
consumption model for wireless sensor networks using GBR techniques.” AFRICON, 1–5. doi:
10.1109/AFRCON.2015.7331987.
[21] Heinzelman, W. R., Chandrakasan, A., and Balakrishnan, H. (2000). “Energy-efficient
communication protocol for wireless microsensor networks,” in Proceedings of the 33rd Annual
Hawaii International Conference on System Sciences IEEE, 10. doi: 10.1109/HICSS.2000.926982.
[22] Kim, D., Ha, S., and Choi, Y. (1998). “K-hop cluster-based dynamic source routing in wireless ad-
hoc packet radio network,” in 48th
IEEE Vehicular Technology Conference, VTC 98, Vol. 1, Ottawa,
ON, 224–228. doi: 10.1109/VETEC.1998.686541.
17. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
69
[23] Intanagonwiwat, C., Govindan, R., and Estrin, D. (2000). “Directed diffusion: a scalable, and robust
communication paradigm for sensor networks,” in Proceedings of the 6th Annual International
Conference on Mobile Computing, and Networking, Rome:IEEE, pp. 56–67.
[24] Heinzelman, W. R., Kulik, J., and Balakrishnan, H. (1999). “Adaptive protocols for information
dissemination in wireless sensor networks,” in Proceedings of the 5th Annual ACM/IEEE
International Conference on Mobile Computing, and Networking IEEE, Seattle, WA.
[25] Lindsey, S., and Raghavendra, C. S. (2002). “PEGASIS: Power Efficient Gathering in Sensor
Information Systems,” in Proceedings of IEEE Aerospace Conference: IEEE.
[26] Zonouz, A. E., Xing, L., Vokkarane, V. M., and Sun, Y. (2016). “Hybrid wireless sensor networks: a
reliability, cost and energy-aware approach.” IET Wirel. Sensor Syst. 6, 42–48. doi: 10.1049/iet-
wss.2014.0131.
[27] Stojmenovic and X. Lin, (1999) “GEDIR: loop-free location based routing in wireless networks,” in
Proceedings of the International Conference on Parallel and Distributed Computing and Systems,
Boston, Mass, USA, pp. 109–115.
[28] Y. Xu, J. Heidemann, and D. Estrin, (2001) “Geography-informed energy conservation for ad hoc
routing,” in Proceedings of the 7th Annual International Conference on Mobile Computing and
Networking, Rome, Italy, pp. 215–222.
[29] B. Chen, K. Jamieson, and H. Balakrishnan (2001) “Span: an energy-efficient coordination algorithm
for topology maintenance in Ad Hoc wireless networks,” in Proceedings of the 7th ACM
International Conference on Mobile Computing and Networking, pp. 315–322, July 2001.
[30] Y. Yu, D. Estrin, and R. Govindan, (2001) “Geographical and energy aware routing: a recursive data
dissemination protocol for wireless sensor networks,” UCLA Computer Science Department, Los
Angeles, Calif, USA, Tech. Rep. UCLA/CSD-TR-01-0023
[31] F. Kuhn, R. Wattenhofer, and A. Zollinger, (2003) “Worst-case optimal and average-case efficient
geometric ad-hoc routing,” in Proceedings of the 4th ACM International Symposium on Mobile Ad
Hoc Networking and Computing, Annapolis, Md, USA, pp. 267–278.
[32] Ennaciri A., Erritali M., & Bengourram J (2019). “Load balancing protocol (EESAA) to improve
quality of service in wireless sensor network.” Procedia Computer Science, 151, 1140–1145.
[33] Sharawi, M. & Emary, E. (2017). “Impact of grey wolf optimization on WSN cluster formation and
lifetime expansion.” In 2017 Ninth international conference on advanced computational intelligence
(ICACI), Doha, pp. 157–162.
[34] Jadhav, A. R. & Shankar, T. (2017). “Whale optimization-based energy-efficient cluster head
selection algorithm for wireless sensor networks.” Neural and Evolutionary Computing.
arXiv:1711.0938 9.
[35] Yahiaoui, S., Omar, M., Bouabdallah, A., Natalizio, E., & Challal, Y. (2018). “An energy efficient
and QoS aware routing protocol for wireless sensor and actuator networks.” AEU - International
Journal of Electronics and Communications, 83, 193–203.
[36] Tianshu, W., Gongxuan, Z., Xichen, Y., & Ahmadreza, V. (2018). “Genetic algorithm for energy-
efficient clustering and routing in wireless sensor networks.” Journal of Systems and Software, 146,
196–214.
[37] Y. Sun, W. Dong and Y. Chen (2017) "An improved routing algorithm based on ant colony
optimization in wireless sensor networks" IEEE Communication. vol. 21, no. 6, pp. 1317-1320.
[38] E. Amiri, H. Keshavarz, M. Alizadeh, M. Zamani and T. Khodadadi, (2014) "Energy efficient routing
in wireless sensor networks based on fuzzy ant colony optimization", Int. J. Distrib. Sensor Network,
vol. 10, no. 7.
[39] S. Okdem and D. Karaboga, (2009) "Routing in wireless sensor networks using an ant colony
optimization (ACO) router chip", Sensors, vol. 9, no. 2, pp. 909-921.
[40] Y. Xu, Z. Yue and L. Lv, (2019) "Clustering Routing Algorithm and Simulation of Internet of Things
Perception Layer Based on Energy Balance," in IEEE Access, vol. 7, pp. 145667-145676.
18. International Journal of Computer Networks & Communications (IJCNC) Vol.13, No.4, July 2021
70
AUTHORS
SHIVSHANKER. P. BIRADAR Completed B.E (Electronics & Communication
Engineering), M. Tech (Communication System) and perusing Ph.D. from VTU,
Belagavi, India. Research work at congestion control in sensor network using routing
techniques. The area of interest in wireless communication, digital processing, etc.
Dr.T.S.Vishwanath Ph.D. in Control System, Institution: Dr. MGR Educational and
Research Institute University Chennai India, M. E. in Control System, Institution:
WCE Sangli, BE in Electrical Engineering, Institution: PDA College of Engineering
Gulbarga. Research work at “Robust H∞ control and analysis” application to
electrical drives. Member of MIE, ISTE, IETE and IJEET.