In wireless sensor network (WSN) there are two main problems in employing conventional compression
techniques. The compression performance depends on the organization of the routes for a larger extent.
The efficiency of an in-network data compression scheme is not solely determined by the compression
ratio, but also depends on the computational and communication overheads. In Compressive Data
Aggregation technique, data is gathered at some intermediate node where its size is reduced by applying
compression technique without losing any information of complete data. In our previous work, we have
developed an adaptive traffic aware aggregation technique in which the aggregation technique can be
changed into structured and structure-free adaptively, depending on the load status of the traffic. In this
paper, as an extension to our previous work, we provide a cost effective compressive data gathering
technique to enhance the traffic load, by using structured data aggregation scheme. We also design a
technique that effectively reduces the computation and communication costs involved in the compressive
data gathering process. The use of compressive data gathering process provides a compressed sensor
reading to reduce global data traffic and distributes energy consumption evenly to prolong the network
lifetime. By simulation results, we show that our proposed technique improves the delivery ratio while
reducing the energy and delay
Communication Cost Reduction by Data Aggregation: A SurveyIJMTST Journal
Wireless Sensor Networks have gained wide popularity in the recent years for its high-ranking applications such as remote environment monitoring, target tracking, safety-critical monitoring etc. However Wireless Sensor Networks face many constraints like low computational power, small storage, and limited energy resources. One of the important issues in wireless sensor network is to increase the network lifetime to keep the network operational as long as possible. In this survey paper, we provide a comprehensive review of the existing literature on techniques and protocols for data aggregation to reduce communication cost and increase network lifetime in wireless sensor networks.
Data aggregation in important issue in WSN’s. Because with the help of data aggregation; we are
reduce energy consumption in the network. In the Ad-hoc sensor network have the most challenging task
is to maintain a life time of the node. due to efficient data aggregation increase the life of the network. In
this paper, we are going to provide the information about the type of the network and which data
aggregation algorithm is best. In big scale sensor network, energy economical, data collection and query
distribution in most important.
Keywords — data aggregation; wireless sensor network
A COMBINATION OF THE INTRUSION DETECTION SYSTEM AND THE OPEN-SOURCE FIREWALL ...IJCNCJournal
There are many security models for computer networks using a combination of Intrusion Detection System and Firewall proposed and deployed in practice. In this paper, we propose and implement a new model of the association between Intrusion Detection System and Firewall operations, which allows Intrusion Detection System to automatically update the firewall filtering rule table whenever it detects a weirdo intrusion. This helps protect the network from attacks from the Internet.
AN EFFICIENT INTRUSION DETECTION SYSTEM WITH CUSTOM FEATURES USING FPA-GRADIE...IJCNCJournal
An efficient Intrusion Detection System has to be given high priority while connecting systems with a network to prevent the system before an attack happens. It is a big challenge to the network security group to prevent the system from a variable types of new attacks as technology is growing in parallel. In this paper, an efficient model to detect Intrusion is proposed to predict attacks with high accuracy and less false-negative rate by deriving custom features UNSW-CF by using the benchmark intrusion dataset UNSW-NB15. To reduce the learning complexity, Custom Features are derived and then Significant Features are constructed by applying meta-heuristic FPA (Flower Pollination algorithm) and MRMR (Minimal Redundancy and Maximum Redundancy) which reduces learning time and also increases prediction accuracy. ENC (ElasicNet Classifier), KRRC (Kernel Ridge Regression Classifier), IGBC (Improved Gradient Boosting Classifier) is employed to classify the attacks in the datasets UNSW-CF, UNSW and recorded that UNSW-CF with derived custom features using IGBC integrated with FPA provided high accuracy of 97.38% and a low error rate of 2.16%. Also, the sensitivity and specificity rate for IGB attains a high rate of 97.32% and 97.50% respectively.
Mobile Agents based Energy Efficient Routing for Wireless Sensor NetworksEswar Publications
Energy Efficiency and prolonged network lifetime are few of the major concern areas. Energy consumption rated of sensor nodes can be reduced in various ways. Data aggregation, result sharing and filtration of aggregated data among sensor nodes deployed in the unattended regions have been few of the most researched areas in the field of wireless sensor networks. While data aggregation is concerned with minimizing the information transfer from source to sink to reduce network traffic and removing congestion in network, result sharing focuses on sharing of information among agents pertinent to the tasks at hand and filtration of aggregated data so as to remove redundant information. There exist various algorithms for data aggregation and filtration using different mobile agents. In this proposed work same mobile agent is used to perform both tasks data aggregation and data filtration. This approach advocates the sharing of resources and reducing the energy consumption level of sensor nodes.
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYijasuc
Recent developments in processor, memory and radio technology have enabled wireless sensor networks
which are deployed to collect useful information from an area of interest. The sensed data must be
gathered and transmitted to a base station where it is further processed for end-user queries. Since the
network consists of low-cost nodes with limited battery power, power efficient methods must be employed
for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in
a round of communication each of the sensor nodes has data to send to a base station, it is important to
minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With
the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power
consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be
achieved in terms of network lifetime. Several application specific sensor network data gathering protocols
have been proposed in research literatures. However, most of the proposed algorithms have been some
attention to the related network lifetime and saving energy are two critical issues for wireless sensor
networks. In this paper we have explored general network lifetime in wireless sensor networks and made an
extensive study to categorize available data gathering techniques and analyze possible network lifetime on
them.
FUZZY-CLUSTERING BASED DATA GATHERING IN WIRELESS SENSOR NETWORK ijsc
Wireless Sensor Networks (WSN) is spatially distributed, collection of sensor nodes for the purpose of
monitoring physical or environmental conditions, such as temperature, sound, pressure, etc. and to
cooperatively pass their data through the network to a base station. The critical challenge is to minimize
the energy consumption in data gathering and forwarding from sensor nodes to the sink. Cluster based
data aggregation is one of the most popular communication protocols in this field. Clustering is an
important procedure for extending the network lifetime in wireless sensor networks. Cluster Heads (CH)
aggregate data from relevant cluster nodes and send it to the base station. A main challenge in WSNs is to
select suitable CHs. Another communication protocol is based on a tree construction. In this protocol,
energy consumption is low because there are short paths between the sensors. In this paper, Dynamic
Fuzzy Clustering data aggregation is introduced. This approach is based on clustering and minimum
spanning tree. The proposed method initially uses fuzzy decision making approach for the selection of CHs.
Afterward a minimum spanning tree is constructed based on CHs. CHs are selected efficiently and
accurately. The combining clustering and tree structure is reclaiming the advantages of the previous
structures. Our method is compared to the well-known data aggregation methods, in terms of energy
consumption and the amount of energy residuary in each sensor network lifetime. Our method decreases
energy consumption of each node. When the best CHs selected and the minimum spanning tree is formed by
the best CHs, the remaining energy of the nodes will be preserved. Node lifetime has an important role in
WSN. Using our proposed data aggregation algorithm, survival of the network is improved
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.
Communication Cost Reduction by Data Aggregation: A SurveyIJMTST Journal
Wireless Sensor Networks have gained wide popularity in the recent years for its high-ranking applications such as remote environment monitoring, target tracking, safety-critical monitoring etc. However Wireless Sensor Networks face many constraints like low computational power, small storage, and limited energy resources. One of the important issues in wireless sensor network is to increase the network lifetime to keep the network operational as long as possible. In this survey paper, we provide a comprehensive review of the existing literature on techniques and protocols for data aggregation to reduce communication cost and increase network lifetime in wireless sensor networks.
Data aggregation in important issue in WSN’s. Because with the help of data aggregation; we are
reduce energy consumption in the network. In the Ad-hoc sensor network have the most challenging task
is to maintain a life time of the node. due to efficient data aggregation increase the life of the network. In
this paper, we are going to provide the information about the type of the network and which data
aggregation algorithm is best. In big scale sensor network, energy economical, data collection and query
distribution in most important.
Keywords — data aggregation; wireless sensor network
A COMBINATION OF THE INTRUSION DETECTION SYSTEM AND THE OPEN-SOURCE FIREWALL ...IJCNCJournal
There are many security models for computer networks using a combination of Intrusion Detection System and Firewall proposed and deployed in practice. In this paper, we propose and implement a new model of the association between Intrusion Detection System and Firewall operations, which allows Intrusion Detection System to automatically update the firewall filtering rule table whenever it detects a weirdo intrusion. This helps protect the network from attacks from the Internet.
AN EFFICIENT INTRUSION DETECTION SYSTEM WITH CUSTOM FEATURES USING FPA-GRADIE...IJCNCJournal
An efficient Intrusion Detection System has to be given high priority while connecting systems with a network to prevent the system before an attack happens. It is a big challenge to the network security group to prevent the system from a variable types of new attacks as technology is growing in parallel. In this paper, an efficient model to detect Intrusion is proposed to predict attacks with high accuracy and less false-negative rate by deriving custom features UNSW-CF by using the benchmark intrusion dataset UNSW-NB15. To reduce the learning complexity, Custom Features are derived and then Significant Features are constructed by applying meta-heuristic FPA (Flower Pollination algorithm) and MRMR (Minimal Redundancy and Maximum Redundancy) which reduces learning time and also increases prediction accuracy. ENC (ElasicNet Classifier), KRRC (Kernel Ridge Regression Classifier), IGBC (Improved Gradient Boosting Classifier) is employed to classify the attacks in the datasets UNSW-CF, UNSW and recorded that UNSW-CF with derived custom features using IGBC integrated with FPA provided high accuracy of 97.38% and a low error rate of 2.16%. Also, the sensitivity and specificity rate for IGB attains a high rate of 97.32% and 97.50% respectively.
Mobile Agents based Energy Efficient Routing for Wireless Sensor NetworksEswar Publications
Energy Efficiency and prolonged network lifetime are few of the major concern areas. Energy consumption rated of sensor nodes can be reduced in various ways. Data aggregation, result sharing and filtration of aggregated data among sensor nodes deployed in the unattended regions have been few of the most researched areas in the field of wireless sensor networks. While data aggregation is concerned with minimizing the information transfer from source to sink to reduce network traffic and removing congestion in network, result sharing focuses on sharing of information among agents pertinent to the tasks at hand and filtration of aggregated data so as to remove redundant information. There exist various algorithms for data aggregation and filtration using different mobile agents. In this proposed work same mobile agent is used to perform both tasks data aggregation and data filtration. This approach advocates the sharing of resources and reducing the energy consumption level of sensor nodes.
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYijasuc
Recent developments in processor, memory and radio technology have enabled wireless sensor networks
which are deployed to collect useful information from an area of interest. The sensed data must be
gathered and transmitted to a base station where it is further processed for end-user queries. Since the
network consists of low-cost nodes with limited battery power, power efficient methods must be employed
for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in
a round of communication each of the sensor nodes has data to send to a base station, it is important to
minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With
the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power
consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be
achieved in terms of network lifetime. Several application specific sensor network data gathering protocols
have been proposed in research literatures. However, most of the proposed algorithms have been some
attention to the related network lifetime and saving energy are two critical issues for wireless sensor
networks. In this paper we have explored general network lifetime in wireless sensor networks and made an
extensive study to categorize available data gathering techniques and analyze possible network lifetime on
them.
FUZZY-CLUSTERING BASED DATA GATHERING IN WIRELESS SENSOR NETWORK ijsc
Wireless Sensor Networks (WSN) is spatially distributed, collection of sensor nodes for the purpose of
monitoring physical or environmental conditions, such as temperature, sound, pressure, etc. and to
cooperatively pass their data through the network to a base station. The critical challenge is to minimize
the energy consumption in data gathering and forwarding from sensor nodes to the sink. Cluster based
data aggregation is one of the most popular communication protocols in this field. Clustering is an
important procedure for extending the network lifetime in wireless sensor networks. Cluster Heads (CH)
aggregate data from relevant cluster nodes and send it to the base station. A main challenge in WSNs is to
select suitable CHs. Another communication protocol is based on a tree construction. In this protocol,
energy consumption is low because there are short paths between the sensors. In this paper, Dynamic
Fuzzy Clustering data aggregation is introduced. This approach is based on clustering and minimum
spanning tree. The proposed method initially uses fuzzy decision making approach for the selection of CHs.
Afterward a minimum spanning tree is constructed based on CHs. CHs are selected efficiently and
accurately. The combining clustering and tree structure is reclaiming the advantages of the previous
structures. Our method is compared to the well-known data aggregation methods, in terms of energy
consumption and the amount of energy residuary in each sensor network lifetime. Our method decreases
energy consumption of each node. When the best CHs selected and the minimum spanning tree is formed by
the best CHs, the remaining energy of the nodes will be preserved. Node lifetime has an important role in
WSN. Using our proposed data aggregation algorithm, survival of the network is improved
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.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
Cluster Head Selection Techniques for Energy Efficient Wireless Sensor Networ...ijsrd.com
Wireless sensor networks are widely considered as one of the most important technologies. The Wireless Sensor Network (WSN) is a wireless network consisting of ten to thousand small nodes with sensing, computing and wireless communication capabilities. They have been applied to numerous fields such as healthcare, monitoring system, military, and so forth. Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Energy efficiency is thus a primary issue in maintaining the network. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach in wireless sensor networks. This paper elaborates several techniques like LEACH, HEED, LEACH-B, PEACH, EEUC of cluster head selection for energy efficient in wireless sensor networks.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
An Integrated Distributed Clustering Algorithm for Large Scale WSN...................................................1
S. R. Boselin Prabhu, S. Sophia, S. Arthi and K. Vetriselvi
An Efficient Connection between Statistical Software and Database Management System ................... 1
Sunghae Jun
Pragmatic Approach to Component Based Software Metrics Based on Static Methods ......................... 1
S. Sagayaraj and M. Poovizhi
SDI System with Scalable Filtering of XML Documents for Mobile Clients ............................................... 1
Yi Yi Myint and Hninn Aye Thant
An Easy yet Effective Method for Detecting Spatial Domain LSB Steganography .................................... 1
Minati Mishra and Flt. Lt. Dr. M. C. Adhikary
Minimizing the Time of Detection of Large (Probably) Prime Numbers ................................................... 1
Dragan Vidakovic, Dusko Parezanovic and Zoran Vucetic
Design of ATL Rules for TransformingUML 2 Sequence Diagrams into Petri Nets..................................... 1
Elkamel Merah, Nabil Messaoudi, Dalal Bardou and Allaoua Chaoui
Data aggregation in wireless sensor network based on dynamic fuzzy clusteringcsandit
Wireless Sensor Networks (WSN) use a plurality of s
ensor nodes that unceasingly collected and
sent data from a specific area to a base station. C
luster based data aggregation is one of the
popular protocols in WSN. Clustering is an importan
t procedure for extending the network
lifetime in WSNs. Cluster Heads (CH) aggregate data
from relevant cluster nodes and send it to
the base station. A main challenge in WSNs is to se
lect suitable CHs. In another communication
protocol based on a tree construction, energy consu
mption is low because there are short paths
between the sensors. In this paper, we propose Dyna
mic Fuzzy Clustering (DFC) data
aggregation. The proposed method first uses fuzzy d
ecision making approach for the selection
of CHs and then a minimum spanning tree is construc
ted based on CHs. CHs are selected
efficiently and accurately. The combining clusterin
g and tree structure is reclaiming the
advantages of the previous structures. Our method i
s compared to Low Energy Adaptive
Clustering Hierarchy (LEACH), Cluster and Tree Dara
Aggregation (CTDA), Modified Cluster
based and Tree based Data Aggregation (MCTDA) and C
luster based and Tree based Power
Efficient Data Collection and Aggregation (CTPEDCA)
.Our method decreases energy
consumption of each node. In DFC data aggregation,
the node lifetime is increased and the
survival of the WSN is improved.
WIRELESS SENSOR NETWORK CLUSTERING USING PARTICLES SWARM OPTIMIZATION FOR RED...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality. The most important issue in this type of networks is energy constraints. In this area several researches have been done from which clustering is one of the most effective solutions. The goal of clustering is to divide network into sections each of which has a cluster head (CH). The task of cluster heads collection, data aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF, PSO-MV) in terms of network lifetime and energy consumption.
CONSENSUS BASED DATA AGGREGATION FOR ENERGY CONSERVATION IN WIRELESS SENSOR N...ijdpsjournal
Our planet is abundant with raw data and to monitor the available data properly, processing of the enormous raw data is very vital. One of the key things in development of mankind and the nature is to acquire as much data as possible and to react appropriately in accordance with the studied data. It’s nothing but diagnosis of the physical world by studying the data acquired from them in order to take proper measures that can help in treating them better. Large volume of data incurs high energy consumption for its transmission and thus results in decrease of overall network lifetime.
Wireless Sensor Network (WSN) is a collection of multiple sensor nodes that all together forms a network for transmitting data acquired by each sensor node to sink known as Base Station (BS). In hierarchical routing acquired data are sent via relay agents like Cluster Heads (CH). The Cluster Heads must be customised with computations and formulations, which will help in aggregating the gathered data, in order to reduce energy consumption while transmitting the data further in the network while maintaining the data integrity to withhold the significance of every single value in a data set.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Energy Efficient Multipath Data Fusion Technique for Wireless Sensor NetworksIDES Editor
In wireless sensor networks (WSN), data fusion
should be energy efficient. But, determining the optimal
number of aggregators in an energy efficient manner is a
challenging task. Moreover, the existing data fusion
techniques mostly use the same path for transmitting
aggregated data to the sink which reduces the nodes lifetime.
In this paper, we propose a technique which combines energy
efficiency and multiple path selection for data fusion in WSN.
The network is partitioned into various clusters and the node
with highest residual energy is selected as the cluster head.
The sink computes multiple paths to each cluster head for
data transmission. The distributed source coding and the
lifting scheme wavelet transform are used for compressing
the data at the CH. During each round of transmission, the
path is changed in a round robin manner, to conserve the
energy. This process is repeated for each cluster. From our
simulation results we show that this data fusion technique
has less energy consumption with increased packet delivery
ratio, when compared with the existing schemes.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
GREEDY CLUSTER BASED ROUTING FOR WIRELESS SENSOR NETWORKSijcsit
In recent years, applications of wireless sensor networks have evolved in many areas such as target tracking, environmental monitoring, military and medical applications. Wireless sensor network continuously collect and send data through sensor nodes from a specific region to a base station. But, data redundancy due to neighbouring sensors consumes energy, compromising the network lifetime. In order to improve the network lifetime, a novel cluster based local route search method, called, Greedy Clusterbased Routing (GCR) technique in wireless sensor network. The proposed GCR method uses arbitrary timer in order to participate cluster head selection process with maximum neighbour nodes and minimum distance between the source and base station. GCR constructs dynamic routing improving the rate of network lifetime through Mass Proportion value. Also, GCR uses a greedy route finding strategy for
balancing energy consumption. Experimental results show that GCR achieves significant energy savings and prolong network lifetime.
Wireless sensor networks, clustering, Energy efficient protocols, Particles S...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality.
The most important issue in this type of networks is energy constraints. In this area several researches have
been done from which clustering is one of the most effective solutions. The goal of clustering is to divide
network into sections each of which has a cluster head (CH). The task of cluster heads collection, data
aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach
for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal
fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual
energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation
results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF,
PSO-MV) in terms of network lifetime and energy consumption.
Cluster Head Selection Techniques for Energy Efficient Wireless Sensor Networ...ijsrd.com
Wireless sensor networks are widely considered as one of the most important technologies. The Wireless Sensor Network (WSN) is a wireless network consisting of ten to thousand small nodes with sensing, computing and wireless communication capabilities. They have been applied to numerous fields such as healthcare, monitoring system, military, and so forth. Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Energy efficiency is thus a primary issue in maintaining the network. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach in wireless sensor networks. This paper elaborates several techniques like LEACH, HEED, LEACH-B, PEACH, EEUC of cluster head selection for energy efficient in wireless sensor networks.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
An Integrated Distributed Clustering Algorithm for Large Scale WSN...................................................1
S. R. Boselin Prabhu, S. Sophia, S. Arthi and K. Vetriselvi
An Efficient Connection between Statistical Software and Database Management System ................... 1
Sunghae Jun
Pragmatic Approach to Component Based Software Metrics Based on Static Methods ......................... 1
S. Sagayaraj and M. Poovizhi
SDI System with Scalable Filtering of XML Documents for Mobile Clients ............................................... 1
Yi Yi Myint and Hninn Aye Thant
An Easy yet Effective Method for Detecting Spatial Domain LSB Steganography .................................... 1
Minati Mishra and Flt. Lt. Dr. M. C. Adhikary
Minimizing the Time of Detection of Large (Probably) Prime Numbers ................................................... 1
Dragan Vidakovic, Dusko Parezanovic and Zoran Vucetic
Design of ATL Rules for TransformingUML 2 Sequence Diagrams into Petri Nets..................................... 1
Elkamel Merah, Nabil Messaoudi, Dalal Bardou and Allaoua Chaoui
Data aggregation in wireless sensor network based on dynamic fuzzy clusteringcsandit
Wireless Sensor Networks (WSN) use a plurality of s
ensor nodes that unceasingly collected and
sent data from a specific area to a base station. C
luster based data aggregation is one of the
popular protocols in WSN. Clustering is an importan
t procedure for extending the network
lifetime in WSNs. Cluster Heads (CH) aggregate data
from relevant cluster nodes and send it to
the base station. A main challenge in WSNs is to se
lect suitable CHs. In another communication
protocol based on a tree construction, energy consu
mption is low because there are short paths
between the sensors. In this paper, we propose Dyna
mic Fuzzy Clustering (DFC) data
aggregation. The proposed method first uses fuzzy d
ecision making approach for the selection
of CHs and then a minimum spanning tree is construc
ted based on CHs. CHs are selected
efficiently and accurately. The combining clusterin
g and tree structure is reclaiming the
advantages of the previous structures. Our method i
s compared to Low Energy Adaptive
Clustering Hierarchy (LEACH), Cluster and Tree Dara
Aggregation (CTDA), Modified Cluster
based and Tree based Data Aggregation (MCTDA) and C
luster based and Tree based Power
Efficient Data Collection and Aggregation (CTPEDCA)
.Our method decreases energy
consumption of each node. In DFC data aggregation,
the node lifetime is increased and the
survival of the WSN is improved.
WIRELESS SENSOR NETWORK CLUSTERING USING PARTICLES SWARM OPTIMIZATION FOR RED...IJMIT JOURNAL
Wireless sensor networks (WSN) is composed of a large number of small nodes with limited functionality. The most important issue in this type of networks is energy constraints. In this area several researches have been done from which clustering is one of the most effective solutions. The goal of clustering is to divide network into sections each of which has a cluster head (CH). The task of cluster heads collection, data aggregation and transmission to the base station is undertaken. In this paper, we introduce a new approach for clustering sensor networks based on Particle Swarm Optimization (PSO) algorithm using the optimal fitness function, which aims to extend network lifetime. The parameters used in this algorithm are residual energy density, the distance from the base station, intra-cluster distance from the cluster head. Simulation results show that the proposed method is more effective compared to protocols such as (LEACH, CHEF, PSO-MV) in terms of network lifetime and energy consumption.
CONSENSUS BASED DATA AGGREGATION FOR ENERGY CONSERVATION IN WIRELESS SENSOR N...ijdpsjournal
Our planet is abundant with raw data and to monitor the available data properly, processing of the enormous raw data is very vital. One of the key things in development of mankind and the nature is to acquire as much data as possible and to react appropriately in accordance with the studied data. It’s nothing but diagnosis of the physical world by studying the data acquired from them in order to take proper measures that can help in treating them better. Large volume of data incurs high energy consumption for its transmission and thus results in decrease of overall network lifetime.
Wireless Sensor Network (WSN) is a collection of multiple sensor nodes that all together forms a network for transmitting data acquired by each sensor node to sink known as Base Station (BS). In hierarchical routing acquired data are sent via relay agents like Cluster Heads (CH). The Cluster Heads must be customised with computations and formulations, which will help in aggregating the gathered data, in order to reduce energy consumption while transmitting the data further in the network while maintaining the data integrity to withhold the significance of every single value in a data set.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Energy Efficient Multipath Data Fusion Technique for Wireless Sensor NetworksIDES Editor
In wireless sensor networks (WSN), data fusion
should be energy efficient. But, determining the optimal
number of aggregators in an energy efficient manner is a
challenging task. Moreover, the existing data fusion
techniques mostly use the same path for transmitting
aggregated data to the sink which reduces the nodes lifetime.
In this paper, we propose a technique which combines energy
efficiency and multiple path selection for data fusion in WSN.
The network is partitioned into various clusters and the node
with highest residual energy is selected as the cluster head.
The sink computes multiple paths to each cluster head for
data transmission. The distributed source coding and the
lifting scheme wavelet transform are used for compressing
the data at the CH. During each round of transmission, the
path is changed in a round robin manner, to conserve the
energy. This process is repeated for each cluster. From our
simulation results we show that this data fusion technique
has less energy consumption with increased packet delivery
ratio, when compared with the existing schemes.
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.
Optimized Energy Management Model on Data Distributing Framework of Wireless ...Venu Madhav
Data Dissemination is an essential transmitting method for a sensor network to the endusers
across any set of interconnected frameworks. WSN is often used within an IoT system,
in other words. As in a mesh network, a wide collection of sensors can collect data
individually and send data to the web via an IoT system through a router. The conventional
defined solution for data dissemination in Wireless Sensor Networks (WSN) does not
include the wide range of new applications built on the Internet of Things (IoT)systems.
Hence, it is observed that searching for an appropriate transmission link while distributing
data with optimized utilization of energy is a significant challenge in the IoT communication
infrastructure. Therefore, in this paper, an Optimized Energy Management Model for
Data Dissemination (OEM-DD) framework has been proposed to optimize energy during
data transmission efficiently across all sensor network nodes in the IoT system. The efficiency
of the data dissemination across an interconnected network has been achieved by
introducing a Non-adaptive routing approach in which data is distributed effectively from
a single source to various points. Besides, Non-adaptive routing involves the dispersed collaboration
system and the priority task planning principle combined with an integer framework
for the efficient energy processing and grouping of data in the sensor’s network. Optimization
of the energy management model through Non-adaptive routing allows low power
consumption and minimal energy usage for each sensor node in the IoT system to improve
the transfer and handling of data in severe interruption. The experimental results show that
the suggested model enhances the data transmission rate of 96.33%
An Efficient Approach for Data Gathering and Sharing with Inter Node Communi...cscpconf
In today’s era Wireless sensor networks (WSNs) have emerged as a solution for a wide range of
applications. Most of the traditional WSN architectures consist of static nodes which are densely deployed
over a sensing area. Recently, several WSN architectures based on mobile elements (MEs) have been
proposed. Most of them exploit mobility to address the problem of data collection in WSNs. The common
drawback among them is to data sharing between interconnected nodes. In this paper we propose an
Efficient Approach for Data Gathering and Sharing with Inter Node Communication in Mobile-Sink. Our
algorithm is divided into seven parts: Registration Phase, Authentication Phase, Request and Reply Phase,
Setup Phase, Setup Phase (NN), Data Gathering, and Forwarding to Sink. Our approach provides an
efficient way to handle data in between the intercommunication nodes. By the above approach we can
access the data from the node which is not in the list, by sharing the data from the node which is
approachable to the desired node. For accessing and sharing we need some security so that the data can
be shared between authenticated nodes. For this we use two way security approach one for the accessing
node and other for the sharing.
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
Time Orient Multi Attribute Sensor Selection Technique For Data Collection In...inventionjournals
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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)
ALL ABOUT DATA AGGREGATION IN WIRELESS SENSOR NETWORKSEditor IJCTER
A wireless sensor network is a computer network that consists of small devices called
sensor nodes. These sensor nodes have the ability to sense different environmental conditions like
temperature, pressure, etc. All these sensor nodes send their data to a central node or base station.
This creates a large communication overhead the energy source for these nodes is usually a battery.
This gives rise to huge consumption of energy and resources. So a solution is required that
overcomes the above problems. Data aggregation is one of its solutions. This method consists of
aggregators that combine the data coming from the sensor nodes and then passes it to the base
station. With the help of data aggregation we reduce the energy consumption by eliminating
redundancy and we can enhance the life time of wireless network. The purpose of the proposed paper
is to explain data aggregation in wireless sensor network, how it works, different techniques of data
aggregation and the comparison among them.
An Analytical Model of Latency and Data Aggregation Tradeoff in Cluster Based...ijsrd.com
Sensor networks are collection of sensor nodes which co-operatively send sensed data to base station. As sensor nodes are battery driven, an efficient utilization of power is essential in order to use networks for long duration. Therefore it is needed to reduce data traffic inside sensor networks, thereby reducing the amount of data that is needed to send to base station. The main goal of data aggregation algorithms is to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. In wireless sensor network, periodic data sampling leads to enormous collection of raw facts, the transmission of which would rapidly deplete the sensor power. A fundamental challenge in the design of wireless sensor networks (WSNs) is to maximize their lifetimes. Data aggregation has emerged as a basic approach in WSNs in order to reduce the number of transmissions of sensor nodes, and hence minimizing the overall power consumption in the network. Data aggregation is affected by several factors, such as the placement of aggregation points, the aggregation function, and the density of sensors in the network. In this paper, an analytical model of wireless sensor network is developed and performance is analyzed for varying degree of aggregation and latency parameters. The overall performance of our proposed methods is evaluated using MATLAB simulator in terms of aggregation cycles, average packet drops, transmission cost and network lifetime. Finally, simulation results establish the validity and efficiency of the approach.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
Similar to A COST EFFECTIVE COMPRESSIVE DATA AGGREGATION TECHNIQUE FOR WIRELESS SENSOR NETWORKS (20)
Quarkus Hidden and Forbidden ExtensionsMax Andersen
Quarkus has a vast extension ecosystem and is known for its subsonic and subatomic feature set. Some of these features are not as well known, and some extensions are less talked about, but that does not make them less interesting - quite the opposite.
Come join this talk to see some tips and tricks for using Quarkus and some of the lesser known features, extensions and development techniques.
Into the Box Keynote Day 2: Unveiling amazing updates and announcements for modern CFML developers! Get ready for exciting releases and updates on Ortus tools and products. Stay tuned for cutting-edge innovations designed to boost your productivity.
top nidhi software solution freedownloadvrstrong314
This presentation emphasizes the importance of data security and legal compliance for Nidhi companies in India. It highlights how online Nidhi software solutions, like Vector Nidhi Software, offer advanced features tailored to these needs. Key aspects include encryption, access controls, and audit trails to ensure data security. The software complies with regulatory guidelines from the MCA and RBI and adheres to Nidhi Rules, 2014. With customizable, user-friendly interfaces and real-time features, these Nidhi software solutions enhance efficiency, support growth, and provide exceptional member services. The presentation concludes with contact information for further inquiries.
Field Employee Tracking System| MiTrack App| Best Employee Tracking Solution|...informapgpstrackings
Keep tabs on your field staff effortlessly with Informap Technology Centre LLC. Real-time tracking, task assignment, and smart features for efficient management. Request a live demo today!
For more details, visit us : https://informapuae.com/field-staff-tracking/
Unleash Unlimited Potential with One-Time Purchase
BoxLang is more than just a language; it's a community. By choosing a Visionary License, you're not just investing in your success, you're actively contributing to the ongoing development and support of BoxLang.
OpenFOAM solver for Helmholtz equation, helmholtzFoam / helmholtzBubbleFoamtakuyayamamoto1800
In this slide, we show the simulation example and the way to compile this solver.
In this solver, the Helmholtz equation can be solved by helmholtzFoam. Also, the Helmholtz equation with uniformly dispersed bubbles can be simulated by helmholtzBubbleFoam.
Accelerate Enterprise Software Engineering with PlatformlessWSO2
Key takeaways:
Challenges of building platforms and the benefits of platformless.
Key principles of platformless, including API-first, cloud-native middleware, platform engineering, and developer experience.
How Choreo enables the platformless experience.
How key concepts like application architecture, domain-driven design, zero trust, and cell-based architecture are inherently a part of Choreo.
Demo of an end-to-end app built and deployed on Choreo.
A Comprehensive Look at Generative AI in Retail App Testing.pdfkalichargn70th171
Traditional software testing methods are being challenged in retail, where customer expectations and technological advancements continually shape the landscape. Enter generative AI—a transformative subset of artificial intelligence technologies poised to revolutionize software testing.
Why React Native as a Strategic Advantage for Startup Innovation.pdfayushiqss
Do you know that React Native is being increasingly adopted by startups as well as big companies in the mobile app development industry? Big names like Facebook, Instagram, and Pinterest have already integrated this robust open-source framework.
In fact, according to a report by Statista, the number of React Native developers has been steadily increasing over the years, reaching an estimated 1.9 million by the end of 2024. This means that the demand for this framework in the job market has been growing making it a valuable skill.
But what makes React Native so popular for mobile application development? It offers excellent cross-platform capabilities among other benefits. This way, with React Native, developers can write code once and run it on both iOS and Android devices thus saving time and resources leading to shorter development cycles hence faster time-to-market for your app.
Let’s take the example of a startup, which wanted to release their app on both iOS and Android at once. Through the use of React Native they managed to create an app and bring it into the market within a very short period. This helped them gain an advantage over their competitors because they had access to a large user base who were able to generate revenue quickly for them.
Software Engineering, Software Consulting, Tech Lead.
Spring Boot, Spring Cloud, Spring Core, Spring JDBC, Spring Security,
Spring Transaction, Spring MVC,
Log4j, REST/SOAP WEB-SERVICES.
Strategies for Successful Data Migration Tools.pptxvarshanayak241
Data migration is a complex but essential task for organizations aiming to modernize their IT infrastructure and leverage new technologies. By understanding common challenges and implementing these strategies, businesses can achieve a successful migration with minimal disruption. Data Migration Tool like Ask On Data play a pivotal role in this journey, offering features that streamline the process, ensure data integrity, and maintain security. With the right approach and tools, organizations can turn the challenge of data migration into an opportunity for growth and innovation.
Enhancing Research Orchestration Capabilities at ORNL.pdfGlobus
Cross-facility research orchestration comes with ever-changing constraints regarding the availability and suitability of various compute and data resources. In short, a flexible data and processing fabric is needed to enable the dynamic redirection of data and compute tasks throughout the lifecycle of an experiment. In this talk, we illustrate how we easily leveraged Globus services to instrument the ACE research testbed at the Oak Ridge Leadership Computing Facility with flexible data and task orchestration capabilities.
Cyaniclab : Software Development Agency Portfolio.pdfCyanic lab
CyanicLab, an offshore custom software development company based in Sweden,India, Finland, is your go-to partner for startup development and innovative web design solutions. Our expert team specializes in crafting cutting-edge software tailored to meet the unique needs of startups and established enterprises alike. From conceptualization to execution, we offer comprehensive services including web and mobile app development, UI/UX design, and ongoing software maintenance. Ready to elevate your business? Contact CyanicLab today and let us propel your vision to success with our top-notch IT solutions.
Listen to the keynote address and hear about the latest developments from Rachana Ananthakrishnan and Ian Foster who review the updates to the Globus Platform and Service, and the relevance of Globus to the scientific community as an automation platform to accelerate scientific discovery.
We describe the deployment and use of Globus Compute for remote computation. This content is aimed at researchers who wish to compute on remote resources using a unified programming interface, as well as system administrators who will deploy and operate Globus Compute services on their research computing infrastructure.
Exploring Innovations in Data Repository Solutions - Insights from the U.S. G...Globus
The U.S. Geological Survey (USGS) has made substantial investments in meeting evolving scientific, technical, and policy driven demands on storing, managing, and delivering data. As these demands continue to grow in complexity and scale, the USGS must continue to explore innovative solutions to improve its management, curation, sharing, delivering, and preservation approaches for large-scale research data. Supporting these needs, the USGS has partnered with the University of Chicago-Globus to research and develop advanced repository components and workflows leveraging its current investment in Globus. The primary outcome of this partnership includes the development of a prototype enterprise repository, driven by USGS Data Release requirements, through exploration and implementation of the entire suite of the Globus platform offerings, including Globus Flow, Globus Auth, Globus Transfer, and Globus Search. This presentation will provide insights into this research partnership, introduce the unique requirements and challenges being addressed and provide relevant project progress.
Experience our free, in-depth three-part Tendenci Platform Corporate Membership Management workshop series! In Session 1 on May 14th, 2024, we began with an Introduction and Setup, mastering the configuration of your Corporate Membership Module settings to establish membership types, applications, and more. Then, on May 16th, 2024, in Session 2, we focused on binding individual members to a Corporate Membership and Corporate Reps, teaching you how to add individual members and assign Corporate Representatives to manage dues, renewals, and associated members. Finally, on May 28th, 2024, in Session 3, we covered questions and concerns, addressing any queries or issues you may have.
For more Tendenci AMS events, check out www.tendenci.com/events
Globus Compute wth IRI Workflows - GlobusWorld 2024Globus
As part of the DOE Integrated Research Infrastructure (IRI) program, NERSC at Lawrence Berkeley National Lab and ALCF at Argonne National Lab are working closely with General Atomics on accelerating the computing requirements of the DIII-D experiment. As part of the work the team is investigating ways to speedup the time to solution for many different parts of the DIII-D workflow including how they run jobs on HPC systems. One of these routes is looking at Globus Compute as a way to replace the current method for managing tasks and we describe a brief proof of concept showing how Globus Compute could help to schedule jobs and be a tool to connect compute at different facilities.
Globus Compute wth IRI Workflows - GlobusWorld 2024
A COST EFFECTIVE COMPRESSIVE DATA AGGREGATION TECHNIQUE FOR WIRELESS SENSOR NETWORKS
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
DOI : 10.5121/ijasuc.2010.1411 116
A COST EFFECTIVE COMPRESSIVE DATA
AGGREGATION TECHNIQUE FOR WIRELESS
SENSOR NETWORKS
M.Y. Mohamed Yacoab1
, Dr.V.Sundaram2
and Dr.A.Thajudeen3
1
Research Scholar, Karpagam University, Coimbatore, India
yacoab@yahoo.com
2
Director, MCA Department, Karpagam College of Engineering, Coimbatore, India
dr_vsundaram@yahoo.com
3
Director, Measi Institute of Information Technology, Chennai India
thaj_a2001@yahoo.com
ABSTRACT
In wireless sensor network (WSN) there are two main problems in employing conventional compression
techniques. The compression performance depends on the organization of the routes for a larger extent.
The efficiency of an in-network data compression scheme is not solely determined by the compression
ratio, but also depends on the computational and communication overheads. In Compressive Data
Aggregation technique, data is gathered at some intermediate node where its size is reduced by applying
compression technique without losing any information of complete data. In our previous work, we have
developed an adaptive traffic aware aggregation technique in which the aggregation technique can be
changed into structured and structure-free adaptively, depending on the load status of the traffic. In this
paper, as an extension to our previous work, we provide a cost effective compressive data gathering
technique to enhance the traffic load, by using structured data aggregation scheme. We also design a
technique that effectively reduces the computation and communication costs involved in the compressive
data gathering process. The use of compressive data gathering process provides a compressed sensor
reading to reduce global data traffic and distributes energy consumption evenly to prolong the network
lifetime. By simulation results, we show that our proposed technique improves the delivery ratio while
reducing the energy and delay.
KEYWORDS
Wireless Sensor Network, Data Aggregation And Data Gathering, Compressive Data
Gathering
1. INTRODUCTION
1.1 Wireless Sensor Networks
Wireless sensor networks include the emerging technologies which have received major
attention from the research community. The sensor network which is self organizing ad hoc
system comprises of several small and low cost devices. It observes the physical environment,
collect the information and transmit it to one or more sink nodes. Generally, the radio
transmission range of the sensor nodes are in the orders of magnitude which is smaller than the
geographical extent of the entire network. Therefore, data should be transmitted towards the sink
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
117
node hop-by-hop in a multi-hop manner. By reducing the amount of data which is to be
transmitted, the energy consumption of the network can also be reduced [1]. A large number of
small electromechanical devices with sensing, computing and communication capabilities are
included in the wireless sensor networks. It can be used for collecting sensory information, such
as temperature measurements, from an extended geographic area [2].
The possible uses of the sensor networks have been researched actively. Due to the
characteristics of the wireless sensor network several challenging issues are created. The
following characteristics are mainly focused:
• Sensor nodes tend to fail.
• Sensor nodes utilize a broadcast communication paradigm and have severe bandwidth
constraints.
• Sensor nodes have limited resources [3].
1.2 Data Aggregation and Data Gathering
A common function of sensor networks is data gathering. In data gathering the information
sampled at sensor nodes has to be transported to the central base station for further processing
and analysis. An important topic mentioned by the wireless sensor network community is the in-
network data aggregation while focusing on the severe energy constraints of the sensor nodes
and the limited transport capacity of multi-hop wireless networks. The basic idea for minimizing
the expense of data transmission is to pre-process the sensor data in the network by the sensor
nodes [4].
One of the basic distributed data processing procedures in the wireless sensor networks is data
aggregation. It is used to save the energy and to reduce the medium access layer contention [5].
The idea is to combine the data coming from different sources, eliminating the redundancy and
reduce the number of transmissions, thus saving the energy [6]. By using the in-network data
aggregation, the natural redundancy in the raw data collected from the sensors can be eliminated.
Moreover, such operations are useful for extracting the specific information from the data.
Supporting high frequency of in-network data aggregation is severe for the network in order to
conserve energy for a longer network lifetime.
1. 3 Need of Compressive Data Aggregation technique in WSN
In wireless sensor network (WSN) there are two main problems with conventional compression
techniques.
• The compression performance relies heavily on how the routes are organized. In order to
achieve the highest compression ratio, compression and routing algorithms need to be
jointly optimized.
• The efficiency of an in-network data compression scheme is not solely determined by
the compression ratio, but also depends on the computational and communication
overheads [7].
In this situation, Compressive Data Aggregation technique helps to cope up with these issues. In
this technique, data is gathered at some intermediate node where the data size size is reduced by
applying compression technique without losing any information of complete data. Compressive
Data Aggregation technique requires each node in the WSN to send exactly k packets
irrespective of what it has received, which means, compared with traditional techniques , more
work/load for the nodes which are far away from the sink and less work/load for the nodes that
are close to the sink. Data compression and aggregation technique have the potential to improve
WSN energy efficiency and minimize communication [8].
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
118
1.4 Adaptive Traffic Aware Data Aggregation Technique
In our previous work [9], we have proposed an adaptive traffic aware aggregation technique for
wireless sensor networks. In this work, a multi path structured tree is constructed in which nodes
are selected based on their residual energy level. A traffic monitoring agent is used to monitor
the load status of the event traffic and each node estimates its traffic load during the data
reception. At the sink, it estimates the total traffic load in the system and sends an
OVERLOADED packet to the sources if it is greater than a threshold level T. Then the
aggregation technique is changed to structure-free lossy aggregation by the sources. If the traffic
load is less than the threshold value T, the sink sends UNDERLOADED packet to the sources
and then sources change the aggregation mode to the structured lossless aggregation. This
technique eventually provides a reliable transmission environment with low energy
consumption, by efficiently utilizing the energy availability of the forwarding nodes to gather
and distribute the data to sink, according to its requirements.
As an extension of our previous work, we provide a compressive data gathering technique to
enhance the traffic load, when structured data aggregation is used. The use of compressive data
gathering provides a compressed sensor reading to reduce global data traffic and distributes
energy consumption evenly to prolong network lifetime. We can also increase the efficiency
level if the correlated sensor readings are transmitted jointly rather than separately.
2. RELATED WORK
Marco F. Duarte et al [11] have introduced a new theory for distributed compressed sensing
(DCS) that enables new distributed coding algorithms for multi-signal ensembles that exploit
both intra- and inter-signal correlation structures. They also proposed algorithms for joint
recovery of multiple signals from incoherent projections.
Zainul Charbiwala et al [12] have proposed that if CS is employed for source compression, then
Compressive Sensing (CS) can further be exploited as an application layer erasure coding
strategy for recovering missing data. They showed that CS erasure encoding (CSEC) with
random sampling is efficient for handling missing data in erasure channels, paralleling the
performance of BCH codes, with the added benefit of graceful degradation of the reconstruction
error even when the amount of missing data far exceeds the designed redundancy.
Wenbo He et al [13] proposed a two privacy-preserving data aggregation schemes for additive
aggregation functions. The first scheme – Cluster-based Private Data Aggregation (CPDA) –
leverages clustering protocol and algebraic properties of polynomials. The second scheme –
Slice-Mix AggRegaTe (SMART) – builds on slicing techniques and the associative property of
addition. The goal of this work is to bridge the gap between collaborative data collection by wireless
sensor networks and data privacy.
Maarten Ditzel et al [14] presented the results of a study on the effects of data aggregation for
multi-target tracking in wireless sensor networks. Wireless sensor networks are normally limited
in communication bandwidth. The nodes implementing the wireless sensor network are
themselves limited in computing power and usually have a limited battery life. These
observations are recognized and combined to come to efficient target tracking approaches.
Steffen Peter et al [15] described and evaluated three algorithms that were reported to suit to the
WSN scenario. As result of the evaluation, where emphasize is on the awareness to potential
attack scenarios, a brief overview of strengths and weaknesses of the algorithms is presented.
Since no algorithm provides all desirable goals, two approaches to cope with the problems are
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
119
proposed. The first is the successive combination of two algorithms. It increases security, while
the additional efforts can be minimized by carefully selected parameters. For the second
approach, specific weaknesses are faced and so mechanisms are engineered that solve the
particular issues.
3. STRUCTURED TREE CONSTRUCTION
Initially we will describe the structured tree construction algorithm presented in our previous
paper.
We consider the wireless sensor network M as a directed graph G (N, E). Let the set of nodes N
consists of sensors and (a, b) ∈E if a and b are residing inside the transmission range of each
other. The fundamental idea of the proposed algorithm is, when a data gathering request is
arrived, then using the greedy algorithm a data gathering tree for the request is constructed. The
greedy algorithm maximizes the minimum residual energy among the nodes. Then the nodes are
included in the tree one by one but in the beginning only the sink node is included. A node b is
selected to be included into the tree if the causes to maximize the minimum residual energy
among the trees are included.
In our algorithm, we use the following notations
• N is the total number of nodes
• NT is the set of nodes in the tree,
• stop is a Boolean variable,
• newnode is the node that will be added to the tree.
• q is the size of the sensed data by newnode.
• wα
a,b is the weight assigned to the edge.
• R is the set of nodes that are not in the tree.
• RE is the residual energy.
• s is the sink node
• mremax is the maximum value of minimum residual energy at each node of the tree.
• tp is the temporary parent node.
• Pa,s is the unique path in T from node a to node s
• p(a) is the parent of a in T
• Let node v ∈ N - NT be the considered node.
3. 1. 1. Tree Construction Algorithm
Algorithm.1
1. NT = {s}
2. Stop = “false”
3. R = N - NT
4. RE(s) = ∞
5. mremax = 0
6. for each i ∈ R
6.1 Compute mremax (i) and tp
6.2. If mremax (i) > mremax, then
6.2.1. mremax = mremax(i)
6.2.2. Newnode = i
6.3 End if
7. End for
8 If mremax > 0, then
8.1. P (newnode) = tp(newnode)
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
120
8.2. For each j ∈ Pnewnode, s do
8.2.1. RE (j) = RE (j) - qwα
j,p(j)
8.3 End for
8.4. NT = NT ∪ {newnode}
8.5 R = R - newnode
9 Else
9.1 stop = “True”
10. End if
11. If (R ≠φ ) or stop=”false” then
11.1 repeat from 5
12. End if
13. End
4. ADAPTIVE COMPRESSIVE DATA GATHERING AND RECOVERY
4. 1. Compressive Data Gathering
The intuition behind CDG is that higher efficiency can be achieved if correlated sensor readings
are transmitted jointly rather than separately. We have given a simple example in Section I,
showing how sensor readings are combined while being relayed along a chain-type topology to
the sink. In practice, sensors usually spread in a two-dimensional area, and the ensemble of
routing paths presents a tree structure. Fig. 4(a) shows a typical routing tree in which the sink
has four children. Each of them leads a sub tree delimited by the dotted lines. Data gathering and
reconstruction of CDG are performed on the sub tree basis.
The perception behind CDG is that joint transmission of the correlated sensor readings instead of
transmission of the readings separately will increase the efficiency to a higher level. The
combining of the sensor readings when it is being transmitted to the sink along the chain type
topology is shown as an example in section 1. Generally sensors spread in the two dimensional
area and the structure represented by the routing paths is a tree structure. A routing tree with four
children at the sink is shown in the Fig. 4(a). A sub tree delimited by the dotted lines is lead by
each of them. On the sub tree basis data gathering and reconstruction of the CDG are performed.
In order to combine sensor readings while relaying them, every node needs to know its local routing
structure. That is, whether or not a given node is a leaf node in the routing tree or how many
children the node has if it is an inner node. To facilitate efficient aggregation, we have made a
small modification to standard ad-hoc routing protocol: when a node chooses a parent node, it
sends a “subscribe notification” to that node; when a node changes parent, it sends an
“unsubscribe notification” to the old parent.
Each node should know its local routing structure so as to combine the sensor readings when it is
being transmitted. That is, if the given node in the routing tree is a leaf node or not or if the node
is an inner node then how many children does it have. To the standard routing protocol, a small
modification is
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
121
fig. 1
done so as to facilitate proficient aggregation: when a parent node is chosen by the node, it
transmits a “subscribe notification” to that node and an “unsubscribe notification” is sent to the
old parent, when the node changes the parent.
The data gathering process of CDG is illustrated through an example shown in Fig. 4(b). It is the
detailed view of a small fraction of the routing tree marked in Fig. 4(a). After all nodes acquire
their readings, leaf nodes initiate the transmission.
The example shown in fig. 1 illustrates the data gathering process of CDG. The leaf nodes will
initiate the transmission only after all nodes receive their readings.
In this example, S2 generates a random number αi2, computes αi2v2, and transmits the value to S1.
The index i denote the ith
weighted sum ranging from 1 to M. Similarly, S4, S5 and S6 transmit
αi4v4, αi5v5, and αi6v6 to S3. Once S3 receives the three values, it computes αi3v3, adds it to the
sum of relayed values and transmits ∑=
6
3
ij
j
jvα to S1. Then S1 computes αi1v1 and
transmits ∑=
8
1
1j
j
jvα . Finally, the message containing the weighted sum of all readings in a sub
tree is forwarded to the sink.
In this example, a random number αi2 is generated by S2 and it computes αi2v2 and then the
value is sent to S1. The ith weighted sum is denoted by the index i which ranges from 1 to M.
Likewise αi4v4, αi5v5, and αi6v6 is transmitted to S3 by S4, S5 and S6. After the three values are
received by S3 it will compute the value αi3v3 and then it adds to the sum of the relayed value.
It then transmits to S1 the value ∑=
6
3
ij
j
jvα . Next αi1v1 is computed by the node S1 and
S1
S2 S3
S6
S7
S8
S5
S4
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
122
∑=
8
1
1j
j
jvα is transmitted. Lastly, to the sink, the message which contains the weighted sum of all
readings in a sub tree is forwarded.
Assume that there are N nodes in a particular tree, and the sink intends to collect M
measurements. Then all nodes send the same number of O (M) messages regardless of their hop
distance to the sink. The overall message complexity is O (NM). When M << N, CDG transmits
less messages than the baseline data collection whose worst case message complexity is O (N2
).
More importantly, the transmission load is spread out uniformly so that the lifetime of bottleneck
sensors and the entire network is greatly extended.
In a specific tree, if it is assumed to have N nodes and M measurements are intended to be
collected by the sink. Then regardless of the hop distance of the node to the sink, all nodes will
send the same number of O (M). O (NM) will be the overall message complexity. If M << N,
then less messages are transmitted by CDG when compared with the baseline data collection
when O (N2
) is the worst case message complexity. More importantly, for the extension of the
lifetime of the bottleneck sensors as well as the entire network, the transmission load is spread
uniformly.
The ith
weighted sum can be represented by:
∑
=
=
N
j
ji vA
1
ijα (1)
The sink obtains M weighted sums {Ai}, i = 1, 2 ...M.
Mathematically, we have:
MA
A
A
.
.
.
2
1
=
MNMM
N
N
ααα
ααα
ααα
...
.
.
......
......
21
22221
11211
Nv
v
v
.
.
.
2
1
(2)
In this equation, each column of {αij} contains the series of random numbers generated at a
corresponding node. In order to avoid transmitting this random matrix from sensors to the sink,
we can adopt a simple strategy: before data transmission, the sink broadcasts a random seed to
the entire network. Then each sensor generates its own seed using this global seed and its unique
identification. With a pre-installed pseudo random number generator, each sensor is able to
generate the corresponding series of coefficients. These coefficients can be reproduced at the
sink given that the sink knows the identifications of all sensors.
In the above equation, series of random numbers are placed in each column of {αij} which is
produced at the corresponding node. A simple strategy is used for preventing the transmission of
the random matrix from sensors to the sink: a random seed is broadcasted to the entire network
before transmission. Using this global seed and its unique identification, each sensor will
generate its own seed. Each sensor generates a corresponding series of coefficients from a pre-
installed pseudo random number generator. Given that the sink knows the identifications of all
sensors, the coefficients can be reproduced at the sink.
In (2), vi (i = 1, 2 ...N) is a scalar value. In a practical sensor network, each node is possibly
attached with a few sensors of different type, e.g. a temperature sensor and a humidity sensor.
Then sensor readings from each node become a multi-dimensional vector. In this case, we may
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
123
separate readings of each dimension and process them respectively. Alternatively, since the
random coefficients αij are irrelevant to sensor readings, we may treat vi as a vector. The
weighted sums Ai become vectors of the same dimension too.
In (2), vi (i = 1, 2 ...N) is a scalar value. Each node is possibly attached with a few sensors of
different type, e.g., temperature sensor and a humidity sensor in a practical sensor network. Then
from each node, the sensor readings become a multi dimensional vector. In this case, in each
dimension we may separate the readings and process them. Alternatively, since for the sensor
readings, the random coefficients αij are irrelevant, vi is treated as a vector. Ai which is a
weighted sum become vectors of the same dimension too.
When M < N, solving a set of M linear equations with N unknown variables is an ill-posed
problem. However, sensor readings are not independent variables. In most cases, the sensor field
follows a certain structure because of the spatial or temporal correlations. Hence, there exists a
transform domain in which the signal is sparse. Under this assumption, we will explain in the
following subsection whether the set of linear equations are solvable, what requirements M
should meet to solve them, and how these equations can be solved.
When M < N, with N unknown variables, solving a set of M linear equations is an ill-posed
problem. But sensor readings are no where independent variables. In most cases, a certain
structure is followed by the sensor field due to the spatial or temporal correlations. So, a
transform domain is used wherever the signal is sparse. Based on this assumption in the
following subsections we explain: whether linear equation set is solvable, to meet them what are
the requirements M and these equations can be solved.
4.2 Data recovery
According to compressive sampling theory, a K-sparse signal can be reconstructed from a small
number of measurements with a probability close to one. The weighted sums obtained in (2) are
a typical type of measurements. Signal sparsity characterizes the correlations within a signal. An
N-dimensional signal is considered as a K-sparse signal if there exists a domain in which this
signal can be represented by K (K _ N) non-zero coefficients. Fig. 5(a) shows a 100-dimensional
signal in its original time domain. Obviously, it is not sparse at all in this domain. Because of the
signal correlation, it can be described more compactly in transform domains such as wavelet and
DCT.
A K-sampling signal according to the compressive sampling theory can be reconstructed based
on the small number of measurements having a probability nearly one. The weighted sum from
(2) is measurements of typical type. Within a signal, signal sparsity characterizes the
correlations. An N-dimensional signal is called as a K-sparse signal when there is a domain
where signal can be presented as K(K_N) non zero coefficients. Fig.5(a) represents a 100-
dimensional signal in its real time domain. Due to signal correlation, in transform domains such
as wavelet and DCT, it can be described more compactly.
In a densely deployed sensor network, sensors have spatial correlations in their readings.
Sensors have spatial correlations in its readings in a densely deployed sensor networks.
Let N sensor readings form a vector v = [v1 v2 ... vN] T
, then v is a K-sparse signal in a particular
domain λ. Denote λ = [λ 1 λ 2 ... λ N] as the representation basis with vectors {λ i} as columns,
and X = [X1, X2 ...XN] T
are the corresponding coefficients. Then,
v can be represented in the λ domain as:
i
N
i
iXv λ∑=
=
1
Or v = λX (3)
Compressive sampling theory tells that a K-sparse signal can be reconstructed from M
measurements if M satisfies the following conditions [6]:
M ≥ β. ∆2
(α, λ). K.log N (4)
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
124
where β is a positive constant, α is the sampling matrix as defined in (2), and ∆ (α, λ) is the
coherence between sampling basis α and representation basis λ. The coherence metric measures
the largest correlation between any two elements of α and λ, and is defined as:
∆ (α, λ) = √N. Max | < αi, λj> |, 1≤ i, j ≥N (5)
From (5), we can see that the smaller the coherence between α and λ is, the lesser measurements
are needed to reconstruct the signal. In practice, using random measurement matrix is a
convenient choice, since a random basis has been shown to be largely incoherent with any fixed
basis and M = 3K ~ 4K is usually sufficient to satisfy (4).
From eq. (5), we get to know that lesser is the coherence in between α and λ, reduced
measurements are required for the signal reconstruction. In practice, a convenient choice is to
use random measurement matrix, since with any fixed basis a random basis is shown to be
largely incoherent and M = 3K – 4K is sufficient to satisfy eq. (4).
With sufficient number of measurements, the sink is able to reconstruct sensor readings by
solving an l1-minimization problem:
1
min
l
XNX ℜ∈
s.t. A = αv, v = λX (6)
In addition, for sparse signals whose random projections are contaminated with noise,
reconstruction can be achieved by solving a relaxed l1-minimization problem, where is a
predefined error threshold:
1
min
l
XNX ℜ∈
s.t. ||A – αv||
2
l < ε, v = λX (7)
Suppose is the solution to this convex optimization problem, then the proposed reconstruction
of the original signal is ũ = λ . It has been shown that the above l1-minimization problem can
be solved with linear programming (LP) techniques. Although the reconstruction complexity of
LP based decoder is polynomial, it goes pretty high when N is too large. While there is a large
body of on-going work looking for low-complexity reconstruction techniques, this topic is
beyond the scope of our paper. With the current LP based decoder, we would suggest that the
size of N does not exceed one thousand.
Suppose for the convex optimization problem if is the solution, then for the original signal the
proposed reconstruction is ũ = λ . The linear programming (LP) techniques can be used for
solving the above mentioned l1-minimization problem. When N is too large the reconstruction
complexity of LP based decoder goes pretty high even though initially it is a polynomial
function. This topic is beyond the scope of our paper, when there is a large body of on going
work looking for low complexity reconstruction technique. We would suggest, for the current
LP based decoder that the size of N does not exceed one thousand.
In (6) and (7), the λ matrix describes the correlation pattern among sensor readings. It is utilized
only in data recovery process, and is not required to be known to sensors. In this way, most of
the computations are shifted from sensors to the sink. Such asymmetry of computation
complexity makes CDG an appealing choice for WSNs.
In (6) and (7) the correlation pattern among the sensor reading is described by the λ matrix. It is
not required to be known to the sensors since it is utilized in data recovery process. Likewise,
most of the calculations are transferred from the sensors to the sink. As a result of the
asymmetry of computation complexity, CDG is an appealing choice for WSN’s.
5. MINIMIZING COMPRESSION COST
Our objective is to minimize both the computation and communication costs rather than
minimizing communication cost only, as done in the prior works. To perform the compression
over the data gathering tree (given in the last section), we propose a flow based technique where
data from each source is compressed and transmitted as a traffic flow over the corresponding
path from the source to the sink.
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
125
5. 1. Network Model
The underlying wireless network is modeled as a connected weighted graph
G = < N, L, W >,
Where the vertex set N represents the set of n sensor nodes; the edge (link) set L represents the
wireless connection between nodes and associated with each edge li Є L, its weight Wli is the
energy cost of sending a data packet of unit size over li. The link weight is determined by the
distance between the two adjacent nodes, the radio device, and the communication environment.
We also use (u, v) to denote an edge connecting u and v.
Let si Є N denote the sink node and S ⊂ N, denote the set of source nodes. In each period, each
source node generates a raw data of one unit size that needs to be transported to the sink,
possibly via multi-hop communication.
A data gathering tree is a sub-tree of G rooted at sink and containing S, denoted as
T = < N’, L’ >,
where S ⊂ N’ ⊂ N and L’ ⊂ L. Let Mn denote the number of source nodes in the sub-tree
rooted at n Є N. Given a data gathering tree, let Ps denote the path in the tree that connects s to si.
Also, for two edges l1, l2 on the same path, let l1 l2 denote the fact that l1 is a predecessor of l2.
We define a pre-defined system parameter, costcomp ≥ 0, to represent the energy cost of
compressing one unit of data (using (1) and (2) in section 4) normalized by the cost of
communicating one unit of data. The energy cost of compressing source information of size z to
an output of size o is represented as a function
F (o) = Costcomp * z * CR (8)
Where CR =
o
z is the compression ratio.
From (1), it can be seen that the energy cost is
• Proportional to the input size z since it has to process the whole input at least once,
• Proportional to the compression ratio CR.
If. l = (u, v) denote a one-hop link, where u generates a data packet of one unit size that needs
to be transmitted to v after appropriate compression by u, then z=1 and Eq. (1) can be modified
as.
F (o) =
o
Costcomp
Let Wl denote the cost of transmitting one unit of data over the link l. The overall energy costs,
denoted as Costenergy(o) can then be modeled as follows
Costenergy(o) =
o
Costcomp
+ o. Wl (9)
5. 2. Cost Effective Data Gathering
Given a data gathering tree (as described in section 3) over a sensor network, we model data
transmission over the tree as a composition of different data flows from each source node to si.
That is, each path from a source node to si in the tree corresponds to a data flow over the path.
The flow size may change along its corresponding path due to data compression performed by
intermediate nodes. Also, the energy cost of the system is the sum of the computation and
communication costs of all paths in the tree.
Consider an arbitrary path Ps in the tree from a source node n to si. Let fl
n
denote the flow over l
Є Ps and qs denote the last edge in Ps, i.e., the edge incident on si in Ps. We assume that the total
energy spent on data compression over the path Ps is determined by the flow on qs, i.e., the total
energy cost for data compression over Ps is calculated as
11. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
126
Ps = s
q
comp
s
f
Cost
(10)
Given a node in the tree, the number of incoming flows equals the number of source nodes in its
sub-tree. The output size required for compressing each incoming packet is lower bounded by
the joint entropy of these source nodes. We assume that the joint entropy of any i source nodes,
Ei is a non-decreasing and concave function of i with E1 = ED, where ED Є (0, 1) is the entropy of
one unit of data. We assume that the compression of i incoming data flows at node n can be
performed in such a way that the lower bound for compressing each data flow equals LBi =
i
Ei
,
with LB1 = E1 = ED. In other words, we assume that when maximal compression is performed on
i pieces of source information, the fraction of compressible data of each piece is the same.
Thus, for any l = (a, b) Є Ps, we impose the constraint on fl
n
such that
l
nf ≥ nMLB =
nM
nME
(11)
Let λi = nMLB , where Mn is the number of source nodes in the sub-tree rooted at n∈N. Also, we
have λi ≥λi+1, for i = 1. . . k − 1.
Given a data gathering tree and an arbitrary source node s Є S, consider the path from s to si. Let
Ps = {s1, s2. . . sk} denote the path, where s1 = s, sk = si, and k is the number of nodes along Ps.
We need to compress and transmit a packet of unit size from s1 to si with the minimal
computation and communication energy costs.
Let f denote a vector with flow along Ps, i.e., f = { l
n
f
1
, …., l
nk
f
1−
}.
For any optimal flow f over a path Ps, if fi+1 < fi, we have fi = λi.
6. SIMULATION RESULTS
6. 1. Simulation Setup
The performance of our cost effective compressive data aggregation (CECDA) technique is
evaluated through NS2 [13] simulation. A random network deployed in an area of 500 X 500 m
is considered. We vary the number of nodes as 20, 40….100. Initially the nodes are placed
randomly in the specified area. The base station is assumed to be situated 100 meters away from
the above specified area. The initial energy of all the nodes is assumed as 3.1 joules. In the
simulation, the channel capacity of mobile hosts is set to the same value: 2 Mbps. The
distributed coordination function (DCF) of IEEE 802.11 is used for wireless LANs as the MAC
layer protocol. The simulated traffic is CBR with UDP source and sink. The number of sources
is varied from 1 to 5.
Table 1 summarizes the simulation parameters used
TABLE 1: SIMULATION PARAMETERS
No. of Nodes 20,40,….100
Area Size 500 X 500
Mac 802.11
Simulation Time 50 sec
Traffic Source CBR
Packet Size 512
Transmit Power 0.660 w
12. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
127
Receiving Power 0.395 w
Idle Power 0.335 w
Initial Energy 3.1 J
Transmission
Range
75m
6. 2. Performance Metrics
The performance of CECDA technique is compared with our previous ATAA [9] protocol. The
performance is evaluated mainly, according to the following metrics.
Average end-to-end Delay: The end-to-end-delay is averaged over all surviving data packets
from the sources to the destinations.
Average Packet Delivery Ratio: It is the ratio of the number of packets received successfully
and the total number of packets transmitted.
Energy Consumption: It is the average energy consumed by all the nodes in sending, receiving
and forwarding operations
The simulation results are presented in the next section.
6. 3. Simulation Results
A. Dense
In our initial experiment, we vary the number of nodes as 20, 40, 60, 80 and 10 in which the
sources are densely deployed.
No. Of Nodes vs Delay
0
1
2
3
20 40 60 80 100
Nodes
Delay(s)
ATAA
CECDA
Fig 1: Nodes Vs Delay
No. of Nodes Vs Delivery Ratio
0
0.2
0.4
0.6
0.8
1
20 40 60 80 100
Nodes
Del.ratio
ATAA
CECDA
Fig 2: Nodes Vs DelRatio
13. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
128
No. Of Nodes Vs Energy
0
0.5
1
1.5
2
2.5
20 40 60 80 100
Nodes
Energy(J)
ATAA
CECDA
Fig 3: Nodes Vs Energy
Since the aggregation involves compressed data, the delay incurred in sending the data from
sensors to the sink, will be significantly reduced. Fig 1 gives the average end-to-end delay when
the number of nodes is increased. From the figure, it can be seen that the average end-to-end
delay of the proposed CECDA technique is less when compared with ATAA.
Fig 2 presents the packet delivery ratio when the number of nodes is increased. The compressed
data aggregation eliminates the packet drops at the intermediate nodes and hence increases the
packet delivery ratio. So CECDA achieves good delivery ratio, compared to ATAA.
Compressing the data during data aggregation reduces the number of data packets to be
aggregated at the aggregator nodes. Hence the total energy consumption involved in the
aggregation process will also be reduced. Fig 3 shows the results of energy consumption when
the number of nodes is increased. From the results, we can see that CECDA technique has less
energy consumption when compared with ATAA, since it has the energy efficient tree.
B. Sparse
In our second experiment, we vary the number of nodes as 20, 40, 60, 80 and 10 in which the
sources are sparsely deployed.
No.of Nodes Vs Delay
0
5
10
15
20
20 40 60 80 100
Nodes
Delay(s)
ATAA
CECDA
Fig 4: Nodes Vs Delay
14. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
129
No. of Nodes Vs Delivery Ratio
0
0.2
0.4
0.6
0.8
1
20 40 60 80 100
Nodes
Del.ratio
ATAA
CECDA
Fig 5: Nodes Vs DelRatio
Nio. of Nodes Vs Energy
0
0.5
1
1.5
2
2.5
20 40 60 80 100
Nodes
Energy(J)
ATAA
CECDA
Fig 6: Nodes Vs Energy
Since the aggregation involves compressed data, the delay incurred in sending the data from
sensors to the sink, will be significantly reduced. Fig 4 gives the average end-to-end delay when
the number of nodes is increased. From the figure, it can be seen that the average end-to-end
delay of the proposed CECDA technique is less when compared with ATAA.
Fig 5 presents the packet delivery ratio when the number of nodes is increased. CECDA
achieves good delivery ratio, compared to ATAA. The compressed data aggregation eliminates
the packet drops at the intermediate nodes and hence increases the packet delivery ratio.
Fig 6 shows the results of energy consumption when the number of nodes is increased.
Compressing the data during data aggregation reduces the number of data packets to be
aggregated at the aggregator nodes. Hence the total energy consumption involved in the
aggregation process will also be reduced. From the results, we can see that CECDA technique
has less energy consumption when compared with ATAA, since it has the energy efficient tree.
7. CONCLUSION
Compressive Data Aggregation technique helps to solve the issues of traditional compression
techniques. In this technique data is gathered at some intermediate node where size of the data
need to be sent is reduced by applying compression technique without losing any knowledge of
complete data. In our previous work, we have developed an adaptive traffic aware aggregation
technique in which the aggregation technique is adaptively changed to structured and structure-
free, depending on the load status of the traffic. In this paper, as an extension of our previous
work, we have provided a compressive data gathering technique to enhance the traffic load,
when structured data aggregation is used. We have also designed a technique that effectively
reduces the computation and communication costs involved in the compressive data gathering
process. The use of compressive data gathering provides a compressed sensor reading to reduce
global data traffic and distributes the energy consumption evenly to prolong network lifetime.
15. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.1, No.4, December 2010
130
By simulation results, we have shown that our proposed technique improves the delivery ratio
while reducing the energy and delay.
References
[1] Dorottya Vass and Attila Vidacs, “Distributed Data Aggregation with Geographical Routing in
Wireless Sensor Networks”, Proc., IEEE International Conference on Pervasive Services (ICPS), Istanbul,
Turkey, 15-20 July, 2007.
[2] Jukka Kohonen, “Data Gathering in Sensor Networks”, Helsinki Institute for Information Technology
in Finland, Nov-2004.
[3] Gregory Hartl, Baochun Li, “Loss Inference in Wireless Sensor Networks Based on Data
Aggregation”, IPSN 2004.
[4] Tao Cui, Lijun Chen, Tracey Ho, Steven H. Low, and Lachlan L. H. Andrew, “Opportunistic Source
Coding for Data Gathering in Wireless Sensor Networks”, Proceedings of the 2007 conference on
Diversity in computing Orlando, Florida, 2007.
[5] Zhenzhen Ye, Alhussein A. Abouzeid and Jing Ai, “Optimal Policies for Distributed Data
Aggregation in Wireless Sensor Networks”, Draft Infocom2007 Paper.
[6] Bhaskar Krishnamachari, Deborah Estrin and Stephen Wicker, “The Impact of Data Aggregation in
Wireless Sensor Networks”, Proceedings of the 22nd International Conference on Distributed Computing
Systems – 2002.
[7] Chong Luo and Feng Wu, “Compressive Data Gathering for Large-Scale Wireless Sensor Networks”,
Proceedings of the 15th annual international conference on Mobile computing and networking, Beijing,
China, 2009.
[8] Hengyu Long et al, “Energy-Efficient Spatially-Adaptive Clustering and Routing in Wireless Sensor
Networks”, Proceedings of Design, Automation & Test in Europe Conf, 2009.
[9] M.Y. Mohamed Yacoab and Dr. V. Sundaram, “An Adaptive Traffic Aware Data Aggregation
Technique for Wireless Sensor Networks”, American Journal of Scientific Research Issue 10, 2010.
[10]Riccardo Masiero et al, “A Bayesian Analysis of Compressive Sensing Data Recovery in Wireless
Sensor Networks”, IEEE SASN 2009, Saint Petersburg, Russia, Oct. 12-14, 2009.
[11]Dror Baron et al, “An Information-Theoretic Approach to Distributed Compressed Sensing”,
Proceedings of the 43d Allerton Conference on Communication, Control, and Computing, Monticello, IL,
September, 2005.
[12]Zainul Charbiwala et al, “Compressive Oversampling for Robust Data Transmission in Sensor
Networks”, IEEE INFOCOM, San Diego, CA, March 2010.
[13] Wenbo He, Xue Liu, Hoang Nguyen, Klara Nahrstedt and Tarek Abdelzaher, “PDA: Privacy-
preserving Data Aggregation in Wireless Sensor Networks”, 2007.
[14] Maarten Ditzel, Caspar Lageweg, Johan Janssen and Arne Theil, “Multi-target Data Aggregation and
Tracking in Wireless Sensor Networks”, JOURNAL OF NETWORKS, VOL. 3, NO. 1, JANUARY 2008.
[15] Steffen Peter, Krzysztof Piotrowski and Peter Langendoerfer, “On Concealed Data Aggregation for
Wireless Sensor Networks”, 2007.