The widespread application of wireless sensor networks (WNSs) is obstructed by the severely limited
energy constraints and security threat for sensor nodes. Since traditional routing and security schemes are
not suited for these networks, a large part of research focusses on energy efficient routing protocols while
extending the network lifetime. Uneven distribution of communication loads result in network partitioning.
Traditional novel en-route filtering approaches, notably commutative cipher based en-route filtering
(CCEF) saves energy by early filtering of false reports. However this approach main focus is security not
network lifetime is limited by fixed paths and underlying routing not suitable for WSNs. In order to cater
these problems we propose energy efficient routing and pre-deterministic key distribution with dynamic
path selection in CCEF. Modified CCEF (MCCEF) aims at saving energy and extending network lifetime
while maintaining filtering power as in CCEF. Experimental results demonstrate the validity of our
approach with an average of three times network lifetime extension, 5.022% energy savings, and similar
filtering power as the original scheme.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
The document proposes using multi-objective swarm optimization algorithms to route data in heterogeneous wireless sensor networks. Specifically, it develops the MOSSA-BA algorithm, which combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the artificial bee colony algorithm (BA). Testing shows the MOSSA-BA based routing protocols improve energy efficiency over 34% in medium areas and over 22% in large areas compared to SEP, EDEEC, and other competitors.
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...IJCI JOURNAL
With limited amount of energy, nodes are powered by
batteries in wireless networks. Increasing the lif
e
span of the network and reducing the usage of energ
y are two severe problems in Wireless Sensor
Networks. A small number of energy utilization path
algorithms like minimum spanning tree reduces tota
l
energy consumption of a Wireless Sensor Network, ho
wever very heavy load of sending data packets on
many key nodes is used with the intention that the
nodes quickly consumes battery energy, by raising t
he
life span of the network reduced. Our proposal work
aimed on presenting an Energy Conserved Fast and
Secure Data Aggregation Scheme for WSN in time and
security logic occurrence data collection
application. To begin with, initially the goal is m
ade on energy preservation of sensed data gathering
from
event identified sensor nodes to destination. Inven
tion is finished on Energy Efficient Utilization Pa
th
Algorithm (EEUPA), to extend the lifespan by proces
sing the collecting series with path mediators
depending on gene characteristics sequencing of nod
e energy drain rate, energy consumption rate, and
message overhead together with extended network lif
e span. Additionally, a mathematical programming
technique is designed to improve the lifespan of th
e network. Simulation experiments carried out among
different relating conditions of wireless sensor ne
twork by different path algorithms to analyze the
efficiency and effectiveness of planned Efficient E
nergy Utilization Path Algorithm in wireless sensor
network (EEUPA)
Performance evaluation of data filtering approach in wireless sensor networks...ijmnct
Wireless Sensor Network is a field of research which is viable in every application area like security
services, patient care, traffic regulations, habitat monitoring and so on. The resource limitation of small
sized tiny nodes has always been an issue in wireless sensor networks. Various techniques for improving
network lifetime have been proposed in the past. Now the attention has been shifted towards heterogeneous
networks rather than having homogeneous sensor nodes in a network. The concept of partial mobility has
also been suggested for network longevity. In all the major proposals; clustering and data aggregation in
heterogeneous networks has played an integral role. This paper contributes towards a new concept of
clustering and data filtering in wireless sensor networks. In this paper we have compared voronoi based
ant systems with standard LEACH-C algorithm and MTWSW with TWSW algorithm. Both the techniques
have been applied in heterogeneous wireless sensor networks. This approach is applicable both for critical
as well as for non-critical applications in wireless sensor networks. Both the approaches presented in this
paper outperform LEACH-C and TWSW in terms of energy efficiency and shows promising results for
future work.
This document provides a literature review of various methods proposed by researchers to improve energy efficiency and security in wireless sensor networks (WSNs). It summarizes several key energy efficient routing protocols like LEACH, PEGASIS and TEEN, as well as security threats like denial of service attacks, wormhole attacks, and Sybil attacks. The document reviews several studies that have developed algorithms and schemes to reduce energy consumption through techniques like dynamic clustering, mobile agent clustering, and randomized routing. It also discusses schemes to prevent security issues like false data injection and improve data authentication. The conclusion states that future work needs to focus on improving battery power and providing better fault tolerance and protection from severe security threats in WSNs.
Energy Proficient and Security Protocol for WSN: A Reviewtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Theoretical work submitted to the Journal should be original in its motivation or modeling structure. Empirical analysis should be based on a theoretical framework and should be capable of replication. It is expected that all materials required for replication (including computer programs and data sets) should be available upon request to the authors.
The International Journal of Engineering & Science would take much care in making your article published without much delay with your kind cooperation
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.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
Routing is a persistent concern in wireless sensor networks (WSNs), as getting data from sources to destinations can be a tricky task. Challenges include safeguarding the data being transferred, ensuring network longevity, and preserving energy in harsh environmental conditions. Consequently, this study delves into the suitability of using multi-objective swarm optimization to route heterogeneous WSNs in the hope of mitigating these issues while boosting the speed and accuracy of data transmission. In order to achieve better performance in terms of load balancing and reducing energy expenditure, the MOSSA-BA algorithm was developed. This algorithm combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the exploiting strategy of the artificial bee colony (BA) in the neighbourhood of Salps. Inspired by the SEP and EDEEC protocols, the integrated solutions of MOSSA-BA were used to route two and three levels of heterogeneous networks. The embedded solutions provided outstanding performance in regards to FND, HND, LND, percentage of remaining energy, and the number of packages delivered to the base station. Compared to SEP, EDEEC, and other competitors based on MOSSA and a modified multi-objective particle swarm optimization (MOPSO), the MOSSA-BA-based protocols demonstrated energy-saving percentages of more than 34% in medium-sized areas of interest and over 22% in large-sized areas of detection.
Multi Objective Salp Swarm based Energy Efficient Routing Protocol for Hetero...IJCNCJournal
The document proposes using multi-objective swarm optimization algorithms to route data in heterogeneous wireless sensor networks. Specifically, it develops the MOSSA-BA algorithm, which combines the Multi-Objective Salp Swarm Algorithm (MOSSA) with the artificial bee colony algorithm (BA). Testing shows the MOSSA-BA based routing protocols improve energy efficiency over 34% in medium areas and over 22% in large areas compared to SEP, EDEEC, and other competitors.
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...IJCI JOURNAL
With limited amount of energy, nodes are powered by
batteries in wireless networks. Increasing the lif
e
span of the network and reducing the usage of energ
y are two severe problems in Wireless Sensor
Networks. A small number of energy utilization path
algorithms like minimum spanning tree reduces tota
l
energy consumption of a Wireless Sensor Network, ho
wever very heavy load of sending data packets on
many key nodes is used with the intention that the
nodes quickly consumes battery energy, by raising t
he
life span of the network reduced. Our proposal work
aimed on presenting an Energy Conserved Fast and
Secure Data Aggregation Scheme for WSN in time and
security logic occurrence data collection
application. To begin with, initially the goal is m
ade on energy preservation of sensed data gathering
from
event identified sensor nodes to destination. Inven
tion is finished on Energy Efficient Utilization Pa
th
Algorithm (EEUPA), to extend the lifespan by proces
sing the collecting series with path mediators
depending on gene characteristics sequencing of nod
e energy drain rate, energy consumption rate, and
message overhead together with extended network lif
e span. Additionally, a mathematical programming
technique is designed to improve the lifespan of th
e network. Simulation experiments carried out among
different relating conditions of wireless sensor ne
twork by different path algorithms to analyze the
efficiency and effectiveness of planned Efficient E
nergy Utilization Path Algorithm in wireless sensor
network (EEUPA)
Performance evaluation of data filtering approach in wireless sensor networks...ijmnct
Wireless Sensor Network is a field of research which is viable in every application area like security
services, patient care, traffic regulations, habitat monitoring and so on. The resource limitation of small
sized tiny nodes has always been an issue in wireless sensor networks. Various techniques for improving
network lifetime have been proposed in the past. Now the attention has been shifted towards heterogeneous
networks rather than having homogeneous sensor nodes in a network. The concept of partial mobility has
also been suggested for network longevity. In all the major proposals; clustering and data aggregation in
heterogeneous networks has played an integral role. This paper contributes towards a new concept of
clustering and data filtering in wireless sensor networks. In this paper we have compared voronoi based
ant systems with standard LEACH-C algorithm and MTWSW with TWSW algorithm. Both the techniques
have been applied in heterogeneous wireless sensor networks. This approach is applicable both for critical
as well as for non-critical applications in wireless sensor networks. Both the approaches presented in this
paper outperform LEACH-C and TWSW in terms of energy efficiency and shows promising results for
future work.
This document provides a literature review of various methods proposed by researchers to improve energy efficiency and security in wireless sensor networks (WSNs). It summarizes several key energy efficient routing protocols like LEACH, PEGASIS and TEEN, as well as security threats like denial of service attacks, wormhole attacks, and Sybil attacks. The document reviews several studies that have developed algorithms and schemes to reduce energy consumption through techniques like dynamic clustering, mobile agent clustering, and randomized routing. It also discusses schemes to prevent security issues like false data injection and improve data authentication. The conclusion states that future work needs to focus on improving battery power and providing better fault tolerance and protection from severe security threats in WSNs.
Energy Proficient and Security Protocol for WSN: A Reviewtheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Theoretical work submitted to the Journal should be original in its motivation or modeling structure. Empirical analysis should be based on a theoretical framework and should be capable of replication. It is expected that all materials required for replication (including computer programs and data sets) should be available upon request to the authors.
The International Journal of Engineering & Science would take much care in making your article published without much delay with your kind cooperation
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.
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.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor node creates challenges for routing in WSNs. The research work presents the organized and detailed description of energy conservation method for WSNs. In the proposed method reclustering and multihop data transmission processes are utilized for data reporting to base station by sensor node. The accurate use of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for longer times inside the cluster. The result shows that the proposed clustering approach has higher stable region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy Adaptive Clustering Hierarchy (LEACH) for WSNs.
Performance Evaluation of Ant Colony Optimization Based Rendezvous Leach Usin...IJERD Editor
- The document discusses the performance evaluation of an Ant Colony Optimization (ACO) based algorithm for wireless sensor networks with mobile sinks.
- It proposes using ACO along with rendezvous points and mobile sinks in a clustering protocol called Rendezvous LEACH (RZ LEACH) to optimize energy efficiency and network lifetime.
- Simulation results show that the ACO based RZ LEACH outperforms the original RZ LEACH protocol by prolonging the number of operational nodes and increasing average remaining energy in the network over time.
This document summarizes several energy-efficient routing protocols for wireless sensor networks. It begins by introducing the basic components and architecture of wireless sensor networks. It then categorizes routing protocols based on network structure (flat, hierarchical, location-based) and operation (multipath, query-based, etc.). The majority of the document focuses on reviewing hierarchical protocols, including LEACH, PEGASIS, Hierarchical PEGASIS, and HEED. It provides brief overviews of how these protocols work to reduce energy consumption and extend network lifetime through clustering and data aggregation approaches.
The document discusses energy efficient routing protocols for clustered wireless sensor networks. It provides an overview of wireless sensor networks and discusses how clustering is commonly used to improve energy efficiency and scalability. The document reviews several existing clustering-based routing protocols and analyzes their approaches for prolonging network lifetime by minimizing energy consumption in wireless sensor networks.
A multi-hop routing protocol for an energy-efficient in wireless sensor networkIJECEIAES
The low-energy adaptive clustering hierarchy (LEACH) protocol has been developed to be implemented in wireless sensor networks (WSNs) systems such as healthcare and military systems. LEACH protocol depends on clustering the employed sensors and electing one cluster head (CH) for each cluster. The CH nodes are changed periodically to evenly distribute the energy load among sensors. Updating the CH node requires electing different CH and re-clustering sensors. This process consumes sensors’ energy due to sending and receiving many broadcast and unicast messages thus reduces the network lifetime, which is regarded as a significant issue in LEACH. This research develops a new approach based on modifying the LEACH protocol to minimize the need of updating the cluster head. The proposal aims to extend the WSN’s lifetime by maintaining the sensor nodes’ energy. The suggested approach has been evaluated and shown remarkable efficiency in comparison with basic LEACH protocol and not-clustered protocol in terms of extending network lifetime and reducing the required sent messages in the network reflected by 15%, and, in addition, reducing the need to reformatting the clusters frequently and saving network resources.
Data gathering in wireless sensor networks using intermediate nodesIJCNCJournal
Energy consumption is an essential concern to Wireless Sensor Networks (WSNs).The major cause of the energy consumption in WSNs is due to the data aggregation. A data aggregation is a process of collecting data from sensor nodes and transmitting these data to the sink node or base station. An effective way to perform such a task is accomplished by using clustering. In clustering, nodes are grouped into clusters where a number of nodes, called cluster heads, are responsible for gathering data from other nodes, aggregate them and transmit them to the Base Station (BS).
In this paper we produce a new algorithm which focused on reducing the transmission bath between sensor nodes and cluster heads. A proper utilization and reserving of the available power resources is achieved with this technique compared to the well-known LEACH_C algorithm.
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
This document describes a hybrid Particle Swarm Optimization - Bat Algorithm (HPSO-BA) with fuzzy logic routing technique to maximize lifetime in wireless sensor networks while constraining delay. The proposed method uses HPSO-BA to optimize energy efficiency in the sensor network's shortest path trees. A fuzzy logic approach is also used to combine multiple metrics for routing decisions. Simulation results show the technique achieves a good balance between increased network lifetime and reduced end-to-end delay.
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.
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.
Congestion Control Clustering a Review PaperEditor IJCATR
Wireless Sensor Networks consists of sensor nodes which are scattered in the environment, gather data and transmit it to a
base station for processing. Energy conservation in the Wireless Sensor Networks (WSN) is a very important task because of their
limited battery power. The related works so far have been done have tried to solve the problem keeping in the mind the constraints of
WSNs. In this paper, a priority based application specific congestion control clustering (PASCCC) protocol has been studied, which
often integrates the range of motion and heterogeneity of the nodes to detect congestion in a very network. Moreover a comparison of
the various clustering techniques has been done. From the survey it has been found that none of the protocol is efficient for energy
conservation. Hence the paper ends with future scope to overcome these issues.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
The document proposes a new method to increase the lifetime of wireless sensor networks. It divides the sensor network environment into two virtual layers based on distance from the base station. It then uses residual energy, distance from base station, and position in the layers as factors in selecting cluster heads. Simulations show the proposed method outperforms LEACH and ELEACH algorithms in both homogeneous and heterogeneous sensor energy environments.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
A Survey of Routing Protocols for Structural Health MonitoringIJEEE
Wireless sensor networks have emerged in recent years as a promising technology that can impact the field of structural monitoring and infrastructure asset management. Various routing protocols are used to define communication among sensor nodes of the wireless sensor network for purpose of disseminating information. These routing protocols can be designed to improve the network performance in terms of energy consumption, delay and security issues. This paper discusses the requirements of routing protocol for Structural health monitoring and presents summary of various routing protocols used for WSNs for Structural health monitoring.
Energy Aware Talented Clustering with Compressive Sensing (TCCS) for Wireless...IJCNCJournal
Wireless sensor networks (WSNs) are networks of sensor nodes that interact wirelessly to gather information about the surrounding environment. Nodes are often low-powered and dispersed in an ad hoc, decentralized manner. Although WSNs have gained in popularity, they still have several serious shortcomings, like limited battery life and bandwidth. In this paper, the cluster head (CH) selection, the Compressive Sensing (CS) theory, the Connection-based Decentralized Clustering (CDC), the relay node selection, and the Multi Objective Genetic Algorithm (MOGA)are all taken into account The initial stage provided a theoretical revision to the concepts of network construction, compressive sensing, and MOGA, which impacted the improvement of network lifetime. In the second stage developed a novel model such as Energy Aware Talented Clustering with Compressive Sensing (TCCS) for the sensor network. This approach considers increasing longevity but also raises the network's overall quality of service (QoS). In the analysis, the TCCS model is applied to both the centralized and distributed networks and compared with the existing methods. When compared to the previous methods, the simulation results show that the proposed work performs better in terms of the calculation of maximum packet delivery ratio of 93.93 percent, minimum energy consumption of 8.04J, maximum energy efficiency of 91.04 percent, maximum network throughput of 465.51kbps, minimum packet loss of 282 packets, and minimum delay of 63.82 msec.
ENERGY AWARE TALENTED CLUSTERING WITH COMPRESSIVE SENSING (TCCS) FOR WIRELESS...IJCNCJournal
Wireless sensor networks (WSNs) are networks of sensor nodes that interact wirelessly to gather
information about the surrounding environment. Nodes are often low-powered and dispersed in an ad hoc,
decentralized manner. Although WSNs have gained in popularity, they still have several serious
shortcomings, like limited battery life and bandwidth. In this paper, the cluster head (CH) selection, the
Compressive Sensing (CS) theory, the Connection-based Decentralized Clustering (CDC), the relay node
selection, and the Multi Objective Genetic Algorithm (MOGA)are all taken into account The initial stage
provided a theoretical revision to the concepts of network construction, compressive sensing, and MOGA,
which impacted the improvement of network lifetime. In the second stage developed a novel model such as
Energy Aware Talented Clustering with Compressive Sensing (TCCS) for the sensor network. This
approach considers increasing longevity but also raises the network's overall quality of service (QoS). In
the analysis, the TCCS model is applied to both the centralized and distributed networks and compared
with the existing methods. When compared to the previous methods, the simulation results show that the
proposed work performs better in terms of the calculation of maximum packet delivery ratio of 93.93
percent, minimum energy consumption of 8.04J, maximum energy efficiency of 91.04 percent, maximum
network throughput of 465.51kbps, minimum packet loss of 282 packets, and minimum delay of 63.82 msec.
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.
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.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of user's approach to providing feedback for smart home devices. We will conduct an online survey for a sample of three to five students selected by simple random sampling to study the user's motto for giving feedback on smart home devices and their expectations. We have observed that most users are ready to actively share their input on smart home devices to improve the product's service and quality to fulfill the user’s needs and make their lives easier.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more
straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame
works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of
user's approach to providing feedback for smart home devices. We will conduct an online survey for a
sample of three to five students selected by simple random sampling to study the user's motto for giving
feedback on smart home devices and their expectations. We have observed that most users are ready to
actively share their input on smart home devices to improve the product's service and quality to fulfill the
user’s needs and make their lives easier.
More Related Content
Similar to MODIFIED CCEF FOR ENERGY-EFFICIENCY AND EXTENDED NETWORK LIFETIME IN WSNS
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.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor node creates challenges for routing in WSNs. The research work presents the organized and detailed description of energy conservation method for WSNs. In the proposed method reclustering and multihop data transmission processes are utilized for data reporting to base station by sensor node. The accurate use of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for longer times inside the cluster. The result shows that the proposed clustering approach has higher stable region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy Adaptive Clustering Hierarchy (LEACH) for WSNs.
Performance Evaluation of Ant Colony Optimization Based Rendezvous Leach Usin...IJERD Editor
- The document discusses the performance evaluation of an Ant Colony Optimization (ACO) based algorithm for wireless sensor networks with mobile sinks.
- It proposes using ACO along with rendezvous points and mobile sinks in a clustering protocol called Rendezvous LEACH (RZ LEACH) to optimize energy efficiency and network lifetime.
- Simulation results show that the ACO based RZ LEACH outperforms the original RZ LEACH protocol by prolonging the number of operational nodes and increasing average remaining energy in the network over time.
This document summarizes several energy-efficient routing protocols for wireless sensor networks. It begins by introducing the basic components and architecture of wireless sensor networks. It then categorizes routing protocols based on network structure (flat, hierarchical, location-based) and operation (multipath, query-based, etc.). The majority of the document focuses on reviewing hierarchical protocols, including LEACH, PEGASIS, Hierarchical PEGASIS, and HEED. It provides brief overviews of how these protocols work to reduce energy consumption and extend network lifetime through clustering and data aggregation approaches.
The document discusses energy efficient routing protocols for clustered wireless sensor networks. It provides an overview of wireless sensor networks and discusses how clustering is commonly used to improve energy efficiency and scalability. The document reviews several existing clustering-based routing protocols and analyzes their approaches for prolonging network lifetime by minimizing energy consumption in wireless sensor networks.
A multi-hop routing protocol for an energy-efficient in wireless sensor networkIJECEIAES
The low-energy adaptive clustering hierarchy (LEACH) protocol has been developed to be implemented in wireless sensor networks (WSNs) systems such as healthcare and military systems. LEACH protocol depends on clustering the employed sensors and electing one cluster head (CH) for each cluster. The CH nodes are changed periodically to evenly distribute the energy load among sensors. Updating the CH node requires electing different CH and re-clustering sensors. This process consumes sensors’ energy due to sending and receiving many broadcast and unicast messages thus reduces the network lifetime, which is regarded as a significant issue in LEACH. This research develops a new approach based on modifying the LEACH protocol to minimize the need of updating the cluster head. The proposal aims to extend the WSN’s lifetime by maintaining the sensor nodes’ energy. The suggested approach has been evaluated and shown remarkable efficiency in comparison with basic LEACH protocol and not-clustered protocol in terms of extending network lifetime and reducing the required sent messages in the network reflected by 15%, and, in addition, reducing the need to reformatting the clusters frequently and saving network resources.
Data gathering in wireless sensor networks using intermediate nodesIJCNCJournal
Energy consumption is an essential concern to Wireless Sensor Networks (WSNs).The major cause of the energy consumption in WSNs is due to the data aggregation. A data aggregation is a process of collecting data from sensor nodes and transmitting these data to the sink node or base station. An effective way to perform such a task is accomplished by using clustering. In clustering, nodes are grouped into clusters where a number of nodes, called cluster heads, are responsible for gathering data from other nodes, aggregate them and transmit them to the Base Station (BS).
In this paper we produce a new algorithm which focused on reducing the transmission bath between sensor nodes and cluster heads. A proper utilization and reserving of the available power resources is achieved with this technique compared to the well-known LEACH_C algorithm.
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
This document describes a hybrid Particle Swarm Optimization - Bat Algorithm (HPSO-BA) with fuzzy logic routing technique to maximize lifetime in wireless sensor networks while constraining delay. The proposed method uses HPSO-BA to optimize energy efficiency in the sensor network's shortest path trees. A fuzzy logic approach is also used to combine multiple metrics for routing decisions. Simulation results show the technique achieves a good balance between increased network lifetime and reduced end-to-end delay.
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.
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.
Congestion Control Clustering a Review PaperEditor IJCATR
Wireless Sensor Networks consists of sensor nodes which are scattered in the environment, gather data and transmit it to a
base station for processing. Energy conservation in the Wireless Sensor Networks (WSN) is a very important task because of their
limited battery power. The related works so far have been done have tried to solve the problem keeping in the mind the constraints of
WSNs. In this paper, a priority based application specific congestion control clustering (PASCCC) protocol has been studied, which
often integrates the range of motion and heterogeneity of the nodes to detect congestion in a very network. Moreover a comparison of
the various clustering techniques has been done. From the survey it has been found that none of the protocol is efficient for energy
conservation. Hence the paper ends with future scope to overcome these issues.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
The document proposes a new method to increase the lifetime of wireless sensor networks. It divides the sensor network environment into two virtual layers based on distance from the base station. It then uses residual energy, distance from base station, and position in the layers as factors in selecting cluster heads. Simulations show the proposed method outperforms LEACH and ELEACH algorithms in both homogeneous and heterogeneous sensor energy environments.
INCREASING WIRELESS SENSOR NETWORKS LIFETIME WITH NEW METHODijwmn
One of the most important issues in Wireless Sensor Networks (WSNs) is severe energy restrictions. As the
performance of Sensor Networks is strongly dependence to the network lifetime, researchers seek a way to
use node energy supply effectively and increasing network lifetime. As a consequence, it is crucial to use
routing algorithms result in decrease energy consumption and better bandwidth utilization. The purpose of
this paper is to increase Wireless Sensor Networks lifetime using LEACH-algorithm. So before clustering
Network environment, it is divided into two virtual layers (using distance between sensor nodes and base
station) and then regarding to sensors position in each of two layers, residual energy of sensor and
distance from base station is used in clustering. In this article, we compare proposed algorithm with wellknown LEACH and ELEACH algorithms in homogenous environment (with equal energy for all sensors)
and heterogeneous one (energy of half of sensors get doubled), also for static and dynamic situation of base
station. Results show that our proposed algorithm delivers improved performance.
A Survey of Routing Protocols for Structural Health MonitoringIJEEE
Wireless sensor networks have emerged in recent years as a promising technology that can impact the field of structural monitoring and infrastructure asset management. Various routing protocols are used to define communication among sensor nodes of the wireless sensor network for purpose of disseminating information. These routing protocols can be designed to improve the network performance in terms of energy consumption, delay and security issues. This paper discusses the requirements of routing protocol for Structural health monitoring and presents summary of various routing protocols used for WSNs for Structural health monitoring.
Energy Aware Talented Clustering with Compressive Sensing (TCCS) for Wireless...IJCNCJournal
Wireless sensor networks (WSNs) are networks of sensor nodes that interact wirelessly to gather information about the surrounding environment. Nodes are often low-powered and dispersed in an ad hoc, decentralized manner. Although WSNs have gained in popularity, they still have several serious shortcomings, like limited battery life and bandwidth. In this paper, the cluster head (CH) selection, the Compressive Sensing (CS) theory, the Connection-based Decentralized Clustering (CDC), the relay node selection, and the Multi Objective Genetic Algorithm (MOGA)are all taken into account The initial stage provided a theoretical revision to the concepts of network construction, compressive sensing, and MOGA, which impacted the improvement of network lifetime. In the second stage developed a novel model such as Energy Aware Talented Clustering with Compressive Sensing (TCCS) for the sensor network. This approach considers increasing longevity but also raises the network's overall quality of service (QoS). In the analysis, the TCCS model is applied to both the centralized and distributed networks and compared with the existing methods. When compared to the previous methods, the simulation results show that the proposed work performs better in terms of the calculation of maximum packet delivery ratio of 93.93 percent, minimum energy consumption of 8.04J, maximum energy efficiency of 91.04 percent, maximum network throughput of 465.51kbps, minimum packet loss of 282 packets, and minimum delay of 63.82 msec.
ENERGY AWARE TALENTED CLUSTERING WITH COMPRESSIVE SENSING (TCCS) FOR WIRELESS...IJCNCJournal
Wireless sensor networks (WSNs) are networks of sensor nodes that interact wirelessly to gather
information about the surrounding environment. Nodes are often low-powered and dispersed in an ad hoc,
decentralized manner. Although WSNs have gained in popularity, they still have several serious
shortcomings, like limited battery life and bandwidth. In this paper, the cluster head (CH) selection, the
Compressive Sensing (CS) theory, the Connection-based Decentralized Clustering (CDC), the relay node
selection, and the Multi Objective Genetic Algorithm (MOGA)are all taken into account The initial stage
provided a theoretical revision to the concepts of network construction, compressive sensing, and MOGA,
which impacted the improvement of network lifetime. In the second stage developed a novel model such as
Energy Aware Talented Clustering with Compressive Sensing (TCCS) for the sensor network. This
approach considers increasing longevity but also raises the network's overall quality of service (QoS). In
the analysis, the TCCS model is applied to both the centralized and distributed networks and compared
with the existing methods. When compared to the previous methods, the simulation results show that the
proposed work performs better in terms of the calculation of maximum packet delivery ratio of 93.93
percent, minimum energy consumption of 8.04J, maximum energy efficiency of 91.04 percent, maximum
network throughput of 465.51kbps, minimum packet loss of 282 packets, and minimum delay of 63.82 msec.
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.
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.
Similar to MODIFIED CCEF FOR ENERGY-EFFICIENCY AND EXTENDED NETWORK LIFETIME IN WSNS (20)
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of user's approach to providing feedback for smart home devices. We will conduct an online survey for a sample of three to five students selected by simple random sampling to study the user's motto for giving feedback on smart home devices and their expectations. We have observed that most users are ready to actively share their input on smart home devices to improve the product's service and quality to fulfill the user’s needs and make their lives easier.
Users Approach on Providing Feedback for Smart Home Devices – Phase IIijujournal
Smart Home technology has accomplished extraordinary success in making individuals' lives more
straightforward and relaxing. Technology has recently brought about numerous savvy and refined frame
works that advanced clever living innovation. In this paper, we will investigate the behavioral intention of
user's approach to providing feedback for smart home devices. We will conduct an online survey for a
sample of three to five students selected by simple random sampling to study the user's motto for giving
feedback on smart home devices and their expectations. We have observed that most users are ready to
actively share their input on smart home devices to improve the product's service and quality to fulfill the
user’s needs and make their lives easier.
October 2023-Top Cited Articles in IJU.pdfijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
ACCELERATION DETECTION OF LARGE (PROBABLY) PRIME NUMBERSijujournal
This document discusses methods for efficiently generating large prime numbers for use in RSA cryptography. It presents experimental results measuring the time taken to generate prime numbers when trial dividing the starting number by different numbers of initial primes before applying the Miller-Rabin primality test. The optimal number of trial divisions can be estimated as B=E/D, where E is the time for Miller-Rabin test and D is the maximum usefulness of trial division. Experimental results on different sized numbers support dividing by around 20 initial primes as optimal.
A novel integrated approach for handling anomalies in RFID dataijujournal
Radio Frequency Identification (RFID) is a convenient technology employed in various applications. The
success of these RFID applications depends heavily on the quality of the data stream generated by RFID
readers. Due to various anomalies found predominantly in RFID data it limits the widespread adoption of
this technology. Our work is to eliminate the anomalies present in RFID data in an effective manner so that
it can be applied for high end applications. Our approach is a hybrid approach of middleware and
deferred because it is not always possible to remove all anomalies and redundancies in middleware. The
processing of other anomalies is deferred until the query time and cleaned by business rules. Experimental
results show that the proposed approach performs the cleaning in an effective manner compared to the
existing approaches.
UBIQUITOUS HEALTHCARE MONITORING SYSTEM USING INTEGRATED TRIAXIAL ACCELEROMET...ijujournal
Ubiquitous healthcare has become one of the prominent areas of research inorder to address the
challenges encountered in healthcare environment. In contribution to this area, this study developed a
system prototype that recommends diagonostic services based on physiological data collected in real time
from a distant patient. The prototype uses WBAN body sensors to be worn by the individual and an android
smart phone as a personal server. Physiological data is collected and uploaded to a Medical Health
Server (MHS) via GPRS/internet to be analysed. Our implemented prototype monitors the activity, location
and physiological data such as SpO2 and Heart Rate (HR) of the elderly and patients in rehabilitation. The
uploaded information can be accessed in real time by medical practitioners through a web application.
ENHANCING INDEPENDENT SENIOR LIVING THROUGH SMART HOME TECHNOLOGIESijujournal
The population of elderly folks is ballooning worldwide as people live longer. But getting older often
means declining health and trouble living solo. Smart home tech could keep an eye on old folks and get
help quickly when needed so they can stay independent. This paper looks at a system combining wireless
sensors, video watches, automation, resident monitoring, emergency detection, and remote access. Sensors
track health signs, activities, appliance use. Video analytics spot odd stuff like falls. Sensor fusion and
machine learning find normal patterns so wonks can see unhealthy changes and send alerts. Multi-channel
alerts reach caregivers and emergency folks. A LabVIEW can integrate devices and enables local and
remote oversight and can control and handle emergency responses. Benefits seem to be early illness clues,
quick help, less burden on caregivers, and optimized home settings. But will old folks use all this tech? Can
we prove it really helps folks live longer and better? More research on maximizing reliability and
evaluating real-world impacts is needed. But designed thoughtfully, smart homes could may profoundly
improve the aging experience.
HMR LOG ANALYZER: ANALYZE WEB APPLICATION LOGS OVER HADOOP MAPREDUCEijujournal
In today’s Internet world, log file analysis is becoming a necessary task for analyzing the customer’s
behavior in order to improve advertising and sales as well as for datasets like environment, medical,
banking system it is important to analyze the log data to get required knowledge from it. Web mining is the
process of discovering the knowledge from the web data. Log files are getting generated very fast at the
rate of 1-10 Mb/s per machine, a single data center can generate tens of terabytes of log data in a day.
These datasets are huge. In order to analyze such large datasets we need parallel processing system and
reliable data storage mechanism. Virtual database system is an effective solution for integrating the data
but it becomes inefficient for large datasets. The Hadoop framework provides reliable data storage by
Hadoop Distributed File System and MapReduce programming model which is a parallel processing
system for large datasets. Hadoop distributed file system breaks up input data and sends fractions of the
original data to several machines in hadoop cluster to hold blocks of data. This mechanism helps to
process log data in parallel using all the machines in the hadoop cluster and computes result efficiently.
The dominant approach provided by hadoop to “Store first query later”, loads the data to the Hadoop
Distributed File System and then executes queries written in Pig Latin. This approach reduces the response
time as well as the load on to the end system. This paper proposes a log analysis system using Hadoop
MapReduce which will provide accurate results in minimum response time.
SERVICE DISCOVERY – A SURVEY AND COMPARISONijujournal
The document summarizes and compares several major service discovery approaches. It provides an overview of service discovery objectives and techniques, then surveys prominent protocols including SLP, Jini, and UPnP. Each approach is analyzed based on features like service description, discovery architecture, announcement/query mechanisms, and how they handle service usage and dynamic network changes. The comparison aims to identify strengths and limitations to guide future research in improving service discovery.
SIX DEGREES OF SEPARATION TO IMPROVE ROUTING IN OPPORTUNISTIC NETWORKSijujournal
Opportunistic Networks are able to exploit social behavior to create connectivity opportunities. This
paradigm uses pair-wise contacts for routing messages between nodes. In this context we investigated if the
“six degrees of separation” conjecture of small-world networks can be used as a basis to route messages in
Opportunistic Networks. We propose a simple approach for routing that outperforms some popular
protocols in simulations that are carried out with real world traces using ONE simulator. We conclude that
static graph models are not suitable for underlay routing approaches in highly dynamic networks like
Opportunistic Networks without taking account of temporal factors such as time, duration and frequency of
previous encounters.
International Journal of Ubiquitous Computing (IJU)ijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
PERVASIVE COMPUTING APPLIED TO THE CARE OF PATIENTS WITH DEMENTIA IN HOMECARE...ijujournal
The aging population and the consequent increase in the incidence of dementias is causing many
challenges to health systems, mainly related to infrastructure, low services quality and high costs. One
solution is to provide the care at house of the patient, through of home care services. However, it is not a
trivial task, since a patient with dementia requires constant care and monitoring from a caregiver, who
suffers physical and emotional overload. In this context, this work presents an modelling for development of
pervasive systems aimed at helping the care of these patients in order to lessen the burden of the caregiver
while the patient continue to receive the necessary care.
A proposed Novel Approach for Sentiment Analysis and Opinion Miningijujournal
as the people are being dependent on internet the requirement of user view analysis is increasing
exponentially. Customer posts their experience and opinion about the product policy and services. But,
because of the massive volume of reviews, customers can’t read all reviews. In order to solve this problem,
a lot of research is being carried out in Opinion Mining. In order to solve this problem, a lot of research is
being carried out in Opinion Mining. Through the Opinion Mining, we can know about contents of whole
product reviews, Blogs are websites that allow one or more individuals to write about things they want to
share with other The valuable data contained in posts from a large number of users across geographic,
demographic and cultural boundaries provide a rich data source not only for commercial exploitation but
also for psychological & sociopolitical research. This paper tries to demonstrate the plausibility of the idea
through our clustering and classifying opinion mining experiment on analysis of blog posts on recent
product policy and services reviews. We are proposing a Nobel approach for analyzing the Review for the
customer opinion
International Journal of Ubiquitous Computing (IJU)ijujournal
International Journal of Ubiquitous Computing (IJU) is a quarterly open access peer-reviewed journal that provides excellent international forum for sharing knowledge and results in theory, methodology and applications of ubiquitous computing. Current information age is witnessing a dramatic use of digital and electronic devices in the workplace and beyond. Ubiquitous Computing presents a rather arduous requirement of robustness, reliability and availability to the end user. Ubiquitous computing has received a significant and sustained research interest in terms of designing and deploying large scale and high performance computational applications in real life. The aim of the journal is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
USABILITY ENGINEERING OF GAMES: A COMPARATIVE ANALYSIS OF MEASURING EXCITEMEN...ijujournal
Usability engineering and usability testing are concepts that continue to evolve. Interesting research studies
and new ideas come up every now and then. This paper tests the hypothesis of using an EDA-based
physiological measurements as a usability testing tool by considering three measures; which are observers‟
opinions, self-reported data and EDA-based physiological sensor data. These data were analyzed
comparatively and statistically. It concludes by discussing the findings that has been obtained from those
subjective and objective measures, which partially supports the hypothesis.
SECURED SMART SYSTEM DESING IN PERVASIVE COMPUTING ENVIRONMENT USING VCSijujournal
Ubiquitous Computing uses mobile phones or tiny devices for application development with sensors
embedded in mobile phones. The information generated by these devices is a big task in collection and
storage. For further, the data transmission to the intended destination is delay tolerant. In this paper, we
made an attempt to propose a new security algorithm for providing security to Pervasive Computing
Environment (PCE) system using Public-key Encryption (PKE) algorithm, Biometric Security (BS)
algorithm and Visual Cryptography Scheme (VCS) algorithm. In the proposed PCE monitoring system it
automates various home appliances using VCS and also provides security against intrusion using Zigbee
IEEE 802.15.4 based Sensor Network, GSM and Wi-Fi networks are embedded through a standard Home
gateway.
PERFORMANCE COMPARISON OF ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKSijujournal
Routing protocols have an important role in any Mobile Ad Hoc Network (MANET). Researchers have
elaborated several routing protocols that possess different performance levels. In this paper we give a
performance evaluation of AODV, DSR, DSDV, OLSR and DYMO routing protocols in Mobile Ad Hoc
Networks (MANETS) to determine the best in different scenarios. We analyse these MANET routing
protocols by using NS-2 simulator. We specify how the Number of Nodes parameter influences their
performance. In this study, performance is calculated in terms of Packet Delivery Ratio, Average End to
End Delay, Normalised Routing Load and Average Throughput.
The document compares the performance of various optical character recognition (OCR) tools. It analyzes eight OCR tools - Online OCR, Free Online OCR, OCR Convert, Convert image to text.net, Free OCR, i2OCR, Free OCR to Word Convert, and Google Docs. The document provides sample outputs of each tool processing the same input image. It then evaluates the tools based on character accuracy, character error rate, special symbol accuracy, and special symbol error rate to determine which tools most accurately convert images to editable text.
Optical Character Recognition (OCR) is a technique, used to convert scanned image into editable text
format. Many different types of Optical Character Recognition (OCR) tools are commercially available
today; it is a useful and popular method for different types of applications. OCR can predict the accurate
result depends on text pre-processing and segmentation algorithms. Image quality is one of the most
important factors that improve quality of recognition in performing OCR tools. Images can be processed
independently (.png, .jpg, and .gif files) or in multi-page PDF documents (.pdf). The primary objective of
this work is to provide the overview of various Optical Character Recognition (OCR) tools and analyses of
their performance by applying the two factors of OCR tool performance i.e. accuracy and error rate.
DETERMINING THE NETWORK THROUGHPUT AND FLOW RATE USING GSR AND AAL2Rijujournal
In multi-radio wireless mesh networks, one node is eligible to transmit packets over multiple channels to
different destination nodes simultaneously. This feature of multi-radio wireless mesh network makes high
throughput for the network and increase the chance for multi path routing. This is because the multiple
channel availability for transmission decreases the probability of the most elegant problem called as
interference problem which is either of interflow and intraflow type. For avoiding the problem like
interference and maintaining the constant network performance or increasing the performance the WMN
need to consider the packet aggregation and packet forwarding. Packet aggregation is process of collecting
several packets ready for transmission and sending them to the intended recipient through the channel,
while the packet forwarding holds the hop-by-hop routing. But choosing the correct path among different
available multiple paths is most the important factor in the both case for a routing algorithm. Hence the
most challenging factor is to determine a forwarding strategy which will provide the schedule for each
node for transmission within the channel. In this research work we have tried to implement two forwarding
strategies for the multi path multi radio WMN as the approximate solution for the above said problem. We
have implemented Global State Routing (GSR) which will consider the packet forwarding concept and
Aggregation Aware Layer 2 Routing (AAL2R) which considers the both concept i.e. both packet forwarding
and packet aggregation. After the successful implementation the network performance has been measured
by means of simulation study.
STATATHON: Unleashing the Power of Statistics in a 48-Hour Knowledge Extravag...sameer shah
"Join us for STATATHON, a dynamic 2-day event dedicated to exploring statistical knowledge and its real-world applications. From theory to practice, participants engage in intensive learning sessions, workshops, and challenges, fostering a deeper understanding of statistical methodologies and their significance in various fields."
Open Source Contributions to Postgres: The Basics POSETTE 2024ElizabethGarrettChri
Postgres is the most advanced open-source database in the world and it's supported by a community, not a single company. So how does this work? How does code actually get into Postgres? I recently had a patch submitted and committed and I want to share what I learned in that process. I’ll give you an overview of Postgres versions and how the underlying project codebase functions. I’ll also show you the process for submitting a patch and getting that tested and committed.
Orchestrating the Future: Navigating Today's Data Workflow Challenges with Ai...Kaxil Naik
Navigating today's data landscape isn't just about managing workflows; it's about strategically propelling your business forward. Apache Airflow has stood out as the benchmark in this arena, driving data orchestration forward since its early days. As we dive into the complexities of our current data-rich environment, where the sheer volume of information and its timely, accurate processing are crucial for AI and ML applications, the role of Airflow has never been more critical.
In my journey as the Senior Engineering Director and a pivotal member of Apache Airflow's Project Management Committee (PMC), I've witnessed Airflow transform data handling, making agility and insight the norm in an ever-evolving digital space. At Astronomer, our collaboration with leading AI & ML teams worldwide has not only tested but also proven Airflow's mettle in delivering data reliably and efficiently—data that now powers not just insights but core business functions.
This session is a deep dive into the essence of Airflow's success. We'll trace its evolution from a budding project to the backbone of data orchestration it is today, constantly adapting to meet the next wave of data challenges, including those brought on by Generative AI. It's this forward-thinking adaptability that keeps Airflow at the forefront of innovation, ready for whatever comes next.
The ever-growing demands of AI and ML applications have ushered in an era where sophisticated data management isn't a luxury—it's a necessity. Airflow's innate flexibility and scalability are what makes it indispensable in managing the intricate workflows of today, especially those involving Large Language Models (LLMs).
This talk isn't just a rundown of Airflow's features; it's about harnessing these capabilities to turn your data workflows into a strategic asset. Together, we'll explore how Airflow remains at the cutting edge of data orchestration, ensuring your organization is not just keeping pace but setting the pace in a data-driven future.
Session in https://budapestdata.hu/2024/04/kaxil-naik-astronomer-io/ | https://dataml24.sessionize.com/session/667627
Codeless Generative AI Pipelines
(GenAI with Milvus)
https://ml.dssconf.pl/user.html#!/lecture/DSSML24-041a/rate
Discover the potential of real-time streaming in the context of GenAI as we delve into the intricacies of Apache NiFi and its capabilities. Learn how this tool can significantly simplify the data engineering workflow for GenAI applications, allowing you to focus on the creative aspects rather than the technical complexities. I will guide you through practical examples and use cases, showing the impact of automation on prompt building. From data ingestion to transformation and delivery, witness how Apache NiFi streamlines the entire pipeline, ensuring a smooth and hassle-free experience.
Timothy Spann
https://www.youtube.com/@FLaNK-Stack
https://medium.com/@tspann
https://www.datainmotion.dev/
milvus, unstructured data, vector database, zilliz, cloud, vectors, python, deep learning, generative ai, genai, nifi, kafka, flink, streaming, iot, edge
"Financial Odyssey: Navigating Past Performance Through Diverse Analytical Lens"sameer shah
Embark on a captivating financial journey with 'Financial Odyssey,' our hackathon project. Delve deep into the past performance of two companies as we employ an array of financial statement analysis techniques. From ratio analysis to trend analysis, uncover insights crucial for informed decision-making in the dynamic world of finance."
The Ipsos - AI - Monitor 2024 Report.pdfSocial Samosa
According to Ipsos AI Monitor's 2024 report, 65% Indians said that products and services using AI have profoundly changed their daily life in the past 3-5 years.
Build applications with generative AI on Google CloudMárton Kodok
We will explore Vertex AI - Model Garden powered experiences, we are going to learn more about the integration of these generative AI APIs. We are going to see in action what the Gemini family of generative models are for developers to build and deploy AI-driven applications. Vertex AI includes a suite of foundation models, these are referred to as the PaLM and Gemini family of generative ai models, and they come in different versions. We are going to cover how to use via API to: - execute prompts in text and chat - cover multimodal use cases with image prompts. - finetune and distill to improve knowledge domains - run function calls with foundation models to optimize them for specific tasks. At the end of the session, developers will understand how to innovate with generative AI and develop apps using the generative ai industry trends.
Build applications with generative AI on Google Cloud
MODIFIED CCEF FOR ENERGY-EFFICIENCY AND EXTENDED NETWORK LIFETIME IN WSNS
1. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
DOI:10.5121/iju.2015.6401 1
MODIFIED CCEF FOR ENERGY-EFFICIENCY AND
EXTENDED NETWORK LIFETIME IN WSNS
Muhammad K. Shahzad1
and Tae Ho Cho1, 2
1
College of Information and Communication Engineering,
Sungkyunkwan University, Suwon 440-746, Republic of Korea.
ABSTRACT
The widespread application of wireless sensor networks (WNSs) is obstructed by the severely limited
energy constraints and security threat for sensor nodes. Since traditional routing and security schemes are
not suited for these networks, a large part of research focusses on energy efficient routing protocols while
extending the network lifetime. Uneven distribution of communication loads result in network partitioning.
Traditional novel en-route filtering approaches, notably commutative cipher based en-route filtering
(CCEF) saves energy by early filtering of false reports. However this approach main focus is security not
network lifetime is limited by fixed paths and underlying routing not suitable for WSNs. In order to cater
these problems we propose energy efficient routing and pre-deterministic key distribution with dynamic
path selection in CCEF. Modified CCEF (MCCEF) aims at saving energy and extending network lifetime
while maintaining filtering power as in CCEF. Experimental results demonstrate the validity of our
approach with an average of three times network lifetime extension, 5.022% energy savings, and similar
filtering power as the original scheme.
KEYWORDS
Wireless sensor networks, energy efficiency, network lifetime, filtering power.
1. INTRODUCTION
In en-route filtering schemes generally underlying routing protocols are not considered for further
energy efficiency. Notably, a novel commutative cipher based en-route filtering (CCEF) [1] can
save up to 32% energy in case of large number of injected fabricated reports. However limitations
are; network lifetime is not main concern, based on fixed paths, and while in routing only
distance is considered not energy level of a node. For different fabricated ratio (FTR) the security
response is constant. FTR is number of attacks divided by total number of events. Security
response is number of verification nodes assigned in a path as per current FTR. In order to save
more energy CCEF does not improve underlying reedy perimeter stateless routing (GPSR) [2]
which was originally design for ad hoc networks. The work [3] have demonstrated that
unbalanced communication load results in network partition or energy-hole problem which have
severe effects on network lifetime. In wireless sensor networks (WSNs) several en-route filtering
2
Corresponding author
2. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
2
algorithms [4], [5], [6], and [7] saves energy by early filtering of attacks which do not consider
energy-efficiency in routing.
Several improvement of CCEF [8], DEF [9], SEF [10], and IHA [11] have been proposed address
some of the limitations. In pre-deterministic key distribution based CCEF (PKCCEF) [8] which
showed up to 16.05% energy efficiency and 81.01% network lifetime extension. Our proposed
modified CCEF (MCCEF) not only significantly extends network lifetime up to 300% but also
maintain filtering power in addition to be more energy efficiency than original scheme. In
research work [12], authors suggests that uneven distribution of the communication loads can
results in energy-hole. In order to solve this problem they have suggested an adjustable
transmission range can be assigned to optimize the network lifetime. In this paper in order to
evaluate energy consumption, we will use first order radio model [13, 14]. In [15], authors have
discussed different factors of RF power management in WSNs. The paper presents a micro-power
spectrum analyser which enables low power operations throughout wireless integrated networks
sensors (WINS).
MCCEF saves energy while significantly extending the network lifetime. Moreover our proposed
scheme give similar filtering power as in the original scheme. Since creating path is more
expansive then selecting from already created paths, MCCEF before creating a new path among a
pair of nodes prefer to select from buffer if it already exists. FTR or attacks information is also
obtained without causing additional messages or energy consumption at sensor nodes.
Our proposed scheme aims at distributing communication loads over larger group of nodes in the
sensor to get more balanced energy distribution approach. This is achieved by energy efficient
routing which consider different factors in addition to distance only in CCEF and pre-
deterministically re-distribute keys. Based on current FTR ratio our algorithm can choose
dynamically one of the paths which cater for security needs. Performance analysis demonstrate
the validity of our approach which is more energy efficient and prolongs the network lifetime
significantly while maintaining the filtering power as in the original approach.
The main contribution of this paper are:
Energy efficient routing
Extended network lifetime while
Maintaining filtering power
2. RELATED WORK
In order to address the security of the WSN, the underlying routing protocol is generally ignored.
In the security design, when the number of attacks exceeds a certain threshold, it is safe to assume
that early detection would conserve energy that would have been wasted otherwise. However,
further energy efficiency can be achieved if energy-efficient routing is considered.
CCEF [1] establishes a secret association among the nodes and the base station ( ) per session,
and each node in the route possesses its own witness. The sensor nodes in the path do not need to
share a symmetric key, thereby offering stronger security protection than the existing schemes.
3. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
3
Intermediate nodes have a witness key ( ) and can verify a report without knowing the session
key ( ). Even though only a few nodes are used as the filtering nodes, keys are distributed to
all of the nodes. CCEF does only support static sink based networks and does not perform re-
clustering after depletion of sensor nodes. When number of sensor nodes are less then t nodes the
security as well as network lifetime suffer from adverse effect. The underlying routing for CCEF
is GPSR [2] excessively use geography for greedy (distance) forwarding. This efficient geo
routing method is scalable for large densely deployed networks. However, for energy constraints
WSNs it suffer from number of constraint; 1) consider distance only not energy while forwarding
messages 2) fix path routing and 3) low network lifetime. The study [3] investigates the uneven
consumption of the energy in gradient sinking networks. This leads to the presence of energy
holes resulting in a significant reduction in the sensor network lifetime.
The results demonstrate that the stated strategy can reduce energy consumption and extend the
network lifetime dramatically. However this study is applicable for static sink based WSNs. In
order to achieve energy efficiency and prolong network lifetime recently several approaches has
been proposed. One approach to save energy is to filter false reports en-route as early as possible.
To address this various novel en-route filtering has been proposed. Statistical en-route filtering
(SEF) [4] first addressed the false report detection problems by determining the number of
compromised sensor nodes. It introduces the general en-route filtering framework, which serves
as the basis of subsequent en-route filtering-based security protocols. Dynamic en-route filtering
(DEF) [5] uses the hill climbing approach for key dissemination in order to filter false reports
earlier, where each node requires a key chain for authentication. The interleaved hop-by-hop
authentication scheme (IHA) [6] can detect false data reports when no more than nodes are
compromised. It provides an upper bound to the number of hops a false report can traverse before
it is dropped in the presence of t colluding nodes. As in CCEF, IHA also based on GPSR and
suffer from similar limitations. In a probabilistic voting-based filtering scheme (PVFS) [7], the
number of message authentication controls (MACs; referred to as votes in the paper) is used to
prevent both fabricated reports with false votes and false votes on valid report attacks.
Recently several variations of above en-route filtering schemes has been propose to increase
energy efficiency and/or extend network lifetime. PKCCEF [8] improves CCEF which by using
energy aware routing, significantly improves network lifetime and saves energy. The fuzzy-based
path selection method (FPSM) [9] improves the detection of false reports in the WSN, in which
each cluster chooses paths by considering the detection power of the false data and the energy
efficiency. In [10], a key index-based routing for filtering false event reports in the WSN is
presented. Each node selects a path from the event source to the destination based on the key
index of its neighbor nodes. However these schemes do not utilized re-clustering and assume
static sink. The work in [11] addresses the limitations of IHA, which works on a single fixed path
between the source and the destination. The authors propose a Multipath Interleaved Hop-by-hop
Authentication (MIHA) scheme that creates multiple paths and switches to another path if there
are compromised nodes in the current path. It proves to be more energy efficient and can filter
more attacks than the original scheme.
Research work [16], suggests that uneven distribution of the communication loads often results in
energy hole. In order to solve this problem optimal and adjustable transmission ranges are
assigned to optimize the network lifetime. Results demonstrate the near optimal solution to
extend network lifetime both in uniform and non-uniform deployment. The paper [13] presents
4. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
4
several radio transmission model. In order to calculate the energy consumption and comparison in
this paper we first order radio model. In [14], authors use the first order radio model for their
energy efficient communication protocol for wireless sensor networks. We use the same first
order radio transmission model with same values for energy transmission and reception of a bit
with an acceptable ratio.
3. PROPOSED SCHEME
In this section, motivation, system models, and system overview is presented in detail.
3.1. Motivation
Uneven energy consumption results in energy-holes around the Base Station ) in sink based
networks. In order to solve this problem different approaches with an aim to distribute
communication load over larger group of sensor networks has been adapted. The underlying
routing in CCEF is GPSR which was originally proposed for ad hoc networks does not cater for
energy limited sensor nodes requirements. In fix path routing a single path is used until it is
broken by depletion of a node. MCCEF aims at dynamically selecting from different available
paths based on a node’s residual energy level, current attack ratio (FTR), and distance. Since
different paths have different number of verification nodes based on number of keys in paths, our
proposed scheme can respond based on FTR. MCCEF make use of these factors in design of
energy efficiency approach while extending the network lifetime significantly and maintaining
en-route filtering power as in CCEF.
3.2. System models
3.2.1.Network model
The sensor nodes are randomly deployed within square sensor field of area within
radius of as shown in the Fig. 1. This sensor field comprise of number of sensor nodes
represented by: { } respectively. In this paper total number of sensor nodes
{ }. As shown in the Fig. The location of the is (500, 250) m. The
clusters are represented by: { } where All the cluster are of equal size
with where . In each cluster equal number of nodes are randomly
distributed in each cluster. Following are the assumptions associated with network model:
1.Network is composed of stationary homogenous nodes
2.Communication links are symmetric
3.Nodes can adjust transmission power as per relative distance
5. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
5
3.2.2.First order radio model for energy consumption
The first-order radio model [13, 14] is used with a free space ( power loss) channel model is
used. A typical sensor circuitry consists of a data processing unit, radio communication
components, a micro sensor unit, antenna, power supply, and amplifier. In our implementation of
the energy dissipation model, we only consider the energy dissipation that is associated with the
radio component. A simple and commonly used first-order radio model block diagram is shown
in Fig. 2. In order to transmit a -bits packet with a distance between the transmitter and
receiver, the transmission energy, ) can be modeled by Equation (1).
) (1)
Where is the energy used by the electronics of the circuit, and is the energy used
by the electronics of the transmitter to transmit bits. Moreover, is the energy used by the
amplifier, and λ is the path loss constant. Similarly, ) is the energy needed to receive k-bits
in Equation (2).
Figure 1. Sensor field
Figure 2: First order radio model
6. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
6
) (2)
3.3. System Overview
3.3.1.Boot-up initialization
Sensor nodes are considered to be secure for the initialization during the boot-up process, and it is
also assumed that the cannot be compromised. The sensor nodes have a fixed amount of
energy. At this phase, the randomly deployed nodes are granted unique and . Furthermore,
each node can know it’s location through a location mechanism.
3.3.2.Key distribution process
The witness keys ) are distributed pre-deterministically for each session to a randomly
selected percentage of sensor nodes. is distributed before a session in the network, while is
sent securely to the in a query message. In CCEF, keys are distributed to all nodes on the path
in the query message, while in the response message, the filtering nodes are determined
probabilistically (p=1/αh). In our method, keys are only possessed by a predetermined percentage
of nodes in the path and in the response message the same nodes are used as filtering nodes
without using the probabilistic method. We can dynamically determine a path based on the attack
information; therefore, depending upon the attack ratio, there can be different corresponding
paths. A session is changed after time units or after a node is depleted.
3.3.3.Route set-up process
Selecting a neighbor each time that is closest to the source node does not always result in energy-
efficiency, as the path can be the shortest in terms of the number of hops or distance but may not
be energy efficient. The distance and energy are inversely proportional, but both factors are
crucial in determining the next hop. Therefore, it is desirable to consider both factors when
making routing decisions to ensure an energy efficient route setup. The route setup process
remains the same as in CCEF, except that the underlying routing considers a different key
distribution method and a different next hop evaluation method. We assume that the knows
the location of the events and sends a query message to establish a path. This path will be used for
the duration of the session to report events located in that cluster. Since events --can take place
randomly in any of the clusters, multiple sessions are established at a given time. The details of
the route set-up phase are explained in Section 3.
3.3.4.Forwarding node selection
Our proposed method for selecting the next forwarding nodes to create a path is shown in
Equation (3).
( ) ( ) (3)
Where is the system design parameter, is the shortest distance of the closest neighbor to the
sink, is the residual, remaining, or current energy level of a candidate sensor node and is the
presence of key on that node Candidate nodes are set of sensors which are considered to find
7. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
7
forwarding nodes. All variables are normalized by one and the nodes with the highest evaluation
using the above node selection method are selected as forwarding nodes. This process is repeated
unless a path is created between the and the source .
4. PERFORMANCE EVALUATION
4.1. Experimental Environment
In this paper, we consider a 1000-node randomly distributed sensor network in area grid of
with clusters. In each cluster, a fixed number of nodes are located at
random locations. Each of the sensor nodes has a range, which is used to select the
neighbors, candidate, and forwarding nodes. The is located at ) and aware of the
node , locations, and node keys ( ) of all of the sensor nodes. The communication links are
considered to be bidirectional. When nodes are deployed, the boot-up process is initialized with a
localization-awareness component. Each node also assumes a unique and knows its key.
Table 1 shows the parameters for the experimental setup that was used for the performance
analysis. The values of and are selected to achieve an acceptable [14]. The data
packet or message size is 200 bits (or one time step) and a round is defined as four time steps or
800 bits of data received at the .
4.2. Attack information
The communication in our method is query-driven in which a query message is initiated by the
to inquire about an event in an area. For one query-response session, the knows the
expected number of event reports from the source . A legitimate report received at the will
increment the respective counter by one to determine total number such reports. For this case no
Table 1: Experimental parameters detail
Parameters Values
Sensor 1000
Sensor field size 500 x 500 m2
BS type Static
BS location (500, 250) m
𝑹𝒊 50 m
Cluster h/w 50 m
𝑬𝒆𝒍𝒆𝒄 50 nJ/bit
𝑬𝒂𝒎𝒑 100 pJ/bit/m2
Node energy 1 Joules
Data packet 200 bits
Round 800 bits
FTR 30%
Path loss constant (λ) 2
8. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
8
extra messages or energy consumption is required at the sensor nodes. Fabricated or false reports
can be dropped either en-route or at the . In first case a fabricated report is dropped en-route,
the will know report is dropped after a time window is elapsed. In second case, if a fabricated
report is reached at the , it will be dropped after final verification. In both cases of legitimate
and fabricated reports, the will know the total number both types of reports by their respective
counters. Therefore, by using this information the value of the FTR can be determined at any
time. The FTR value along with a node energy level and distance from the is then exploited to
determine number of keys to be distributed in each session per path basis. As mentioned before,
this method does not need extra energy consumption at sensor nodes and calculations on the
can be justified since it has sufficient power and computation capacity.
4.3. Experimental results
The performance evaluation metrics used to compare network lifetime and energy efficiency are;
first node depleted (FND), half nodes depleted (HND), and last node depleted (LND). The
depleted node is one which have exhausted its total energy and cannot participate in
communication. A round is 800 bits of data received at the or four time steps. One time step
is equal to the one packet size which is 200 bits. More the number of rounds a schemes can take
before node(s) depletion the better the performance will be. Same parameters are used for energy
efficiency to evaluate average energy consumer per round at each of the above performance
indicators. Moreover filtering power and buffer performance at end of the each simulation
experiment will be presented.
4.3.1. Network Lifetime
In Fig. 3 the network lifetime comparative performance of CCEF and MCCEF is shown for FND
performance metric. The x-axis represents network size in terms of number of sensor nodes and
y-axis indicates number of rounds. MCCEF shows a significant performance gain of 3.3964 times
over CCEF. For all network sizes (number of nodes) proposed scheme performance better than
CCEF. Figure 4 indicates network lifetime performance of compared schemes for HCO
performance metric. This indicates performance of CCEF and MCCEF after half out of the nodes
are depleted. MCCEF also outperform CCEF over this performance indicator by having 2.3964
folds network lifetime gain. In Fig. 5 compare the performance based on LND performance
metric. In third case MCCEF again prolong the network lifetime by significant 3.4107 times over
the original scheme.
Figure 3: Network lifetime
(FND)
Figure 4: Network lifetime
(HND)
Figure 5: Network lifetime
(LND)
9. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
9
The summary of network lifetime performance improvement of proposed scheme over CCEF is
shown in the Table 2. As shown in the Table 2, average network lifetime gain of MCCEF over
three different metrics is 3.0089 folder or over 300% as compare to CCEF. The performance gain
is achieved with more balance network energy consumption strategies which distribute
communication loads over large group of sensor nodes. Results have indicated that energy
efficient routing, dynamic path selection based on network conditions, and pre-deterministic key
re-distribution help solving energy-hole problem.
Table 2. Network lifetime gain of MCCEF and CCEF
4.3.2.Energy efficiency
In this section energy efficiency comparative analysis of MCCEF and CCEF is highlighted. In
order to compare these schemes performance metrics of FCO, HCO, and FCO are used. The x-
axis shows network size and y-axis indicates average energy consumption in mili joules per
round. Figure 6 that MCCEF have advantage over CCEF in energy efficiency using FND. In most
cases for different network sizes MCCEF outperforms CCEF in average efficiency energy per
round. The average performance in energy saving over different network sizes is 7.80%. The case
of performance improvement using HND metric is shown in the Fig. 7. In this case the average
energy saving is better than previous case with 11.42% average energy saving. In the third case
where LND comparison MCCEF has slightly energy inefficient with energy deficit of -1.76%.
However on average in three cases our proposed method is 5.82% more energy efficient than
CCEF scheme.
Metric FND HND FND Avg.
Lifetime 3.3964 2.2196 3.4107 3.0089
10. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
10
Table 3 Energy efficiency gain of MCCEF and CCEF
Metric FND HND FND Avg
Energy 7.80% 11.42% -1.76% 5.82%
Table 3 summarize the overall energy efficiency performance gain of MCCEF over CCEF with
different performance metrics.
4.3.3.Security
In this section filtering power of two compared schemes in shown. In case of dynamic path
selection it is hard to assign appropriate keys to verification nodes. Our main objective was to
make CCEF energy efficient while extending the network life do not compromising security.
With pre-deterministic key re-distribution help achieving similar performance as in original
scheme. The Fig. 9 shows that MCCEF filtering power is similar to that of CCEF. Our
performance little better at network sizes of 300 and 400 nodes while in other cases CCEF
performance is slightly better. However since performance difference is very small we can claim
that performance is almost similar in both schemes. This is still encouraging considering network
lifetime and energy efficiency we have achieved.
Figure 6: Energy efficiency
(FND)
Figure 7: Energy efficiency
(HND)
Figure 8: Energy efficiency
(LND)
Figure 9: Filtering power of CCEF
& MCCEF
Figure 10: Buffer history in
MCCEF
11. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
11
4.3.4.Buffer history
Our proposed approach also make use of path buffer history. Creating a path is more expansive as
compared to the selecting path from already created path in the buffer. Whenever a path is created
between a pair of nodes it is saved and re-used when event source and the are same. This
also saves some of the energy in MCCEF scheme. The Fig. 10 depicts the performance of
MCCEF buffer history of paths created and used from buffer.
5. CONCLUSIONS AND FUTURE WORK
By distribute and balance the communication loads over a larger group nodes MCCEF has been
able cater with energy hole or network partition problem. We have modified GPSR used in CCEF
to apply it for sensor network condition and also save energy. Keys are pre-deterministically re-
distributed on different path to respond to different FTR ratios or attack frequency. This enable
dynamic path selection based routing. This helps in load balance over multiple paths alternatively
which extend network lifetime.
Energy is saved by early detection of fabricated reports which limits them in travelling number of
hopes. In case when FTR is low less number of verification nodes are selected resulting is less
number of verifications for legitimate reports. Energy is also saved by using path buffer history in
proposed scheme.
In future more energy efficiency and improved filtering power can be achieved with selecting
filtering nodes using fuzzy logic instead of probabilistic method. Moreover further improvement
in security can be achieved by using optimized fuzzy logic functions using genetic algorithm.
ACKNOWLEDGEMENTS
This research was supported by the Basic Science Research Program through the National
Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and
Technology (No. 2013R1A2A2A01013971).
REFERENCES
[1]. Hao Yang and Songwu Lu. (2004). Commutative cipher based en-route filtering in wireless sensor
networks. 60th Vehicular Technology Conference, vol. 2, pp. 1223-1227.
[2]. B. Karp and H. T. Kung. (2000). GPSR: Greedy perimeter stateless routing for wireless networks.
ACM MobiCom, pp. 243-254.
[3]. Liu, Tao. (2012). Avoiding energy holes to maximize network lifetime in gradient sinking sensor
networks. Wireless Personal Communication. Springer Science + Business Media, LLC, pp. 581-
600.
[4]. F. Ye, H. Luo, S. Lu, and L. Zhang. (2004). Statistical en-route filtering of injected false data in
sensor networks. In IEEE Proceedings of INFOCOM 2004, pp. 839-850.
[5]. Zhen Yu, and Yong Guan. (2010) A dynamic en-route filtering scheme for data reporting in wireless
sensor networks. IEEE/ACM Transactions on Networking, vol. 18(1), pp.150-163.
12. International Journal of UbiComp (IJU), Vol.6, No.4, October 2015
12
[6]. S. Zhu, S. Setia, S. Jajodia, and P. Ning. (2004). An interleaved hop-by-hop authentication scheme
for filtering of injected false data in sensor networks. Proceedings of EEE Symposium on Security
and Privacy, pp. 259-271.
[7]. Feng Li and Jie Wu. (2006). A probabilistic voting-based filtering scheme in wireless sensor
networks. Vancour, Canada, ACM IWCMC, pp. 27-32.
[8]. Muhammad K Shahzad and Tae Ho Cho, (2015). Extending the Network Lifetime by Pre-
deterministic Key Distribution in CCEF in Wireless Sensor Networks. Wireless Networks, DOI
10.1007/s11276-015-0941-0.
[9]. Hae Young LEE and Tae Ho CHO. (2009). Fuzzy-based path selection method for improving the
detection of false reports in sensor networks. IEICE Transaction on Information and System, pp.
1574-1576.
[10]. S. Y. Moon and T. H. Cho (2012). Key index-based routing for filtering false event reports in
wireless sensor networks. IEEE Transaction on Communication. Tokyo. Japan, vol. E95-B(9), pp.
2807-2814.
[11]. P.T. Nghiem and T.H. Cho. (2010). A multi-path interleaved hop by hop en-route filtering scheme in
wireless sensor networks. Computer Communications, vol. 33(10), pp. 1202-1209.
[12]. Chao Songa, Ming Liu , Jiannong Cao, Yuan Zheng, Haigang Gong, and Guihai Chen. (2009).
Maximizing network lifetime based on transmission range adjustment in wireless sensor networks.
Computer Communications. pp. 1316–1325.
[13]. Swarup Kumar Mitra, Mrinal Kanti Naskar. (2011). Comparative study of radio models for data
gathering in wireless sensor network. International Journal of Computer Applications. vol. 27(4), pp.
49-57.
[14]. Mong Crossbow, 2011. http://www.xbow.com/.
[15]. BorMing Lee, Hui-Ming Hsieh, Wang, J. T., Kai-Long Hsiao, Note for LC Oscillator Power
Management for Wireless Network Sensors Technique, Energy and Power Engineering Science, doi:
10.12966 / epes. 08. 01. 2014 , August 2014, v.1, p. 17-21
Authors
Khuram Shahzad Toor received a B.E.I.T degree from the University of Lahore and
an M.S. degree in Information Technology from the National University of Science and
Technology, Isalamabad, Pakistan in 2004 and 2007, respectively. He is now a Ph.D.
scholar in the College of Information and Communication Engineering at
Sungkyunkwan University, South Korea. His research interests include wireless sensor
networks and graph gheory.
Tae Ho Cho (Corresponding author) received a Ph.D. degree in Electrical and
Computer Engineering from the University of Arizona, USA, in 1993, and B.S. and
M.S. degrees in Electrical Engineering from Sungkyunkwan University, Korea and the
University of Alabama, USA, respectively. He is currently a Professor in the College of
Information and Communication Engineering at Sungkyunkwan University, Korea. His
research interests include wireless sensor networks, intelligent systems, modeling and
simulation, and enterprise resource planning.