In a real application area, the WSN is not a homogeneous network where the nodes are maintained in respective coordinate position relatively same to each other. But rather homogeneous it should be heterogeneous, where the relative positional difference for different nodes are different. In this paper a better scheme is being proposed which will take care of the life time and density of a WSN. Sun et. al. proposed uniform density in WSN by assuming the network as a homogeneous network ,but in this paper without taking a homogeneous network the same problem is being solved by using the Gaussian probability density function. And also the chance of error in receiving the message from the WSN to the base station is minimized by using priori probability algorithm.
NODE FAILURE TIME AND COVERAGE LOSS TIME ANALYSIS FOR MAXIMUM STABILITY VS MI...IJCNCJournal
This document analyzes and compares two algorithms for data gathering in mobile sensor networks:
1) Maximum Stability Spanning Tree-based Data Gathering (Max.Stability-DG) which determines data gathering trees that exist for the longest time by assuming knowledge of future topology changes.
2) Minimum Distance Spanning Tree-based Data Gathering (MST-DG) which determines data gathering trees based on the minimum distance spanning tree at each current time instant.
An exhaustive simulation study is conducted to analyze the impact of these algorithms on node lifetime, network lifetime, and coverage loss time due to node failures in mobile sensor networks.
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Net...IJASCSE
This document proposes a Clustering Based Lifetime Maximizing Aggregation Tree (CLMAT) algorithm for wireless sensor networks. The algorithm aims to reduce energy consumption by creating an aggregation tree that minimizes distance traversed, energy consumed, and cost. It considers the three factors of energy, distance, and cost simultaneously when constructing the tree, unlike previous works. The tree is structured to maximize network lifetime by selecting nodes with higher residual energy as parents where possible. Pseudocode is provided to generate the aggregation tree using clustering by calculating branch and tree energy, distance, and cost at each step to ultimately select the tree with the highest lifetime, lowest energy consumption, distance, and cost.
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
The document summarizes a research paper that proposes an energy efficient approach using an evolutionary algorithm to optimize coverage and connectivity in heterogeneous wireless sensor networks. The approach formulates the problem as a multi-objective optimization involving coverage rate, number of active nodes, and network lifetime. It uses a genetic algorithm and represents solutions as strings encoding sensor node states and ranges. Simulations show the approach improves coverage rate and total energy compared to other algorithms while maintaining connectivity.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Limit energy is a severe bottleneck of wireless sensor networks (WSNs), and limits network lifetime of WSNs. To extend network lifetime, buffer zone has been proposed. Sensors send their data packets to buffer zone. The sensors in buffer zone buffer the data packets. And then the sink visits the buffer zone to collect the data ackets. This leads to that the loads of the sensors in buffer zone are too high and the sensors die quickly. To further extend network lifetime, an algorithm based on dynamic buffer zone has been proposed in this paper. The algorithm divides the whole network area into some areas, and lets all areas act as the buffer zone in turn. And the reasonable times each zone acts as the buffer zone are computed with linear programming. The simulation results have shown that our proposed algorithm notably extends network lifetime.
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection won’t be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
This document summarizes clustering techniques for wireless sensor networks. It discusses how clustering helps improve energy efficiency and network lifetime by organizing nodes into clusters with cluster heads. The document surveys several clustering algorithms, including LEACH, DEEC, SEP, HEED, LCA, LCA2, Max-Min D-Cluster algorithm, and weighted clustering algorithms like WCA. It describes how these algorithms elect cluster heads and organize nodes into clusters using different metrics and probabilities based on remaining energy levels or node connectivity. The document concludes that clustering is a key technique for extending network lifetime in wireless sensor networks.
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
This document describes a new clustering protocol called WDDC (Weighted Dynamic Distributed Clustering) for heterogeneous wireless sensor networks. WDDC selects cluster heads based on the ratio of a node's residual energy to the average network energy, and also considers the distance between nodes and the base station. WDDC divides the network lifetime into two zones and changes its behavior dynamically between the zones. Simulation results show WDDC outperforms other clustering protocols like SEP and DEEC in terms of energy efficiency and extending network lifetime.
NODE FAILURE TIME AND COVERAGE LOSS TIME ANALYSIS FOR MAXIMUM STABILITY VS MI...IJCNCJournal
This document analyzes and compares two algorithms for data gathering in mobile sensor networks:
1) Maximum Stability Spanning Tree-based Data Gathering (Max.Stability-DG) which determines data gathering trees that exist for the longest time by assuming knowledge of future topology changes.
2) Minimum Distance Spanning Tree-based Data Gathering (MST-DG) which determines data gathering trees based on the minimum distance spanning tree at each current time instant.
An exhaustive simulation study is conducted to analyze the impact of these algorithms on node lifetime, network lifetime, and coverage loss time due to node failures in mobile sensor networks.
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Net...IJASCSE
This document proposes a Clustering Based Lifetime Maximizing Aggregation Tree (CLMAT) algorithm for wireless sensor networks. The algorithm aims to reduce energy consumption by creating an aggregation tree that minimizes distance traversed, energy consumed, and cost. It considers the three factors of energy, distance, and cost simultaneously when constructing the tree, unlike previous works. The tree is structured to maximize network lifetime by selecting nodes with higher residual energy as parents where possible. Pseudocode is provided to generate the aggregation tree using clustering by calculating branch and tree energy, distance, and cost at each step to ultimately select the tree with the highest lifetime, lowest energy consumption, distance, and cost.
Energy efficient approach based on evolutionary algorithm for coverage contro...ijcseit
The document summarizes a research paper that proposes an energy efficient approach using an evolutionary algorithm to optimize coverage and connectivity in heterogeneous wireless sensor networks. The approach formulates the problem as a multi-objective optimization involving coverage rate, number of active nodes, and network lifetime. It uses a genetic algorithm and represents solutions as strings encoding sensor node states and ranges. Simulations show the approach improves coverage rate and total energy compared to other algorithms while maintaining connectivity.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Limit energy is a severe bottleneck of wireless sensor networks (WSNs), and limits network lifetime of WSNs. To extend network lifetime, buffer zone has been proposed. Sensors send their data packets to buffer zone. The sensors in buffer zone buffer the data packets. And then the sink visits the buffer zone to collect the data ackets. This leads to that the loads of the sensors in buffer zone are too high and the sensors die quickly. To further extend network lifetime, an algorithm based on dynamic buffer zone has been proposed in this paper. The algorithm divides the whole network area into some areas, and lets all areas act as the buffer zone in turn. And the reasonable times each zone acts as the buffer zone are computed with linear programming. The simulation results have shown that our proposed algorithm notably extends network lifetime.
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection won’t be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
This document summarizes clustering techniques for wireless sensor networks. It discusses how clustering helps improve energy efficiency and network lifetime by organizing nodes into clusters with cluster heads. The document surveys several clustering algorithms, including LEACH, DEEC, SEP, HEED, LCA, LCA2, Max-Min D-Cluster algorithm, and weighted clustering algorithms like WCA. It describes how these algorithms elect cluster heads and organize nodes into clusters using different metrics and probabilities based on remaining energy levels or node connectivity. The document concludes that clustering is a key technique for extending network lifetime in wireless sensor networks.
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
This document describes a new clustering protocol called WDDC (Weighted Dynamic Distributed Clustering) for heterogeneous wireless sensor networks. WDDC selects cluster heads based on the ratio of a node's residual energy to the average network energy, and also considers the distance between nodes and the base station. WDDC divides the network lifetime into two zones and changes its behavior dynamically between the zones. Simulation results show WDDC outperforms other clustering protocols like SEP and DEEC in terms of energy efficiency and extending network lifetime.
VIRTUAL ARCHITECTURE AND ENERGYEFFICIENT ROUTING PROTOCOLS FOR 3D WIRELESS SE...ijwmn
This paper proposes a virtual architecture for three-dimensional (3D) wireless sensor networks (WSNs), a dynamic coordinate system, and a scalable energy-efficient training protocol for collections of nodes deployed in the space that are initially anonymous, asynchronous, and unaware of their initial location. The 3D WSNs considered comprise massively deployed tiny energy-constrained commodity sensors and one or more sink nodes that provide an interface to the outside world. The proposed architecture is a generalization of a two-dimensional virtual architecture previously proposed in the literature, in which a flexible and intuitive coordinate system is imposed onto the deployment area and the anonymous nodes are partitioned into clusters where data can be gathered from the environment and synthesized under local control. The architecture solves the hidden sensors problem that occurs because of irregularities in rugged deployment areas or environments containing buildings by training the network of nodes arbitrarily dispersed in the 3D space. In addition, we derive two simple and energy-efficient routing protocols, respectively for dense and sparse networks, based on the proposed dynamic coordinate system. They are used to minimize the power expended in collecting and routing data to the sink node, thus increasing the lifetime of the network.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
A study of localized algorithm for self organized wireless sensor network and...eSAT 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.
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.
Erca energy efficient routing and reclusteringaciijournal
The pervasive application of wireless sensor networks (WNSs) is challenged by the scarce energy constraints of sensor nodes. En-route filtering schemes, especially commutative cipher based en-route filtering (CCEF) can saves energy with better filtering capacity. However, this approach suffer from fixed paths and inefficient underlying routing designed for ad-hoc networks. Moreover, with decrease in remaining sensor nodes, the probability of network partition increases. In this paper, we propose energy-efficient routing and re-clustering algorithm (ERCA) to address these limitations. In proposed scheme with reduction in the number of sensor nodes to certain thresh-hold the cluster size and transmission range dynamically maintain cluster node-density. Performance results show that our approach demonstrate filtering-power, better energy-efficiency, and an average gain over 285% in network lifetime.
An implementation of recovery algorithm for fault nodes in a wireless sensor ...eSAT 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
Survey Paper on Clustering Data Streams Based on Shared Density between Micro...IRJET Journal
This document discusses a survey of clustering data streams based on shared density between micro-clusters. It describes how current reclustering approaches for data stream clustering ignore density information between micro-clusters, which can result in inaccurate cluster assignments. The paper proposes DBSTREAM, a new approach that captures shared density between micro-clusters using a density graph. This density information is then used in the reclustering process to generate final clusters based on actual density between adjacent micro-clusters rather than assumptions about data distribution.
1) The document proposes a three-tier architecture for wireless sensor networks using a genetic algorithm based hierarchical cooperative technique (GAHCT) to select cluster heads and super heads.
2) GAHCT uses factors like residual energy, bandwidth, and memory capacity to select cluster heads in the first tier, super heads in the third tier, with cluster slaves making up the second tier.
3) Simulation results show that GAHCT improves network lifetime and reduces total energy consumption compared to single-tier and two-tier architectures by creating a more efficient network topology.
Energy Efficient Multipath Data Fusion Technique for Wireless Sensor NetworksIDES Editor
In wireless sensor networks (WSN), data fusion
should be energy efficient. But, determining the optimal
number of aggregators in an energy efficient manner is a
challenging task. Moreover, the existing data fusion
techniques mostly use the same path for transmitting
aggregated data to the sink which reduces the nodes lifetime.
In this paper, we propose a technique which combines energy
efficiency and multiple path selection for data fusion in WSN.
The network is partitioned into various clusters and the node
with highest residual energy is selected as the cluster head.
The sink computes multiple paths to each cluster head for
data transmission. The distributed source coding and the
lifting scheme wavelet transform are used for compressing
the data at the CH. During each round of transmission, the
path is changed in a round robin manner, to conserve the
energy. This process is repeated for each cluster. From our
simulation results we show that this data fusion technique
has less energy consumption with increased packet delivery
ratio, when compared with the existing schemes.
This document compares the k-means and grid density clustering algorithms. K-means partitions data into k clusters based on minimizing distances between points and cluster centroids. It works well with numerical data but can be affected by outliers. Grid density determines dense grids based on neighbor densities and can handle different shaped and multi-density clusters without knowing the number of clusters beforehand. It has advantages over k-means in that it can handle categorical data, noise and arbitrary shaped clusters.
Protected Data Collection In WSN by Filtering Attackers Influence (Published ...sangasandeep
This document discusses secure data aggregation in wireless sensor networks. It presents three approaches to secure data aggregation: hop-by-hop encryption, end-to-end encryption, and privacy homomorphism. A general framework is also proposed that uses clustering to perform secure and energy-efficient data aggregation across sensor nodes. The framework applies end-to-end symmetric cryptography using privacy homomorphism to encrypt data before sending it to cluster heads. This helps prevent attackers from accessing plaintext sensor data during transmission and aggregation.
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.
As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI) values of the anchor node beacons are used. The number of anchor nodes and their configurations has an impact on the accuracy of the localization system, which is also addressed in this paper. Five different training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance of the proposed method in real time, the model obtained was then implemented on the Arduino microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved with a 12-12-2 neural network structure. The proposed method can also be implemented on any other embedded microcontroller system.
ENERGY EFFICIENT APPROACH BASED ON EVOLUTIONARY ALGORITHM FOR COVERAGE CONTRO...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this paper, we address the problem of network coverage and connectivity and propose an energy efficient approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the sensor nodes can have different sensing ranges and transmission ranges .The proposed algorithm is simulated and it' efficiency
is demonstrated via different experiments.
This document discusses approaches to improve reliability in wireless sensor networks. It proposes a dynamic sectoring scheme where the network area is divided into sectors with a sensor node assigned as sector head for each. When an event occurs, only that sector is activated, reducing congestion and energy use. This is expected to enhance packet delivery ratio and reduce losses. Prior work on using data fusion and opportunistic flooding algorithms to improve reliability is also reviewed. The dynamic sectoring approach aims to reliably transmit data with low congestion and energy usage.
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
5.a robust frame of wsn utilizing localization technique 36-46Alexander Decker
This document discusses localization techniques for wireless sensor networks. It begins by defining localization as identifying a sensor node's position and explains that localization is a fundamental challenge for wireless sensor networks. It then describes two main categories of localization techniques: range-based and range-free. Range-based techniques use distance or angle measurements between nodes to determine positions but require expensive hardware. Range-free techniques estimate positions based on neighboring node information and are less expensive but less accurate. The document reviews several specific localization algorithms from previous research and discusses their advantages and limitations.
11.0005www.iiste.org call for paper.a robust frame of wsn utilizing localizat...Alexander Decker
This document discusses localization techniques for wireless sensor networks. It begins by defining localization as identifying a sensor node's position and explains how accuracy is important. It then describes two main categories of localization techniques: range-based and range-free. Range-based uses distance or angle measurements between nodes for higher accuracy but requires expensive hardware. Range-free relies on information from nearby nodes and is less accurate but cheaper. The document reviews several specific localization algorithms from previous research and their limitations. It concludes by stating that energy efficiency is critical for wireless sensor networks due to limited battery life.
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.
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
Optimal sensor deployment is necessary condition in homogeneous and heterogeneous wireless sensor
network. Effective deployment of sensor nodes is a major point of concern as performance and lifetime of any
WSN. Proposed sensor deployment in WSN explore every sensor node sends its data to the nearest sink node
of the WSN. In addition to that system proposes a hexagonal cell based sensor deployment which leads to
optimal sensor deployment for both homogeneous and heterogeneous sensor deployment. Wireless sensor
networks are receiving significant concentration due to their potential applications ranging from surveillance
to tracking domains. In limited communication range, a WSN is divided into several disconnected sub-graphs
under certain conditions. We deploy sensor nodes at random locations so that it improves performance of the
network.This paper aims to study, discuss and analyze various node deployment strategies and coverage
problems for Homogeneous and Heterogeneous WSN.
VIRTUAL ARCHITECTURE AND ENERGYEFFICIENT ROUTING PROTOCOLS FOR 3D WIRELESS SE...ijwmn
This paper proposes a virtual architecture for three-dimensional (3D) wireless sensor networks (WSNs), a dynamic coordinate system, and a scalable energy-efficient training protocol for collections of nodes deployed in the space that are initially anonymous, asynchronous, and unaware of their initial location. The 3D WSNs considered comprise massively deployed tiny energy-constrained commodity sensors and one or more sink nodes that provide an interface to the outside world. The proposed architecture is a generalization of a two-dimensional virtual architecture previously proposed in the literature, in which a flexible and intuitive coordinate system is imposed onto the deployment area and the anonymous nodes are partitioned into clusters where data can be gathered from the environment and synthesized under local control. The architecture solves the hidden sensors problem that occurs because of irregularities in rugged deployment areas or environments containing buildings by training the network of nodes arbitrarily dispersed in the 3D space. In addition, we derive two simple and energy-efficient routing protocols, respectively for dense and sparse networks, based on the proposed dynamic coordinate system. They are used to minimize the power expended in collecting and routing data to the sink node, thus increasing the lifetime of the network.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
Maximizing Lifetime of Homogeneous Wireless Sensor Network through Energy Eff...CSCJournals
The objective of this paper is to develop a mechanism to increase the lifetime of homogeneous wireless sensor networks (WSNs) through minimizing long range communication, efficient data delivery and energy balancing. Energy efficiency is a very important issue for sensor nodes which affects the lifetime of sensor networks. To achieve energy balancing and maximizing network lifetime we divided the whole network into different clusters. In cluster based architecture, the role of aggregator node is very crucial because of extra processing and long range communication. Once the aggregator node becomes non functional, it affects the whole cluster. We introduced a candidate cluster head node on the basis of node density. We proposed a modified cluster based WSN architecture by introducing a server node (SN) that is rich in terms of resources. This server node (SN) takes the responsibility of transmitting data to the base station over longer distances from the cluster head. We proposed cluster head selection algorithm based on residual energy, distance, reliability and degree of mobility. The proposed method can save overall energy consumption and extend the lifetime of the sensor network and also addresses robustness against even/uneven node deployment.
A study of localized algorithm for self organized wireless sensor network and...eSAT 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.
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.
Erca energy efficient routing and reclusteringaciijournal
The pervasive application of wireless sensor networks (WNSs) is challenged by the scarce energy constraints of sensor nodes. En-route filtering schemes, especially commutative cipher based en-route filtering (CCEF) can saves energy with better filtering capacity. However, this approach suffer from fixed paths and inefficient underlying routing designed for ad-hoc networks. Moreover, with decrease in remaining sensor nodes, the probability of network partition increases. In this paper, we propose energy-efficient routing and re-clustering algorithm (ERCA) to address these limitations. In proposed scheme with reduction in the number of sensor nodes to certain thresh-hold the cluster size and transmission range dynamically maintain cluster node-density. Performance results show that our approach demonstrate filtering-power, better energy-efficiency, and an average gain over 285% in network lifetime.
An implementation of recovery algorithm for fault nodes in a wireless sensor ...eSAT 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
Survey Paper on Clustering Data Streams Based on Shared Density between Micro...IRJET Journal
This document discusses a survey of clustering data streams based on shared density between micro-clusters. It describes how current reclustering approaches for data stream clustering ignore density information between micro-clusters, which can result in inaccurate cluster assignments. The paper proposes DBSTREAM, a new approach that captures shared density between micro-clusters using a density graph. This density information is then used in the reclustering process to generate final clusters based on actual density between adjacent micro-clusters rather than assumptions about data distribution.
1) The document proposes a three-tier architecture for wireless sensor networks using a genetic algorithm based hierarchical cooperative technique (GAHCT) to select cluster heads and super heads.
2) GAHCT uses factors like residual energy, bandwidth, and memory capacity to select cluster heads in the first tier, super heads in the third tier, with cluster slaves making up the second tier.
3) Simulation results show that GAHCT improves network lifetime and reduces total energy consumption compared to single-tier and two-tier architectures by creating a more efficient network topology.
Energy Efficient Multipath Data Fusion Technique for Wireless Sensor NetworksIDES Editor
In wireless sensor networks (WSN), data fusion
should be energy efficient. But, determining the optimal
number of aggregators in an energy efficient manner is a
challenging task. Moreover, the existing data fusion
techniques mostly use the same path for transmitting
aggregated data to the sink which reduces the nodes lifetime.
In this paper, we propose a technique which combines energy
efficiency and multiple path selection for data fusion in WSN.
The network is partitioned into various clusters and the node
with highest residual energy is selected as the cluster head.
The sink computes multiple paths to each cluster head for
data transmission. The distributed source coding and the
lifting scheme wavelet transform are used for compressing
the data at the CH. During each round of transmission, the
path is changed in a round robin manner, to conserve the
energy. This process is repeated for each cluster. From our
simulation results we show that this data fusion technique
has less energy consumption with increased packet delivery
ratio, when compared with the existing schemes.
This document compares the k-means and grid density clustering algorithms. K-means partitions data into k clusters based on minimizing distances between points and cluster centroids. It works well with numerical data but can be affected by outliers. Grid density determines dense grids based on neighbor densities and can handle different shaped and multi-density clusters without knowing the number of clusters beforehand. It has advantages over k-means in that it can handle categorical data, noise and arbitrary shaped clusters.
Protected Data Collection In WSN by Filtering Attackers Influence (Published ...sangasandeep
This document discusses secure data aggregation in wireless sensor networks. It presents three approaches to secure data aggregation: hop-by-hop encryption, end-to-end encryption, and privacy homomorphism. A general framework is also proposed that uses clustering to perform secure and energy-efficient data aggregation across sensor nodes. The framework applies end-to-end symmetric cryptography using privacy homomorphism to encrypt data before sending it to cluster heads. This helps prevent attackers from accessing plaintext sensor data during transmission and aggregation.
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.
As Wireless Sensor Networks are penetrating into the industrial domain, many research opportunities are emerging. One such essential and challenging application is that of node localization. A feed-forward neural network based methodology is adopted in this paper. The Received Signal Strength Indicator (RSSI) values of the anchor node beacons are used. The number of anchor nodes and their configurations has an impact on the accuracy of the localization system, which is also addressed in this paper. Five different training algorithms are evaluated to find the training algorithm that gives the best result. The multi-layer Perceptron (MLP) neural network model was trained using Matlab. In order to evaluate the performance of the proposed method in real time, the model obtained was then implemented on the Arduino microcontroller. With four anchor nodes, an average 2D localization error of 0.2953 m has been achieved with a 12-12-2 neural network structure. The proposed method can also be implemented on any other embedded microcontroller system.
ENERGY EFFICIENT APPROACH BASED ON EVOLUTIONARY ALGORITHM FOR COVERAGE CONTRO...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this
paper, we address the problem of network coverage and connectivity and propose an energy efficient
approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the
sensor nodes can have different sensing ranges and transmission ranges. The proposed algorithm is
simulated and it' efficiency is demonstrated via different experiments.
International Journal of Computer Science, Engineering and Information Techno...ijcseit
Coverage and connectivity are two important requirements in Wireless Sensor Networks (WSNs). In this paper, we address the problem of network coverage and connectivity and propose an energy efficient approach based on genetic evolutionary algorithm for maintaining coverage and connectivity where the sensor nodes can have different sensing ranges and transmission ranges .The proposed algorithm is simulated and it' efficiency
is demonstrated via different experiments.
This document discusses approaches to improve reliability in wireless sensor networks. It proposes a dynamic sectoring scheme where the network area is divided into sectors with a sensor node assigned as sector head for each. When an event occurs, only that sector is activated, reducing congestion and energy use. This is expected to enhance packet delivery ratio and reduce losses. Prior work on using data fusion and opportunistic flooding algorithms to improve reliability is also reviewed. The dynamic sectoring approach aims to reliably transmit data with low congestion and energy usage.
CODE AWARE DYNAMIC SOURCE ROUTING FOR DISTRIBUTED SENSOR NETWORKIJNSA Journal
Sensor network facilitates monitoring and controlling of physical environments. These wireless networks consist of dense collection of sensors capable of collection and dissemination of data. They have application in variety of fields such as military purposes, environment monitoring etc. Typical deployment of sensor network assumes central processing station or a gateway to which all other nodes route their data using dynamic source routing (DSR). This causes congestion at central station and thus reduces the efficiency of the network. In this work we will propose a better dynamic source routing technique using network coding to reduce total number of transmission in sensor networks resulting in better efficiency.
5.a robust frame of wsn utilizing localization technique 36-46Alexander Decker
This document discusses localization techniques for wireless sensor networks. It begins by defining localization as identifying a sensor node's position and explains that localization is a fundamental challenge for wireless sensor networks. It then describes two main categories of localization techniques: range-based and range-free. Range-based techniques use distance or angle measurements between nodes to determine positions but require expensive hardware. Range-free techniques estimate positions based on neighboring node information and are less expensive but less accurate. The document reviews several specific localization algorithms from previous research and discusses their advantages and limitations.
11.0005www.iiste.org call for paper.a robust frame of wsn utilizing localizat...Alexander Decker
This document discusses localization techniques for wireless sensor networks. It begins by defining localization as identifying a sensor node's position and explains how accuracy is important. It then describes two main categories of localization techniques: range-based and range-free. Range-based uses distance or angle measurements between nodes for higher accuracy but requires expensive hardware. Range-free relies on information from nearby nodes and is less accurate but cheaper. The document reviews several specific localization algorithms from previous research and their limitations. It concludes by stating that energy efficiency is critical for wireless sensor networks due to limited battery life.
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.
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
Optimal sensor deployment is necessary condition in homogeneous and heterogeneous wireless sensor
network. Effective deployment of sensor nodes is a major point of concern as performance and lifetime of any
WSN. Proposed sensor deployment in WSN explore every sensor node sends its data to the nearest sink node
of the WSN. In addition to that system proposes a hexagonal cell based sensor deployment which leads to
optimal sensor deployment for both homogeneous and heterogeneous sensor deployment. Wireless sensor
networks are receiving significant concentration due to their potential applications ranging from surveillance
to tracking domains. In limited communication range, a WSN is divided into several disconnected sub-graphs
under certain conditions. We deploy sensor nodes at random locations so that it improves performance of the
network.This paper aims to study, discuss and analyze various node deployment strategies and coverage
problems for Homogeneous and Heterogeneous WSN.
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.
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksIJMER
This document summarizes an article about optimizing set coverage problems in wireless sensor networks. It discusses the following key points:
1) Wireless sensor networks aim to maximize network lifetime by scheduling sensors to alternate between active and sleep modes or adjusting transmission ranges. The optimize set coverage (OSC) problem aims to find a maximum number of set covers where each active sensor is connected to the base station.
2) The OSC problem is proved to be NP-complete. Integer programming and linear programming models are proposed to formulate the OSC problem.
3) Greedy-based heuristics are presented for solving the OSC problem in a centralized and distributed manner. Simulations are used to validate the performance of
Energy Efficient Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
This document summarizes a research paper that proposes using network coding to improve the efficiency of dynamic source routing in wireless sensor networks. The paper describes how typical sensor networks rely on a central processing station that causes congestion. It then discusses network coding and how it allows intermediate nodes to encode packets before forwarding. The paper proposes a scheme where some sensor nodes act as aggregators that apply network coding on received packets from neighboring sensors if the data is significantly different. Simulation results show this approach reduces total transmissions for networks with up to 75 nodes, improving efficiency, but performance degrades for larger networks potentially due to increased collisions.
Single Sink Repositioning Technique in Wireless Sensor Networks for Network L...IRJET Journal
This document presents a technique called single sink repositioning to extend the lifetime of wireless sensor networks. Sensor nodes have limited battery power, so energy consumption must be managed carefully. In typical static sink networks, nodes farther from the sink expend more energy transmitting data and drain their batteries quicker, shortening network lifetime. The proposed approach tracks the distance of each node to the sink and calculates an optimal sink position to minimize distances. It simulates moving the sink to this position using an algorithm in NS-2. Simulation results show repositioning the sink achieves significant energy savings compared to static sinks, helping improve overall network lifetime.
Spatial Correlation Based Medium Access Control Protocol Using DSR & AODV Rou...IOSR Journals
The document summarizes a proposed spatial correlation-based medium access control protocol for wireless sensor networks that aims to improve energy efficiency. It discusses how sensor nodes are spatially distributed and correlated in detecting events. An iterative node selection algorithm is used to select a minimum set of representative sensor nodes based on a distortion constraint, in order to reduce redundant transmissions. The protocol uses vector quantization to calculate distances between nodes and a mobile element. It then evaluates the performance of using the DSR and AODV routing protocols with this spatial correlation-based MAC protocol in terms of energy consumption and packet drop ratio through simulations. The simulation results show that the protocol with AODV routing performs better than with DSR routing.
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...ijsrd.com
In Wireless Sensor Network (WSNs), gather the data by using mobile sinks has become popular. Reduce the number of messages which is used for sink location broadcasting, efficient energy data forwarding, become accustomed to unknown earthly changes are achieved by a protocol which is projected by a SinkTrail. The forecast of mobile sinks’ location are done by using logical coordinate system. When sensor nodes don’t have any data to send, at that time they switch to sleep mode to save the energy and to increase the network lifetime. And due to this reason there is a chance of the involvement of nodes that are in sleeping state between the path sources to the mobile sink which is selected by the SinkTrail protocol. Before become the fully functional and process the information, these sleeping nodes can drop the some information. Due to this reason, it is vital to wake-up the sleeping nodes on the path earlier than the sender can start transferring of sensed data. In this paper, on-demand wake-up scheduling algorithm is projected which is used to activates sleeping node on the path before data delivery. Here, in this work the multi-hop communication in WSN also considers. By incorporating wake-up scheduling algorithm to perk up the dependability and improve the performance of on-demand data forwarding extends the SinkTrail solution in our work. This projected algorithm improves the quality of service of the network by dishonesty of data or reducing the loss due to sleeping nodes. The efficiency and the effectiveness projected solution are proved by the evaluation results.
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.
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) around events, where accuracy is high, and a Default Synchronization Subset (DSS) where accuracy is low to preserve energy. An authentication-based security mechanism is used to securely transmit packets. Simulation results show the technique accurately records event occurrence times while maintaining network lifetime through efficient energy usage.
Spatial correlation based clustering algorithm for random and uniform topolog...eSAT 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
Similar to MAINTAINING UNIFORM DENSITY AND MINIMIZING THE CHANCE OF ERROR IN A LARGE SCALE WSN (20)
Mechatronics is a multidisciplinary field that refers to the skill sets needed in the contemporary, advanced automated manufacturing industry. At the intersection of mechanics, electronics, and computing, mechatronics specialists create simpler, smarter systems. Mechatronics is an essential foundation for the expected growth in automation and manufacturing.
Mechatronics deals with robotics, control systems, and electro-mechanical systems.
Open Channel Flow: fluid flow with a free surfaceIndrajeet sahu
Open Channel Flow: This topic focuses on fluid flow with a free surface, such as in rivers, canals, and drainage ditches. Key concepts include the classification of flow types (steady vs. unsteady, uniform vs. non-uniform), hydraulic radius, flow resistance, Manning's equation, critical flow conditions, and energy and momentum principles. It also covers flow measurement techniques, gradually varied flow analysis, and the design of open channels. Understanding these principles is vital for effective water resource management and engineering applications.
Discover the latest insights on Data Driven Maintenance with our comprehensive webinar presentation. Learn about traditional maintenance challenges, the right approach to utilizing data, and the benefits of adopting a Data Driven Maintenance strategy. Explore real-world examples, industry best practices, and innovative solutions like FMECA and the D3M model. This presentation, led by expert Jules Oudmans, is essential for asset owners looking to optimize their maintenance processes and leverage digital technologies for improved efficiency and performance. Download now to stay ahead in the evolving maintenance landscape.
Software Engineering and Project Management - Software Testing + Agile Method...Prakhyath Rai
Software Testing: A Strategic Approach to Software Testing, Strategic Issues, Test Strategies for Conventional Software, Test Strategies for Object -Oriented Software, Validation Testing, System Testing, The Art of Debugging.
Agile Methodology: Before Agile – Waterfall, Agile Development.
Height and depth gauge linear metrology.pdfq30122000
Height gauges may also be used to measure the height of an object by using the underside of the scriber as the datum. The datum may be permanently fixed or the height gauge may have provision to adjust the scale, this is done by sliding the scale vertically along the body of the height gauge by turning a fine feed screw at the top of the gauge; then with the scriber set to the same level as the base, the scale can be matched to it. This adjustment allows different scribers or probes to be used, as well as adjusting for any errors in a damaged or resharpened probe.
Prediction of Electrical Energy Efficiency Using Information on Consumer's Ac...PriyankaKilaniya
Energy efficiency has been important since the latter part of the last century. The main object of this survey is to determine the energy efficiency knowledge among consumers. Two separate districts in Bangladesh are selected to conduct the survey on households and showrooms about the energy and seller also. The survey uses the data to find some regression equations from which it is easy to predict energy efficiency knowledge. The data is analyzed and calculated based on five important criteria. The initial target was to find some factors that help predict a person's energy efficiency knowledge. From the survey, it is found that the energy efficiency awareness among the people of our country is very low. Relationships between household energy use behaviors are estimated using a unique dataset of about 40 households and 20 showrooms in Bangladesh's Chapainawabganj and Bagerhat districts. Knowledge of energy consumption and energy efficiency technology options is found to be associated with household use of energy conservation practices. Household characteristics also influence household energy use behavior. Younger household cohorts are more likely to adopt energy-efficient technologies and energy conservation practices and place primary importance on energy saving for environmental reasons. Education also influences attitudes toward energy conservation in Bangladesh. Low-education households indicate they primarily save electricity for the environment while high-education households indicate they are motivated by environmental concerns.
Blood finder application project report (1).pdfKamal Acharya
Blood Finder is an emergency time app where a user can search for the blood banks as
well as the registered blood donors around Mumbai. This application also provide an
opportunity for the user of this application to become a registered donor for this user have
to enroll for the donor request from the application itself. If the admin wish to make user
a registered donor, with some of the formalities with the organization it can be done.
Specialization of this application is that the user will not have to register on sign-in for
searching the blood banks and blood donors it can be just done by installing the
application to the mobile.
The purpose of making this application is to save the user’s time for searching blood of
needed blood group during the time of the emergency.
This is an android application developed in Java and XML with the connectivity of
SQLite database. This application will provide most of basic functionality required for an
emergency time application. All the details of Blood banks and Blood donors are stored
in the database i.e. SQLite.
This application allowed the user to get all the information regarding blood banks and
blood donors such as Name, Number, Address, Blood Group, rather than searching it on
the different websites and wasting the precious time. This application is effective and
user friendly.
Tools & Techniques for Commissioning and Maintaining PV Systems W-Animations ...Transcat
Join us for this solutions-based webinar on the tools and techniques for commissioning and maintaining PV Systems. In this session, we'll review the process of building and maintaining a solar array, starting with installation and commissioning, then reviewing operations and maintenance of the system. This course will review insulation resistance testing, I-V curve testing, earth-bond continuity, ground resistance testing, performance tests, visual inspections, ground and arc fault testing procedures, and power quality analysis.
Fluke Solar Application Specialist Will White is presenting on this engaging topic:
Will has worked in the renewable energy industry since 2005, first as an installer for a small east coast solar integrator before adding sales, design, and project management to his skillset. In 2022, Will joined Fluke as a solar application specialist, where he supports their renewable energy testing equipment like IV-curve tracers, electrical meters, and thermal imaging cameras. Experienced in wind power, solar thermal, energy storage, and all scales of PV, Will has primarily focused on residential and small commercial systems. He is passionate about implementing high-quality, code-compliant installation techniques.
MAINTAINING UNIFORM DENSITY AND MINIMIZING THE CHANCE OF ERROR IN A LARGE SCALE WSN
1. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
DOI : 10.5121/ijnsa.2011.3307 98
MAINTAINING UNIFORM DENSITY AND
MINIMIZING THE CHANCE OF ERROR IN A LARGE
SCALE WSN
Asis Kumar Tripathy1
,Shradhananda Beura2
,Muralidhar Behera3
and Gunanidhi
Pradhan4
1,2,3Department of Computer Science and Engineering, NM Institute of Engineering and Technology, Bhubaneswar,Odisha,India
{1
asistripathy,2
beura.shradhananda,3
behera.muralidhar}@gmail.com
4Govt. college of Engineering, Kalahandi, Odisha,India
4
gunanidhipradhan@gmail.com
ABSTRACT
In a real application area, the WSN is not a homogeneous network where the nodes are maintained in
respective coordinate position relatively same to each other. But rather homogeneous it should be
heterogeneous, where the relative positional difference for different nodes are different. In this paper a
better scheme is being proposed which will take care of the life time and density of a WSN. Sun et. al.
proposed uniform density in WSN by assuming the network as a homogeneous network ,but in this paper
without taking a homogeneous network the same problem is being solved by using the Gaussian
probability density function. And also the chance of error in receiving the message from the WSN to the
base station is minimized by using priori probability algorithm.
KEYWORDS
WSN, Network density, life time, priori probability
1. INTRODUCTION
Sensor networks are composed of small electronic devices, the sensors that monitor areas,
objects, animals, persons or sense temperature, humidity, the presence of acoustic or seismic
waves etc. in a given area of interest. WSN can be used for remote monitoring and object
tracking in different environments and for a wide range of applications. Thus recent advances
in computing hardware and software are responsible for the emergence of sensor networks
capable of observing the environment, processing the data and making decisions based on the
environment, detect and locate specific events and track targets over a specific regions. Thus a
sensor network is defined as being composed of a large number of nodes which are deployed
densely in close proximity to the phenomenon to be monitored. Each of these nodes collect
data and its purpose is to route this information back to a sink. Most previous papers
concentrate in homogeneous WSN in many application areas. But practically in many areas
homogeneous WSN deployment is not possible. That is the network is to be deployed can be
heterogeneous WSN. So, in heterogeneous network the network density over a deployed area
may not be uniform. Because in a specified area the position of deployed sensor nodes cannot
be maintained in the homogeneous coordinate separation. That is the area covered by the each
sensor node’s signal is not uniform for the entire deployed sensor node due to the positional
2. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
99
difference is different for every adjacent sensor nodes out of all nodes in WSN. This is one
constraint for heterogeneous WSN in real application field.
Another constraint in WSN is the definition of transmitted message from the nodes t the sink
node, last to the processing device may not be error free due to the attenuation caused by
environment in any intentional man made. That is if noise is added to the message during
transmission then the message which has been sent from the WSN to the receiver may not be
identified as the correct message successfully, due to the addition of noise during transaction
period which leads receiving and processing of an erroneous message and the actual sensing
event cannot be predicted though it has been censored by the WSN. That’s why an algorithm
should be developed which can be supported by a specific device and can receive and identify
the same message which has been transmitted. This can be done by likelihood probability
method called port priori algorithm in which the message received is error free.
2. RELATED WORK
Sun et. Al’s proposed scheme is based on the homogeneous WSN, where different nodes are
deployed with in a predetermined area and the sink node is placed at the coordinate (0,0) of that
specified area of the WSN[16]. This paper concentrates on different energy consumption in the
network, when the network density is uniform. i.e. the information detected will be forwarded
to the sink node so that the energy of the nodes which are closed to the sink will be burnt faster.
Once these nodes died, the life time is over the energy of the nodes that are far away from the
sink node will be watched, which is inefficient. The waste of energy will be concentrated on
this paper to leave nearly no energy when life time comes to its limit, thus makes the network
provide service oriented.
The lifetime limits of WSN with and without aggregation have been taken into consideration by
Manish Bhardwaj, Anantha P. and Chandrakasan, which gives us the feasibility to do some
further work on lifetime[2,4]. After that, a lot of work has been carried out to deal with the
lifetime of WSN, the principal goal of which is the efficient use of energy[5-8]. These
researches aim at modeling the lifetime and finding a method to optimize it. These work have
been done based on the existing definitions of lifetime[9,10]. But on some occasions these
standards are inappropriate. The diversity of source behavior and the layout of the network are
important factors for they can take effect once the network is deployed[11-14]. Some research
work has been done to prolong the lifetime of WSN via unequal clustering or scheduling the
selection of cluster heads [14,15]. But the solution should be more active, the layout should be
well deployed to create wider potential space for optimizing the lifetime before the network
takes into action. Different nodes within the network have different service requirements, which
inspires the idea of this paper, that is, network lifetime should be service-oriented. A service-
oriented assessment of lifetime is explored in this paper. It is investigated from two
perspectives, one is how to assess network lifetime from service-oriented aspect, and the other
is how to deploy more nodes to balance the energy consumption where more service is needed.
3. OVER VIEW OF SUN ET. AL’S SCHEME
In this paper there are various definitions are presented.
3. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
100
definition1: Network density is defined s, in a specified area A where, nodes are deployed,
),( yxρ is defined as the network density with the property
1),( =∫∫A
dxdyyxρ
i.e the network
is assumed as homogeneous.
definition2: Network energy intensity is given and defined as e(x,y)=e0N
∫∫D
dxdyyx ),(ρ
where, e(x,y) is defined as network energy intensity with initial energy 0e
, for the given region
D. With the definition of network density relying models are specified for a routing algorithm
ψ. The relying probability makes the conditional probability density function Rψ
(x,y,a,b,ρ(x,y)), with the property
1)),(,,,,( ≥∫∫A
dxdyyxbayxR ρψ
, where Rψ
(x,y,a,b,ρ(x,y)) denotes the probability of (x,y) that will do the rely if there is an event
generated at (a,b).The partial density function of the sourced is employed S(x,y) with the
property
∫∫ =
A
MdxdyyxS ),(
Where S(x,y) denoted the distribution of source behavior with in
a period T and M denotes the intensity of source behavior.
definition 3: Network requesting intensity C(x,y) is defined as :
C(x,y)=
∫∫A
dadbbaSyxbayxR ),()),(,,,,( ρλ ψ
Where λ is a constant number.
Theorem-1The energy wasted is quantized by the expression.
∫∫A
dxdyyxC ),(
with e(x,y)=T(C(x,y)∀ (x,y)) where T is a constant value.
Section 4: Quantization of network density is explained by the density iterative process.
Step 1. i=0; Let the network be uniformly deployed first, then the density distribution
ρ is
obtained, which is a constant function.
Step 2. After one period T of data gathering the distribution of energy consumption denoted by
network requesting intensity ( , ) i c x y is derived.
Step 3. Use ( , ) i c x y derived in step 2 to guide the new-round deployment of network density.
In section 5, Stability and uniform convergence of the network is analyzed with the equation.
=),( yxρ
dxdydadbbaSyxbayxR
dadbbaSyxbayx
A A
∫∫ ∫∫
∫∫
),()),(,,,,(
),()),(,,,,(R
A
ρ
ρ
ψ
ψ
4. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
101
Theorem 2:
It has been explained that.
=),( yxei
dxdydadbbaSyxbayxR
dadbbaSyxbayx
A A
i
i
∫∫ ∫∫
∫∫
−
−
),()),(,,,,(
),()),(,,,,(R
1
A
1
ρ
ρ
ψ
ψ
If 1<γ by taking
Rψ (x,y,a,b,
),(.),(,,,,()),(,,,,( 0 yxyxbayxRyxbayxR ii ργηρρ ψψ −+=
with
0),(.- i =∫∫ dxdyyx
A
ργη
Theorem-3
It has been explained that when
∫∫A
dadbbaSyxbayxR ),()),(,,,,( ρψ
it is not a constant
function then it will dip get uniform convergence.
So over ally, the research on this service oriented network density WSN paper, the network is
considered as homogeneous and the density iterative process is prepared to quantize the
network density which can enlarge the potential space for optimizing the lifetimes.
Practically when WSN is to be deployed it, can’t be homogenous. So in this paper practical
approach has been explained where a non-homogeneous i.e heterogeneous WSN can be
feasible with the possible error elimination, when message is transmitted. Also it has been
proved simulated that, for uniform network the network density ),( yxρ is with a property
1),( ≠∫∫A
dxdyyxρ
4. PROBLEM DEFINITION
Section-1
In this scheme, in definition(1), network density is considered and it is denoted as f(x,y). Here
as the WSN is considered as homogeneous, therefore the network has taken as uniform network
where the network density distribution taken as
),(),( 0 yxyx ρρ =
which is a constant function
with a property
1),( =∫∫A
dxdyyxρ
5. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
102
For a homogeneous WSN where nodes are deployed uniformly, then the possible schematic
diagram of the network will be as follows,
When the network is uniform i.e the position difference every two consecutive nodes out of all
nodes should be same. This is also is represented in the above diagram.
We can assume, the network is uniform if, Positional coordinates(Nj) - Positional
coordinates(Ni) = constant ∀ N∈WSN deployed
Nj(x,y)-Ni(x,y)= C ∀ N∈WSN deployed where, C is a constant. Suppose the practical area
covered by the signals of a specific deployed node inside homogeneous network area is,
ap(Nk(x,y) is same for all n nodes ap
⇒
∑=
n
k
kN
1
p )(a
=A, where A is the whole area of the WSN.
Then for a uniform WSN,
1),)(( =∫∫A
kp dxdyyxNa
But practically a network can not be uniform because when a network is to be established by
deploying the nodes over a specified area, then the nodes can not be deployed uniformly over
that specified area.
i.e Nj(x,y)-Ni(x,y) ≠ C ∀ N∈WSN deployed
Z
Y
x
(0,0) Sink node
6. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
103
Practically nodes are deployed non-uniform over a specified area. The likely hood schematic
diagram is as follows,
therefore ⇒
∑=
≠
n
k
k AN
1
p )(a
That means, there exist some partial areas which are not covered by the sensor node; signal.
Those are out of coverage of the signal.
Section-2
What happened for the area out of coverage of the signal?
First considering the uniform network, with constant network density ρ(x,y), there is a routing
algorithm ψ, the relying probability matches the conditional probability density function Rψ
(x,y,a,b,ρ(x,y)), with the property
1)),(,,,,( ≥∫∫A
dxdyyxbayxR ρψ
, where
Rψ (x,y,a,b,ρ(x,y)) denotes the probability of (x,y) that will do the relying if there is an event
generated at (a,b).
Suppose that event generated at (a,b) is now with in the out of network coverage area of WSN.
Then the property of routing algorithm, because the generated event may not be predicted.
i.e.
1)),(,,,,( <∫∫A
dxdyyxbayxR ρψ
Z Y
x
(0,0) Sink node
7. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
104
in theorem 2 it is taken as, Rψ (x,y,a,b,ρi(x,y))= Rψ (x,y,a,b,ρ0(x,y)) +η - γ . ρi(x,y)
where
0),(.- i =∫∫ dxdyyx
A
ργη
where ρi(x,y)
=
dxdydadbbaSyxbayxR
dadbbaSyxbayx
A A
i
i
∫∫ ∫∫
∫∫
−
−
),()),(,,,,(
),()),(,,,,(R
1
A
1
ρ
ρ
ψ
ψ
Where S(a,b) the spatial probability density function of a source.
ρi-1(x,y) the network density distribution of the preceding node Ni and this ρi(x,y)
converges if 1<γ .
But for a non-uniform network, it may not be converged for 1<γ , because 1<γ
1)),(,,,,( <∫∫A
dxdyyxbayxR ρψ
For uniform network the network density is ρ(x,y) with a property
∫∫ =
A
dxdyyx 1),(ρ
But for
practical non-uniform network, using Gussian probability density we can perform a number of
experiments to verify that
∫∫ ≠
A
dxdyyx 1),(ρ
The Gaussian probability density function is f(x)=
2
2
1
πδ e
2
2
2
)(
δ
mx−−
Where, m and
2
δ are the average value and the variance associated with Gaussian probability
density function f(x).
Thus X =
dx
xe
mx
∫
∞
∞−
−−
2
2
)(
2
2
2
πδ
δ
= m
8. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
105
Now the cumulative distribution corresponding to the Gaussian probability density for m=0, is
p(X≤x)=F(x)=
dx
xe
x
x
∫∞−
−
2
2
2
2
2
πδ
δ
Now, the error function of u is given by,
erf u=
due
u
u
∫
−
0
22
π
the complementary error function is denoted as erfc u and given by,
erfc u=1-erf u
=
due u
∫
∞
−
0
22
π
Now the cumulative distribution function F(x) is expressed in terms of the error function and
the complementary function, for x≥0,
F(x) =
dx
xe
x
x
∫∞−
−
2
2
2
2
2
πδ
δ
=
dx
xe
x
∫
∞
∞−
−
2
2
2
2
2
πδ
δ
-
dx
xe
x
x
∫
∞
−
2
2
2
2
2
πδ
δ
For x≤0, for positive u,
F(x)=F(-|x|) =
dx
xe
x
x
∫
−
∞−
−
||
2
2
2
2
2
πδ
δ
=
due
x
u
∫
−
∞−
−
π
π
2
||
21
Let u−=ε
F(x) =
∫
∞
−
ε
π
δ
ε
de
x
2
||
22
2
1
=
δ2
||
2
1 x
erfc
9. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
106
Now, for a constant number k, the probability on the standard deviation δ ,
P±kδ = P(m-kδ ≤X≤m+kδ ) = 2
k
erf
0 0.5 1 1.5 2 2.5 3 3.5 4
0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2
k
Probabilityofnetworkdensity
Section-3
Error calculation:
As the signal traverses the transmission medium noise will be added to the signal. Hence as
finally received and pre received the signal will be corrupted or contaminated by noise from a
number of sources.
Let us consider one case:
In successive intervals we want to transmit one of the two possible messages. The two possible
messages might be represented at the transmitting end by two distinct wave form, each limited
in time period to the interval allocated to a bit. At the receiving end we right desire a system
where by the message m0 when received, generates some voltage r0, for m1 received generates
voltage r1 in the absence of noise. Because of noise, error occurred i.e for message m0
received indication might be r1 and for m1 r0
We shall assume, for generality, that the probability of an error is dependant on which msg was
send and transition probabilities are introduced. i.e
P(r0 | m0) = probability that r0 is received for m0 sent.
P(r1 | m0) = probability that r1 is received for m0 sent.
P(r0 | m1) = probability that r0 is received for m1 sent.
10. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
107
P(r1 | m1) = probability that r1 is received for m1 sent.
Priori probabilities:
For the general case, messages m1 and m0 do not occur with equal frequency and probabilities
p(m1) and p(m0) are introduced. Probabilities that m1 and m0 intended in an arbitrary message
interval. These probabilities p(m1) and p(m0) are called priori probabilities.
Now from an observed response r1 and r0, it can not be determined with certainty which of the
message was sent. Now by posteriori probability (message intended with maximum probability
that our opinion is correct).
If r0 is received
Choose m0 if P(m0 | r0) > P(m1 | r0)
Choose m0 if P(m1 | r0) > P(m0 | r0)
If r1 is received
Choose m1 if P(m0 | r1) > P(m1 | r1)
Choose m1 if P(m1 | r1) > P(m0 | r1)
Similarly,
If r0 is received, m0 should be chosen if
P(m0 | r0)P(r0) > P(m1 | r0) P(r0)
Correspondingly If r1 is received, m1 should be chosen if
P(r1 | m1)P(m1) > P(r1 | m0) P(m0)
This is optimum – receiver algorithm.
In general, there can be k messages m1,m2,…….mk and j received rensposes r1,r2,………. rj ,
by optimum-receiver algorithm, if rj is received, choose mk if
P(mk | rj) > P(mi | rj) ∀ i≠k.
Optimum receiver:
A receiver which operates in accordance with this algorithm to maximize a posteriori
probability of a correct decision and is called an optimum receiver.
11. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
108
6.CONCLUSION
In this paper , it is more concentrated on the density of the network in a heterogeneous WSN. A
method to assess lifetime from the perspective of service is first presented, in which whether
the network can support service is concentrated on and also the chance of error at the receiving
site is strictly minimized. This is also being analyzed that how the sink node will be used for
maximum time then also there will not be any problem because of the lifetime of the sensors.
Deployment can be guided to enlarge the potential space for optimizing the lifetime of the
network. The Proposed method is also practically being analyzed the feasibility of the network.
REFERENCES
[1] Akyildiz I.F, Su W, etc. Wireless sensor network: A survey [J]. Computer Networks. 2002,
38(4): 393-422.
[2] Bhardwaj M, Chandrakasan A, Garnett T. Upper bounds on the lifetime of sensor networks[C].
In: IEEE Int’l Conf. on Communications. Helsinki: IEEE Computer Society, 2001, 785-790.
[3] Duarte-Melo E. J, Liu M, Misra A. A Modeling Framework for Computing Lifetime and
Information Capacity in Wireless Sensor Networks[C]. In: Modeling and Optimization in
Mobile, Ad Hoc and Wireless Networks, Cambridge, UK, March 2004.
[4] Bhardwaj M, Chandrakasan A.P. Bounding the Lifetime of Sensor Networks Via Optimal Role
Assignments [C]. In: INFOCOM. New York, USA: IEEE, 2002. 1587-1596.
[5] Kalpakis K. Efficient Algorithms for Maximum Lifetime Data Gathering and Aggregation in
Wireless Sensor Networks [J]. Computer Networks: The International Journal of Computer and
Telecommunications Networking. August 2003, 42(6): 697-716.
[6] Enrique J. Duarte-Melo, Mingyan Liu. Analysis of Energy Consumption and Lifetime of
Heterogeneous Wireless Sensor Networks[C]. In: Proc. of the GLOBECOM 2002. New York:
IEEE Press, 2002. 21-25.
[7] Rai V, Mahapatra R. N. Lifetime Modeling of a Sensor Network[C]. In: Design , Automation
and Test in Europe, Munich , Germany ,March 2005. 202-203.
[8] Yuan Xue, YI CUI, etc. Maximizing Lifetime for Data Aggregation in Wireless Sensor
Networks[J]. Mobile Networks and Applications. 2006, 10(6): 853-864.
[9] A. Ephremides. Energy Concerns in Wireless Networks [J]. IEEE Wireless Communications,
vol. 9, pp. 48-59, Aug. 2002.
[10] Jianping Pany Y. Thomas Houz Lin Caiy etc. Topology Control for Wireless Sensor Networks
[C]. In: nternational Conference on Mobile Computing and Networking. 2003, 286-299.
[11] Egorova-Forster, Murphy. Exploring Non Uniform Quality of Service for Extending WSN
Lifetime[C]. In: Fifth IEEE International Conference on Pervasive Computing and
Communications Workshops (PerComW'07) 2007. 285-289.
[12] Lu Ke zhong, Huang Liu sheng, etc. Deploying Sensor Nodes in Wireless Sensor Networks[J].
Journal of Chinese Computer Systems. 2006, 27(11):2003-2006.
[13] Guihai Chen. Chengfa Li. An Uneven Cluster-Based Routing Protocol for Wireless Sensor
Networks [J]. Chinese Journal of Computers. 2007, 30(1):27-36
12. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.3, May 2011
109
[14] Soro S, Heinzelman WB. Prolonging the lifetime of wireless sensor networks via unequal
clustering[C]. In: Proc. of the 19th IEEE Int'l on Parallel and Distributed Processing
Symposium. San Francisco: IEEE Computer Society Press, 2005. 236-240.
[15] Biswanath Dey Sukumar Nandi. Distributed Location and Lifetime Biased Clustering for Large
Scale Wireless Sensor Network[C]. In : Distributed Computing and Networking, 8th
International Conference, ICDCN 2006. 534-54
[16] Dayang Sun,Yanheng liu,Aimin wang, Bin Ge Research on Service-oriented Lifetime and
Network Density in WSN In:IEEE 9th International Conference for Young Computer Scientists
2008, 439-444
[17] Communication System, Taub & Sheiling.
Authors
Asis Kumar Tripathy Received Diploma in IT in 2002, B.E. IT in 2006 and MTech
in Comp. Sc. & Engg. In 2010 from Inter-National Institute of Information
Technology, Bhubaneswar. He has Joined NM Institute of Engg. & Technology as a
lecturer from 01-07-2010.His research areas are Network Security and Wireless
Sensor Network.
Shradhananda Beura received Diplma in IT, BTech. From CET, Bhubaneswar In
2004 & 2008 respectively. He is persuing MTech. In CSE. His research area is
Wireless Sensor Network.
Muralidhar Behera received MCA in 2003, Persuing MTech. In CSE. His research area is Wireless
Sensor Network.
Dr. Gunanidhi Pradhan Received Ph.D in Information & Communication
Technology.
Awarded Best Teacher Award by ISTE,Currently Principal, Govt. College of
Engineering, Kalahandi,Bhawanipatna,Odisha