In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
Energy Efficient Stable Election Protocol for Clustered Heterogeneous Wireles...IOSR Journals
This document summarizes an energy efficient stable election protocol (EE-SEP) for clustered heterogeneous wireless sensor networks. EE-SEP modifies the existing SEP protocol to improve energy efficiency, stability period, and network lifetime. It does this by calculating the optimal threshold value for selecting cluster heads based on the initial energy of sensor nodes, rather than the weighted election probability used in SEP. Simulations show EE-SEP performs better than SEP by increasing the number of alive nodes over time, reducing energy consumption, and prolonging network lifetime.
Every cluster comprise of a leader which is known as cluster head. The cluster head will be chosen by the sensor nodes in the individual cluster or be pre-assigned by the user. The main advantages of clustering are the transmission of aggregated data to the base station, offers scalability for huge number of nodes and trims down energy consumption. Fundamentally, clustering could be classified into centralized clustering, distributed clustering and hybrid clustering. In centralized clustering, the cluster head is fixed. The rest of the nodes in the cluster act as member nodes. In distributed clustering, the cluster head is not fixed. The cluster head keeps on shifting form node to node within the cluster on the basis of some parameters. Hybrid clustering is the combination of both centralized clustering and distributed clustering mechanisms. This paper gives a brief overview on clustering process in wireless sensor networks. A research on the well evaluated distributed clustering algorithm Low Energy Adaptive Clustering Hierarchy (LEACH) and its followers are portrayed artistically. To overcome the drawbacks of these existing algorithms a hybrid distributed clustering model has been proposed for attaining energy efficiency to a larger scale.
Application of Weighted Centroid Approach in Base Station Localization for Mi...IJMER
A Wireless Sensor Networks (WSNs) consisting of sensor with strategic locations, and a base-stations (BSs) whose locations are relatively flexible. A sensor cluster consists of many small sensor nodes (SNs) that capture, encode, and transmit relevant information from a designated area. This article is focused on the topology of positioning process for BSs in WSNs. Heterogeneous SNs are battery-powered and energy-constrained, their node lifetime directly affects the network lifetime of WSNs. We have proposed an algorithmic approach to locate BSs optimally such that we can maximize the topological network lifetime of WSNs deterministically, even when the initial energy provisioning for SNs is no longer always proportional to their average bit-stream rate. The obtained optimal BS locations are under different length of area field and number of nodes according to the mission criticality of WSNs. By studying energy consumption due to space loss and amplification losses in WSNs, we establish the upper and lower bounds of maximal topological parameters of area and number of nodes, which enable a quick assessment of energy provisioning feasibility and topology necessity. Numerical results and surface plot are given to demonstrate the efficiency and optimality of the proposed topology of BSs positioning approaches designed for maximizing network lifetime of WSNs.
An Improved Energy Efficient Wireless Sensor Networks Through Clustering In C...Editor IJCATR
One of the major reason for performance degradation in Wireless sensor network is the overhead due to control packet and packet delivery degradation. Clustering in cross layer network operation is an efficient way manage control packet overhead and which ultimately improve the lifetime of a network. All these overheads are crucial in a scalable networks. But the clustering always suffer from the cluster head failure which need to be solved effectively in a large network. As the focus is to improve the average lifetime of sensor network the cluster head is selected based on the battery life of nodes. The cross-layer operation model optimize the overheads in multiple layer and ultimately the use of clustering will reduce the major overheads identified and their by the energy consumption and throughput of wireless sensor network is improved. The proposed model operates on two layers of network ie., Network Layer and Transport Layer and Clustering is applied in the network layer . The simulation result shows that the integration of two layers reduces the energy consumption and increases the throughput of the wireless sensor networks.
Energy efficient routing in wireless sensor network based on mobile sink guid...IJECEIAES
In wireless sensor networks (WSNs), the minimization of usage of energy in the sensor nodes is a key task. Three salient functions are performed by WSNs’ sensor nodes namely data sensing, transmitting and relaying. Routing technique is one of the methods to enhance the sensor nodes battery lifetime. Energy optimization is done by using one of the heuristic routing methods for data sensing and transmission. To enhance the energy optimization mainly concentrated on data relaying. In this work stochastic hill climbing is adapted. The proposed solution for data relaying utilizes geographical routing and mobile sink technique. The sink collects the data from cluster heads and movement of the sink is routed by stochastic hill climbing. Experimentation is done on the network simulator 2 Platform. The existing routing techniques like threshold sensitive energy efficient sensor network, energy-efficient low duty cycle, and adaptive clustering protocol are compared with the obtained results of chosen algorithm. The proposed work shows promising results with respect to lifetime, average energy of nodes and packet delivery ratio.
Scheduling different types of packets, such as
real-time and non-real-time data packets, at sensor nodes with
resource constraints in Wireless Sensor Networks (WSN) is of
vital importance to reduce sensors’ energy consumptions and endto-end
data transmission delays. Most of the existing packetscheduling
mechanisms of WSN use First Come First Served
(FCFS), non pre-emptive priority and pre-emptive priority
scheduling algorithms. These algorithms incur a high processing
overhead and long end-to-end data transmission delay due to the
FCFS concept, starvation of high priority real-time data packets
due to the transmission of a large data packet in non pre-emptive
priority scheduling, starvation of non-real-time data packets due
to the probable continuous arrival of real-time data in preemptive
priority scheduling, and improper allocation of data
packets to queues in multilevel queue scheduling algorithms.
Moreover, these algorithms are not dynamic to the changing
requirements of WSN applications since their scheduling policies
are predetermined.
In the Advanced Multilevel Priority packet scheduling
scheme, each node except those at the last level has three levels of
priority queues. According to the priority of the packet and
availability of the queue, node will schedule the packet for
transmission. Due to separated queue availability, packet
transmission delay is reduced. Due to reduction in packet
transmission delay, node can goes into sleep mode as soon as
possible. And Expired packets are deleted at the particular node
at itself before reaching the base station, so that processing
burden on the node is reduced. Thus, energy of the node is saved.
Optimized Cluster Establishment and Cluster-Head Selection Approach in WSNIJCNCJournal
In recent years, limited resources of user products and energy-saving are recognized as the major challenges of Wireless Sensor Networks (WSNs). Clustering is a practical technique that can reduce all energy consumption and provide stability of workload that causes a larger difference in energy depletion among other nodes and cluster heads (CHs). In addition, clustering is the solution of energy-efficient for maximizing the network longevity and improvising energy efficiency. In this paper, a novel OCE-CHS (Optimized Cluster Establishment and Cluster-Head Selection) approach for sensor nodes is represented to improvise the packet success ratio and reduce the average energy-dissipation. The main contribution of this paper is categorized into two processes, first, the clustering algorithm is improvised that periodically chooses the optimal set of the CHs according to the speed of the average node and average-node energy. This is considerably distinguished from node-based clustering that utilizes a distributed clustering algorithm to choose CHs based on the speed of the current node and remaining node energy. Second, more than one factor is assumed for the detached node to join the optimal cluster. In the result section, we discuss our clustering protocols implementation of optimal CH-selection to evade the death of SNs, maximizing throughput, and further improvise the network lifetime by minimizing energy consumption.
IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access 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.
Energy efficient load balanced routing protocol for wireless sensor networkscsandit
Telecommunications is increasingly vital to the society at large, and has become essential to
business, academic, as well as social activities. Due to the necessity to have access to
telecommunications, the deployment requires regulations and policy. Otherwise, the deployment
of the infrastructures would contribute to environment, and human complexities rather than
ease of use.
However, the formulation of telecommunication infrastructure deployment regulation and
policy involve agents such as people and processes. The roles of the agents are critical, and are
not as easy as it meant to belief. This could be attributed to different factors, as they produce
and reproduce themselves overtime.
This paper presents the result of a study which focused on the roles of agents in the formulation
of telecommunication infrastructures deployment regulation and policy. In the study, the
interactions that take place amongst human and non-human agents were investigated. The study
employed the duality of structure, of Structuration theory as lens to understand the effectiveness
of interactions in the formulation of regulations, and how policy is used to facilitate the
deployment of telecommunications infrastructure in the South African environment.
A seminar report on data aggregation in wireless sensor networkspraveen369
This document summarizes a seminar report on data aggregation in wireless sensor networks. It discusses the goals of improving energy efficiency and network lifetime through data aggregation. It provides an overview of different data aggregation approaches, including in-network aggregation, tree-based approaches, and cluster-based approaches. It also discusses query processing and security challenges in wireless sensor networks.
Energy efficient data communication approach in wireless sensor networksijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based
configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor
node creates challenges for routing in WSNs. The research work presents the organized and detailed
description of energy conservation method for WSNs. In the proposed method reclustering and multihop
data transmission processes are utilized for data reporting to base station by sensor node. The accurate use
of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the
proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the
total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for
longer times inside the cluster. The result shows that the proposed clustering approach has higher stable
region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy
Adaptive Clustering Hierarchy (LEACH) for WSNs.
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...IJEEE
In Wireless Sensor Network, due to the
energy restriction of each nodes, efficient routing is very
important in order to save the energy of the hybrid
optimization technique. The results of new protocol i.e.
hybrid have been compared with EEPB and IEEPB.
Simulation results show that the lifetime of Hybrid is better
as compared to EEPB and IEEPB.
IRJET- Chaos based Secured Communication in Energy Efficient Wireless Sensor...IRJET Journal
This document proposes a chaotic encryption method combined with a clustered Low-Energy Adaptive Clustering Hierarchy (LEACH) algorithm to improve energy efficiency and security in wireless sensor networks. It discusses how LEACH clustering helps to reduce energy consumption through data aggregation at cluster heads. The proposed method uses chaotic maps for encryption to provide security. Simulation results show the combined approach increases network lifetime by reducing total energy consumption compared to traditional LEACH.
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.
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.
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
Throughput analysis of energy aware routing protocol for real time load distr...eSAT Journals
Abstract Wireless sensor network (WSNs) are self-organized systems that depend on highly distributed and scattered low cost tiny devices. These devices have some limitations such as processing capability, memory size, communication distance coverage and energy capabilities. In order to maximize the autonomy of individual nodes and indirectly the lifetime of the network, most of the research work is done on power saving techniques. Hence, we propose energy-aware load distribution technique that can provide an excellent data transfer of packets from source to destination via hop by hop basis. Therefore, by making use of the cross-layer interactions between the physical layer and the network layer thus leads to an improvement in energy efficiency of the entire network when compared with other protocols and it also improves the response time in case of network change. Keywords:- wireless sensor network, energy-aware, load distribution, power saving, cross layer interactions.
Data aggregation in wireless sensor network , 11751 d5811praveen369
The document discusses data aggregation in wireless sensor networks. It explains that sensor networks aim to gather and aggregate data in an energy efficient manner to extend network lifetime. It describes various data aggregation approaches like centralized, LEACH, and TAG. It also discusses cluster-based and tree-based aggregation where nodes aggregate and transmit data to parent nodes or cluster heads. The document outlines types of queries for sensor networks and benefits of data aggregation in reducing traffic and energy consumption while improving data accuracy.
This document provides an introduction to wireless sensor networks. It discusses how sensor networks are composed of spatially distributed sensor nodes that monitor physical conditions and work cooperatively to gather and transmit sensor data via wireless communication. Each sensor node contains basic computing and communication capabilities. The document outlines common network topologies used in sensor networks and compares the capabilities of modern sensor nodes to early personal computers. Finally, it lists several example application domains for wireless sensor networks, including environmental/infrastructure monitoring, smart homes/offices, traffic control, medical care, industrial processes, and military surveillance.
The document discusses key principles of effective communication. It defines communication and its components, explaining that communication involves sending and receiving verbal and nonverbal messages between two or more people. It also discusses how the sender's intended message may differ from what the receiver understands if there are barriers like inaccurate interpretation or ignoring nonverbal signals. Effective communication requires understanding messages at different levels and from different perspectives.
This document discusses transducers and the linear variable differential transformer (LVDT). It defines a transducer as a device that converts one form of energy to another, and classifies transducers based on their principles and whether they are active, passive, primary or secondary. LVDTs are introduced as the most widely used inductive transducer to convert linear motion to an electrical signal. The document proceeds to describe the construction, operating principle, and advantages/disadvantages of LVDTs, and concludes by outlining their applications in measuring small displacements.
Basic concepts of wireless communication systemBogs De Castro
This document provides an overview of basic concepts in wireless communication systems, including definitions of computer networks, networking, transmission media, distributed systems, and client-server models. It describes common network devices, topologies, protocols, and the differences between local and wide area networks.
The document discusses wireless sensor networks and describes their key characteristics. It notes that wireless sensor networks consist of low-power smart sensor nodes distributed over a large field to enable wireless sensing and data networking. The sensor nodes contain sensors, processors, memory, and radios. Wireless sensor networks can be either unstructured with dense node distribution or structured with few scattered nodes.
DATA GATHERING ALGORITHMS FOR WIRELESS SENSOR NETWORKS: A SURVEYijasuc
Recent developments in processor, memory and radio technology have enabled wireless sensor networks
which are deployed to collect useful information from an area of interest. The sensed data must be
gathered and transmitted to a base station where it is further processed for end-user queries. Since the
network consists of low-cost nodes with limited battery power, power efficient methods must be employed
for data gathering and aggregation in order to achieve long network lifetimes. In an environment where in
a round of communication each of the sensor nodes has data to send to a base station, it is important to
minimize the total energy consumed by the system in a round so that the system lifetime is maximized. With
the use of data fusion and aggregation techniques, while minimizing the total energy per round, if power
consumption per node can be balanced as well, a near optimal data gathering and routing scheme can be
achieved in terms of network lifetime. Several application specific sensor network data gathering protocols
have been proposed in research literatures. However, most of the proposed algorithms have been some
attention to the related network lifetime and saving energy are two critical issues for wireless sensor
networks. In this paper we have explored general network lifetime in wireless sensor networks and made an
extensive study to categorize available data gathering techniques and analyze possible network lifetime on
them.
Energy Aware Talented Clustering with Compressive Sensing (TCCS) for Wireless...IJCNCJournal
Wireless sensor networks (WSNs) are networks of sensor nodes that interact wirelessly to gather information about the surrounding environment. Nodes are often low-powered and dispersed in an ad hoc, decentralized manner. Although WSNs have gained in popularity, they still have several serious shortcomings, like limited battery life and bandwidth. In this paper, the cluster head (CH) selection, the Compressive Sensing (CS) theory, the Connection-based Decentralized Clustering (CDC), the relay node selection, and the Multi Objective Genetic Algorithm (MOGA)are all taken into account The initial stage provided a theoretical revision to the concepts of network construction, compressive sensing, and MOGA, which impacted the improvement of network lifetime. In the second stage developed a novel model such as Energy Aware Talented Clustering with Compressive Sensing (TCCS) for the sensor network. This approach considers increasing longevity but also raises the network's overall quality of service (QoS). In the analysis, the TCCS model is applied to both the centralized and distributed networks and compared with the existing methods. When compared to the previous methods, the simulation results show that the proposed work performs better in terms of the calculation of maximum packet delivery ratio of 93.93 percent, minimum energy consumption of 8.04J, maximum energy efficiency of 91.04 percent, maximum network throughput of 465.51kbps, minimum packet loss of 282 packets, and minimum delay of 63.82 msec.
ENERGY AWARE TALENTED CLUSTERING WITH COMPRESSIVE SENSING (TCCS) FOR WIRELESS...IJCNCJournal
Wireless sensor networks (WSNs) are networks of sensor nodes that interact wirelessly to gather
information about the surrounding environment. Nodes are often low-powered and dispersed in an ad hoc,
decentralized manner. Although WSNs have gained in popularity, they still have several serious
shortcomings, like limited battery life and bandwidth. In this paper, the cluster head (CH) selection, the
Compressive Sensing (CS) theory, the Connection-based Decentralized Clustering (CDC), the relay node
selection, and the Multi Objective Genetic Algorithm (MOGA)are all taken into account The initial stage
provided a theoretical revision to the concepts of network construction, compressive sensing, and MOGA,
which impacted the improvement of network lifetime. In the second stage developed a novel model such as
Energy Aware Talented Clustering with Compressive Sensing (TCCS) for the sensor network. This
approach considers increasing longevity but also raises the network's overall quality of service (QoS). In
the analysis, the TCCS model is applied to both the centralized and distributed networks and compared
with the existing methods. When compared to the previous methods, the simulation results show that the
proposed work performs better in terms of the calculation of maximum packet delivery ratio of 93.93
percent, minimum energy consumption of 8.04J, maximum energy efficiency of 91.04 percent, maximum
network throughput of 465.51kbps, minimum packet loss of 282 packets, and minimum delay of 63.82 msec.
E FFICIENT E NERGY U TILIZATION P ATH A LGORITHM I N W IRELESS S ENSOR...IJCI JOURNAL
With limited amount of energy, nodes are powered by
batteries in wireless networks. Increasing the lif
e
span of the network and reducing the usage of energ
y are two severe problems in Wireless Sensor
Networks. A small number of energy utilization path
algorithms like minimum spanning tree reduces tota
l
energy consumption of a Wireless Sensor Network, ho
wever very heavy load of sending data packets on
many key nodes is used with the intention that the
nodes quickly consumes battery energy, by raising t
he
life span of the network reduced. Our proposal work
aimed on presenting an Energy Conserved Fast and
Secure Data Aggregation Scheme for WSN in time and
security logic occurrence data collection
application. To begin with, initially the goal is m
ade on energy preservation of sensed data gathering
from
event identified sensor nodes to destination. Inven
tion is finished on Energy Efficient Utilization Pa
th
Algorithm (EEUPA), to extend the lifespan by proces
sing the collecting series with path mediators
depending on gene characteristics sequencing of nod
e energy drain rate, energy consumption rate, and
message overhead together with extended network lif
e span. Additionally, a mathematical programming
technique is designed to improve the lifespan of th
e network. Simulation experiments carried out among
different relating conditions of wireless sensor ne
twork by different path algorithms to analyze the
efficiency and effectiveness of planned Efficient E
nergy Utilization Path Algorithm in wireless sensor
network (EEUPA)
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
The document summarizes an algorithm proposed to reduce energy consumption in wireless sensor networks using duty cycling and multi-hop routing. The key aspects of the algorithm are:
1) Layering the network environment based on size and identifying the optimal number of cluster heads in each layer.
2) Selecting the first layer closest to the sink as the "gateway layer" and stopping energy usage in half of these sensors to extend the network lifespan.
3) Using multi-hop routing whereby cluster heads send data to heads in the above layer until the gateway layer, which then sends to the static or mobile sink.
4) Simulation results showed the proposed algorithm performs better than LEACH and ELEACH in terms of
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which
makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
ENERGY EFFICIENT DATA COMMUNICATION APPROACH IN WIRELESS SENSOR NETWORKSijassn
Wireless sensor network has a vast variety of applications. The adoption of energy efficient cluster-based configuration has many untapped desirable benefits for the WSNs. The limitation of energy in a sensor node creates challenges for routing in WSNs. The research work presents the organized and detailed description of energy conservation method for WSNs. In the proposed method reclustering and multihop data transmission processes are utilized for data reporting to base station by sensor node. The accurate use of energy in WSNs is the main challenge for exploiting the network to the full extent. The main aim of the proposed method is that by evenly distributing the energy all over the sensor nodes and by reducing the total energy dissipation, the lifetime of the network is enhanced, so that the node will remain alive for longer times inside the cluster. The result shows that the proposed clustering approach has higher stable region and network life time than Topology-Controlled Adaptive Clustering (TCAC) and Low-Energy Adaptive Clustering Hierarchy (LEACH) for WSNs.
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
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.
ENERGY EFFICIENT HIERARCHICAL CLUSTER HEAD ELECTION USING EXPONENTIAL DECAY F...ijwmn
This document summarizes an article that proposes an improved algorithm for selecting cluster heads in wireless sensor networks. The algorithm uses an exponential decay function to predict the average energy of sensor nodes and selects cluster heads based on both the probabilistic LEACH algorithm and predicted energy levels. The algorithm was tested in MATLAB simulations of a homogeneous sensor network and showed improvements in stability, average energy dissipation per round, and lifespan over the baseline LEACH protocol.
DESIGNING AN ENERGY EFFICIENT CLUSTERING IN HETEROGENEOUS WIRELESS SENSOR NET...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical
issue that degrades the network performance. Recharging and providing security to the sensor devices is
very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an
important and suitable approach to increase energy efficiency and transmitting secured data which in turn
enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC)
works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the
rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the
network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on
the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all
the cluster heads are formed at a time and selected on rotation based on considering the highest energy of
the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum
flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access
(CSMA), a contention window based protocol is used at the MAC layer for collision detection and to
provide channel access prioritization to HWSN of different traffic classes with reduction in End to End
delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the
cluster head for transmission without depleting the energy. Simulation parameters of the proposed system
such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing
system.
Designing an Energy Efficient Clustering in Heterogeneous Wireless Sensor Net...IJCNCJournal
Designing an energy-efficient scheme in a Heterogeneous Wireless Sensor Network (HWSN) is a critical issue that degrades the network performance. Recharging and providing security to the sensor devices is very difficult in an unattended environment once the energy is drained off. A Clustering scheme is an important and suitable approach to increase energy efficiency and transmitting secured data which in turn enhances the performance in the network. The proposed algorithm Energy Efficient Clustering (EEC) works for optimum energy utilization in sensor nodes. The algorithm is proposed by combining the rotation-based clustering and energy-saving mechanism for avoiding the node failure and prolonging the network lifetime. This shows MAC layer scheduling is based on optimum energy utilization depending on the residual energy. In the proposed work, a densely populated network is partitioned into clusters and all the cluster heads are formed at a time and selected on rotation based on considering the highest energy of the sensor nodes. Other cluster members are accommodated in a cluster based on Basic Cost Maximum flow (BCMF) to allow the cluster head for transmitting the secured data. Carrier Sense Multiple Access (CSMA), a contention window based protocol is used at the MAC layer for collision detection and to provide channel access prioritization to HWSN of different traffic classes with reduction in End to End delay, energy consumption, and improved throughput and Packet delivery ratio(PDR) and allowing the cluster head for transmission without depleting the energy. Simulation parameters of the proposed system such as Throughput, Energy, and Packet Delivery Ratio are obtained and compared with the existing system.
A Review Paper on Power Consumption Improvements in WSNIJERA Editor
Wireless Sensor network (WSN) is a network of low-cost, low-power, multifunctional, small
size sensor nodes which are densely deployed inside a physical environment to collect, process and transmit the
information to sink node. As Sensor nodes are generally battery-powered, it is necessary to balance between
power consumption and energy storage capacity to sustain sensor node's operational life. Therefore one of the
important challenge in WSN is to improve power consumption efficiently to prolong network lifetime by
minimizing the amount of data transmissions throughout the network and maximizing node's low power
residence time. In this paper, two energy optimization techniques, Cluster-Based energy efficient routing
(CBER) scheme and extension to IEEE 802.15.4 standard by dynamic rate adaption and control for energy
reduction (DRACER) protocol for wireless sensor networks has been reviewed. CBER technique increases
network lifetime by reducing Hot Spot problem and end-to-end energy consumption using multi-hop wireless
routing whereas DRACER protocol reduces network latency and average power consumption by minimizing
network overhead using automatic data rate selection process. So, both of these techniques, if utilized in
combination, it is possible to achieve very high energy efficiency in WSN
The document discusses energy efficient routing protocols for clustered wireless sensor networks. It provides an overview of wireless sensor networks and discusses how clustering is commonly used to improve energy efficiency and scalability. The document reviews several existing clustering-based routing protocols and analyzes their approaches for prolonging network lifetime by minimizing energy consumption in wireless sensor networks.
A 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.
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 Cluster-
based 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
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.
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.
Similar to ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSOR NETWORKS (20)
Comparison Table of DiskWarrior Alternatives.pdfAndrey Yasko
To help you choose the best DiskWarrior alternative, we've compiled a comparison table summarizing the features, pros, cons, and pricing of six alternatives.
How Social Media Hackers Help You to See Your Wife's Message.pdfHackersList
In the modern digital era, social media platforms have become integral to our daily lives. These platforms, including Facebook, Instagram, WhatsApp, and Snapchat, offer countless ways to connect, share, and communicate.
Paradigm Shifts in User Modeling: A Journey from Historical Foundations to Em...Erasmo Purificato
Slide of the tutorial entitled "Paradigm Shifts in User Modeling: A Journey from Historical Foundations to Emerging Trends" held at UMAP'24: 32nd ACM Conference on User Modeling, Adaptation and Personalization (July 1, 2024 | Cagliari, Italy)
UiPath Community Day Kraków: Devs4Devs ConferenceUiPathCommunity
We are honored to launch and host this event for our UiPath Polish Community, with the help of our partners - Proservartner!
We certainly hope we have managed to spike your interest in the subjects to be presented and the incredible networking opportunities at hand, too!
Check out our proposed agenda below 👇👇
08:30 ☕ Welcome coffee (30')
09:00 Opening note/ Intro to UiPath Community (10')
Cristina Vidu, Global Manager, Marketing Community @UiPath
Dawid Kot, Digital Transformation Lead @Proservartner
09:10 Cloud migration - Proservartner & DOVISTA case study (30')
Marcin Drozdowski, Automation CoE Manager @DOVISTA
Pawel Kamiński, RPA developer @DOVISTA
Mikolaj Zielinski, UiPath MVP, Senior Solutions Engineer @Proservartner
09:40 From bottlenecks to breakthroughs: Citizen Development in action (25')
Pawel Poplawski, Director, Improvement and Automation @McCormick & Company
Michał Cieślak, Senior Manager, Automation Programs @McCormick & Company
10:05 Next-level bots: API integration in UiPath Studio (30')
Mikolaj Zielinski, UiPath MVP, Senior Solutions Engineer @Proservartner
10:35 ☕ Coffee Break (15')
10:50 Document Understanding with my RPA Companion (45')
Ewa Gruszka, Enterprise Sales Specialist, AI & ML @UiPath
11:35 Power up your Robots: GenAI and GPT in REFramework (45')
Krzysztof Karaszewski, Global RPA Product Manager
12:20 🍕 Lunch Break (1hr)
13:20 From Concept to Quality: UiPath Test Suite for AI-powered Knowledge Bots (30')
Kamil Miśko, UiPath MVP, Senior RPA Developer @Zurich Insurance
13:50 Communications Mining - focus on AI capabilities (30')
Thomasz Wierzbicki, Business Analyst @Office Samurai
14:20 Polish MVP panel: Insights on MVP award achievements and career profiling
How RPA Help in the Transportation and Logistics Industry.pptxSynapseIndia
Revolutionize your transportation processes with our cutting-edge RPA software. Automate repetitive tasks, reduce costs, and enhance efficiency in the logistics sector with our advanced solutions.
Advanced Techniques for Cyber Security Analysis and Anomaly DetectionBert Blevins
Cybersecurity is a major concern in today's connected digital world. Threats to organizations are constantly evolving and have the potential to compromise sensitive information, disrupt operations, and lead to significant financial losses. Traditional cybersecurity techniques often fall short against modern attackers. Therefore, advanced techniques for cyber security analysis and anomaly detection are essential for protecting digital assets. This blog explores these cutting-edge methods, providing a comprehensive overview of their application and importance.
Scaling Connections in PostgreSQL Postgres Bangalore(PGBLR) Meetup-2 - MydbopsMydbops
This presentation, delivered at the Postgres Bangalore (PGBLR) Meetup-2 on June 29th, 2024, dives deep into connection pooling for PostgreSQL databases. Aakash M, a PostgreSQL Tech Lead at Mydbops, explores the challenges of managing numerous connections and explains how connection pooling optimizes performance and resource utilization.
Key Takeaways:
* Understand why connection pooling is essential for high-traffic applications
* Explore various connection poolers available for PostgreSQL, including pgbouncer
* Learn the configuration options and functionalities of pgbouncer
* Discover best practices for monitoring and troubleshooting connection pooling setups
* Gain insights into real-world use cases and considerations for production environments
This presentation is ideal for:
* Database administrators (DBAs)
* Developers working with PostgreSQL
* DevOps engineers
* Anyone interested in optimizing PostgreSQL performance
Contact info@mydbops.com for PostgreSQL Managed, Consulting and Remote DBA Services
Quantum Communications Q&A with Gemini LLM. These are based on Shannon's Noisy channel Theorem and offers how the classical theory applies to the quantum world.
Understanding Insider Security Threats: Types, Examples, Effects, and Mitigat...Bert Blevins
Today’s digitally connected world presents a wide range of security challenges for enterprises. Insider security threats are particularly noteworthy because they have the potential to cause significant harm. Unlike external threats, insider risks originate from within the company, making them more subtle and challenging to identify. This blog aims to provide a comprehensive understanding of insider security threats, including their types, examples, effects, and mitigation techniques.
Implementations of Fused Deposition Modeling in real worldEmerging Tech
The presentation showcases the diverse real-world applications of Fused Deposition Modeling (FDM) across multiple industries:
1. **Manufacturing**: FDM is utilized in manufacturing for rapid prototyping, creating custom tools and fixtures, and producing functional end-use parts. Companies leverage its cost-effectiveness and flexibility to streamline production processes.
2. **Medical**: In the medical field, FDM is used to create patient-specific anatomical models, surgical guides, and prosthetics. Its ability to produce precise and biocompatible parts supports advancements in personalized healthcare solutions.
3. **Education**: FDM plays a crucial role in education by enabling students to learn about design and engineering through hands-on 3D printing projects. It promotes innovation and practical skill development in STEM disciplines.
4. **Science**: Researchers use FDM to prototype equipment for scientific experiments, build custom laboratory tools, and create models for visualization and testing purposes. It facilitates rapid iteration and customization in scientific endeavors.
5. **Automotive**: Automotive manufacturers employ FDM for prototyping vehicle components, tooling for assembly lines, and customized parts. It speeds up the design validation process and enhances efficiency in automotive engineering.
6. **Consumer Electronics**: FDM is utilized in consumer electronics for designing and prototyping product enclosures, casings, and internal components. It enables rapid iteration and customization to meet evolving consumer demands.
7. **Robotics**: Robotics engineers leverage FDM to prototype robot parts, create lightweight and durable components, and customize robot designs for specific applications. It supports innovation and optimization in robotic systems.
8. **Aerospace**: In aerospace, FDM is used to manufacture lightweight parts, complex geometries, and prototypes of aircraft components. It contributes to cost reduction, faster production cycles, and weight savings in aerospace engineering.
9. **Architecture**: Architects utilize FDM for creating detailed architectural models, prototypes of building components, and intricate designs. It aids in visualizing concepts, testing structural integrity, and communicating design ideas effectively.
Each industry example demonstrates how FDM enhances innovation, accelerates product development, and addresses specific challenges through advanced manufacturing capabilities.
INDIAN AIR FORCE FIGHTER PLANES LIST.pdfjackson110191
These fighter aircraft have uses outside of traditional combat situations. They are essential in defending India's territorial integrity, averting dangers, and delivering aid to those in need during natural calamities. Additionally, the IAF improves its interoperability and fortifies international military alliances by working together and conducting joint exercises with other air forces.
論文紹介:A Systematic Survey of Prompt Engineering on Vision-Language Foundation ...Toru Tamaki
Jindong Gu, Zhen Han, Shuo Chen, Ahmad Beirami, Bailan He, Gengyuan Zhang, Ruotong Liao, Yao Qin, Volker Tresp, Philip Torr "A Systematic Survey of Prompt Engineering on Vision-Language Foundation Models" arXiv2023
https://arxiv.org/abs/2307.12980
Are you interested in dipping your toes in the cloud native observability waters, but as an engineer you are not sure where to get started with tracing problems through your microservices and application landscapes on Kubernetes? Then this is the session for you, where we take you on your first steps in an active open-source project that offers a buffet of languages, challenges, and opportunities for getting started with telemetry data.
The project is called openTelemetry, but before diving into the specifics, we’ll start with de-mystifying key concepts and terms such as observability, telemetry, instrumentation, cardinality, percentile to lay a foundation. After understanding the nuts and bolts of observability and distributed traces, we’ll explore the openTelemetry community; its Special Interest Groups (SIGs), repositories, and how to become not only an end-user, but possibly a contributor.We will wrap up with an overview of the components in this project, such as the Collector, the OpenTelemetry protocol (OTLP), its APIs, and its SDKs.
Attendees will leave with an understanding of key observability concepts, become grounded in distributed tracing terminology, be aware of the components of openTelemetry, and know how to take their first steps to an open-source contribution!
Key Takeaways: Open source, vendor neutral instrumentation is an exciting new reality as the industry standardizes on openTelemetry for observability. OpenTelemetry is on a mission to enable effective observability by making high-quality, portable telemetry ubiquitous. The world of observability and monitoring today has a steep learning curve and in order to achieve ubiquity, the project would benefit from growing our contributor community.
Details of description part II: Describing images in practice - Tech Forum 2024BookNet Canada
This presentation explores the practical application of image description techniques. Familiar guidelines will be demonstrated in practice, and descriptions will be developed “live”! If you have learned a lot about the theory of image description techniques but want to feel more confident putting them into practice, this is the presentation for you. There will be useful, actionable information for everyone, whether you are working with authors, colleagues, alone, or leveraging AI as a collaborator.
Link to presentation recording and transcript: https://bnctechforum.ca/sessions/details-of-description-part-ii-describing-images-in-practice/
Presented by BookNet Canada on June 25, 2024, with support from the Department of Canadian Heritage.
Mitigating the Impact of State Management in Cloud Stream Processing SystemsScyllaDB
Stream processing is a crucial component of modern data infrastructure, but constructing an efficient and scalable stream processing system can be challenging. Decoupling compute and storage architecture has emerged as an effective solution to these challenges, but it can introduce high latency issues, especially when dealing with complex continuous queries that necessitate managing extra-large internal states.
In this talk, we focus on addressing the high latency issues associated with S3 storage in stream processing systems that employ a decoupled compute and storage architecture. We delve into the root causes of latency in this context and explore various techniques to minimize the impact of S3 latency on stream processing performance. Our proposed approach is to implement a tiered storage mechanism that leverages a blend of high-performance and low-cost storage tiers to reduce data movement between the compute and storage layers while maintaining efficient processing.
Throughout the talk, we will present experimental results that demonstrate the effectiveness of our approach in mitigating the impact of S3 latency on stream processing. By the end of the talk, attendees will have gained insights into how to optimize their stream processing systems for reduced latency and improved cost-efficiency.
Transcript: Details of description part II: Describing images in practice - T...BookNet Canada
This presentation explores the practical application of image description techniques. Familiar guidelines will be demonstrated in practice, and descriptions will be developed “live”! If you have learned a lot about the theory of image description techniques but want to feel more confident putting them into practice, this is the presentation for you. There will be useful, actionable information for everyone, whether you are working with authors, colleagues, alone, or leveraging AI as a collaborator.
Link to presentation recording and slides: https://bnctechforum.ca/sessions/details-of-description-part-ii-describing-images-in-practice/
Presented by BookNet Canada on June 25, 2024, with support from the Department of Canadian Heritage.
Transcript: Details of description part II: Describing images in practice - T...
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSOR NETWORKS
1. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
DOI : 10.5121/ijasuc.2013.4204 47
ENERGY EFFICIENT AGGREGATION WITH
DIVERGENT SINK PLACEMENT FOR WIRELESS
SENSOR NETWORKS
Prakashgoud Patil1
and Umakant P Kulkarni2
1
Master of Computer Applications
B.V.B.College of Engineering & Technology, Hubli-580031, Karnataka, India
prpatilji@gmail.com
1
Computer Science & Engg. Department
S. D. M. College of Engineering and Technology, Dharwad, Karnataka India
upkulkarni@yahoo.com
ABSTRACT
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
KEYWORDS
Wireless Sensor Network (WSN); Clustering; Cluster Head (CH); Aggregation; Energy Metrics.
1. INTRODUCTION
In WSN the data aggregation is a means for condensing the energy requirement by reducing
number of transmission by combining the data and sending the final required result to the base
station. The lifetime of the WSN can be improved by employing the aggregation techniques.
During the process of aggregation the numbers of transmissions are reduced by combining the
similar data from the nearby areas.A sensor node is generally resource constrained with
relatively small memory, restricted computation capability, short range wireless transmission-
receiver and limited built-in battery power. WSN become increasingly useful in variety of
critical applications such as environmental monitoring, smart offices, health care, battle field
surveillance and transportation and traffic monitoring. In most applications of sensor networks
the nodes are deployed randomly. Sensor nodes will establish a network by communication with
the nodes within their radio range. In most applications, it is impossible to replace or recharge
battery of sensor nodes. Energy expenditure of sensor nodes has to be done carefully in order to
prolong life of sensor network. Clustering with data aggregation is one of the solutions to
2. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
48
increase lifetime of sensor network.Data aggregation suppresses the duplicate packets and sends
combined data to the base station thus it minimizes the transmission and achieves the energy
efficiency. It is one of the important technique because it reduces the number of packets
transmission, reduce theenergy consumption, increase the network lifetime and increase
successful data transmission ratio [1-2].
2. REVIEW ON DATA AGGREGATION TECHNIQUES
In direct transmission technique every node transmits the data directly to the sink node in WSN.
The cost of transmitting data is expensive in the direct transmission and more energy is
consumed by each sensor in each rounds. So, in direct transmission technique the nodes die
quickly due to their participation in each sensing round [4].In order to solve this problem many
clustered based protocols are designed for Sensor Networks [7,8].
The WSN is classified as Homogeneous and Heterogeneous networks based on the types of
nodes. All the nodes are identical in the homogeneous networks and Heterogeneous network
may consist of different types of nodes [3]. Most of the current clustering algorithms are
homogeneous schemes, such as LEACH [7] and SEP [8].
In case of cluster based WSN, every cluster have the cluster head. The cluster head performs
data aggregation and it has a capability to transmit data at long distance to reach sink node. In
LEACH protocol the energy expenditure in each round is uniform because it selects the cluster
head periodically. In LEACH algorithm the cluster head selected based on the probability. The
cluster formation by the LEACH may not produce efficient clusters. LEACH improves the
system performance lifetime and data accuracy of the network but the protocol has some
limitations such as the elected cluster head will be concentrated on one part of the network and
clustering terminates in a constant number of iterations. The performance of LEACH is not
good in heterogeneous network. SEP [9] is developed for the two level heterogeneous network,
which includes two types of nodes called advanced and normal nodes.
3. WIRELESS SENSOR NETWORK MODEL
The Wireless Sensor Networks(WSN) is a different type of networking in the field of wireless
which consist of thousands of autonomoussensor nodes in the sensing field which are spatially
distributed to monitor physical or environmental conditions [9-12]. In our design we assumed N
number of nodes in M x N network field as shown in Figure 2. The following characteristics are
assumed to simplify the WSN model.The nodes are energy constrained devices which runs on
limited batteries. In WSN the communication links are symmetric and node are having same
capabilities and resources in terms of battery power and processing capabilities. Nodes are
deployed in the sensing region.
Figure 1 Sensor Network Model
3. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
49
Normally the position of the sink node or base station is at the centre of the field. In our
experiment the position of the base station or sink node is divergent. There is one Base Station
(BS) which is located at the centre / corner or at any random location of the sensing field. It is
assumed that the node senses the environment and sends data in each round.
In this work, we mainly focus on the performance of the proposed algorithm for different sink
positions. In WSN environment each node senses the environmental parameters and sends data
to the sink node. Our aim is to maximize the sensor network lifetime by following the
aggregation technique and to analyze the network efficiency in terms of energy when the sink
node placed different places.
4. RADIO ENERGY DISSIPATION MODEL
The energy dissipation model is significant in designing WSN. To simulate Wireless Sensor
Network most of the authors used free space propagation model in the literature. In WNS, large
amount of energy is consumed by the communication subsystem. To minimize the energy
requirement, one should need to control the redundant communication using aggregation
techniques by avoiding the transmission of redundant data. The energy consumption model used
in our work is similar to the energy model proposed by Heinzelmanet. Al [7,8] and is as show in
the figure 2.
Figure 2 Radio Energy Model
The free space ( d power loss) and multipath model ( d power loss) were used depending
transmitter and receiver distance. The threshold is set for the distance. If the distance is less than
the specified value the free space model ( .)is used and multipath model ( .) is used
when the distance between the transmitter and receiver is more than the threshold value. The
total energy expenditure to transmit K-bit message at a distance d calculated using equation-1.
( . ) =
. + . . <
. + . . ≥
(1)
Where E is the energy spent to operate the transceiver circuit and which depends on factors
such as the digital coding, modulation, filtering, and spreading of the signal.Amplifier energy,
E .d or E .d , are the energy expenditure of transmitting one bit data to achieve an
acceptable bit error rate and is dependent on the distance of transmission in case of free space
model and multipath fading model. In simple term, this depends on the distance to the receiver
and the acceptable bit-error rate.
Value of threshold distance is given by equation-2.
=
.
(2)
4. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
50
5. OBJECTIVE AND SCOPE
The main objective of this proposed work is to improve upon the existing clustering protocol
and propose an optimized algorithm for the clustering in order to prolong network lifetime.
Prolonging network lifetime is the way to provide energy efficient WSNs [6]. The main aim of
this proposed work is to study the performance of our proposed aggregation protocol with
divergent sink placements such as when sink is at the centre of the sensing field, corner of the
sensing field or at a location selected randomly in the sensor field.
5.1 Problem formulation
LEACH cluster-heads are stochastically means not deterministically selected. The cluster head
selection for the round is based on the random number generated between 0 and 1. The random
number generated is compared with a threshold T(n), if the random number is less than the
Threshold value then the node will become cluster head for that round.The threshold is set as
per the equation-3.
where is the set of nodes which are not elected as cluster head in the last rounds.
- is the cluster head probability or percentage of node to become CH.
- Number of the current round. - Set of nodes that have not been cluster head.
Every node becomes a CH exactly once within 1/p round.
5.2 The limitations of the LEACH protocol
Although energy consumption is a critical problem in WSNs, LEACH does not consider the
remaining energy of nodes when selecting CHs. Since CH election is probabilistic, a node with
very low energy has a good chance of becoming a CH. When this node dies, the entire cluster is
dysfunctional. It is possible that some CHs are located within close proximity of each other.
This indicates that CHs are not well distributed in the network. In worst case scenario all CHs
may be located near the edge of the network. If cluster heads are selected unfavourably near the
edge of the network, in such situations some nodes have to bridge long distance to reach a
cluster head. This may result in unfavourable cluster head selection in later rounds
5.3 Proposed Approach
In our proposed approach, we have developed novel aggregation algorithm by modifying the
LEACH threshold equation by multiplying with Node Remaining Energy Coefficient (NREC)
as given in the equation-9 and 10.
Where is the number of consecutive rounds in which node has not been cluster head.
The flowchart for the proposed protocol is as per the given in figure-3. The following section
describes the details of our approach.
5. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
51
Figure 3 Flowchart for EECAP
Initialization of Network
This requires the initialization for the following parameters- Size of Sensing Field (Xm X Ym) ,
Number of Nodes (N), Position of Sink Node(Xs,Ys), Parameters for radio energy dissipation
model such as the energy expedited to transmit , receive and amplify.
Creation of Random Sensor Network
After the initialization phase, the number of nodes are deployed on the field to create the senor
network. Sink node is positioned at the centre / cornet / at any random location of the sensor
field.
6. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
52
Cluster head Election and Node Association
If a node is elected as a cluster head during last q round where q < r or it has received cluster
head announcement from the neighbouring nodes during a particular round, a node withdraws
its participation to be elected as a cluster head during that round and decide to join one of the
cluster heads from which it has received cluster head announcement and having highest RSSI
(Received Signal Strength Indicator) amongst all received cluster head announcements. If a
node which is neither a cluster head nor a member node will send data directly to the base
station.
If a node is a cluster head it will collect data from the member nodes, aggregate them and send it
to base station. Member nodes will be activated and send its data to cluster head as per the
TDMA schedule sent by the cluster head. For the rest of the time member nodes will remain
into SLEEP state to save energy and reactivated at the end of the round time.
6. Implementation and Performance Evaluation
To evaluate the performance of EECAP protocol, Simulation experiments are carried out in
Matlab (2009a) [14]. The results of EECAP are compared with performance of the LEACH and
SEP with Divergent Sink Placement basis of average node remaining energy and the longevity
of the network. The initial values for the various parameters for the senor network have been set
and the details are given in the table -1.
Table1:Network Initial Parameters
Parameters Value
Sink Position a) Centre
b) Corner
c) Random
Network Field(xmxym) (100X100)
Number of Nodes (n) 100
Normal Node Initial energy (Eo ) 0.5 J
Message Size 4000 Bits
Eelec 50nJ/bit
Efs 10nJ/bit/m
Eamp 0.0013pJ/bit/
EDA 5nJ/bit/signal
do( Threshold Distance) 70m
Popt 0.1
In our analysis the following parameters have been used to compare the performance of
aggregation algorithms with divergent sink placement.
Average Remaining Energy of Node (AREN): This is measure of average energy remaining
in all the nodes after each epoch. The energy spent by each node includes operations like
transmitting, receiving, sensing, aggregation of data etc. This is calculated by taking summation
of energy present in each node after each round divided by the number of nodes.
Total number of Dead Nodes (TNDN):The lifetime of the network is measured by the total
number of deadnodes (TNDN) in the network after specified number of rounds.
Stability period (SP):The stability period indicates the steadiness of the network. It is the time
from the start of the network operation and death of the first node in the WSN. This is also
referred as “stable region” of a network.
7. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
53
The performance of EECAP is evaluated at divergent sink positions such as – first time when
the sink node is at the centre of the sensor field, second time when the sink node is at the corner
of the sensing field and lastly the sink node is positioned at a random location in the sensor
field.
7. Results
The figure 4 and 5 shows the number of dead nodes versus sensing rounds. In our proposed
protocol, the first sensor node dies on 1002- sensing round. Whereas, the first node dies quiet
earlier in LEACH( 807 round) and SEP(792 round ) protocol. In LEACH protocol first sensor
node dies on 807th round and in SEP first sensing node dies on 792 rounds. This clearly
indicates that the stability of our proposed algorithm is better in its initial operation i.e. almost
of about 1250 sensing rounds.
Figure 4 Number of Nodes Dead vs Rounds
The figure 5 shows the lifetime comparison for the LEACH, SEP and EECAP (proposed)
algorithms using line graph which shows that the performance of the proposed protocol is stable
and consist throughout all the rounds as compared with LEACH and SEP.
Figure 5 Number of Nodes Dead vs Rounds
8. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
54
The figure 6 shows the performance of LEACH protocol with divergent sink placement such as
when the sink node is located at the centre of the sensor field, when the sink node is placed at
the corner of the sensing field and at any random position in the sensor field. It is observed that
the performance of LEACH protocol is slightly better when the sink node is positioned at the
centre of the sensing field.
Figure 6 Performance of LEACH on Divergent Sink Placement
The figure 7 shows the performance of SEP protocol with divergent sink placement such as
when the sink node is located at the centre of the sensor field, when the sink node is placed at
the corner of the sensing field and at any random position in the sensor field. It is observed that
the performance of SEP protocol is also slightly better when the sink node is positioned at the
centre of the sensing field.
Figure 7 Performance of SEP on Divergent Sink Placement
9. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
55
The performance of EECAP (proposed) protocol with divergent sink placement such as when
the sink node is located at the centre of the sensor field, when the sink node is placed at the
corner of the sensing field or at any random position in the sensor field is as shown in the figure
8. It is observed that the performance of EECAP protocol is also slightly better when the sink
node is positioned at the centre of the sensing field but the there is very small deviation in the
performance when the sink node is placed at different places (Centre, Corner and Random) in
the sensing field and this indicates that the EECAP will have less impact on change of the sink
position in the sensing field.
Figure 8 Performance of EECAP on Divergent Sink Placement
After analyzing all plots given in figures [4-10], it shows that the performance of the proposed
protocol EECAP almost same as SEP protocol in the initial rounds of its operation and better
than the LEACH throughout its lifetime. It is observed that the number of nodes alive at any
specified time during the simulation is higher for EECAP as compared to other two protocols.
10. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
56
Figure 9 Performance - Sink Placement @ Centre of Sensor Field
Figure 10 Performance - Sink Placement @ Corner of Sensor Field
11. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
57
Figure 11 Performance - Sink Placement @ Random Position in Sensor Field
8. CONCLUSION
A major challenge in designing an efficient protocol for wireless sensor networks is maximizing
network lifetime when the sink node is not a stationary. We studied and compared the
performance of our proposed aggregation protocol with LEACH and SEP with divergent sink
placement such as when sink is at the centre, corner or at a location selected randomly in the
sensor field. The simulation results demonstrate that EECAP exhibits good performance in
terms of lifetime and the energy consumption of the wireless sensor networks. The stability of
our proposed algorithm is better during the initial operations of the sensor networks.
REFERENCES
[1] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “Wireless sensor networks: A
survey,” Computer Networks, vol. 38, no. 4, pp. 393– 422, 2002.
[2] Brett A. Warneke, Kristofer S.J. Pister, “MEMS for Distributed Wireless Sensor Networks”,
Berkeley Sensor and Actuator Center, University of California at Berkeley
[3] V. Mhatre and C. Rosenberg, “Homogeneous vs. heterogeneous clustered sensor networks: A
comparative study,” in Proceedings of 2004 IEEE International Conference on Communications
(ICC 2004), June 2004.
[4] Stephanie Lindsey, CauligiRaghavendra , “Data Gathering Algorithms in Sensor Networks Using
Energy Metrics”, IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS,
VOL. 13, NO. 9, SEPTEMBER 2002
[5] Ramesh Rajagopalan and Pramod K. Varshney, “Data aggregation techniques in sensor networks: A
survey”, IEEE Communications Surveys and Tutorials, vol. 8, no. 4, 4th quarter ,2006.
[6] Ameer Ahmed Abbasi a, Mohamed Younis b,” A survey on clustering algorithms for wireless
sensor networks”, ELSEVIER
[7] W. R. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-efficient communication
protocol for wireless microsensor networks” , Proceedings of the 33rd Annual Hawaii International
Conference on system Sciences, vol.2, pp. 3005-3014, 2000.
[8] G. Smaragdakis, I. Matta, A. Bestavros, “SEP: A Stable Election Protocol for clustered
12. International Journal of Ad hoc, Sensor & Ubiquitous Computing (IJASUC) Vol.4, No.2, April 2013
58
heterogeneous wireless sensor networks” , Second International Workshop on Sensor and Actor
Network Protocols and Applications (SANPA 2004), 2004.
[9] Woo-Sung Jung, Keun-Woo Lim, Young-BaeKo, Sang-Joon Park, "A Hybrid Approach for
Clustering-Based Data Aggregation in Wireless Sensor Networks,", ICDS, pp.112-117, 2009 Third
International Conference on Digital Society, 2009.
[10] L. Qing, Q. Zhu, M. Wang, "Design of a distributed energy efficient clustering algorithm for
heterogeneous wireless sensor networks". ELSEVIER, Computer Communications 29, pp 2230-
2237, 2006.
[11] SumitChaudhary, Neha Singh, AvinavPathak and A.K Vatsa, “Energy Efficient Techniques for Data
aggregation and collection in WSN”, International Journal of Computer Science, Engineering and
Applications (IJCSEA) Vol.2, No.4, August 2012
[12] http://www.mathworks.in/help/matlab/index.html
[13] PrakashgoudPatil, Umakant P Kulkarni, Data Aggregation in Wireless Sensor Networks Using
Fuzzy Aggregator, International Conference on Soft-Computing and Engineering Applications –
ICSEA2011, IRNet ISBN : 978-93-81583-01-2.
[14] PrakashgoudPatil, Umakant P Kulkarni, Some Issues in Clustering Algorithms for Wireless Sensor
Networks, IJCA Special Issue on “2nd National Conference- Computing, Communication and
Sensor Network” CCSN, 2011.
[15] PrakashgoudPatil, Umakant P Kulkarni, Effect of Data Aggregation on Wireless Sensor Network
Performance, IEEE Conference - TRENDZ IN INFORMATION SCIENCES & COMPUTING –
TISC 2011 ISBN 978-1-4222-9009-7
Authors
Prof. PrakashgoudPatil received his Bachelor Degree in Computer Science and
Engineering from Karnataka University, Dharwad (Karnataka - India) in 1991 and
ME degree in Computer Science from Tapar Institute ofEngineering Technology
(TIET), Patiala, Punjab. Presently, he is pursuing Ph.D degree in Computer
Research Centre at S.D.M Engineering College, Dharwad affiliated to Visvesvaraya
Technological University, Belgaum under the guidance of Dr. Umakant P.
Kulkarni.
He is currently working as Associate Professor in Master of Computer Applications Department, B.V.B
College of Engineering and Technology, Hubli, Karantak (India). He has presented and published
research papers at national and international conferences and reputed journals and won best paper awards.
He is also actively involved in the development of business applications using open source software &
technologies and his research interests include Computer Networking, Wireless Sensor Networks and
Cyber Security.
Prof. Umakant P. Kulkarni received his PhD degree from Shivaji University,
Kolhapur. Research Centre:-Walchand College of Engineering & Tech, Sangli,
Maharashtra in Nov 2007. He received his Masters degree (M.E) from PSG,
Coimbatore. He is currently working as Professor in Computer Science
Department, SDMCET, Dharwad, Karnataka. He has published and presented a
number of papers in many reputed journals and at International IEEE conferences
as well. This apart he also has presented technical talks and tutorials on various
aspects of Mobile Agents. His research interests include mobile agents, computer
networking, and distributed networking.