The document discusses computational intelligence based data aggregation techniques in wireless sensor networks. It begins by introducing the research intentions of integrating computational intelligence techniques with conventional data aggregation to improve efficiency. It then provides background on wireless sensor network architectures, routing protocols, and challenges with data aggregation. Finally, it proposes using techniques like neural networks, genetic algorithms, fuzzy logic, and particle swarm optimization to enable adaptive and distributed data aggregation and fusion in sensor networks.
In this presentation we review some of the research problems we address at EPFL in the area of sensor data management. At the level of infrastructure we have developed a middleware to seamlessly integrate, aggregate and analyze heterogeneous sensor data streams in real-time, a WIKI based repository supporting the cooperative management of the metadata associated with sensor deployments and cloud-based storage infrastructure. An important problem in managing sensor data is their efficient storage and transmission using compression techniques. To that end we apply model-based compression methods. For analyzing sensor data, we have developed methods to dynamically estimate the variability, which can be readily used for outlier detection, and to extract semantic features from GPS sensor data streams. We also investigate techniques for trading off between the accuracy of the sensor data obtained and the degree of privacy preservation that can be maintained.
The Sensor Data Management presentation was presented by Karl Aberer (Ecole Polytechnique Federale de Lausanne) at the PlanetData project Meeting on February 28 - March 4, 2011 in Innsbruck, Austria.
This document summarizes several data aggregation protocols for wireless sensor networks. It begins by introducing wireless sensor networks and describing the need for data aggregation to reduce energy consumption from transmission. It then categorizes data aggregation mechanisms as structure-free, structure-based (tree-based and cluster-based), and hybrid. Several tree-based protocols are summarized, including TAG, EADAT, AGIT, SRTSD, and PEDAP. Cluster-based protocols discussed include LEACH, PEGASIS, TEEN, APTEEN, and HEED. The document concludes by outlining routing challenges and design issues for data aggregation protocols.
The document surveys real-time data management techniques for wireless sensor networks. It discusses the challenges of managing large amounts of real-time data in wireless sensor networks due to hardware constraints and limited resources. It describes two main approaches to data storage and querying: the warehousing approach where data is sent to a central database, and the distributed approach where sensor devices act as local databases. It then reviews several existing solutions that use each approach, including indexing techniques for centralized databases and distributed architectures using clustering or layers.
AggreLEACH: Enhance Privacy Preserving in Wireless Sensor Networkijsrd.com
Privacy preservation is an important issue in today's context of extreme penetration of internet and mobile technology. It is more important in the case of wireless sensor network where collected data often requires in network processing and collaborative computing. Security is always booming in wireless sensor network. Privacy preserving data aggregation emerged as an important concern in designing data aggregation algorithm. Encryption schemes that support operation over cipher text are of utmost for wireless sensor networks & especially in LEACH protocol. The salient limit of LEACH is energy. Due to this limitation, it seems important to design Confidentiality scheme for WSN so that sensing data can be transmitted to the receiver securely and efficiently and the energy consumed must be minimum hence we proposed AggreLEACH in which confidentiality scheme i.e. holomorphic encryption is added to LEACH protocol. In holomorphic encryption data can be aggregated without decryption and hence less energy consumption. The objective is to provide secure data transmission between sensor node and aggregator. Simulation result are obtain in terms of two metrics- total energy Consumed of node, life-time of node. It is observed that the performance of AggreLEACH compare to LEACH. We have performed theoretical analysis as well as simulation to check the performance in terms of accuracy, complexity and security.
This document summarizes key routing protocols proposed for network structure in wireless sensor networks (WSNs). It classifies routing protocols into three categories: flat-based, hierarchical-based, and location-based routing. Flat-based routing treats all nodes equally, while hierarchical-based routing uses cluster heads to reduce energy consumption. Location-based routing exploits node positions. Key protocols discussed include SPIN, directed diffusion, LEACH, PEGASIS, and SOP. The document provides an overview of how each protocol operates and its advantages.
A Survey of Fuzzy Logic Based Congestion Estimation Techniques in Wireless S...IOSR Journals
This document surveys fuzzy logic techniques for estimating congestion in wireless sensor networks. It begins by providing background on wireless sensor networks and issues like limited battery life. It then discusses clustering as a technique to reduce energy consumption by having cluster heads aggregate and transmit data. The document reviews applications of fuzzy logic in wireless sensor networks for clustering, data fusion, and security. It defines congestion as excessive network load and discusses how fuzzy logic techniques can help estimate congestion to reduce problems like queuing delays and packet loss compared to non-fuzzy approaches. In conclusion, fuzzy logic provides a better approach for estimating congestion in wireless sensor networks.
The document discusses energy efficient routing protocols for clustered wireless sensor networks. It provides an overview of wireless sensor networks and discusses how clustering is commonly used to improve energy efficiency and scalability. The document reviews several existing clustering-based routing protocols and analyzes their approaches for prolonging network lifetime by minimizing energy consumption in wireless sensor networks.
This document discusses routing protocols in wireless sensor networks. It begins with an introduction to routing challenges in WSNs such as limited energy, processing, and storage in sensor nodes. It then covers different routing techniques including flat routing protocols like SPIN, directed diffusion, and rumor routing. Hierarchical routing protocols discussed include LEACH, PEGASIS, TEEN, and APTEEN. Finally, it briefly mentions location-based routing and the GEAR protocol.
In this presentation we review some of the research problems we address at EPFL in the area of sensor data management. At the level of infrastructure we have developed a middleware to seamlessly integrate, aggregate and analyze heterogeneous sensor data streams in real-time, a WIKI based repository supporting the cooperative management of the metadata associated with sensor deployments and cloud-based storage infrastructure. An important problem in managing sensor data is their efficient storage and transmission using compression techniques. To that end we apply model-based compression methods. For analyzing sensor data, we have developed methods to dynamically estimate the variability, which can be readily used for outlier detection, and to extract semantic features from GPS sensor data streams. We also investigate techniques for trading off between the accuracy of the sensor data obtained and the degree of privacy preservation that can be maintained.
The Sensor Data Management presentation was presented by Karl Aberer (Ecole Polytechnique Federale de Lausanne) at the PlanetData project Meeting on February 28 - March 4, 2011 in Innsbruck, Austria.
This document summarizes several data aggregation protocols for wireless sensor networks. It begins by introducing wireless sensor networks and describing the need for data aggregation to reduce energy consumption from transmission. It then categorizes data aggregation mechanisms as structure-free, structure-based (tree-based and cluster-based), and hybrid. Several tree-based protocols are summarized, including TAG, EADAT, AGIT, SRTSD, and PEDAP. Cluster-based protocols discussed include LEACH, PEGASIS, TEEN, APTEEN, and HEED. The document concludes by outlining routing challenges and design issues for data aggregation protocols.
The document surveys real-time data management techniques for wireless sensor networks. It discusses the challenges of managing large amounts of real-time data in wireless sensor networks due to hardware constraints and limited resources. It describes two main approaches to data storage and querying: the warehousing approach where data is sent to a central database, and the distributed approach where sensor devices act as local databases. It then reviews several existing solutions that use each approach, including indexing techniques for centralized databases and distributed architectures using clustering or layers.
AggreLEACH: Enhance Privacy Preserving in Wireless Sensor Networkijsrd.com
Privacy preservation is an important issue in today's context of extreme penetration of internet and mobile technology. It is more important in the case of wireless sensor network where collected data often requires in network processing and collaborative computing. Security is always booming in wireless sensor network. Privacy preserving data aggregation emerged as an important concern in designing data aggregation algorithm. Encryption schemes that support operation over cipher text are of utmost for wireless sensor networks & especially in LEACH protocol. The salient limit of LEACH is energy. Due to this limitation, it seems important to design Confidentiality scheme for WSN so that sensing data can be transmitted to the receiver securely and efficiently and the energy consumed must be minimum hence we proposed AggreLEACH in which confidentiality scheme i.e. holomorphic encryption is added to LEACH protocol. In holomorphic encryption data can be aggregated without decryption and hence less energy consumption. The objective is to provide secure data transmission between sensor node and aggregator. Simulation result are obtain in terms of two metrics- total energy Consumed of node, life-time of node. It is observed that the performance of AggreLEACH compare to LEACH. We have performed theoretical analysis as well as simulation to check the performance in terms of accuracy, complexity and security.
This document summarizes key routing protocols proposed for network structure in wireless sensor networks (WSNs). It classifies routing protocols into three categories: flat-based, hierarchical-based, and location-based routing. Flat-based routing treats all nodes equally, while hierarchical-based routing uses cluster heads to reduce energy consumption. Location-based routing exploits node positions. Key protocols discussed include SPIN, directed diffusion, LEACH, PEGASIS, and SOP. The document provides an overview of how each protocol operates and its advantages.
A Survey of Fuzzy Logic Based Congestion Estimation Techniques in Wireless S...IOSR Journals
This document surveys fuzzy logic techniques for estimating congestion in wireless sensor networks. It begins by providing background on wireless sensor networks and issues like limited battery life. It then discusses clustering as a technique to reduce energy consumption by having cluster heads aggregate and transmit data. The document reviews applications of fuzzy logic in wireless sensor networks for clustering, data fusion, and security. It defines congestion as excessive network load and discusses how fuzzy logic techniques can help estimate congestion to reduce problems like queuing delays and packet loss compared to non-fuzzy approaches. In conclusion, fuzzy logic provides a better approach for estimating congestion in wireless sensor networks.
The document discusses energy efficient routing protocols for clustered wireless sensor networks. It provides an overview of wireless sensor networks and discusses how clustering is commonly used to improve energy efficiency and scalability. The document reviews several existing clustering-based routing protocols and analyzes their approaches for prolonging network lifetime by minimizing energy consumption in wireless sensor networks.
This document discusses routing protocols in wireless sensor networks. It begins with an introduction to routing challenges in WSNs such as limited energy, processing, and storage in sensor nodes. It then covers different routing techniques including flat routing protocols like SPIN, directed diffusion, and rumor routing. Hierarchical routing protocols discussed include LEACH, PEGASIS, TEEN, and APTEEN. Finally, it briefly mentions location-based routing and the GEAR protocol.
A Cooperative Cache Management Scheme for IEEE802.15.4 based Wireless Sensor ...IJECEIAES
Wireless Sensor Networks (WSNs) based on the IEEE 802.15.4 MAC and PHY layer standards is a recent trend in the market. It has gained tremendous attention due to its low energy consumption characteristics and low data rates. However, for larger networks minimizing energy consumption is still an issue because of the dissemination of large overheads throughout the network. This consumption of energy can be reduced by incorporating a novel cooperative caching scheme to minimize overheads and to serve data with minimal latency and thereby reduce the energy consumption. This paper explores the possibilities to enhance the energy efficiency by incorporating a cooperative caching strategy.
This document summarizes several energy-efficient routing protocols for wireless sensor networks. It begins by introducing the basic components and architecture of wireless sensor networks. It then categorizes routing protocols based on network structure (flat, hierarchical, location-based) and operation (multipath, query-based, etc.). The majority of the document focuses on reviewing hierarchical protocols, including LEACH, PEGASIS, Hierarchical PEGASIS, and HEED. It provides brief overviews of how these protocols work to reduce energy consumption and extend network lifetime through clustering and data aggregation approaches.
This document summarizes several energy-aware routing protocols for wireless sensor networks. It discusses classical approaches like flooding and gossiping and their deficiencies. It then describes the SPIN protocol which uses negotiations and metadata to adapt to resource constraints. Directed Diffusion is also covered, using interests, data messages, gradients, and reinforcement to set up multiple paths between sources and sinks. The document provides details on how these protocols establish and maintain paths while conserving energy in wireless sensor networks.
Proposed mac protocol for reduce energy consumption over wsn networkeSAT 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
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
AN ENERGY-EFFICIENT AND SCALABLE SLOTBASED PRIVACY HOMOMORPHIC ENCRYPTION SCH...ijassn
With the advent of Wireless Sensor Networks (WSN) and its immense popularity in a wide range of applications, security has been a major concern for these resource-constraint systems. Alongside security, WSNs are currently being integrated with existing technologies such as the Internet, satellite, Wi-Max, WiFi, etc. in order to transmit data over long distances and hand-over network load to more powerful devices. With the focus currently being on the integration of WSNs with existing technologies, security becomes a major concern. The main security requirement for WSN-integrated networks is providing end-to-end security along with the implementation of in-processing techniques of data aggregation. This can be achieved with the implementation of Homomorphic encryption schemes which prove to be computationally inexpensive since they have considerable overheads. This paper addresses the ID-issue of the commonly used Castelluccia Mykletun Tsudik (CMT) [12] homomorphic scheme by proposing an ID slotting mechanism which carries information pertaining to the security keys responsible for the encryption of individual sensor data. The proposed scheme proves to be 93.5% lighter in terms of induced overheads and 11.86% more energy efficient along with providing efficient WSN scalability compared to the existing scheme. The paper provides analytical results comparing the proposed scheme with the existing scheme thus justifying that the modification to the existing scheme can prove highly efficient for resourceconstrained WSNs.
A N E NERGY -E FFICIENT A ND S CALABLE S LOT - B ASED P RIVACY H OMOMOR...ijassn
With the advent of Wireless Sensor Networks (WSN) a
nd its immense popularity in a wide range of
applications, security has been a major concern for
these resource-constraint systems. Alongside secur
ity,
WSNs are currently being integrated with existing t
echnologies such as the Internet, satellite, Wi-Max
, Wi-
Fi, etc. in order to transmit data over long distan
ces and hand-over network load to more powerful dev
ices.
With the focus currently being on the integration o
f WSNs with existing technologies, security becomes
a
major concern. The main security requirement for WS
N-integrated networks is providing end-to-end
security along with the implementation of in-proces
sing techniques of data aggregation. This can be
achieved with the implementation of Homomorphic enc
ryption schemes which prove to be computationally
inexpensive since they have considerable overheads.
This paper addresses the ID-issue of the commonly
used Castelluccia Mykletun Tsudik (CMT) [12] homomo
rphic scheme by proposing an ID slotting
mechanism which carries information pertaining to t
he security keys responsible for the encryption of
individual sensor data. The proposed scheme proves
to be 93.5% lighter in terms of induced overheads a
nd
11.86% more energy efficient along with providing e
fficient WSN scalability compared to the existing
scheme. The paper provides analytical results compa
ring the proposed scheme with the existing scheme
thus justifying that the modification to the existi
ng scheme can prove highly efficient for resource-
constrained WSNs.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
A Review of Atypical Hierarchical Routing Protocols for Wireless Sensor Networksiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
COMPRESSIVE DATA GATHERING TECHNIQUE BY AVOIDING CORRELATED DATA IN WSNpharmaindexing
This document proposes a technique for compressive data gathering in wireless sensor networks using mobile data collectors. It involves identifying correlated sensor data within clusters near polling points and defining a tour plan for mobile collectors that avoids visiting these correlated sensors. This is done using a spatial correlation method. The goal is to identify new optimal polling points by avoiding correlated sensors, which reduces the tour length of mobile collectors and the number of polling points needed. This extends the lifetime of the wireless sensor network. The document provides background on related work using mobile data collectors and discusses how the proposed approach improves upon prior methods.
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
This document proposes a secure clock synchronization technique for wireless sensor networks used in event-driven measurement applications. The technique aims to 1) provide high synchronization accuracy around detected events, 2) ensure long network lifetime, and 3) provide secure packet transmission. It divides nodes into an improved synchronization subset (ISS) with high accuracy around events, and a default synchronization subset (DSS) with lower accuracy elsewhere. When an event is detected, neighboring nodes in the ISS exchange synchronization packets more frequently for better accuracy. Authentication is used to securely transmit packets and identify intercepted messages. Simulation results show the technique accurately records event occurrence times while maintaining network lifetime through efficient energy usage.
Energy saving in P2P oriented Wireless Sensor Network (WSN) using the approac...IOSR Journals
This document discusses energy saving techniques in peer-to-peer wireless sensor networks through the use of data compression. It begins by introducing wireless sensor networks and their energy constraints. It then discusses how compression can reduce energy consumption by decreasing transmission time. Different compression techniques like LZO, Zlib, and Bzip2 are described. The document proposes using Adaptive Compression Environment to automatically select the best compression technique based on network conditions. It presents an algorithm for compressing data at the sender, transmitting it in chunks, and decompressing it at the receiver. The conclusion states that compression technologies can help save sensor energy in peer-to-peer networks and that more advances will optimize this solution.
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.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
The document proposes an improved data routing protocol for wireless sensor networks. It aims to address deficiencies in existing chain-based routing protocols like Chiron and PEGASIS that can cause longer transmission delays and redundant paths. The key aspects of the proposed protocol are:
1) The sensing area is divided into fan-shaped groups using beamforming from the base station, instead of concentric clusters. Shorter chains are formed within each group for data transmission.
2) The node with maximum residual energy in each chain is elected as the chain leader, rather than taking turns, to aggregate and transmit data to the base station.
3) Transmission between chain leaders is optimized to avoid longer distances and redundant paths.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
This summary provides the key details from the document in 3 sentences:
The document proposes an efficient IoT-based sensor data analysis system in wireless sensor networks using cloud computing. It utilizes the Greedy Perimeter Stateless Routing (GPSR) algorithm to route sensor data to cloud storage. The system is evaluated through simulations analyzing parameters like packet delivery ratio, energy consumption, and delay.
Communication synchronization in cluster based wireless sensor network a re...eSAT Journals
Abstract A wireless sensor network is acquiring more popularity in different sectors. A scalable, low latency and energy efficient are desire challenges that should meet by wireless sensor network. Clustering permits sensors to systematically communicate among clusters. Cluster based sensor network satisfies these challenges as it provides flexible, energy saving and QoS. The communication efficiency and network performance degrades if the interaction between inter-cluster and intra-cluster communication are not managed properly. The proposed work uses two approaches to solve this problem. At aiming low packet delay and high throughput first approach uses cycle- based synchronous scheduling. By completely removing necessity of communication synchronization second approach send packets with no synchronization delay. The combined scheme can take benefit of both approaches. Keywords: Wireless sensor network, clustering, communication synchronization, QoS.
Iaetsd a survey on geographic routing relay selection inIaetsd Iaetsd
The document summarizes research on geographic routing and relay selection in wireless sensor networks. It discusses how geographic routing uses location information to route packets towards a destination but faces challenges around connectivity holes and optimal relay selection. The document reviews several existing approaches and their limitations. It then describes an alternative method called ALBA-R that was proposed to more efficiently route around holes while enhancing relay selection to maximize node lifetime. Simulation results showed ALBA-R outperformed other methods with respect to metrics like overhead and end-to-end delay.
Routing protocols are essential for wireless sensor networks to efficiently transmit collected sensor data to data sinks. The document discusses several challenges in designing routing protocols for wireless sensor networks and surveys different routing techniques including flat, hierarchical, and geographic routing. It provides LEACH and PEGASIS as examples of hierarchical routing protocols that use clustering and data aggregation to reduce energy consumption.
This document provides guidance on writing a research paper, beginning with choosing a topic and developing a thesis statement. It outlines the steps of writing a paper, including selecting and analyzing primary and secondary sources, compiling information, avoiding plagiarism through proper paraphrasing and citation, and including a bibliography. The document emphasizes writing an outline before starting the paper, using multiple credible source types, and thoroughly proofreading the final draft. Research papers require following a process of topic selection, research, organization, citation, and revision to effectively communicate new information and ideas.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
Routing protocols in wireless sensor networks face several unique challenges compared to other wireless networks. The document discusses these challenges and provides an overview of common routing protocol approaches in WSNs, including flat routing protocols like SPIN and Directed Diffusion, hierarchical routing protocols like LEACH, and location-based routing protocols. It also covers routing design issues specific to WSNs such as energy efficiency, data delivery models, fault tolerance, and quality of service.
A Cooperative Cache Management Scheme for IEEE802.15.4 based Wireless Sensor ...IJECEIAES
Wireless Sensor Networks (WSNs) based on the IEEE 802.15.4 MAC and PHY layer standards is a recent trend in the market. It has gained tremendous attention due to its low energy consumption characteristics and low data rates. However, for larger networks minimizing energy consumption is still an issue because of the dissemination of large overheads throughout the network. This consumption of energy can be reduced by incorporating a novel cooperative caching scheme to minimize overheads and to serve data with minimal latency and thereby reduce the energy consumption. This paper explores the possibilities to enhance the energy efficiency by incorporating a cooperative caching strategy.
This document summarizes several energy-efficient routing protocols for wireless sensor networks. It begins by introducing the basic components and architecture of wireless sensor networks. It then categorizes routing protocols based on network structure (flat, hierarchical, location-based) and operation (multipath, query-based, etc.). The majority of the document focuses on reviewing hierarchical protocols, including LEACH, PEGASIS, Hierarchical PEGASIS, and HEED. It provides brief overviews of how these protocols work to reduce energy consumption and extend network lifetime through clustering and data aggregation approaches.
This document summarizes several energy-aware routing protocols for wireless sensor networks. It discusses classical approaches like flooding and gossiping and their deficiencies. It then describes the SPIN protocol which uses negotiations and metadata to adapt to resource constraints. Directed Diffusion is also covered, using interests, data messages, gradients, and reinforcement to set up multiple paths between sources and sinks. The document provides details on how these protocols establish and maintain paths while conserving energy in wireless sensor networks.
Proposed mac protocol for reduce energy consumption over wsn networkeSAT 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
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
AN ENERGY-EFFICIENT AND SCALABLE SLOTBASED PRIVACY HOMOMORPHIC ENCRYPTION SCH...ijassn
With the advent of Wireless Sensor Networks (WSN) and its immense popularity in a wide range of applications, security has been a major concern for these resource-constraint systems. Alongside security, WSNs are currently being integrated with existing technologies such as the Internet, satellite, Wi-Max, WiFi, etc. in order to transmit data over long distances and hand-over network load to more powerful devices. With the focus currently being on the integration of WSNs with existing technologies, security becomes a major concern. The main security requirement for WSN-integrated networks is providing end-to-end security along with the implementation of in-processing techniques of data aggregation. This can be achieved with the implementation of Homomorphic encryption schemes which prove to be computationally inexpensive since they have considerable overheads. This paper addresses the ID-issue of the commonly used Castelluccia Mykletun Tsudik (CMT) [12] homomorphic scheme by proposing an ID slotting mechanism which carries information pertaining to the security keys responsible for the encryption of individual sensor data. The proposed scheme proves to be 93.5% lighter in terms of induced overheads and 11.86% more energy efficient along with providing efficient WSN scalability compared to the existing scheme. The paper provides analytical results comparing the proposed scheme with the existing scheme thus justifying that the modification to the existing scheme can prove highly efficient for resourceconstrained WSNs.
A N E NERGY -E FFICIENT A ND S CALABLE S LOT - B ASED P RIVACY H OMOMOR...ijassn
With the advent of Wireless Sensor Networks (WSN) a
nd its immense popularity in a wide range of
applications, security has been a major concern for
these resource-constraint systems. Alongside secur
ity,
WSNs are currently being integrated with existing t
echnologies such as the Internet, satellite, Wi-Max
, Wi-
Fi, etc. in order to transmit data over long distan
ces and hand-over network load to more powerful dev
ices.
With the focus currently being on the integration o
f WSNs with existing technologies, security becomes
a
major concern. The main security requirement for WS
N-integrated networks is providing end-to-end
security along with the implementation of in-proces
sing techniques of data aggregation. This can be
achieved with the implementation of Homomorphic enc
ryption schemes which prove to be computationally
inexpensive since they have considerable overheads.
This paper addresses the ID-issue of the commonly
used Castelluccia Mykletun Tsudik (CMT) [12] homomo
rphic scheme by proposing an ID slotting
mechanism which carries information pertaining to t
he security keys responsible for the encryption of
individual sensor data. The proposed scheme proves
to be 93.5% lighter in terms of induced overheads a
nd
11.86% more energy efficient along with providing e
fficient WSN scalability compared to the existing
scheme. The paper provides analytical results compa
ring the proposed scheme with the existing scheme
thus justifying that the modification to the existi
ng scheme can prove highly efficient for resource-
constrained WSNs.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
A Review of Atypical Hierarchical Routing Protocols for Wireless Sensor Networksiosrjce
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
COMPRESSIVE DATA GATHERING TECHNIQUE BY AVOIDING CORRELATED DATA IN WSNpharmaindexing
This document proposes a technique for compressive data gathering in wireless sensor networks using mobile data collectors. It involves identifying correlated sensor data within clusters near polling points and defining a tour plan for mobile collectors that avoids visiting these correlated sensors. This is done using a spatial correlation method. The goal is to identify new optimal polling points by avoiding correlated sensors, which reduces the tour length of mobile collectors and the number of polling points needed. This extends the lifetime of the wireless sensor network. The document provides background on related work using mobile data collectors and discusses how the proposed approach improves upon prior methods.
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
This document proposes a secure clock synchronization technique for wireless sensor networks used in event-driven measurement applications. The technique aims to 1) provide high synchronization accuracy around detected events, 2) ensure long network lifetime, and 3) provide secure packet transmission. It divides nodes into an improved synchronization subset (ISS) with high accuracy around events, and a default synchronization subset (DSS) with lower accuracy elsewhere. When an event is detected, neighboring nodes in the ISS exchange synchronization packets more frequently for better accuracy. Authentication is used to securely transmit packets and identify intercepted messages. Simulation results show the technique accurately records event occurrence times while maintaining network lifetime through efficient energy usage.
Energy saving in P2P oriented Wireless Sensor Network (WSN) using the approac...IOSR Journals
This document discusses energy saving techniques in peer-to-peer wireless sensor networks through the use of data compression. It begins by introducing wireless sensor networks and their energy constraints. It then discusses how compression can reduce energy consumption by decreasing transmission time. Different compression techniques like LZO, Zlib, and Bzip2 are described. The document proposes using Adaptive Compression Environment to automatically select the best compression technique based on network conditions. It presents an algorithm for compressing data at the sender, transmitting it in chunks, and decompressing it at the receiver. The conclusion states that compression technologies can help save sensor energy in peer-to-peer networks and that more advances will optimize this solution.
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.
INCREASE THE LIFETIME OF WIRELESS SENSOR NETWORKS USING HIERARCHICAL CLUSTERI...ijwmn
Wireless sensor networks consist of hundreds or thousands of nodes with limited energy. Since the life time
of each sensor is equivalent to the battery life, the energy issue is considered as a major challenge.
Clustering has been proposed as a strategy to extend the lifetime of wireless sensor networks. Cluster size,
number of Cluster head per cluster and the selection of cluster head are considered as important factors in
clustering. In this research by studying LEACH algorithm and optimized algorithms of this protocol and by
evaluating the strengths and weaknesses, a new algorithm based on hierarchical clustering to increase the
lifetime of the sensor network is proposed. In this study, with a special mechanism the environment of
network is layered and the optimal number of cluster head in each layer is selected and then recruit for the
formation of clusters in the same layer by controlling the topology of the clusters is done independently.
Then the data is sent through the by cluster heads through the multi- stage to the main station. Simulation
results show that the above mentioned method increases the life time about 70% compared to the LEACH.
The document proposes an improved data routing protocol for wireless sensor networks. It aims to address deficiencies in existing chain-based routing protocols like Chiron and PEGASIS that can cause longer transmission delays and redundant paths. The key aspects of the proposed protocol are:
1) The sensing area is divided into fan-shaped groups using beamforming from the base station, instead of concentric clusters. Shorter chains are formed within each group for data transmission.
2) The node with maximum residual energy in each chain is elected as the chain leader, rather than taking turns, to aggregate and transmit data to the base station.
3) Transmission between chain leaders is optimized to avoid longer distances and redundant paths.
Efficient IOT Based Sensor Data Analysis in Wireless Sensor Networks with Cloudiosrjce
This summary provides the key details from the document in 3 sentences:
The document proposes an efficient IoT-based sensor data analysis system in wireless sensor networks using cloud computing. It utilizes the Greedy Perimeter Stateless Routing (GPSR) algorithm to route sensor data to cloud storage. The system is evaluated through simulations analyzing parameters like packet delivery ratio, energy consumption, and delay.
Communication synchronization in cluster based wireless sensor network a re...eSAT Journals
Abstract A wireless sensor network is acquiring more popularity in different sectors. A scalable, low latency and energy efficient are desire challenges that should meet by wireless sensor network. Clustering permits sensors to systematically communicate among clusters. Cluster based sensor network satisfies these challenges as it provides flexible, energy saving and QoS. The communication efficiency and network performance degrades if the interaction between inter-cluster and intra-cluster communication are not managed properly. The proposed work uses two approaches to solve this problem. At aiming low packet delay and high throughput first approach uses cycle- based synchronous scheduling. By completely removing necessity of communication synchronization second approach send packets with no synchronization delay. The combined scheme can take benefit of both approaches. Keywords: Wireless sensor network, clustering, communication synchronization, QoS.
Iaetsd a survey on geographic routing relay selection inIaetsd Iaetsd
The document summarizes research on geographic routing and relay selection in wireless sensor networks. It discusses how geographic routing uses location information to route packets towards a destination but faces challenges around connectivity holes and optimal relay selection. The document reviews several existing approaches and their limitations. It then describes an alternative method called ALBA-R that was proposed to more efficiently route around holes while enhancing relay selection to maximize node lifetime. Simulation results showed ALBA-R outperformed other methods with respect to metrics like overhead and end-to-end delay.
Routing protocols are essential for wireless sensor networks to efficiently transmit collected sensor data to data sinks. The document discusses several challenges in designing routing protocols for wireless sensor networks and surveys different routing techniques including flat, hierarchical, and geographic routing. It provides LEACH and PEGASIS as examples of hierarchical routing protocols that use clustering and data aggregation to reduce energy consumption.
This document provides guidance on writing a research paper, beginning with choosing a topic and developing a thesis statement. It outlines the steps of writing a paper, including selecting and analyzing primary and secondary sources, compiling information, avoiding plagiarism through proper paraphrasing and citation, and including a bibliography. The document emphasizes writing an outline before starting the paper, using multiple credible source types, and thoroughly proofreading the final draft. Research papers require following a process of topic selection, research, organization, citation, and revision to effectively communicate new information and ideas.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
Routing protocols in wireless sensor networks face several unique challenges compared to other wireless networks. The document discusses these challenges and provides an overview of common routing protocol approaches in WSNs, including flat routing protocols like SPIN and Directed Diffusion, hierarchical routing protocols like LEACH, and location-based routing protocols. It also covers routing design issues specific to WSNs such as energy efficiency, data delivery models, fault tolerance, and quality of service.
Wireless sensor networks are composed of small, low-cost sensor nodes that are densely deployed to monitor environmental conditions. Each node has sensing, processing and communication capabilities. Sensor networks have many applications including military surveillance, environmental monitoring, health monitoring, smart homes/offices, and inventory management. Routing data efficiently in sensor networks faces challenges due to the large number of nodes, limited energy/resources of nodes, and dynamic network topology changes. Common routing architectures include layered architectures where nodes are organized in layers based on distance from the base station, and clustered architectures where nodes are organized into clusters with cluster heads routing data.
The document presents a graduate project on efficient data aggregation from polling points in wireless sensor networks. The proposed system called Mobi-Cluster aims to minimize overall network overhead and energy expenditure associated with multi-hop data retrieval while ensuring balanced energy consumption and prolonged network lifetime. This is achieved through building cluster structures consisting of member nodes that route data to assigned cluster heads, and selecting appropriate polling points to act as intermediaries between clusters and a mobile collector. The key stages of the Mobi-Cluster protocol are described as cluster head selection, polling point selection, cluster head attachment to polling points, data aggregation and forwarding to polling points, and communication between polling points and the mobile collector.
The document discusses routing protocols for wireless sensor networks (WSNs). It provides an overview of routing challenges in WSNs, including energy constraints, data delivery models, fault tolerance, and quality of service issues. It then describes two common flat routing protocols for WSNs: SPIN and Directed Diffusion. SPIN uses data negotiation to disseminate information and avoid redundant transmissions. Directed Diffusion establishes interest gradients to route data from sources to a sink based on attribute-value pairs.
Wireless sensor networks use large numbers of small, low-cost sensors that communicate wirelessly to monitor conditions like temperature, sound, pollution levels, pressure, etc. Sensors collect data and pass it to a base station, which can be accessed through the internet. Wireless sensor networks can be used for applications like environmental monitoring, smart grids, healthcare, agriculture, and more. They face challenges related to power efficiency, security, scalability and operating in different environments.
Network architecture documents the key differences between ad hoc and sensor networks. Ad hoc networks allow nodes to communicate directly with each other in a peer-to-peer fashion, while sensor networks have dedicated source nodes that sense data and sink nodes that receive the data. Sensor networks also employ in-network processing techniques like data aggregation to reduce energy costs of transmitting all raw data. Routing in wireless sensor networks faces challenges from limited node resources, topology changes, and energy constraints that require routing protocols to be scalable, fault-tolerant and energy-efficient.
The document discusses routing protocols in wireless sensor networks. It outlines several key challenges for routing protocols including node deployment, network dynamics, energy conservation, fault tolerance, scalability, and hardware constraints. It then describes several common routing techniques used in wireless sensor networks, including proactive, reactive, and hybrid path establishment approaches, as well as flat, hierarchical, and location-based network structures. Finally, it discusses different protocol operations such as multipath routing, query-based routing, negotiation-based routing, and supporting quality of service metrics.
Efficient Cluster Based Data Collection Using Mobile Data Collector for Wirel...ijceronline
Establishing an efficient data gathering scheme in wireless sensor networks is a challenging task. Lot of researches has been carried out to establish energy efficient data gathering scheme to avoid heavy traffic received by the nodes near the sink. Data gathering scheme is a significant factor in determining the network lifetime. In this paper we propose an efficient data gathering scheme by introducing clustering and mobility into the wireless sensor network. We consider data collection in wireless sensor networks by utilizing mobile data collector and cluster heads. Cluster heads are chosen and clusters are formed to collect data from the sensor nodes. The proposed scheme finds the shortest tour for the mobile data collector to collect data from the cluster heads. The shortest tour saves time and energy in data gathering.
This document discusses improving the performance of mobile wireless sensor networks using a modified DBSCAN clustering algorithm. It first provides background on wireless sensor networks and discusses challenges related to mobility. It then reviews several existing works related to clustering, mobility, and extending network lifetime. The paper proposes using a modified DBSCAN algorithm that takes into account mobility, remaining energy, and distance to base station to select cluster heads. It evaluates the performance of this approach based on throughput, delay, and packet delivery ratio, finding improvements over other methods.
This document discusses wireless sensor networks and their architecture. It describes layered and clustered architectures for organizing sensor networks. Layered architectures arrange sensors in layers around a central base station, allowing for short-range transmissions. Clustered architectures organize sensors into clusters headed by cluster heads that can aggregate and transmit data to the base station. The document also introduces protocols like UNPF that implement layered architectures and LEACH that uses clustering to minimize energy use in sensor networks.
This document proposes an energy efficient three-level model for query optimization in wireless sensor networks (WSNs). At the three levels are: base station, cluster heads, and sensor nodes. The base station maintains metadata about cluster heads and sensor nodes. When a query is received, it first checks if the result is cached. If not, it checks the status of cluster heads and selects a new cluster head if needed. The query is then disseminated to cluster heads using a modified Bellman-Ford algorithm. Cluster heads aggregate data from relevant sensor nodes and send the result to the base station. This model aims to minimize communication costs during query processing in WSNs.
A Reliable Routing Technique for Wireless Sensor NetworksEditor IJCATR
Wireless Sensor Network (WSN) consists of very large number of sensor nodes which are deployed close to the area which
is to be monitored so as to sense various environmental conditions. WSN is a data-driven network which produces large amount of data
and also sensor nodes are energy-limited devices and their energy consumption is mainly associated with data routing. Therefore it is
necessary to perform redundant data aggregation so as to save energy. In this work data aggregation is achieved with the help of two key
approaches namely Clustering approach and In-network data aggregation. These two approaches help to save energy and thereby
increasing the lifetime of the network. The proposed work has some key features like reliable cluster formation, high data aggregation
rate, priority of packets, minimized overhead, multiple routes, reduced energy consumption which enhance the network lifetime. The
performance evaluation of the proposed approach is carried out using Network Simulator- version 2
A Reliable Routing Technique for Wireless Sensor NetworksEditor IJCATR
Wireless Sensor Network (WSN) consists of very large number of sensor nodes which are deployed close to the area which
is to be monitored so as to sense various environmental conditions. WSN is a data-driven network which produces large amount of data
and also sensor nodes are energy-limited devices and their energy consumption is mainly associated with data routing. Therefore it is
necessary to perform redundant data aggregation so as to save energy. In this work data aggregation is achieved with the help of two key
approaches namely Clustering approach and In-network data aggregation. These two approaches help to save energy and thereby
increasing the lifetime of the network. The proposed work has some key features like reliable cluster formation, high data aggregation
rate, priority of packets, minimized overhead, multiple routes, reduced energy consumption which enhance the network lifetime. The
performance evaluation of the proposed approach is carried out using Network Simulator- version 2.
This document discusses techniques for data dissemination and caching in wireless sensor networks. It aims to reduce energy consumption by minimizing unnecessary data transmission through cooperative caching. Sensor nodes can store data in their local cache or use nearby nodes' caches through cooperative caching. One node close to the sink is selected as the Immediate Dissemination Node to cache data, while other nodes along the path act as dissemination nodes. By caching data closer to the sink, this approach reduces network traffic and prolongs the battery life of sensor nodes. The paper also reviews several routing protocols and discusses how data negotiation, change expectancy, and discarding duplicate data can further improve energy efficiency in wireless sensor networks.
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.
Energy Efficient PEGASIS Routing Protocol in Wireless Sensor NetworkIRJET Journal
This document discusses the PEGASIS routing protocol for wireless sensor networks. It begins with an abstract that introduces PEGASIS as an energy-efficient chain-based hierarchical protocol. It then provides background on wireless sensor networks and discusses challenges like energy efficiency and network lifetime. It explains how PEGASIS forms chains between sensor nodes so that each node only communicates with nearby neighbors, extending network lifetime. The document compares PEGASIS to LEACH, finding that PEGASIS provides more balanced energy distribution and longer network lifetime. It then outlines the PEGASIS algorithm and discusses potential improvements like minimizing delay. Simulation results show PEGASIS increases network efficiency and lifespan over LEACH. The conclusion is that
The document provides an overview of sensor networks, which consist of low-cost, low-power sensor devices that can collect, process, analyze, and disseminate data from various environments. Sensor networks enable information gathering and processing through reliable monitoring using small, wireless sensor nodes. Key challenges for sensor networks include extending the lifetime of the network given limited energy resources and adapting to changing topologies as nodes fail or move. Sensor networks operate using self-organizing, multi-hop wireless connections between nodes that coordinate sensing tasks and route data back to central access points.
Similar to Computational intelligence based data aggregation technique in clustered wsn (20)
Seminar presented by n.m mishra on dt.02 -10-2012TAIWAN
The document discusses the evolution of optical networks to support rich digital media services. It describes how optical networks are advancing to meet the large bandwidth and quality requirements of applications like high-resolution scientific visualization and high-quality consumer video. Specifically, it outlines how optical networks are developing higher speeds, longer transmission distances, and control systems to efficiently deliver high-bandwidth digital media to users.
Presentation date -20-nov-2012 for prof. chenTAIWAN
The paper discusses various techniques for software execution at the transaction level in MPSoC simulations, comparing instruction accurate interpretation, dynamic binary translation, and native execution approaches. It describes how these methods can be integrated into a transaction level modeling environment, noting that native software execution using annotation strategies provides the most accurate performance results at a high simulation speed. The conclusion is that native simulation is best suited for developing upper software layers.
Cluster based wireless sensor network routings ieeeTAIWAN
The document proposes using an artificial bee colony (ABC) algorithm to form clusters in a wireless sensor network (WSN) in order to minimize energy consumption. The ABC algorithm is applied to select cluster heads that are uniformly distributed, unlike in the popular LEACH protocol. Simulation results show the proposed WSNCABC approach extends network lifetime compared to LEACH and direct communication by balancing energy usage across nodes.
Data transformation and query management in personal health sensor networkTAIWAN
The document discusses a method for managing data from personal health sensor networks. It presents an approach for removing outlier sensor values and transforming raw data into an XML format for storage and querying. The method identifies and calibrates outlier values before applying structural enrichment and data transformation steps to process continuous streams of sensor data on heart rate during sporting activities into a format suitable for queries. Experiments show the response time for executing standard queries on the transformed sensor data stored in a database.
On mp so c software execution at the transaction levelTAIWAN
The document discusses various strategies for executing software in transaction-level simulations of multiprocessor systems-on-chip, including instruction interpretation, dynamic binary translation, and native execution on the host machine. It compares the strategies based on speed, accuracy, and development time, finding that native execution provides the most efficient simulation speed while still enabling accurate performance evaluation through annotation strategies. The strategies are then integrated into a transaction-level modeling environment, with native execution found to be best suited for software development layers.
Seminar presented by n.m mishra on dt.02 -10-2012TAIWAN
This document discusses optical network-based digital media services. It covers several topics: the characteristics and recent advancements of optical networks; general requirements for digital media services; using optical networks for high-resolution scientific visualization and high-quality consumer video applications; and conclusions and open research issues. The presentation contains sections on preparatory concepts, optical network characterization, requirements for digital media services, and more.
Computational intelligence based data aggregation technique in clustered wsn
1. Computational Intelligence Based Data
Aggregation Technique in Clustered WSN:
Prospects and Considerations
Muhammad Umar Farooq
Proceedings of the World Congress on Engineering and Computer Science 2012 Vol II
WCECS 2012, October 24-26, 2012, San Francisco, USA
Keywords—Data Aggregation, Computational Intelligence,
Clustering, Wireless Sensor Networks, Routing
Reporter
NILAMADHAB MISHRA
D0121008
2. Contents
• Research Intention
• Preparatory Concept
• WSN network architecture and routing
protocols
• Data aggregation and fusion in WSN
• Data aggregation protocols based on network
architecture
• Computational intelligence and data
aggregation in sensor networks
• Conclusion
2
3. Research Intention
• Data aggregation in wireless sensor networks is a hot research
focus in recent times.
• Data aggregation is defined as the process of aggregating the
data from multiple sensors to eliminate redundant
transmission and provide fused information to the base
station.
• The main goal of data-aggregation algorithms is to gather
and aggregate data in an energy efficient manner so that
network lifetime is enhanced.
• The data aggregation helps to improve the performance of
WSN routing protocol and further improves the overall
performance of the sensor networks.
• Hierarchical network or clustering plays vital role for data
aggregation ,where sensor nodes are divided into groups and
assigned various roles to each group.
3
4. Research Intention
• So better clustering of sensor nodes => better data
aggregation/fusions => better performance in WSN routing =>
better life time of sensor networks or better network
longevity.
• Hence in order to improve the efficiency of data aggregation
technique , the author’s intentions to integrate the
computational intelligence techniques with the conventional
data aggregation techniques for making the solution non-
conventional/non-traditional.
• The computational intelligence techniques comprise artificial
neural computing ,fuzzy computing ,evolutionary computing,
swarm intelligence and their novel integrations.
• Hence should use a novel hybridization of computational
intelligence techniques for effective and efficient data
aggregation.
4
5. Contents
• Research Intention
• Preparatory Concept
• WSN network architecture and routing
protocols
• Data aggregation and fusion in WSN
• Data aggregation protocols based on network
architecture
• Computational intelligence and data
aggregation in sensor networks
• Conclusion
5
6. Preparatory Concept
• A sensor node consists of mainly 3 subsystems as follows.
*sensor subsystem performs sensing function in the area where it is deployed.
*processing subsystem performs obligatory computations at sensor node level.
*communication subsystem disseminates the sensed data across the sensor networks.
• The data dissemination from source to sink Usually requires the transit node
positioning Information either through GPS-free localization or relative localization or
absolute Localization techniques.
6
7. Preparatory Concept
The data aggregation usually involves the fusion of data from multiple sensors at intermediate
nodes and transmission of aggregate data to the sink or base station. The data aggregation
attempts to collect the most critical data from sensors and make it available to the sink in low
latency(potential) and energy efficient manner.
So the data aggregation techniques can be used to combine several correlated data signals
into a smaller set of information that maintains the effective data of the original signals.
7
8. Contents
• Research Intention
• Preparatory Concept
• WSN network architecture and routing
protocols
• Data aggregation and fusion in WSN
• Data aggregation protocols based on network
architecture
• Computational intelligence and data
aggregation in sensor networks
• Conclusion
8
9. WSN network architecture and routing protocols
• The network structures in WSN can be classified as flat
networks, hierarchical networks and location based networks
and deal with routing differently.
• For routing in a flat network, the nodes are same, have same
capabilities and similar tasks.
• In case of hierarchical networks, the sensor nodes are divided
in groups called clusters.
• In case of location based networks, the locations of the
sensor nodes are used in calculating and selecting a route
from source to the destination.
• In a data-centric network, long-term storage (e.g. disk
storage) of the data is also a part of the "network" and may
serve requestors of that data in the future.
9
10. WSN network architecture and routing protocols
• The mobility based networks exploit mobility for data
collection in WSNs. It considers properties of sink mobility as
well as the wireless communication methods for data
transfer:
Mobile base station (MBS)-based solutions:
• An MBS is a mobile sink that changes its position during
operation time. Data generated by sensors are relayed to MBS
without long term buffering.
Mobile data collector (MDC)-based solutions:
• An MDC is a mobile sink that visits sensors. Data are buffered
at source sensors until the MDC visits the sensors and
downloads the information over a single-hop wireless
transmission.
10
12. WSN network architecture and routing protocols
Heterogeneity based networks
• A heterogeneous WSN consists of three types of nodes: sink node, high-
end senor node (NH), and low-end senor node (NL). Each node has the
same communication model and two types of sensor nodes have the same
sensing model. The difference between NH and NL is that the different
pre-defined communication and sensing range.
• Heterogeneous wireless sensor network (heterogeneous WSN) consists of
sensor nodes with different ability, such as different computing power ,
sensing range and communication range.
In wireless sensor networks, cooperative routing protocols have found good
utility. The nodes in a group or cluster send data to cluster head or sink node,
which aggregates data from many nodes and eliminates the redundant data
at this stage, which ultimately enhances the node and network lifetime.
• Cluster based routing protocols work in two levels mostly, cluster heads are
selected in first level and the second level is used for routing.
composition of one round of the clustering process 12
13. WSN network architecture and routing protocols
• Here the author summarized categories of routing protocols for
various sensor networks.
13
14. Contents
• Research Intention
• Preparatory Concept
• WSN network architecture and routing
protocols
• Data aggregation and fusion in WSN
• Data aggregation protocols based on network
architecture
• Computational intelligence and data
aggregation in sensor networks
• Conclusion
14
15. Data aggregation and fusion in WSN
• In Data aggregation/collection process data from sensors in an area is
gathered (for performing fusion) to eliminate redundant data and provide
only the useful fused /integrated information to the base station.
• The sensor nodes send their data to the intermediate nodes for data
aggregation which also normally includes the fusion process and then
transmit the condensed data the base station or sink node.
• The aim of data aggregation is to get the most relevant data from the data
collected by the sensor nodes and make it available to the base station
with minimum energy consumption and also with minimum delay.
• Data aggregation mechanism is an important factor in the energy efficient
sensor network along with network architecture and the underlying
routing protocol.
Data aggregation 15
16. Data aggregation and fusion in WSN
• The Data aggregation techniques include data centric and address centric
routing heuristics. The making of an optimal aggregation tree is NP-hard,
but there exist some sub optimal solutions :
• Center at Nearest Source Data Centric (CNSDC): In CNSDC, the node
closest to the sink acts as the aggregator and the remaining nodes send
their data to that node.
• Shortest Path Tree Data Centric (SPTDC): A SPC is formed and merges the
shortest paths from each source wherever these overlap in an
opportunistic manner.
• Greedy Incremental Tree Data Centric (GITDC): The algorithm starts with
the path from sink to the nearest source, and sequentially adds the next
nearest source to the existing tree.
• Address Centric (AC): In address centric no data aggregation is performed
and all the nodes communicate directly with the sink by using the shortest
paths available.
• Data aggregation has proven to save energy in many network applications.
But data aggregation results in increased delay due to in network
processing, so efficient routing algorithms may be designed to
accommodate for this.
Data aggregation
16
17. Data aggregation and fusion in WSN
• In data fusion at a sensor node ,the data aggregated from multiple nodes is
processed in such a way that the data generated after fusion has reduced the
transmission overhead in the network.
• Various Conventional techniques are used for data
fusion include Kalman filter, Bayesian networks and
Dempster-Shafer .
• The data fusion process includes the collection of data at the fusion node from
other nodes and fusing the sensed data with its own on the basis of pre
decided criterion.
• Data fusion criteria can be voting, probability-based Bayesian model and stack
generalization and the voting scheme can be based on majority voting,
complete agreement and weighted voting.
• After fusion it transmits the data to another node or directly to the base
station. The important considerations in data fusion include the reporting
time, fusion criteria and the data fusion architecture.
Data fusion 17
18. Data aggregation and fusion in WSN
data fusion architecture:-
• In centralized architecture, the fusion process is performed at a central node.
– Advantage: Erroneous report(s) can be easily detected.
– Disadvantage: inflexible to sensor changes and the workload is concentrated at a
single point.
• In decentralized architecture, each node performs data fusion itself and no
gathering of data at a fusion node is required.
– Data fusion occurs locally at each node on the basis of local observations and the
information obtained from neighboring nodes.
– No central processor node.
– Advantage: scalable and tolerant to the addition or loss of sensing nodes or
dynamic changes in the network.
• In hierarchical architecture, the nodes are divided into clusters or levels, and
nodes send their data to the higher level nodes for fusion.
– Nodes are partitioned into hierarchical levels.
– The sensing nodes are at level 0 and the BS at the highest level.
– Reports move from the lower levels to higher ones.
– Advantage: Workload is balanced among nodes
data fusion architecture 18
19. Contents
• Research Intention
• Preparatory Concept
• WSN network architecture and routing
protocols
• Data aggregation and fusion in WSN
• Data aggregation protocols based on network
architecture
• Computational intelligence and data
aggregation in sensor networks
• Conclusion
19
20. Data aggregation protocols based on network architecture
• The architecture of the network influences the performance of the data
aggregation technique being used. The network structures as already
discussed can mainly be divided into Flat networks and hierarchical or cluster
based networks.
20
21. Data aggregation protocols based on network architecture
• The data aggregation techniques designed for flat networks include Push
Diffusion, one phase Pull Diffusion and two phase Pull Diffusion. SPIN (Sensor
Protocols for Information via Negotiation)protocol is the example of push
diffusion, whereas directed diffusion is representative of two phase pull diffusion.
These algorithms improved the performance of the network as compared to
simple flooding in flat networks.
• Hierarchical networks provide the advantages like scalability, energy efficiency
over the flat networks. The hierarchical networks can be divided into different
categories and data aggregation techniques have been proposed for each
category.
The cluster based hierarchical networking and data aggregation protocols for this
category need some unconventional solution from the fields like CI.
LEACH :-LEACH stands for Low-Energy Adaptive Clustering Hierarchy
– The Set-Up Phase
• Where cluster-heads are chosen
– The Steady-State
• The cluster-head is maintained
• When data is transmitted between nodes
21
22. Data aggregation protocols based on network architecture
HEED :- Hybrid Energy Efficient Distributed Clustering
• HEED was designed to select different cluster heads in a field according to the amount of
energy that is distributed in relation to a neighboring node.
• Four primary goals:
– prolonging network life-time by distributing energy consumption
– terminating the clustering process within a constant number of iterations/steps
– minimizing control overhead
– producing well-distributed cluster heads and compact clusters.
CLUDDA :- Clustered Diffusion with Dynamic Data Aggregation
• Generally two main phases involved in this kind of protocols are setup phase and steady state
phase.
• The setup phase involves the organization of the network into clusters and the selection of
cluster heads.
• The steady state phase involves data aggregation at the cluster heads and data transmission
between nodes.
22
23. Contents
• Research Intention
• Preparatory Concept
• WSN network architecture and routing
protocols
• Data aggregation and fusion in WSN
• Data aggregation protocols based on network
architecture
• Computational intelligence and data
aggregation in sensor networks
• Conclusion
23
24. Computational intelligence and data aggregation in sensor networks
• CI is defined as the computational models and tools of intelligence, that
capable of inputting raw numerical sensory data directly, processing them
by exploiting the representational parallelism and pipelining the problem,
generating reliable and timely responses and withstanding high fault
tolerance.
• Here author proposed Data aggregation and fusion techniques based on
computational intelligence for effective fusion of information gathered
from different sensor nodes, the techniques that can adjust automatically.
• many CI paradigms favor the problems of data aggregation and sensor
fusion , those are evolutionary algorithms GA, fuzzy logic and NNs.
• Efficient data aggregation routes have been achieved by GA in a mobile
agent based WSN because of their inherent parallel nature and ability to
deal with difficult real world problems like non-homogeneous, noisy,
incomplete and/or obscured information.
• Particle swarm optimization PSO can be a good alternate to GA because of
PSO' capability to converge quickly to the optimal solutions and to
determine the optimal route paths.
24
25. Computational intelligence and data aggregation in sensor networks
• For fusion process neural networks are well suited because neural
networks can learn and dynamically adapt to the changing scenarios.
• Reinforcement learning is fully distributed and it can adapt quickly to
network topology change or any node failure. It has been used efficiently
for finding the optimal path for data aggregation.
• Fuzzy Logic based distributed approach using fuzzy numbers and weighted
average operators to perform energy efficient flooding-based aggregation.
• In wireless sensor networks many situations demand aggregating data at a
central node e.g. monitoring events. For these situations, the centralized
approaches like neural networks, GA or PSO can be used efficiently to
know the features of the data.
25
26. Contents
• Research Intention
• Preparatory Concept
• WSN network architecture and routing
protocols
• Data aggregation and fusion in WSN
• Data aggregation protocols based on network
architecture
• Computational intelligence and data
aggregation in sensor networks
• Conclusion
26
27. Conclusion
• Due to the several limitations of wireless sensor network, all
CI techniques can not be applied in the field of data
aggregation and data fusion in literature by researchers, as
their characteristics do not suit data aggregation and fusion.
• Data aggregation needs centralized approaches i.e. the data is
gathered at a central node for performing processing and
transmitting results, it results in increased communication
overhead.
• So distributed data aggregation technique under dynamic
communication constraints may be suggested.
• Future research is likely to focus on developing a well founded
analytical approach to distributed multi-sensor data
aggregation and fusion problems where there are time
varying communication bandwidth constraints.
27