In this Paper we analyze WSNs and show that it's possible to achieve better performances in terms of energy consumption and latency. Event aggregation in WSNs is a process of combining several low-level events into a high-level event to eliminate redundant information to be transmitted and thus save energy. Existing works on event aggregation consider either latency constraint or aggregation function, but not both. Moreover, existing works only consider optimal aggregation for single high level event, but many applications are composed of multiple high-level events. This paper studies the problem of aggregating multiple high-level events in WSNs with different latency constraints and aggregation functions. We propose relation matrix to define aggregation function, which describes the similarity among limited number of primitive events rather than the growing number of high-level events. Based on it, we propose an event aggregation algorithm jointly considering the two issues for single high-level event. This algorithm supports partial aggregation which is more general than fully aggregation. Through selection the optimal base events, the work is extended to multiple high level events and consider the practical reliable constraint. The simulation results show that our algorithm outperforms existing approaches and saves significant amount of energy (up to 35% in our system).
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
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.
Congestion Control Clustering a Review PaperEditor IJCATR
Wireless Sensor Networks consists of sensor nodes which are scattered in the environment, gather data and transmit it to a
base station for processing. Energy conservation in the Wireless Sensor Networks (WSN) is a very important task because of their
limited battery power. The related works so far have been done have tried to solve the problem keeping in the mind the constraints of
WSNs. In this paper, a priority based application specific congestion control clustering (PASCCC) protocol has been studied, which
often integrates the range of motion and heterogeneity of the nodes to detect congestion in a very network. Moreover a comparison of
the various clustering techniques has been done. From the survey it has been found that none of the protocol is efficient for energy
conservation. Hence the paper ends with future scope to overcome these issues.
TWO LEVEL DATA FUSION MODEL FOR DATA MINIMIZATION AND EVENT DETECTION IN PERI...pijans
Periodic Wireless Sensor Networks used for many applications such continuous Weather Monitoring, Cattle Monitoring, Water Quality Monitoring and Event Detection Applications. Due to continuous Monitoring, Large Amount of redundant data is transferred over the Network, which causes depletion of energy resources. Data Fusion is used with the Aim of deleting redundant, inconsistent data and provides more accurate data to the Sink. However, redundant data improves the data quality. Therefore, Two Level Data Fusion Model is proposed in this paper to transfer minimized data with the ability of accurately
determines the event with minimum Delay. Data Fusion Model employs Cluster based Data Fusion at Two Levels; First Level at Sensor Node ( SNs) and another level at Cluster Head ( CH )Node. At the first level of Fusion, SNs Send single most common measurement to the CH by using a similarity function. Second Level of Fusion is applied on CH to remove similar multi attribute measurement. Also at CH Node, Multiple Correlation is used to accurately distinguish the abnormal event from the normal event or outliers within minimum delay. Experimental results are performed on real data to validate proposed Data Fusion Model is Better in terms of data transfer over Network, Redundancy, Energy Consumption over the Prefix Filtering Technique (PFF) . This Model is also used to accurately detect early events in case of Emergency.
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.
Reliable and Efficient Data Acquisition in Wireless Sensor NetworkIJMTST Journal
The sensors in the WSN sense the surrounding, collects the data and transfers the data to the sink node. It
has been observed that the sensor nodes are deactivated or damaged when exposed to certain radiations or
due to energy problems. This damage leads to the temporary isolation of the nodes from the network which
results in the formation of the holes. These holes are dynamic in nature and can grow and shrink depending
upon the factors causing the damage to the sensor nodes. So a solution has been presented in the base paper
where the dual mode i.e. Radio frequency and the Acoustic mode are considered so that the data can be
transferred easily. Based on this a survey has been done where several factors are studied so that the
performance of the system can be increased.
ENERGY EFFICIENT HIERARCHICAL CLUSTER HEAD ELECTION USING EXPONENTIAL DECAY F...ijwmn
In the recent years, wireless sensor network (WSN) have witnessed increased interest in information gathering in applications such as combat field reconnaissance, security surveillance, environmental monitoring, patient health monitoring and so on. Thus, there is a need for scalable and energy-efficient routing, data gathering and aggregation protocols in these WSN environments. Various hierarchical
clustering Protocols have been proposed by authors for WSN to improve system stability, lifetime, and energy efficiency. Clustering involves grouping nodes into disjoint and non-overlapping clusters. In this paper we motivate the need for clustering. Secondly, we present general classification of published clustering schemes. Thirdly, we review some existing clustering algorithms proposed for WSNs; highlighting their objectives, features, and so on. Finally, we develop an Average Energy (AvE) prediction algorithm using exponential decay function y=Ae-ax+B. We then combine this function with the
probabilistic distributed LEACH of algorithm to determine suitable CHs. The combined algorithm was implemented on MATLAB simulator and tested for homogenous network. The result gathered from the simulation shows that the extended algorithm in homogenous network mode is able to achieve 39%
stability, 11% Average energy Dissipation per round and 40% Lifespan better than LEACH-Homo. This paper proposes a new direction in improving energy efficiency of WSN routing protocol, which is desirable in some critical WSN applications. .
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
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.
Congestion Control Clustering a Review PaperEditor IJCATR
Wireless Sensor Networks consists of sensor nodes which are scattered in the environment, gather data and transmit it to a
base station for processing. Energy conservation in the Wireless Sensor Networks (WSN) is a very important task because of their
limited battery power. The related works so far have been done have tried to solve the problem keeping in the mind the constraints of
WSNs. In this paper, a priority based application specific congestion control clustering (PASCCC) protocol has been studied, which
often integrates the range of motion and heterogeneity of the nodes to detect congestion in a very network. Moreover a comparison of
the various clustering techniques has been done. From the survey it has been found that none of the protocol is efficient for energy
conservation. Hence the paper ends with future scope to overcome these issues.
TWO LEVEL DATA FUSION MODEL FOR DATA MINIMIZATION AND EVENT DETECTION IN PERI...pijans
Periodic Wireless Sensor Networks used for many applications such continuous Weather Monitoring, Cattle Monitoring, Water Quality Monitoring and Event Detection Applications. Due to continuous Monitoring, Large Amount of redundant data is transferred over the Network, which causes depletion of energy resources. Data Fusion is used with the Aim of deleting redundant, inconsistent data and provides more accurate data to the Sink. However, redundant data improves the data quality. Therefore, Two Level Data Fusion Model is proposed in this paper to transfer minimized data with the ability of accurately
determines the event with minimum Delay. Data Fusion Model employs Cluster based Data Fusion at Two Levels; First Level at Sensor Node ( SNs) and another level at Cluster Head ( CH )Node. At the first level of Fusion, SNs Send single most common measurement to the CH by using a similarity function. Second Level of Fusion is applied on CH to remove similar multi attribute measurement. Also at CH Node, Multiple Correlation is used to accurately distinguish the abnormal event from the normal event or outliers within minimum delay. Experimental results are performed on real data to validate proposed Data Fusion Model is Better in terms of data transfer over Network, Redundancy, Energy Consumption over the Prefix Filtering Technique (PFF) . This Model is also used to accurately detect early events in case of Emergency.
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.
Reliable and Efficient Data Acquisition in Wireless Sensor NetworkIJMTST Journal
The sensors in the WSN sense the surrounding, collects the data and transfers the data to the sink node. It
has been observed that the sensor nodes are deactivated or damaged when exposed to certain radiations or
due to energy problems. This damage leads to the temporary isolation of the nodes from the network which
results in the formation of the holes. These holes are dynamic in nature and can grow and shrink depending
upon the factors causing the damage to the sensor nodes. So a solution has been presented in the base paper
where the dual mode i.e. Radio frequency and the Acoustic mode are considered so that the data can be
transferred easily. Based on this a survey has been done where several factors are studied so that the
performance of the system can be increased.
ENERGY EFFICIENT HIERARCHICAL CLUSTER HEAD ELECTION USING EXPONENTIAL DECAY F...ijwmn
In the recent years, wireless sensor network (WSN) have witnessed increased interest in information gathering in applications such as combat field reconnaissance, security surveillance, environmental monitoring, patient health monitoring and so on. Thus, there is a need for scalable and energy-efficient routing, data gathering and aggregation protocols in these WSN environments. Various hierarchical
clustering Protocols have been proposed by authors for WSN to improve system stability, lifetime, and energy efficiency. Clustering involves grouping nodes into disjoint and non-overlapping clusters. In this paper we motivate the need for clustering. Secondly, we present general classification of published clustering schemes. Thirdly, we review some existing clustering algorithms proposed for WSNs; highlighting their objectives, features, and so on. Finally, we develop an Average Energy (AvE) prediction algorithm using exponential decay function y=Ae-ax+B. We then combine this function with the
probabilistic distributed LEACH of algorithm to determine suitable CHs. The combined algorithm was implemented on MATLAB simulator and tested for homogenous network. The result gathered from the simulation shows that the extended algorithm in homogenous network mode is able to achieve 39%
stability, 11% Average energy Dissipation per round and 40% Lifespan better than LEACH-Homo. This paper proposes a new direction in improving energy efficiency of WSN routing protocol, which is desirable in some critical WSN applications. .
The Energy hole problem is a major problem of
data collection in wireless sensor networks. The sensors near the
static sink serve as relays for remote sensors, which reduce their
energy rapidly, causing energy holes in the sensor field. This
project has proposed a customizable mobile sink based adaptive
protected energy efficient clustering protocol (MSAPEEP) for
improvement of the problem of energy holes along with that we
also characterize and made comparison with the previous
existing protocols. A MSAPEEP uses the adaptive protected
method (APM) to discover the best possible number of cluster
heads (CHs) to get better life span and constancy time of the
network. The effectiveness of MSAPEEP is compared with
previous protocols; specifically, low energy adaptive clustering
hierarchy (LEACH) and mobile sink enhanced energy efficient
PEGASIS based routing protocol using network simulator(NS2).
Examples of simulation result show that MSAPEEP is more
reliable and removes the potential of energy hole and enhances
the stability and life span of the wireless sensor network(WSN).
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)
A COST EFFECTIVE COMPRESSIVE DATA AGGREGATION TECHNIQUE FOR WIRELESS SENSOR N...ijasuc
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
HCIFR: Hierarchical Clustering and Iterative Filtering Routing Algorithm for ...IJAEMSJORNAL
The hierarchical clustering and iterative filtering algorithms are combined to form an energy efficient routing algorithm which supports in improved performance, efficient routing at the time of link failure, collusion robust and secure data aggregation. The idea of combining these two algorithms which may lead to improved performance. Initially clusters are formed by neighborhood. The cluster is a combination of one clusterhead, two deputy clusterheads and cluster members. This system uses a Hierarchical clustering algorithm for efficient data transmission to their clusterhead by cluster members. The clusterhead aggregate the collected data and check for trustworthiness. The data is aggregated by clusterhead using the iterative filtering algorithm and resistant to collusion attacks. Simulation results depict the average energy consumption, throughput, packet drops and packet delivery under the influence of proposed algorithm.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitiv...paperpublications3
Abstract: In WSN, sensor nodes have limited energy budget therefore this paper mainly focus on power saving by using the docition paradigm. Docition is a new teacher-student paradigm proposed to improve cognitive radio. Although it improves the infrastruc¬ture based networks it has a weakness in case of ad-hoc mobile net¬works. The energy constraints and the total mobility of the net¬work complicate the selection of the appropriate teacher for a student. By selecting the wrong teacher, there is a high probabil¬ity that the taught information may be faulty, and thus the student radio diverges from the best state. This causes a high amount of energy loss, though the most important concern in ad-hoc networks is energy limitation. In this paper, we propose a dynamic docition for teacher selection based on the auto-correla¬tion degree of the teacher’s candidate environment and the cross-correlation degree between the teacher candidate and the student environments. We validate our approach in the context of coexist¬ence between WSN and WiFi. The WSN detects, models and exploits the unused time slots in the electromagnetic spectrum, left by WiFi, using dynamic docition. The simulation results show that the use of dynamic docition outperforms the existing docition in mobile networks. The improvements are shown through the low link overhead percentage (20% less overhead) and the low packet loss ratio (30% improvement).
Keywords: Docitive; Online Prediction Problem; WSN; pareto model; IEEE802.11 b/g;cognitive radio.
Title: Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitive WSN
Author: Dr. Charbel Nicolas
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
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.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
Analysis of Genetic Algorithm for Effective power Delivery and with Best Upsurgeijeei-iaes
Wireless network is ready for hundreds or thousands of nodes, where each node is connected to one or sometimes more sensors. WSN sensor integrated circuits, embedded systems, networks, modems, wireless communication and dissemination of information. The sensor may be an obligation to technology and science. Recent developments underway to miniaturization and low power consumption. They act as a gateway, and prospective clients, I usually have the data on the server WSN. Other components separate routing network routers, called calculating and distributing routing tables. Discussed the routing of wireless energy balance. Optimization solutions, we have created a genetic algorithm. Before selecting an algorithm proposed for the construction of the center console. In this study, the algorithms proposed model simulated results based on "parameters depending dead nodes, the number of bits transmitted to a base station, where the number of units sent to the heads of fuel consumption compared to replay and show that the proposed algorithm has a network of a relative.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
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.
Construction on cohesionless soil – A reviewijsrd.com
In India, specifically in Gujarat region like Kutch, Bhuj, Kandla large deposits of cohesionless soil are observed. Cohesionless soil is defined asthe soil which is not containing water andthe shear strain does not exist (or is negligible)between two particles. Loose and sandy material in which there is no bond between the particles is also termed as cohesionless soil. Cohesionless soil is also known as frictional soil. Cohesionless soil have lessload bearing capacity, less shear strength, less specific surface and they do not have any plasticity. Therefore, the cohesionless soil is mostly settled during earthquake and in heavy rainy season.Owing to such properties of cohesionless soil,it is very difficult to carryout construction work on such soil in a normal way.Here, need is felt to find some problems encountered during construction on cohesionless soil and methods for preventionof these problems. This paper aims at focusing the most predominant problems encountered while doing construction on such cohesionless soil and remedial measures taken for the same.
Analysis of Highly Birefringent Photonic Crystal Fiber Employing Different Ge...ijsrd.com
In this paper we are proposed three different types of photonic crystal fibers and compared them for higher birefringence by using finite element method. Using elliptical holes instead of circular air holes we are getting high birefringence. We also obtained low dispersion for the same structure consist of a defect in the center design flexibility and high index contrast give a better birefringence in the range of 10-3 to 10-2.Also the characteristics of PCF are plotted for a range of wavelength
The Energy hole problem is a major problem of
data collection in wireless sensor networks. The sensors near the
static sink serve as relays for remote sensors, which reduce their
energy rapidly, causing energy holes in the sensor field. This
project has proposed a customizable mobile sink based adaptive
protected energy efficient clustering protocol (MSAPEEP) for
improvement of the problem of energy holes along with that we
also characterize and made comparison with the previous
existing protocols. A MSAPEEP uses the adaptive protected
method (APM) to discover the best possible number of cluster
heads (CHs) to get better life span and constancy time of the
network. The effectiveness of MSAPEEP is compared with
previous protocols; specifically, low energy adaptive clustering
hierarchy (LEACH) and mobile sink enhanced energy efficient
PEGASIS based routing protocol using network simulator(NS2).
Examples of simulation result show that MSAPEEP is more
reliable and removes the potential of energy hole and enhances
the stability and life span of the wireless sensor network(WSN).
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)
A COST EFFECTIVE COMPRESSIVE DATA AGGREGATION TECHNIQUE FOR WIRELESS SENSOR N...ijasuc
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
HCIFR: Hierarchical Clustering and Iterative Filtering Routing Algorithm for ...IJAEMSJORNAL
The hierarchical clustering and iterative filtering algorithms are combined to form an energy efficient routing algorithm which supports in improved performance, efficient routing at the time of link failure, collusion robust and secure data aggregation. The idea of combining these two algorithms which may lead to improved performance. Initially clusters are formed by neighborhood. The cluster is a combination of one clusterhead, two deputy clusterheads and cluster members. This system uses a Hierarchical clustering algorithm for efficient data transmission to their clusterhead by cluster members. The clusterhead aggregate the collected data and check for trustworthiness. The data is aggregated by clusterhead using the iterative filtering algorithm and resistant to collusion attacks. Simulation results depict the average energy consumption, throughput, packet drops and packet delivery under the influence of proposed algorithm.
International Journal of Engineering Research and DevelopmentIJERD Editor
Electrical, Electronics and Computer Engineering,
Information Engineering and Technology,
Mechanical, Industrial and Manufacturing Engineering,
Automation and Mechatronics Engineering,
Material and Chemical Engineering,
Civil and Architecture Engineering,
Biotechnology and Bio Engineering,
Environmental Engineering,
Petroleum and Mining Engineering,
Marine and Agriculture engineering,
Aerospace Engineering.
Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitiv...paperpublications3
Abstract: In WSN, sensor nodes have limited energy budget therefore this paper mainly focus on power saving by using the docition paradigm. Docition is a new teacher-student paradigm proposed to improve cognitive radio. Although it improves the infrastruc¬ture based networks it has a weakness in case of ad-hoc mobile net¬works. The energy constraints and the total mobility of the net¬work complicate the selection of the appropriate teacher for a student. By selecting the wrong teacher, there is a high probabil¬ity that the taught information may be faulty, and thus the student radio diverges from the best state. This causes a high amount of energy loss, though the most important concern in ad-hoc networks is energy limitation. In this paper, we propose a dynamic docition for teacher selection based on the auto-correla¬tion degree of the teacher’s candidate environment and the cross-correlation degree between the teacher candidate and the student environments. We validate our approach in the context of coexist¬ence between WSN and WiFi. The WSN detects, models and exploits the unused time slots in the electromagnetic spectrum, left by WiFi, using dynamic docition. The simulation results show that the use of dynamic docition outperforms the existing docition in mobile networks. The improvements are shown through the low link overhead percentage (20% less overhead) and the low packet loss ratio (30% improvement).
Keywords: Docitive; Online Prediction Problem; WSN; pareto model; IEEE802.11 b/g;cognitive radio.
Title: Using Neighbor’s State Cross-correlation to Accelerate Adaptation in Docitive WSN
Author: Dr. Charbel Nicolas
ISSN 2349-7815
International Journal of Recent Research in Electrical and Electronics Engineering (IJRREEE)
Paper Publications
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.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
Analysis of Genetic Algorithm for Effective power Delivery and with Best Upsurgeijeei-iaes
Wireless network is ready for hundreds or thousands of nodes, where each node is connected to one or sometimes more sensors. WSN sensor integrated circuits, embedded systems, networks, modems, wireless communication and dissemination of information. The sensor may be an obligation to technology and science. Recent developments underway to miniaturization and low power consumption. They act as a gateway, and prospective clients, I usually have the data on the server WSN. Other components separate routing network routers, called calculating and distributing routing tables. Discussed the routing of wireless energy balance. Optimization solutions, we have created a genetic algorithm. Before selecting an algorithm proposed for the construction of the center console. In this study, the algorithms proposed model simulated results based on "parameters depending dead nodes, the number of bits transmitted to a base station, where the number of units sent to the heads of fuel consumption compared to replay and show that the proposed algorithm has a network of a relative.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
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.
Construction on cohesionless soil – A reviewijsrd.com
In India, specifically in Gujarat region like Kutch, Bhuj, Kandla large deposits of cohesionless soil are observed. Cohesionless soil is defined asthe soil which is not containing water andthe shear strain does not exist (or is negligible)between two particles. Loose and sandy material in which there is no bond between the particles is also termed as cohesionless soil. Cohesionless soil is also known as frictional soil. Cohesionless soil have lessload bearing capacity, less shear strength, less specific surface and they do not have any plasticity. Therefore, the cohesionless soil is mostly settled during earthquake and in heavy rainy season.Owing to such properties of cohesionless soil,it is very difficult to carryout construction work on such soil in a normal way.Here, need is felt to find some problems encountered during construction on cohesionless soil and methods for preventionof these problems. This paper aims at focusing the most predominant problems encountered while doing construction on such cohesionless soil and remedial measures taken for the same.
Analysis of Highly Birefringent Photonic Crystal Fiber Employing Different Ge...ijsrd.com
In this paper we are proposed three different types of photonic crystal fibers and compared them for higher birefringence by using finite element method. Using elliptical holes instead of circular air holes we are getting high birefringence. We also obtained low dispersion for the same structure consist of a defect in the center design flexibility and high index contrast give a better birefringence in the range of 10-3 to 10-2.Also the characteristics of PCF are plotted for a range of wavelength
Design and Implementation of Vehicle Gaseous Fuel Leakage Detection System us...ijsrd.com
In this paper, a new method of designing and development of a microcontroller based toxic gas detection system is proposed. If the toxic gas or fuel leakage has been detected, the system automatically alerts the driver through buzzer, opens the car door automatically and transmits the warning message to the authorized user through the GSM module attached. User can send SMS and receive SMS through GSM Modem, based on that message User can control some appliances in host section. This system aims to modify an existing safety model employed in automotive field. It can be used in any Vehicle like Car, Bus Van etc. The advantage of this automated detection/alarm system is that, it offers faster response time and accurate detection of an emergency in turn leading to faster diffusion of the situation, compared to manual methods. This is a very compelling reason that justifies designing such a safety system.
Improved Performance of LEACH using Better CH Selection by Weighted Parametersijsrd.com
In recent era, the research for improving the performance of the WSN is done in the 'speed of light'. LEACH is the protocol which has changed the scenario of using WSN for any application like monitoring physical parameters, measuring parameters surveillance etc. Also LEACH-C can be used for the same with some modifications in LEACH like deciding CH centrally in fixed amount. But there is a con of LEACH; it decides the CH based on random generation value. Therefore, in proposed scheme, threshold is calculated using weighted parameter of residual energy and distance from the base station.
Sodium Alginate composite film preparation with Nano clay and enhancing its p...ijsrd.com
Use of natural polymers from renewable resources has been increasing in recent years due to their excellent performance over existing petro-polymers which are non-environmental friendly. Films prepared from natural polymers such as polysaccharides, proteins, lipids etc., have wide application over packaging sector. Sodium alginate is the sodium salt of alginic acid, which a polyuronide is made up of a sequence of two hexuronic acids: beta-D mannuronic acid and alpha-L guluronic acid. Films obtained from Sodium Alginate hydrocollidal compounds are bio-degradable and bio-compatible with better gel forming and film forming capabilities. The objective of this follow up is to enhance the physical properties of sodium alginate film, prepared with various compositions of CaCl2 and Nanoclay compounds using casting method.
This paper presents a design and implementation of FPGA based Bose, Chaudhuri and Hocquenghem (BCH) codes for wireless communication applications. The codes are written in VHDL (Very High Speed Hardware Description Language). Here BCH decoder (15, 5, and 3) is implemented and discussed. And decoder uses serial input and serial output architecture. BCH code forms a large class of powerful random error correcting cyclic codes. BCH operates over algebraic structure called finite fields and they are binary multiple error correcting codes. BCH decoder is implemented by syndrome calculation circuit, the BMA (Berlekamp-Massey algorithm) and Chien search circuit. The codecs are implemented over cyclone FPGA device.
Trajectory Segmentation and Sampling of Moving Objects Based On Representativ...ijsrd.com
Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this paper, we propose a method for trajectory segmentation and sampling based on the representativeness of the (sub) trajectories in the MOD. In order to find the most representative sub trajectories, the following methodology is proposed. First, a novel global voting algorithm is performed, based on local density and trajectory similarity information. This method is applied for each segment of the trajectory, forming a local trajectory descriptor that represents line segment representativeness. The sequence of this descriptor over a trajectory gives the voting signal of the trajectory, where high values correspond to the most representative parts. Then, a novel segmentation algorithm is applied on this signal that automatically estimates the number of partitions and the partition borders, identifying homogenous partitions concerning their representativeness. Finally, a sampling method over the resulting segments yields the most representative sub trajectories in the MOD. Our experimental results in synthetic and real MOD verify the effectiveness of the proposed scheme, also in comparison with other sampling techniques.
Time Multiplexed VLSI Architecture for Real-Time Barrel Distortion Correction...ijsrd.com
A low-cost very large scale integration (VLSI) implementation of real-time correction of barrel distortion for video- endoscopic images is presented in this paper. The correcting mathematical model is based on least-squares estimation. To decrease the computing complexity, we use an odd-order polynomial to approximate the back-mapping expansion polynomial. By algebraic transformation, the approximated polynomial becomes a monomial form which can be solved by Hornor's algorithm. With the iterative characteristic of Hornor's algorithm, the hardware cost and memory requirement can be conserved by time multiplexed design. In addition, a simplified architecture of the linear interpolation is used to reduce more computing resource and silicon area. The VLSI architecture of this paper contains 13.9-K gates by using a 0.18 μm CMOS process. Compared with some existing distortion correction techniques, this paper reduces at least 69% hardware cost and 75% memory requirement.
An Approximate Analysis Procedure for Piled Raft subjected to Vertical Loadingijsrd.com
Piled raft is a geotechnical composite construction consisting of three elements raft, piles and soil. Addition of piles in raft strategically improves ultimate load carrying capacity, decreases overall and differential settlement .The design of piled raft is complicated due to complex interaction between rafts, pile and soil. In recent years due to advent of multistory buildings there has been a significant rise in usage of piled raft in India. This paper presents a simplified method for analysis of piled raft with use of software SAFE considering all the interactions. In the scope of this paper, the design procedure for piled rafts is discussed and results are verified with that available from literature.
Smart License Plate Recognition System based on Image Processingijsrd.com
This report describes the Smart License Plate Reorganization System, which can be installed into a tollbooth for automated acceptation of vehicle license plate details using an image of a vehicle. This Smart License Plate Reorganization system could then be implemented to control the payment of fees, highways, bridges, parking areas or tunnels, etc. This report contains new algorithm for acceptation number plate using Structural operation, Thresholding operation, Edge detection, Bounding box analysis for number plate extraction, character separation using separation and character acceptation using Template method and Feature extraction.
Effects of air filter type and condition on performance and emission of four...ijsrd.com
to study of different paper related to air filter
condition and filtering media and their effect on the
performance of the I.C. engine. The role of the engine air
induction system and air filter increased because of recent
engine exhaust particulate and evaporative emission
regulations. Engine lifetime, engine emission and fuel
consumption depend on the air induction system design and
its performance, So Study of papers on different type of air
filter filtration media and their effect on engine performance
is done in this paper. This study is useful to select zero
maintenance, long life, reliable and durable air filters
improves performance of the existing engines without any
major modifications.
Need to replace Furrow Irrigation system by Drip Irrigation system to Improve...ijsrd.com
The Aim of this paper is to replace furrow Irrigation system by Drip irrigation system to improve qualitative parameters of cotton crop at its different physiological stages. (Germination, Initial Vegetative, Flowering, Boll development and Maturity).As we are knowing furrow irrigation system requires more water than drip irrigation system. Our region is affected with drought once in every four year. Cotton crop needs continuous water for duration of 140 to 160 days in between May to October. In month of May and June water table is going down and all Water resources are at its bottom level during season of summer.
Sustainable vegetables and flowers cultivation Practices Adopted by Greenhous...ijsrd.com
This paper analyzes vegetables and flowers cultivation practices of randomly selected farmers in the Sabarkantha district of Gujarat on the basis of personal interviews and observation. Growers were asked about different cultivation practices of vegetables (Capsicum, tomato), flowers like gerbera they were followed in the greenhouse. 70 per cent and 20 per cent of capsicum growers fell under high and low adoption cultivation practices categories. While 83 per cent of the gerbera growers belonged to high adoption category as well as 17 per cent respondents fell under low adoption cultivation practices categories respectively.
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.
Data Collection Method to Improve Energy Efficiency in Wireless Sensor NetworkKhushbooGupta145
Wireless Sensor Networks (WSNs) are generally self-organized wireless ad hoc networks which incorporate a huge number of sensor nodes which are resource constraint. Among the tasks of WSN, one most essential task is to collect the data
and transmits the gathered data to a distant base station (BS). The effectiveness of WSNs can be calculated in terms of network lifetime. Data collection is a frequent operation but analytical and critical operation in many WSN’s
application. To prolong network lifetime innovative technique that can improve
energy efficiency are highly required. This paper presents a survey for
designing Energy Efficient Data Collection Methods used for prolonging network lifetime in Wireless Sensor Network (WSN). The study highlights the importance of different Data conditions for various purposes like emergency response, medical monitoring, military applications, surveillance in volcanic or
remote regions, etc. Different Data Collection methods like data aggregation clusters, data aggregation trees, network coding, correlation dominating set etc. are considered in detail in this study. Furthermore, a comparison of different Data Collection Method based on the network lifetime, energy efficiency,
complexity of the algorithm, transmission cost and fusion cost is done.
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.
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...Editor IJMTER
The main motive of this research is to study energy-efficient data-gathering mechanisms to
abnormal packet data for saving the energy. To detect the abnormal packet irregularities is useful for
saving energy, as well as for management of network, because the patterns found can be used for
both decision making in applications and system performance tuning. Node distribution in WSNs is
either deterministic or self-organizing and application dependant. The sensor nodes in WSNs have
minimum energy and they use their energy for communication and sensing.
Fast Data Collection with Interference and Life Time in Tree Based Wireless S...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
A LOW-ENERGY DATA AGGREGATION PROTOCOL USING AN EMERGENCY EFFICIENT HYBRID ME...IJCNCJournal
Recent wireless sensor network focused on developing communication networks with minimal power and cost. To achieve this, several techniques have been developed to monitor a completely wireless sensor network. Generally, in the WSN network, communication is established between the source nodes and the destination node with an abundant number of hops, an activity which consumes much energy. The node existing between source and destination nodes consumes energy for transmission of data and maximize network lifetime. To overcome this issue, a new Emergency Efficient Hybrid Medium Access Control (EEHMAC) protocol is presented to reduce consumption of energy among a specific group of WSNs which will increase the network lifetime. The proposed model makes a residual battery is utilized for effective transmission of data with minimal power consumption. Compared with other models, the experimental results strongly showed that our model is not only able to reduce network lifetime but also to increase the overall network performance.
EVENT DRIVEN ROUTING PROTOCOLS FOR WIRELESS SENSOR NETWORK- A SURVEYijcsa
Advances in embedded systems have resulted in the development of wireless sensor networks, which not
only provide unique opportunities for monitoring but also controlling homes, cities and the environments.
Recent advancements in wireless sensor network have resulted into many new protocols some of them are
specifically designed for sensor network for detecting the event and routing the event related information to
the base station in efficient manner. This paper surveys recent event driven routing protocols for wireless
sensor network. We have compared various event driven routing protocols using different parameters like
Sink Centric, Node Centric, Reliability, Congestion control, Energy Efficiency, Loss reliability and loss
recovery. We have also described LEACH and MECN protocols but as they are not e
Dynamic selection of cluster head in in networks for energy managementeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Dynamic selection of cluster head in in networks for energy managementeSAT Journals
Abstract In this project, we presented Multipath Region Routing (MRR) protocol for energy conservation in Wireless Sensor Networks (WSNs). Large scale dense WSNs are used in different types of applications for accurate monitoring. Energy conservation is an important issue in WSNs. In order to save energy, Multipath Region Routing protocol is used which provides balance in energy consumption and sustains the network life-span. By using this method, we can reduce the number of energy dissipation because the cluster head will collect data directly from other nodes. Hence, the energy can be preserved and network life time is extended to reasonable time. Keywords: Clustering; Wireless Sensor Networks; Security; Multipath Region Routing;
Building Programming Abstractions for Wireless Sensor Networks Using Watershe...M H
The availability and quality of information extracted from Wireless Sensor Networks (WSNs) revolutionised a wide range of application areas. The success of any WSN application is, nonetheless, determined by the ability to retrieve information with the required level of accuracy, within specified time constraints, and with minimum resource utilisation. This paper presents a new approach to localised information extraction that utilises the Watershed segmentation algorithm to dynamically group nodes into segments, which can be used as programming abstractions upon which different query operations can be performed. Watershed results in a set of well delimited areas, such that the number of necessary operations (communication and computation) to answer a query are minimised. This paper presents a fully asynchronous Watershed implementation, where nodes can compute their local data in parallel and independently from one another. The preliminary experimental results demonstrate that the proposed approach is able to significantly reduce the query processing cost and time without involving any loss of efficiency.
Smart Spaces and Next Generation Wired/Wireless Networking Smart Spaces and Next Generation Wired/Wireless Networking Look
Inside
Share
Share this content on Facebook Share this content on Twitter Share this content on LinkedIn
Other actions
Export citations
About this Book
Reprints and Permissions
Energy-efficient data-aggregation for optimizing quality of service using mo...IJECEIAES
Quality of service (QoS) is essential for carrying out data transmission using resource-constrained sensor nodes in wireless sensor network (WSN). The introduction of mobile agent-based data aggregation is reported to offer energy efficiency; however, it has limitations, especially using a single mobile agent, where QoS optimization is not feasible. A review of existing studies showcases some dedicated attempts to use a mobile agent-based approach and address QoS enhancements. However, they were never combined studied. Therefore, this paper introduces a unique concept of retaining maximum QoS performance during data aggregation using a single mobile agent. The model introduces a unique communication framework, transmission provisioning using exceptional routine management, and simplified energy modeling. The proposed model has aimed for a lower delay and faster data aggregation speed with lower consumption of transmittance energy. The implementation and assessment of the model are carried out considering the challenging environment of WSN with multiple scales of data priority. The proposed model also contributes to evolving out with simplified communication vectors in a highly decentralized method. MATLAB's simulation outcome shows that the proposed system offers better delay performance, optimal energy management, and faster response time than existing schemes.
A Novel Weighted Clustering Based Approach for Improving the Wireless Sensor ...IJERA Editor
Great lifetime and reliability is the key aim of Wireless Sensor Network (WSN) design. As for prolonging
lifetime of this type of network, energy is the most important resource; all recent researches are focused on more
and more energy efficient techniques. Proposed work is Weighted Clustering Approach based on Weighted
Cluster Head Selection, which is highly energy efficient and reliable in mobile network scenario. Weight
calculation using different attributes of the nodes like SNR (Signal to Noise Ratio), Remaining Energy, Node
Degree, Mobility, and Buffer Length gives efficient Cluster Head (CH) on regular interval of time. CH rotation
helps in optimum utilization of energy available with all nodes; results in prolonged network lifetime.
Implementation is done using the NS2 network simulator and performance evaluation is carried out in terms of
PDR (Packet Delivery Ratio), End to End Delay, Throughput, and Energy Consumption. Demonstration of the
obtained results shows that proposed work is adaptable for improving the performance. In order to justify the
solution, the performance of proposed technique is compared with the performance of traditional approach. The
performance of proposed technique is found optimum as compared to the traditional techniques.
Throughput analysis of energy aware routing protocol for real time load distr...eSAT Journals
Abstract Wireless sensor network (WSNs) are self-organized systems that depend on highly distributed and scattered low cost tiny devices. These devices have some limitations such as processing capability, memory size, communication distance coverage and energy capabilities. In order to maximize the autonomy of individual nodes and indirectly the lifetime of the network, most of the research work is done on power saving techniques. Hence, we propose energy-aware load distribution technique that can provide an excellent data transfer of packets from source to destination via hop by hop basis. Therefore, by making use of the cross-layer interactions between the physical layer and the network layer thus leads to an improvement in energy efficiency of the entire network when compared with other protocols and it also improves the response time in case of network change. Keywords:- wireless sensor network, energy-aware, load distribution, power saving, cross layer interactions.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Due to availability of internet and evolution of embedded devices, Internet of things can be useful to contribute in energy domain. The Internet of Things (IoT) will deliver a smarter grid to enable more information and connectivity throughout the infrastructure and to homes. Through the IoT, consumers, manufacturers and utility providers will come across new ways to manage devices and ultimately conserve resources and save money by using smart meters, home gateways, smart plugs and connected appliances. The future smart home, various devices will be able to measure and share their energy consumption, and actively participate in house-wide or building wide energy management systems. This paper discusses the different approaches being taken worldwide to connect the smart grid. Full system solutions can be developed by combining hardware and software to address some of the challenges in building a smarter and more connected smart grid.
A Survey Report on : Security & Challenges in Internet of Thingsijsrd.com
In the era of computing technology, Internet of Things (IoT) devices are now popular in each and every domains like e-governance, e-Health, e-Home, e-Commerce, and e-Trafficking etc. Iot is spreading from small to large applications in all fields like Smart Cities, Smart Grids, Smart Transportation. As on one side IoT provide facilities and services for the society. On the other hand, IoT security is also a crucial issues.IoT security is an area which totally concerned for giving security to connected devices and networks in the IoT .As, IoT is vast area with usability, performance, security, and reliability as a major challenges in it. The growth of the IoT is exponentially increases as driven by market pressures, which proportionally increases the security threats involved in IoT The relationship between the security and billions of devices connecting to the Internet cannot be described with existing mathematical methods. In this paper, we explore the opportunities possible in the IoT with security threats and challenges associated with it.
In today’s emerging world of Internet, each and every thing is supposed to be in connected mode with the help of billions of smart devices. By connecting all the devises used in our day to day life, make our life trouble less and easy. We are incorporated in a world where we are used to have smart phones, smart cars, smart gadgets, smart homes and smart cities. Different institutes and researchers are working for creating a smart world for us but real question which we need to emphasis on is how to make dumb devises talk with uncommon hardware and communication technology. For the same what kind of mechanism to use with various protocols and less human interaction. The purpose is to provide the key area for application of IoT and a platform on which various devices having different mechanism and protocols can communicate with an integrated architecture.
Study on Issues in Managing and Protecting Data of IOTijsrd.com
This paper discusses variety of issues for preserving and managing data produced by IoT. Every second large amount of data are added or updated in the IoT databases across the heterogeneous environment. While managing the data each phase of data processing for IoT data is exigent like storing data, querying, indexing, transaction management and failure handling. We also refer to the problem of data integration and protection as data requires to be fit in single layout and travel securely as they arrive in the pool from diversified sources in different structure. Finally, we confer a standardized pathway to manage and to defend data in consistent manner.
Interactive Technologies for Improving Quality of Education to Build Collabor...ijsrd.com
Today with advancement in Information Communication Technology (ICT) the way the education is being delivered is seeing a paradigm shift from boring classroom lectures to interactive applications such as 2-D and 3-D learning content, animations, live videos, response systems, interactive panels, education games, virtual laboratories and collaborative research (data gathering and analysis) etc. Engineering is emerging with more innovative solutions in the field of education and bringing out their innovative products to improve education delivery. The academic institutes which were once hesitant to use such technology are now looking forward to such innovations. They are adopting the new ways as they are realizing the vast benefits of using such methods and technology. The benefits are better comprehensibility, improved learning efficiency of students, and access to vast knowledge resources, geographical reach, quick feedback, accountability and quality research. This paper focuses on how engineering can leverage the latest technology and build a collaborative learning environment which can then be integrated with the national e-learning grid.
Internet of Things - Paradigm Shift of Future Internet Application for Specia...ijsrd.com
In the world more than 15% people are living with disability that also include children below age of 10 years. Due to lack of independent support services specially abled (handicap) people overly rely on other people for their basic needs, that excludes them from being financially and socially active. The Internet of Things (IoT) can give support system and a better quality of life as well as participation in routine and day to day life. For this purpose, the future solutions for current problems has been introduced in this paper. Daunting challenges have been considered as future research and glimpse of the IoT for specially abled person is given in the paper.
A Study of the Adverse Effects of IoT on Student's Lifeijsrd.com
Internet of things (IoT) is the most powerful invention and if used in the positive direction, internet can prove to be very productive. But, now a days, due to the social networking sites such as Face book, WhatsApp, twitter, hike etc. internet is producing adverse effects on the student life, especially those students studying at college Level. As it is rightly said, something which has some positive effects also has some of the negative effects on the other hand. In this article, we are discussing some adverse effects of IoT on student’s life.
Pedagogy for Effective use of ICT in English Language Learningijsrd.com
The use of information and communications technology (ICT) in education is a relatively new phenomenon and it has been the educational researchers' focus of attention for more than two decades. Educators and researchers examine the challenges of using ICT and think of new ways to integrate ICT into the curriculum. However, there are some barriers for the teachers that prevent them to use ICT in the classroom and develop supporting materials through ICT. The purpose of this study is to examine the high school English teachers’ perceptions of the factors discouraging teachers to use ICT in the classroom.
In recent years usage of private vehicles create urban traffic more and more crowded. As result traffic becomes one of the important problems in big cities in all over the world. Some of the traffic concerns are traffic jam and accidents which have caused a huge waste of time, more fuel consumption and more pollution. Time is very important parameter in routine life. The main problem faced by the people is real time routing. Our solution Virtual Eye will provide the current updates as in the real time scenario of the specific route. This research paper presents smart traffic navigation system, based on Internet of Things, which is featured by low cost, high compatibility, easy to upgrade, to replace traditional traffic management system and the proposed system can improve road traffic tremendously.
Ontological Model of Educational Programs in Computer Science (Bachelor and M...ijsrd.com
In this work there is illustrated an ontological model of educational programs in computer science for bachelor and master degrees in Computer science and for master educational program “Computer science as second competence†by Tempus project PROMIS.
Understanding IoT Management for Smart Refrigeratorijsrd.com
Lately the concept of Internet of Things (IoT) is being more elaborated and devices and databases are proposed thereby to meet the need of an Internet of Things scenario. IoT is being considered to be an integral part of smart house where devices will be connected to each other and also react upon certain environmental input. This will eventually include the home refrigerator, air conditioner, lights, heater and such other home appliances. Therefore, we focus our research on the database part for such an IoT’ fridge which we called as smart Fridge. We describe the potentials achievable through a database for an IoT refrigerator to manage the refrigerator food and also aid the creation of a monthly budget of the house for a family. The paper aims at the data management issue based on a proposed design for an intelligent refrigerator leveraging the sensor technology and the wireless communication technology. The refrigerator which identifies products by reading the barcodes or RFID tags is proposed to order the required products by connecting to the Internet. Thus the goal of this paper is to minimize human interaction to maintain the daily life events.
DESIGN AND ANALYSIS OF DOUBLE WISHBONE SUSPENSION SYSTEM USING FINITE ELEMENT...ijsrd.com
Double wishbone designs allow the engineer to carefully control the motion of the wheel throughout suspension travel. 3-D model of the Lower Wishbone Arm is prepared by using CAD software for modal and stress analysis. The forces and moments are used as the boundary conditions for finite element model of the wishbone arm. By using these boundary conditions static analysis is carried out. Then making the load as a function of time; quasi-static analysis of the wishbone arm is carried out. A finite element based optimization is used to optimize the design of lower wishbone arm. Topology optimization and material optimization techniques are used to optimize lower wishbone arm design.
A Review: Microwave Energy for materials processingijsrd.com
Microwave energy is a latest largest growing technique for material processing. This paper presents a review of microwave technologies used for material processing and its use for industrial applications. Advantages in using microwave energy for processing material include rapid heating, high heating efficiency, heating uniformity and clean energy. The microwave heating has various characteristics and due to which it has been become popular for heating low temperature applications to high temperature applications. In recent years this novel technique has been successfully utilized for the processing of metallic materials. Many researchers have reported microwave energy for sintering, joining and cladding of metallic materials. The aim of this paper is to show the use of microwave energy not only for non-metallic materials but also the metallic materials. The ability to process metals with microwave could assist in the manufacturing of high performance metal parts desired in many industries, for example in automotive and aeronautical industries.
Web Usage Mining: A Survey on User's Navigation Pattern from Web Logsijsrd.com
With an expontial growth of World Wide Web, there are so many information overloaded and it became hard to find out data according to need. Web usage mining is a part of web mining, which deal with automatic discovery of user navigation pattern from web log. This paper presents an overview of web mining and also provide navigation pattern from classification and clustering algorithm for web usage mining. Web usage mining contain three important task namely data preprocessing, pattern discovery and pattern analysis based on discovered pattern. And also contain the comparative study of web mining techniques.
APPLICATION OF STATCOM to IMPROVED DYNAMIC PERFORMANCE OF POWER SYSTEMijsrd.com
Application of FACTS controller called Static Synchronous Compensator STATCOM to improve the performance of power grid with Wind Farms is investigated .The essential feature of the STATCOM is that it has the ability to absorb or inject fastly the reactive power with power grid . Therefore the voltage regulation of the power grid with STATCOM FACTS device is achieved. Moreover restoring the stability of the power system having wind farm after occurring severe disturbance such as faults or wind farm mechanical power variation is obtained with STATCOM controller . The dynamic model of the power system having wind farm controlled by proposed STATCOM is developed . To validate the powerful of the STATCOM FACTS controller, the studied power system is simulated and subjected to different severe disturbances. The results prove the effectiveness of the proposed STATCOM controller in terms of fast damping the power system oscillations and restoring the power system stability.
Making model of dual axis solar tracking with Maximum Power Point Trackingijsrd.com
Now a days solar harvesting is more popular. As the popularity become higher the material quality and solar tracking methods are more improved. There are several factors affecting the solar system. Major influence on solar cell, intensity of source radiation and storage techniques The materials used in solar cell manufacturing limit the efficiency of solar cell. This makes it particularly difficult to make considerable improvements in the performance of the cell, and hence restricts the efficiency of the overall collection process. Therefore, the most attainable maximum power point tracking method of improving the performance of solar power collection is to increase the mean intensity of radiation received from the source used. The purposed of tracking system controls elevation and orientation angles of solar panels such that the panels always maintain perpendicular to the sunlight. The measured variables of our automatic system were compared with those of a fixed angle PV system. As a result of the experiment, the voltage generated by the proposed tracking system has an overall of about 28.11% more than the fixed angle PV system. There are three major approaches for maximizing power extraction in medium and large scale systems. They are sun tracking, maximum power point (MPP) tracking or both.
A REVIEW PAPER ON PERFORMANCE AND EMISSION TEST OF 4 STROKE DIESEL ENGINE USI...ijsrd.com
In day today's relevance, it is mandatory to device the usage of diesel in an economic way. In present scenario, the very low combustion efficiency of CI engine leads to poor performance of engine and produces emission due to incomplete combustion. Study of research papers is focused on the improvement in efficiency of the engine and reduction in emissions by adding ethanol in a diesel with different blends like 5%, 10%, 15%, 20%, 25% and 30% by volume. The performance and emission characteristics of the engine are tested observed using blended fuels and comparative assessment is done with the performance and emission characteristics of engine using pure diesel.
Study and Review on Various Current Comparatorsijsrd.com
This paper presents study and review on various current comparators. It also describes low voltage current comparator using flipped voltage follower (FVF) to obtain the single supply voltage. This circuit has short propagation delay and occupies a small chip area as compare to other current comparators. The results of this circuit has obtained using PSpice simulator for 0.18 μm CMOS technology and a comparison has been performed with its non FVF counterpart to contrast its effectiveness, simplicity, compactness and low power consumption.
Reducing Silicon Real Estate and Switching Activity Using Low Power Test Patt...ijsrd.com
Power dissipation is a challenging problem for today's system-on-chip design and test. This paper presents a novel architecture which generates the test patterns with reduced switching activities; it has the advantage of low test power and low hardware overhead. The proposed LP-TPG (test pattern generator) structure consists of modified low power linear feedback shift register (LP-LFSR), m-bit counter, gray counter, NOR-gate structure and XOR-array. The seed generated from LP-LFSR is EXCLUSIVE-OR ed with the data generated from gray code generator. The XOR result of the sequence is single input changing (SIC) sequence, in turn reduces the switching activity and so power dissipation will be very less. The proposed architecture is simulated using Modelsim and synthesized using Xilinx ISE9.2.The Xilinx chip scope tool will be used to test the logic running on FPGA.
Defending Reactive Jammers in WSN using a Trigger Identification Service.ijsrd.com
In the last decade, the greatest threat to the wireless sensor network has been Reactive Jamming Attack because it is difficult to be disclosed and defend as well as due to its mass destruction to legitimate sensor communications. As discussed above about the Reactive Jammers Nodes, a new scheme to deactivate them efficiently is by identifying all trigger nodes, where transmissions invoke the jammer nodes, which has been proposed and developed. Due to this identification mechanism, many existing reactive jamming defending schemes can be benefited. This Trigger Identification can also work as an application layer .In this paper, on one side we provide the several optimization problems to provide complete trigger identification service framework for unreliable wireless sensor networks and on the other side we also provide an improved algorithm with regard to two sophisticated jamming models, in order to enhance its robustness for various network scenarios.
Vaccine management system project report documentation..pdfKamal Acharya
The Division of Vaccine and Immunization is facing increasing difficulty monitoring vaccines and other commodities distribution once they have been distributed from the national stores. With the introduction of new vaccines, more challenges have been anticipated with this additions posing serious threat to the already over strained vaccine supply chain system in Kenya.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Final project report on grocery store management system..pdf
Rapid and Energy Efficient Data Transmission Technique using Event Aggregation in WSN
1. International Journal for Scientific Research & Development (IJSRD) | Vol. 1, Issue 1, 2013 | ISSN: (online): 2321-0613
All rights reserved by www.ijsrd.com 45
Rapid and Energy Efficient Data Transmission Technique
using Event Aggregation in WSN
Raxit G. Jani1
Prof. Vaseem Ghada2
1
M.Tech Student, Information and Computer Technology
2
Assistant Professor, Computer Engineering Department
1
Institute of Technology, Nirma University
2
B.H. Gardi College of Engineering & Technology, Gardi Vidhyapith, Rajkot
Abstract---In this Paper we analyze WSNs and show that
it’s possible to achieve better performances in terms of
energy consumption and latency. Event aggregation in
WSNs is a process of combining several low-level events
into a high-level event to eliminate redundant information to
be transmitted and thus save energy. Existing works on
event aggregation consider either latency constraint or
aggregation function, but not both. Moreover, existing
works only consider optimal aggregation for single high
level event, but many applications are composed of multiple
high-level events. This paper studies the problem of
aggregating multiple high-level events in WSNs with
different latency constraints and aggregation functions. We
propose relation matrix to define aggregation function,
which describes the similarity among limited number of
primitive events rather than the growing number of high-
level events. Based on it, we propose an event aggregation
algorithm jointly considering the two issues for single high-
level event. This algorithm supports partial aggregation
which is more general than fully aggregation. Through
selection the optimal base events, the work is extended to
multiple high level events and consider the practical reliable
constraint. The simulation results show that our algorithm
outperforms existing approaches and saves significant
amount of energy (up to 35% in our system).
I. INTRODUCTION
Wireless Sensor Network (WSN) has developed in
recent years. WSN because of its edibility in arrangement as
well as the less effort demanded for maintenance, have
exhibited promising applications in many fields like
military, healthcare, environmental applications, etc. WSN
comprises of large number of tiny sensor nodes. Because of
their small size and use of wireless medium for
communication these nodes can be deployed in the
phenomenon or close to it. These sensor nodes because of its
size have some limitations. They have limited computation
power, memory, communication capabilities and energy.
WSNs have been extensively studied with the objective of
energy efficiency whereas throughput, bandwidth
utilization, fairness and latency were considered as the
secondary objectives. One of the most prominent operations
of WSN is converge casting. Converge cast, namely the
collection of data from a set of sensors toward a common
sink over a tree-based routing topology, is a fundamental
operation in wireless sensor networks (WSN). Two types of
data collection: (i) aggregated converge cast where packets
are aggregated at each hop (ii) raw-data converge cast where
packets are individually relayed toward the sink. Aggregated
converge cast is applicable when a strong spatial correlation
exists in the data, or the goal is to collect summarized
information such as the maximum sensor reading. Raw-data
converge cast, on the other hand, is applicable within each
sensor reading, is equally important, or the correlation is
minimal. Aggregated converge cast also results in energy
conservation and one of the most popular techniques used.
In this it reduces the number of packets to be transmitted
from source to sink which saves the energy of transmitting
each packet individually. This process does increase the
latency of communication. The collection of data formal set
of sensors toward a common sink over a tree based routing
topology, called as converge cast, is a fundamental
operation in wireless sensor networks (WSNs).it is essential
to provide a guarantee on the delivery time as well as
increase the rate of such data collection in many
applications. For instance the applications in which the
actuators and the controllers need to receive data from all
sensors within a specific deadline, failure of which might
lead to unpredictable and catastrophic events. This falls
under the category of one-shot data collection. On the other
hand, applications such as permafrost monitoring require
periodic and fast data delivery over long periods of time,
which falls under the category of continuous data collection.
However since various sensor nodes often detect common
phenomena, there is likely to be some redundancy in the
data that the source nodes communicate to a sink. In-
network filtering and processing techniques like data
aggregation can help to conserve the scarce energy
resources. In this paper we study the energy savings and the
traffic reduction at the expense of latency that can be
obtained by introducing data aggregation in the described
scenario.
We also show how such performances are affected
by factors such as the radio range of the nodes, the number
of nodes, the Maximum out-degree of the nodes in the
broadcast tree. Most previous works on data aggregation
have mainly focused on energy saving issue. Building an
energy efficient topology (usually a tree construction) has
been investigated. Tree topologies are often employed for
wireless sensor networks not only because their structure is
suitable for a network with one or a few sink nodes, but also
because their simplicity is very attractive when network
resources are limited. It has been shown that ending the
optimal aggregation tree that minimizes the number of
2. Rapid and Energy Efficient Data Transmission Technique using Event Aggregation in WSN
(IJSRD/Vol. 1/Issue 1/2013/0013)
All rights reserved by www.ijsrd.com 46
transmissions or maximizes the network lifetime is an NP-
Hard problem and efficient approximation algorithms have
been provided for constructing such trees. This is not the
focus of our paper. Instead, we assume that an aggregation
tree has been provided. Given a tree topology, we study the
impact of in-network aggregation on the delay performance
of wireless scheduling.
II. EVENT AGGREGATION
A. Event & Data:
Early works in WSNs are mainly about data
processing and the latest ones begin to discuss event
processing. Event processing is a natural extension of data
processing in WSNs, which encapsulates collected data in
events. Correspondingly, while data aggregation generates
the summary of raw data, event aggregation deduces high-
level events from low-level events. Event aggregation is an
effective approach to reduce data amount in WSN
communication. In existing works, some analyze the impact
of aggregation functions on aggregation structure, where
aggregation function describes the correlations among
different events. Others consider latency constraints to meet
time sensitive requirements. An aggregation with both of the
factors is more general but has not been considered yet.
The difficulty partly arises from the aggregation
function which is usually assumed as fully aggregation
function which means two low-level events with one unit
data amount can merge into a composite event with one unit
data amount, or more general function which takes low-level
events as input and composite event as output. It is not clear
how to combine aggregation function with latency
constraint. More importantly, hardly any existing works
have been conducted for multiple high-level events.
Considering a WSN based intelligent traffic system, many
events are required by different users for different purposes.
Some users may have interests in the average speed of
vehicles, while some others may want to know the speed of
individual vehicles. The events have different correlations
among low-level events hence have different aggregation
functions. Moreover, the latency requirements also may be
different. Existing approaches have not investigated the
diversity of requirements in event aggregation.[3] In this
paper, we investigate the aggregation problem of multiple
high-level events with different latency constraints and
aggregation functions in WSNs. We propose relation matrix
as a simple approach to define aggregation function, which
use the similarity among limited number of primitive events
rather than growing number of high-level events. After that
we design algorithm named DBEA to build the aggregation
tree for single high-level event considering both the two
issues.
This algorithm supports partial aggregation which
is more general than fully aggregation. The convicting
optimal parent candidates in building the tree are also
considered. Finally, we use dynamic programming to select
some of the high-level events as base events subject to a
reliable constraint, and then build the aggregation tree using
DBEA. Firstly, proposed a simple approach to describe
aggregation function and enable them to combine with
latency constraint. Secondly, considered both latency
constraint and aggregation function in individual high-level
event aggregation. Thirdly, extended the approach for
multiple high-level events aggregation and consider the
practical reliable constraint.
Two issues have influence on event aggregation:
latency constraint and aggregation function. In this paper,
latency is defined as the time duration from the time point
when the first event is sent at a source node to the time point
when the last event is received by the sink node. In a usual
WSN application, the latency is mainly determined by
communication distance. When latency constraint is tight,
the aggregation tree trends to be the shortest path tree and
little opportunity to undertake the aggregation. By contrast,
if latency constraint is loose (e.g. no latency constraint),
optimal aggregation can be achieved. Aggregation function
also affects event aggregation, which describes correlations
among the events and hence the data amount reduction. A
larger data amount reduction means the event is more
sensitive to event aggregation. Existing works encounter
two problems when building the aggregation tree. Firstly,
they considered only aggregation function but no latency
constraint. Secondly, they cannot be directly adopted for
multiple high-level events with different latency constraints
and aggregation functions. For the first problem, in later
section we will introduce an solution for single event.
For the second problem, several straight forward
approaches can be proposed but all have deficiencies. The
first one is to build the aggregation tree every time an event
comes which results in unacceptable overhead and latency.
The reasonable approach is to build a number of m
aggregation trees in advance according to a number of m
latency constraint-aggregation function pairs, where m is
determined by available data memory in a sensor node. For
simplicity, m events are selected as base events to acquire
the m latency constraint-aggregation function pairs. We call
the latency constraints of base events as base latency
constraints, and the aggregation functions of base events as
base aggregation functions. In reality, all the events with
base latency constraints are required to meet an reliable
requirement. For example, if li is a base latency constraint,
all the events with li need bound their performance
degradation to some degree.[3]
B. Problem Formulation:
The Event Aggregation with Different Latency Constraints
and Aggregation Functions (EALA) problem is formulated:
Given: a. A wireless sensor network G(V,E), a set of source
nodes S and a sink node r. b. A high-level event set CE
involving n composite events ce (i = 1...n) which need
detected. Each composite event has latency constraint li and
aggregation function ag. c. At most m composite events
cev1...cevm can be selected as base events to construct the
aggregation tree. and a aggregation tree which aggregates all
composite events to the sink node with minimal message
traffic cost. Subject to a. Each composite event meets
latency constraint b. All the events with base latency
constraints meet the reliable requirement.
C. Delay bounded event aggregation algorithm:
We propose Delay Bounded Event Aggregation algorithm
(DBEA) to build the aggregation tree considering both
latency constraint and aggregation function. Different from
fully aggregation, DBEA supports partial aggregation.
3. Rapid and Energy Efficient Data Transmission Technique using Event Aggregation in WSN
(IJSRD/Vol. 1/Issue 1/2013/0013)
All rights reserved by www.ijsrd.com 47
During the tree building, if a source node joins in the tree,
the distance increased is not the distance between this node
and the tree, but the distance between this node and the sink
node.
Fig.1. Design rationale of delay bounded event aggregation
algorithm
For example, in Figure 1, aggregation tree T already
includes v1, v2 and v3; the distance between v4 and T is 1,
which is exactly the increased distance in fully aggregation
since when a packet traverses from v4 to v3, it merges into
the packet of v3 hence not increase the cost from v3. This is
not the case in partial aggregation, the packet traversing to
v3 may aggregate into a packet with data amount more than
1(eg. 1.5), then it has additional cost from v3 to the sink
node (eg. (1.5 1)(6 + 4) = 5)). We also introduce the concept
of possible distance, because different events may have
convicting optimal parent candidates. As in Figure 1, v1, v2
and v3 are already in T; When event e1 transmits to v3, the
optimal distance is 2 subject to the parent of v2, while for
event e2, the optimal distance is 3 subject to the parent of
v2. In the aggregation tree, v3 have only one parent. This is
so called possible and need adjustment when a source node
joins in the tree. The details are shown in Algorithm 1. We
randomly create networks with minimum latency 4 and
aggregation function N0(norm of A2 is 0, norm=0 for short),
then issue a set of events with increasing latency constraints
from 0 to 25.
We use DBEA to build aggregation tree and
calculate the maximum latency. The experiment is repeated
with different aggregation function N1 (norm = 1),
N2(norm = 2) and N3(norm = 3). The result and each point
represent 50 times executions. All the results are between
the minimal latency and latency constraint, which shows all
latency constraints are strictly meet, at the same time the
approach gets benefit compared with the approach simply
selecting the minimal latency. Growing benefit goes with
increasing aggregation function. The aggregation tree with
N3 is longer than all others. For event 12, the latency of
aggregation tree with N3 is 13 while that with N0 is only 8.
The aggregation characteristic is recognized in the algorithm
and generate a longer aggregation tree hence more
opportunities for performance improvement. The simulation
results show that significant energy (up to 35% in our
system) can be saved by using our algorithm.
III. DELAY PERFORMANCE OF SCHEDULING WITH
DATA AGGREGATION
Most previous works on data aggregation have
mainly focused on energy saving issue. Building an energy-
efficient topology (usually a tree construction) has been
investigated. Tree topologies are often employed for
wireless sensor networks not only because their structure is
suitable for a network with one or a few sink nodes, but also
because their simplicity is very attractive when network
resources are limited. It has been shown that ending the
optimal aggregation tree that minimizes the number of
transmissions or maximizes the network lifetime is an NP-
Hard problem and efficient approximation algorithms have
been provided for constructing such trees. This is not the
focus of our paper. Instead, we assume that an aggregation
tree has been provided. Given a tree topology, we study the
impact of in-network aggregation on the delay performance
of wireless scheduling. Another group of works have
investigated the energy latency trade-off. They have dealt
with energy efficiency of wireless sensor networks
constrained on the maximum delay of sensed data. Given a
deadline, they minimize overall energy dissipation of sensor
nodes, minimize the maximum energy consumption or
minimize the amount of missed data. we formulate the
problem by minimizing the total delay of sensed data, and
thus reduce the average delay. Associated with in network
aggregation, scheduling also needs to be considered since
one has to determine which node forwards data, and which
node holds data for aggregation, which might improve the
performance in the future by reducing the amount of bits in-
right. The problem is further exacerbated by interference in
the wireless environment. Our main contributions are as
follows:
We formulate the scheduling problem that
minimizes the delay sum of data in wireless sensor
networks, and qualify the gain of in-network aggregation
techniques for tree networks. We study the characteristics of
optimal scheduling with aggregation, and analyse the
optimal performance by providing a lower bound. We
evaluate the performance of scheduling policies against the
delay bound, and show that the performance can
substantially improve by considering the network state one-
step ahead, i.e., by estimating the network state of the next
time slot.
A. Network Model:
We consider a tree network T(V,E), where V
denotes the set of n wireless nodes and E denotes the set of
wireless links. One sink node denoted by vs is located at the
root of the tree, and collects data from (n - 1) sensor nodes.
The task of the network is to compute a function from the
sensed data, and to deliver the function value through the
sink node. Data is forwarded via hop-by-hop
communications to save energy, which costs a unit of
transmission time per forwarding. The function should allow
in-network aggregation from a partial collection of data
without changing the final results or increasing transmission
cost (time) for forwarding aggregated data. Common
examples of such functions include min, max, average,
histogram, etc. We assume a time-slotted system with a
single frequency channel for the entire system. Channels are
assumed error free. However, there is wireless interference
between channels, which is modelled by the well-known
node-exclusive interference model1. Under this model, two
links sharing a node cannot transmit at the same time. The
model is suitable for Bluetooth and FH-CDMA networks. At
each time slot, a link can transmit a single packet, and
multiple links can transmit simultaneously only when they
are greater than one hop away from each other. It is also
4. Rapid and Energy Efficient Data Transmission Technique using Event Aggregation in WSN
(IJSRD/Vol. 1/Issue 1/2013/0013)
All rights reserved by www.ijsrd.com 48
denoted by the 1-hop interference model or the primary
interference model.[5]
Fig.2. Messages in the queue of node v with and without
aggregation. Without aggregation, when node v is
scheduled, the message m1 will be forwarded. With
aggregation, all messages are aggregated into a single packet
and will be forwarded simultaneously. (a) Without in-
network aggregation. (b) With in-network aggregation.
The overall system operations are described as
follows. Assume that a measurement event occurs at time t =
0. Each node senses its environment and generates data,
which is denoted by a message. All messages from sensor
nodes have to be delivered to the sink. During the first time
slot, each message generated at node v 1) is contained in a
packet for transmission and forwarded to the parent node of
v, 2) stays at node v due to transmissions from an interfering
neighbour, or 3) waits at node v for further aggregation. The
parent node that receives the packet may forward the
message to its own parent node in the next time slot. After
the first time slot, some of the nodes may have multiple
messages. Under certain sensor network applications, nodes
with multiple messages can compress the data and put them
into a single packet without affecting the final results. This
procedure is called as in-network aggregation. For example,
suppose that the task of the network is to compute an
average of the messages obtained from sensor nodes. If we
format the content of a packet in a tuple of (the average of
messages, the number of averaged messages), an
intermediate node can compute an average of all the
messages that it has received or generated, and package the
computation result into a single tuple without losing any
information.
We assume that aggregation is permanent and
messages that are aggregated will not split later. At each
time slot, the process of transmission and aggregation is
repeated until the sink collects all the messages. Clearly,
aggregation will improve scheduling efficiency by reducing
the number of packet transmissions. We assume that if in-
network aggregation is allowed, it can be done with a
negligible cost of energy or computing power. If
aggregation is not allowed, we assume that one packet can
contain only one message. Our objective is to minimize the
total delay in collecting all the messages related to a
particular measurement event. Let V denote the set of all
messages of the event. Each message is generated at a
sensor node during t = 0 and no message is generated for t >
0. Messages do not need to measure the same physical
environment, and may have a different meaning with a
different importance, in which case, we quantify the
importance of each message m using a weight wm > 0. Let
fm(t) denote the node where message m is located at2 time t.
We denote the system state at time t by its vector f(t) :=
fm(t). Also let S(t) denote the schedule during time slot t,
which is the set of nodes that transmit during time slot t.
Note that each node v . S(t) will transmit a packet to its
parent node p(v), and those set of active inks (v, p(v)) will
correspond to a matching under the node-exclusive
interference model. Let S denote the set of all possible
schedules. Given a system state, let H (v) denote the set of
messages that can be transmitted when node v is scheduled.
Without aggregation, the set H (v) will have a single
message, which might be the one with the largest weight
among the messages located at node v. (See Fig.3.1) With
aggregation, we assume that H(v) includes all messages at
node v. Use two spaces after periods (full stops). Hyphenate
complex modifiers: “zero-field-cooled magnetization.”
Avoid dangling participles, such as, “Using (1), the potential
was calculated.” Write instead, “The potential was
calculated using (1),” or “Using (1), we calculated the
potential.” Use a zero before decimal points: “0.25,” not
“.25.” Use “cm3
,” not “cc.” Do not mix complete spellings
and abbreviations of units: “Wb2/m2” or “webers per square
meter,” not “webers/m2.” Spell units when they appear in
text: “…a few henries,” not “…a few H.” If your native
language is not English, try to get a native English speaking
colleague to proofread your paper. After time slot t, the
system state will change as follows:
Let tm denote the time when message m arrives at the sink
vs, i.e., tm := min ft | fm(t + 1) = vsg. Multiple messages, if
aggregated, can arrive at the sink simultaneously and have
the same arrival time. Our objective is to solve the following
problem:
We rewrite the above problem using the delays that
each message experiences. Let S(t) denote the set of
messages that are scheduled during time slot t, i.e., S(t) := m
| fm(t) S(t),m H(fm(t)). Further, let h(v, v') denote the
number of hops between two nodes v and v', and let hm
denote the number of hops between the initial location fm(1)
of message m and the sink vs, i.e., hm := h(fm(1), vs). Note
that hm is the least number of time slots for m to arrive at
the sink when there is no other message. When multiple
messages coexist in the network, two packets that contain a
different message can compete with each other for
scheduling resources. While a node is transmitting a packet,
its neighbouring nodes cannot transmit simultaneously due
to wireless interference and the messages in those nodes
have to be delayed staying at the current location. Let Dm
denote the delays experienced by each message m in the
network until it arrives at the sink, i.e., Dm := tmhm. Since
is a constant, (2) is equivalent to
5. Rapid and Energy Efficient Data Transmission Technique using Event Aggregation in WSN
(IJSRD/Vol. 1/Issue 1/2013/0013)
All rights reserved by www.ijsrd.com 49
At each time slot, we have to determine which message m
has to be forwarded, and which should stay for aggregation.
Hence, in-network aggregation results in a trade-off between
scheduling efficiency and delays. Remark: The problem (3)
is similar to the scheduling for minimum delay, where the
delay optimal scheduler for linear networks has been
provided. Although there is a similarity in the objective, the
problem becomes much more complex here because the
topology is richer (a tree topology), and we have to deal
with aggregation. Hence, the solution of is not applicable.
B. Impact Of Aggregation
In this section, we study the effectiveness of in-
network aggregation in terms of the total delay. Given a tree
network of n nodes including the sink, we consider a
scenario in which each sensor node generates a message,
and all (n -1)messages are equally important. Specifically,
all weights are set to 1. We show that without aggregation,
the optimal delay is lower bounded by O(n2), while it is
upper bounded by O(n log n) with aggregation. Therefore,
the gain is quite substantial
1) Performance without aggregation:
For a given tree network, let d and W denote the
maximum depth and the maximum width of the tree,
respectively. At time t, a message m is said to be located at
depth d if h(fm(t); vs) = d. The following proposition
provides a bound on the optimal delay performance.
Proposition 1: Without in-network aggregation, the delay is
lower bounded by when d = O(log n). Proof: Since
messages cannot be aggregated, each packet has to include
only one message. Then, at the root, the sink can receive at
most one packet during each time slot under the node-
exclusive interference model. Since it takes at least (n - 1)
time slots to receive all (n - 1) messages.
2) Performance with aggregation:
In-network aggregation can signi_cantly reduce the
delays by integrating multiple messages into a single packet.
Since the reduction in the number of transmissions implies
less interference, messages can be forwarded faster. We
assume that messages can be aggregated into a single packet
with no cost if they are located in the same node.
Proposition 2: With in-network aggregation, the delay is
upper bounded by
Proof: We provide a scheduling policy based on link
colouring and show its delay bound, which will serve as an
upper bound on the delay of the optimal scheduler. Since
each node has at most (W + 1) links, we can colour links
using (W + 2) different colours such that two links with the
same colour are not adjacent to each other. Then we can
schedule links with the same colour simultaneously. We
choose a colour in a time slot in a round robin manner. Note
that under this policy, each node transmits a packet to its
parent every (W +2) time slots. We can estimate the
maximum delay that a message experiences before it arrives
at the sink.[5]
3) Optimal scheduling:
Let A(t) and T(t) denote the set of messages that
have arrived at the sink, and are transient in the network,
respectively, at time slot t. That is, A(t) = fm | fm(t) = vsg,
and T(t) = fm | fm(t) |= vsg. Clearly, we have A(1) = 0 and
T(1) = V . Let Dm(t) denote the delays experienced by m
during [0, t]. Hence
C. Numerical Results:
We now investigate the performance of several
scheduling algorithms versus our delay bound as a
performance benchmark. We assume that the objective
function, e.g., average of sensed data, conforms to our
aggregation constraints, i.e., in-network computations with a
partial collection of data do not change the _nal results and
do not increase transmission cost of aggregated data. We
classify scheduling policies into myopic and non-myopic
ones: Myopic policies make a scheduling decision based
only on the current system state. Most conventional
scheduling algorithms are myopic. No myopic policies
simulate the network with a sequence of schedules, and
make a scheduling decision for time slot t based on
simulation results. For example, a non-myopic policy that
can simulate the network up to tmax steps can solve (3) by
simulating S(1), . . . , S(tmax).
In our experiments, we focus on binary tree
networks. We first examine the optimal performance for full
binary trees and move to binary trees that are randomly
generated. We also compare the analytical results with the
performance of scheduling policies when weights are
assigned at random. Number citations consecutively in
square brackets [1]. The sentence punctuation follows the
bracket [2]. Refer simply to the reference number, as in [3].
Do not use “Ref. [3]” or reference [3]” except at the
beginning of a sentence: “Reference [3] was the first …”
1) Myopic Scheduling Policies
For a feasible schedule S S, let D(f(t), S) denote the
total delay increment if S is applied to the system state f(t).
13 Since myopic scheduling policies make scheduling
decisions based on the current state of the network, we
consider the following conventional scheduling algorithms:
Maximum Weight Matching (MWM): During each
time slot t, it schedules the set of nodes that minimize the
delay increment of messages for the time slot.
Maximum Size Matching (MSM): During each
time slot t, it schedules the set of nodes that maximize the
total number of scheduled nodes with a message.
6. Rapid and Energy Efficient Data Transmission Technique using Event Aggregation in WSN
(IJSRD/Vol. 1/Issue 1/2013/0013)
All rights reserved by www.ijsrd.com 50
Greedy Maximal Matching (GMM): At each time
slot t, it sorts nodes based on the sum of message weights in
each node, and includes nodes in the schedule S(t) in
decreasing order conforming to the inference constraints.
One may expect that MWM will achieve the best
performance since it serves the largest weights during the
time slot.
2) Non-Myopic Scheduling Policies:
In this section, we propose three non-myopic
scheduling policies and evaluate their performance. Under
non-myopic scheduling policies, a scheduling decision is
based on the current and the future system states, which can
be obtained by simulating the network. A higher
performance is expected as further future states are taken
into account. However, due to computational complexity in
implementation, we consider one-step non-myopic policies
only. Specifically, we propose the following algorithms:
Non-Myopic MWM (NM-MWM): During each
time slot t, it schedules the set of nodes that will minimize
the delay increments during [t, t + 1]
Non-Myopic MWM with Analysis (NM-
MWM+A): It schedules the set of nodes that minimize the
future delay bound, which can be obtained using our
analysis.
Non-Myopic GMM (NM-GMM): It is similar with
NMMWM except that for each feasible S, it chooses the
second schedule S' using the GMM algorithm.
This analysis is accurate, in particular when the
network size is small. We also evaluate the performance of
several myopic and non-myopic scheduling policies, and
show that the one-step non-myopic scheduling policies
achieve substantially lower delays than the conventional
myopic ones. In particular, the non-myopic GMM seems to
achieve good performance with moderate complexity
making it attractive as a viable alternative over the optimal
solution.[6]
There are many interesting directions for future
work. One can obtain analytic results when the underlying
tree networks have a larger width, and develop a simple
distributed algorithm with high performance. Performance
of scheduling policies will depend on different interference
models, e.g., matrix based interference model or K-hop
interference models, and needs to be quantified in those
settings. It could also be interesting to study the scheduling
performance when the energy cost of in-network
aggregation itself is not negligible.
IV. SIMULATION RESULTS
In our simulation, 200 nodes are put into a
10×10(m2
) space. Any nodes within communication radius
rc can communicate with each other. We use the energy
consumption as the performance metric. Assuming the
packet with data amount I and transmission distance d, the
transmission cost is I(βdγ+E) when d < rc, where _ denotes
energy consumption per bit on the transmitter and receiver
circuit [3].The parameters are set that γ = 2, β =
100(pJ/bit/m2
), _ = 40(nJ/bit). The numbers of hops are used
to describe the latency.
We randomly create networks with minimum
latency 4 and aggregation function N0(norm of A2 is 0,
norm=0 for The word “data” is plural, not singular. The
subscript for short, then issue a set of events with increasing
latency constraints from 0 to 25.
Fig 3. Delay bounded event aggregation
Fig. 4. Aggregation with different event number
We use DBEA to build aggregation tree and
calculate the maximum latency. The experiment is repeated
with different aggregation function N1(norm = 1), N2(norm
= 2) and N3(norm = 3). Figure 3 shows the result and each
point represents 50 times executions. All the results are
between the minimal latency and latency constraint, which
shows all latency constraints are strictly meet, at the same
time the approach gets benefit compared with the approach
simply selecting the minimal latency. Growing benefit goes
with increasing aggregation function. The aggregation tree
with N3 is longer than all others. For event 12, the latency of
aggregation tree with N3 is 13 while that with N0 is only 8.
The aggregation characteristic is recognized in the algorithm
and generate a longer aggregation tree hence more
opportunities for performance improvement.
Several experiments are undertaken to investigate
the performance of our solution for EALA (EALA for
short). For comparison, we choose several base algorithms
including fully aggregation, average aggregation and
random selection. In fully aggregation, the minimum latency
constraint and fully aggregation function are used for all
events. The average aggregation analyses all the aggregation
7. Rapid and Energy Efficient Data Transmission Technique using Event Aggregation in WSN
(IJSRD/Vol. 1/Issue 1/2013/0013)
All rights reserved by www.ijsrd.com 51
functions and calculates an average one. Random selection
uses multiple base events like EALA, but only selects them
randomly. We take the experiments with different event
number, latency number and base event number. The results
are shown in Figure 3, 4. In Figure 4, we fix base event
number as 20 and change the total event number from 20 to
100. As the result, EALA is always has the least energy
consumption among these four approaches. One interesting
thing here is average aggregation is almost the same with
fully aggregation, which means the calculation of average
value has limited help. This is because with the diversity of
the events, only one average value cannot effectively
decrease latency gap and aggregation gap. Random selection
and EALA use more base events hence have much better
performance. When event number is 20, it saves 50% energy
than fully aggregation. As event number increases to 50, the
energy saved decreases to 30 percentages but the quantity is
increased to 1.5 × 106(J). Between EALA and random
selection, EALA always has better performance. Similar
analysis can be put to latency number (graph omitted here),
and EALA also has better performance than others. The
result about different base event numbers could serves as a
guideline to decide proper base event number in the system.
As in Figure 4, the energy consumption decreases sharply
from base event number 0 to 20. In EALA, about 35%
energy is saved. After 20, the plot decreases much more
slowly. From 20 base events to 40 base events, less than
10% energy is saved. So in this system, 20 base events is a
proper choice. In this figure 4, it is very clear that EALA
outperform other approaches in terms of quantity and
decreasing speed.
V. CONCLUSION
In this paper, we studied the event aggregation
problem considering both aggregation function and latency
constrains in multiple high-level events. We proposed
solutions to this problem including a simple approach to
describe aggregation function, the DBEA algorithm
considering both latency constraint and aggregation function
for single high-level event, and the optimal base events
selection algorithm for aggregating multiple high-level
events given a reliable constraint. The simulation results
show that significant energy (up to 35% in our system) can
be saved by using our algorithm.
REFERENCES
[1] Mr Bhabani Prasadv, Mrs. Chitrakala,"A Fast
Convergecast Method for Tree-Based Wireless sensor
Networks," Electronics Research Laboratory Memorandum
Number M98/2, 2009..
[2] Claudio Barone, Fabrizio Ciarlo, Sebastiano Testa"
Energy E_ciency and Tra_c Optimization through Data
Aggregation in Wireless Sensor Networks," in Proc. EEE
MEMS Workshop, Nagoya Jan. 2009, pp. 350355.
[3] K.-W. Fan, S. Liu,"Structure-free Data
Aggregation in Sensor Networks," journal IEEE
Transactions on Mobile Computing, vol. 6 Issue 8. August
2007
[4] Weiping Zhu, Jiannong Cao, Yi Xu," Event
Aggregation with Di_erent Latency Constraints and
Aggregation Functions in Wireless Sensor Networks" IEEE
ICC 2011.
[5] H. Luo, Y. Liu and S. K. Das, Routing Correlated
Data with Fusion Cost in Wireless Sensor Networks, IEEE
Trans. on Mobile Computing, vol. 5, no.11, pp. 1620-1632,
2006.
[6] Changhee Joo, Jin-Ghoo Choi, and Ness B. Shro_,
"Delay Performance of Scheduling with Data Aggregation
in Wireless Sensor Networks" IEEE INFOCOM 2010.
[7] L. Becchetti, P. Korteweg, A. Marchetti-
Spaccamela, M. Skutella, L. Stougie, and A. Vitaletti,
Latency Constrained Aggregation in Sensor Networks, in
the 14th conference on Annual European Symposium, 2006.
[8] Athanassios Boulis, "Castalia A simulator for
Wireless Sensor Networks and Body Area Net- works"Ver
3.1,3.2 NICTA December 2010.
[9] Amitabha Ghosh, Ozlem Durmaz Incel, V.S. Anil
Kumar, and Bhaskar Krishnamachari , "Algorithms for Fast
Aggregated Convergecast in Sensor Networks" University
of Southern California 2007.