With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
QUAD TREE BASED STATIC MULTI HOP LEACH ENERGY EFFICIENT ROUTING PROTOCOL: A N...IJCNCJournal
This research work propounds a simple graph theory semblance Divide and Conquer Quad tree based Multi-hop Static Leach (DCQMS-Leach) energy efficient routing protocol for wireless sensor networks. The pivotal theme of this research work is to demonstrate how divide and conquer plays a pivotal role in a multi-hop static leach energy efficient routing protocol. This research work motivates, enforces, reckons the DCQMS-Leach energy efficient routing protocol in wireless sensor networks using Mat lab simulator.This research work also computes the performance concepts of DCQMS-Leach routing protocol using various performance metrics such as Packet Drop Rate (PDR), Throughput, and End to End Delay (EED) by comparing and contrasting alive nodes with number of nodes, number of each packets sent to the cluster heads with rounds, number of cluster heads with rounds, number of packets forwarded to the base station with rounds and finally dead nodes with number of rounds. In order to curtail energy consumption this research work proffers a routing methodology such as DCQMS-Leach in energy efficient wireless,sensor routing protocol. The recommended DCQMS-Leach overcomes the in adequacies of all other different leach protocols suggested by the previous researchers.
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
In wireless sensor networks (WSN), conserving energy and increasing lifetime of the network are a critical issue that has been addressed by substantial research works. The clustering technique has been proven particularly energy-efficient in WSN. The nodes form groups (clusters) that include one cluster head and member clusters. Cluster heads (CHs) are able to process, filter, gather the data sent by sensors
belonging to their cluster and send it to the base station. Many routing protocols which have been proposed are based on heterogeneity and use the clustering scheme such as SEP and DEEC. In this paper we introduce a new approach called WDDC in which cluster heads are chosen on the basis
of probability of ratio of residual energy and average energy of the network. It also takes into consideration distances between nodes and the base station to favor near nodes with more energy to be cluster heads. Furthermore, WDDC is dynamic; it divides network lifetime in two zones in which it changes its behavior. Simulation results show that our approach performs better than the other distributed clustering protocols such as SEP and DEEC in terms of energy efficiency and lifetime of the network.
Energy efficient clustering in heterogeneousIJCNCJournal
Cluster head election is a key technique used to reduce energy consumption and enhancing the throughput
of wireless sensor networks. In this paper, a new energy efficient clustering (E2C) protocol for
heterogeneous wireless sensor networks is proposed. Cluster head is elected based on the predicted
residual energy of sensors, optimal probability of a sensor to become a cluster head, and its degree of
connectivity as the parameters. The probability threshold to compete for the role of cluster head is derived.
The probability threshold has been extended for multi-levels energy heterogeneity in the network. The
proposed E2C protocol is simulated in MATLAB. Results obtained in the simulationshowthat performance
of the proposed E2Cprotocol is betterthan stable election protocol (SEP), and distributed energy efficient
clustering (DEEC) protocol in terms of energy consumption, throughput, and network lifetime.
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.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
ENERGY EFFICIENT HIERARCHICAL CLUSTER HEAD ELECTION USING EXPONENTIAL DECAY F...ijwmn
In the recent years, wireless sensor network (WSN) have witnessed increased interest in information gathering in applications such as combat field reconnaissance, security surveillance, environmental monitoring, patient health monitoring and so on. Thus, there is a need for scalable and energy-efficient routing, data gathering and aggregation protocols in these WSN environments. Various hierarchical
clustering Protocols have been proposed by authors for WSN to improve system stability, lifetime, and energy efficiency. Clustering involves grouping nodes into disjoint and non-overlapping clusters. In this paper we motivate the need for clustering. Secondly, we present general classification of published clustering schemes. Thirdly, we review some existing clustering algorithms proposed for WSNs; highlighting their objectives, features, and so on. Finally, we develop an Average Energy (AvE) prediction algorithm using exponential decay function y=Ae-ax+B. We then combine this function with the
probabilistic distributed LEACH of algorithm to determine suitable CHs. The combined algorithm was implemented on MATLAB simulator and tested for homogenous network. The result gathered from the simulation shows that the extended algorithm in homogenous network mode is able to achieve 39%
stability, 11% Average energy Dissipation per round and 40% Lifespan better than LEACH-Homo. This paper proposes a new direction in improving energy efficiency of WSN routing protocol, which is desirable in some critical WSN applications. .
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...Editor IJMTER
The main motive of this research is to study energy-efficient data-gathering mechanisms to
abnormal packet data for saving the energy. To detect the abnormal packet irregularities is useful for
saving energy, as well as for management of network, because the patterns found can be used for
both decision making in applications and system performance tuning. Node distribution in WSNs is
either deterministic or self-organizing and application dependant. The sensor nodes in WSNs have
minimum energy and they use their energy for communication and sensing.
ENERGY EFFICIENT AGGREGATION WITH DIVERGENT SINK PLACEMENT FOR WIRELESS SENSO...ijasuc
In WSN the data aggregation is a means for condensing the energy requirement by reducing number of
transmission by combining the data and sending the final required result to the base station. The lifetime
of the WSN can be improved by employing the aggregation techniques. During the process of aggregation
the numbers of transmission are reduced by combining the similar data from the nearby areas. By using
the clustering technique and aggregating the correlated data greatly minimize the energy consumed in
collecting and disseminating the data. In this work, we evaluate the performance of a novel energy
efficient cluster based aggregation protocol (EECAP) for WSN. The main focus in this proposed work is
to study the performance of our proposed aggregation protocol with divergent sink placements such as
when sink is at the centre of the sensing field, corner of the sensing field or at a location selected
randomly in the sensor field. We present experimental results by calculating the lifetime of network in
terms of number of sensing rounds using various parameters such as – average remaining energy of
nodes, number of dead nodes after the specified number of sensing rounds. Finally the performance of
various aggregation algorithms such as LEACH, SEP and our proposed aggregation protocol (EECAP)
are compared with divergent sink placements. The simulation results demonstrates that EECAP exhibits
good performance in terms of lifetime and the energy consumption of the wireless sensor networks and
which can be as equally compared with existing clustering protocols.
QUAD TREE BASED STATIC MULTI HOP LEACH ENERGY EFFICIENT ROUTING PROTOCOL: A N...IJCNCJournal
This research work propounds a simple graph theory semblance Divide and Conquer Quad tree based Multi-hop Static Leach (DCQMS-Leach) energy efficient routing protocol for wireless sensor networks. The pivotal theme of this research work is to demonstrate how divide and conquer plays a pivotal role in a multi-hop static leach energy efficient routing protocol. This research work motivates, enforces, reckons the DCQMS-Leach energy efficient routing protocol in wireless sensor networks using Mat lab simulator.This research work also computes the performance concepts of DCQMS-Leach routing protocol using various performance metrics such as Packet Drop Rate (PDR), Throughput, and End to End Delay (EED) by comparing and contrasting alive nodes with number of nodes, number of each packets sent to the cluster heads with rounds, number of cluster heads with rounds, number of packets forwarded to the base station with rounds and finally dead nodes with number of rounds. In order to curtail energy consumption this research work proffers a routing methodology such as DCQMS-Leach in energy efficient wireless,sensor routing protocol. The recommended DCQMS-Leach overcomes the in adequacies of all other different leach protocols suggested by the previous researchers.
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
In wireless sensor networks (WSN), conserving energy and increasing lifetime of the network are a critical issue that has been addressed by substantial research works. The clustering technique has been proven particularly energy-efficient in WSN. The nodes form groups (clusters) that include one cluster head and member clusters. Cluster heads (CHs) are able to process, filter, gather the data sent by sensors
belonging to their cluster and send it to the base station. Many routing protocols which have been proposed are based on heterogeneity and use the clustering scheme such as SEP and DEEC. In this paper we introduce a new approach called WDDC in which cluster heads are chosen on the basis
of probability of ratio of residual energy and average energy of the network. It also takes into consideration distances between nodes and the base station to favor near nodes with more energy to be cluster heads. Furthermore, WDDC is dynamic; it divides network lifetime in two zones in which it changes its behavior. Simulation results show that our approach performs better than the other distributed clustering protocols such as SEP and DEEC in terms of energy efficiency and lifetime of the network.
Energy efficient clustering in heterogeneousIJCNCJournal
Cluster head election is a key technique used to reduce energy consumption and enhancing the throughput
of wireless sensor networks. In this paper, a new energy efficient clustering (E2C) protocol for
heterogeneous wireless sensor networks is proposed. Cluster head is elected based on the predicted
residual energy of sensors, optimal probability of a sensor to become a cluster head, and its degree of
connectivity as the parameters. The probability threshold to compete for the role of cluster head is derived.
The probability threshold has been extended for multi-levels energy heterogeneity in the network. The
proposed E2C protocol is simulated in MATLAB. Results obtained in the simulationshowthat performance
of the proposed E2Cprotocol is betterthan stable election protocol (SEP), and distributed energy efficient
clustering (DEEC) protocol in terms of energy consumption, throughput, and network lifetime.
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.
Clustering provides an effective method for
extending the lifetime of a wireless sensor network. Current
clustering methods selecting cluster heads with more residual
energy, and rotating cluster heads periodically to distribute the
energy consumption among nodes in each cluster. However,
they rarely consider the hot spot problem in multi hop sensor
networks. When cluster heads forward their data to the base
station, the cluster heads closer to the base station are heavily
burdened with traffic and tend to die much faster. To mitigate
the hot spot problem, we propose a Novel Energy Efficient
Unequal Clustering Routing (NEEUC) protocol. It uses residual
energy and groupsthe nodesinto clusters of unequal layers
ENERGY EFFICIENT HIERARCHICAL CLUSTER HEAD ELECTION USING EXPONENTIAL DECAY F...ijwmn
In the recent years, wireless sensor network (WSN) have witnessed increased interest in information gathering in applications such as combat field reconnaissance, security surveillance, environmental monitoring, patient health monitoring and so on. Thus, there is a need for scalable and energy-efficient routing, data gathering and aggregation protocols in these WSN environments. Various hierarchical
clustering Protocols have been proposed by authors for WSN to improve system stability, lifetime, and energy efficiency. Clustering involves grouping nodes into disjoint and non-overlapping clusters. In this paper we motivate the need for clustering. Secondly, we present general classification of published clustering schemes. Thirdly, we review some existing clustering algorithms proposed for WSNs; highlighting their objectives, features, and so on. Finally, we develop an Average Energy (AvE) prediction algorithm using exponential decay function y=Ae-ax+B. We then combine this function with the
probabilistic distributed LEACH of algorithm to determine suitable CHs. The combined algorithm was implemented on MATLAB simulator and tested for homogenous network. The result gathered from the simulation shows that the extended algorithm in homogenous network mode is able to achieve 39%
stability, 11% Average energy Dissipation per round and 40% Lifespan better than LEACH-Homo. This paper proposes a new direction in improving energy efficiency of WSN routing protocol, which is desirable in some critical WSN applications. .
A Review Study on Shortest Path in WSN to detect the Abnormal Packet for savi...Editor IJMTER
The main motive of this research is to study energy-efficient data-gathering mechanisms to
abnormal packet data for saving the energy. To detect the abnormal packet irregularities is useful for
saving energy, as well as for management of network, because the patterns found can be used for
both decision making in applications and system performance tuning. Node distribution in WSNs is
either deterministic or self-organizing and application dependant. The sensor nodes in WSNs have
minimum energy and they use their energy for communication and sensing.
Energy Efficient 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.
Cluster Head Selection Techniques for Energy Efficient Wireless Sensor Networ...ijsrd.com
Wireless sensor networks are widely considered as one of the most important technologies. The Wireless Sensor Network (WSN) is a wireless network consisting of ten to thousand small nodes with sensing, computing and wireless communication capabilities. They have been applied to numerous fields such as healthcare, monitoring system, military, and so forth. Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Energy efficiency is thus a primary issue in maintaining the network. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach in wireless sensor networks. This paper elaborates several techniques like LEACH, HEED, LEACH-B, PEACH, EEUC of cluster head selection for energy efficient in wireless sensor networks.
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
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
Energy aware clustering protocol (eacp)IJCNCJournal
Energy saving to prolong the network life is an important design issue while developing a new routing
protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the
network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a
homogeneous network architecture, in which all sensors have the same capabilities in terms of battery
power, communication, sensing, storage, and processing. Recently, there has been an interest in
heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new
energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is
introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal
nodes are elected with the help of a probability scheme based on residual and average energy of the
normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a
round. Advanced nodes use a separate probability based scheme for cluster head election and they will
further act as a gateway for normal cluster heads and transmit their data load to base station when they
are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during
cluster formation phase to save network energy. The performance of EACP is compared with SEP and
simulation result shows the better result for stability period, network life and energy saving than SEP.
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)
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.
ENERGY EFFICIENT ROUTING ALGORITHM FOR MAXIMIZING THE MINIMUM LIFETIME OF WIR...ijasuc
In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
A Fast Convergence and Quick Route Updates Based Energy Aware Tree-Based Rout...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
A NOVEL ROUTING PROTOCOL FOR TARGET TRACKING IN WIRELESS SENSOR NETWORKSIJCNCJournal
Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more
number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage,
processing power. They have wireless capabilities to monitor physical or environmental conditions. This
paper compared the performance analysis of some existing routing protocols for target tracking
application with proposed hierarchical binary tree structure to store the routing information. The sensed
information is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparent
node) which deployed using complete binary tree data structure. This reduces traffic implosion and
geographical overlapping. Simulation result showed improved network lifetime by 20%, target detection
probability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routing
efficiency. We have evaluated our proposed algorithm using NS2.
FUZZY-CLUSTERING BASED DATA GATHERING IN WIRELESS SENSOR NETWORK ijsc
Wireless Sensor Networks (WSN) is spatially distributed, collection of sensor nodes for the purpose of
monitoring physical or environmental conditions, such as temperature, sound, pressure, etc. and to
cooperatively pass their data through the network to a base station. The critical challenge is to minimize
the energy consumption in data gathering and forwarding from sensor nodes to the sink. Cluster based
data aggregation is one of the most popular communication protocols in this field. Clustering is an
important procedure for extending the network lifetime in wireless sensor networks. Cluster Heads (CH)
aggregate data from relevant cluster nodes and send it to the base station. A main challenge in WSNs is to
select suitable CHs. Another communication protocol is based on a tree construction. In this protocol,
energy consumption is low because there are short paths between the sensors. In this paper, Dynamic
Fuzzy Clustering data aggregation is introduced. This approach is based on clustering and minimum
spanning tree. The proposed method initially uses fuzzy decision making approach for the selection of CHs.
Afterward a minimum spanning tree is constructed based on CHs. CHs are selected efficiently and
accurately. The combining clustering and tree structure is reclaiming the advantages of the previous
structures. Our method is compared to the well-known data aggregation methods, in terms of energy
consumption and the amount of energy residuary in each sensor network lifetime. Our method decreases
energy consumption of each node. When the best CHs selected and the minimum spanning tree is formed by
the best CHs, the remaining energy of the nodes will be preserved. Node lifetime has an important role in
WSN. Using our proposed data aggregation algorithm, survival of the network is improved
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.
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 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.
Cluster Head Selection Techniques for Energy Efficient Wireless Sensor Networ...ijsrd.com
Wireless sensor networks are widely considered as one of the most important technologies. The Wireless Sensor Network (WSN) is a wireless network consisting of ten to thousand small nodes with sensing, computing and wireless communication capabilities. They have been applied to numerous fields such as healthcare, monitoring system, military, and so forth. Recent advances in wireless sensor networks have led to many new protocols specifically designed for sensor networks where energy awareness is an essential consideration. Energy efficiency is thus a primary issue in maintaining the network. Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required. Clustering is an effective topology control approach in wireless sensor networks. This paper elaborates several techniques like LEACH, HEED, LEACH-B, PEACH, EEUC of cluster head selection for energy efficient in wireless sensor networks.
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
Energy Conservation in Wireless Sensor Networks Using Cluster-Based ApproachIJRES Journal
In a wireless networking environment, the network is comprised of sensor nodes and backbones are subsets of sensors or actuators that suffice for performing basic data communication operations. They are applied for energy efficient broadcasting. In a broadcasting (also known as data dissemination) task, a message is to be sent from one node, which could be a sink or an actuator, to all the sensors or all the actuators in the network. The goal is to minimize the number of rebroadcasts while attempting to deliver messages to all sensors or actuators. Neighbor detection and route discovery algorithms that consider a realistic physical layer are described. An adaptive broadcasting protocol without parameters suitable for delay tolerant networks is further discussed. In existing solutions for minimal energy broadcasting problem, nodes can adjust their transmission powers. Wireless Sensor Networks (WSNs) are sets of many sensors that gather data and collaborate together. So, the procedures of broadcast or multicast are more important than traditional point-to-point communication in computer network. This paper focuses on broadcasting in structured WSNs. In such a kind, the procedure of network communications is easier than in unstructured WSNs. Thus, it will make an overview of Multi Point Relay (MPR) to show its weakness. Then define a cluster-based architecture for WSNs which is constructed using MPR. Next, provide a new broadcast algorithm based on the previous cluster architecture called 3B (Backbone Based Broadcasting). By the end, an illustration of 3B shows that it minimizes the energy consumption for accomplishing broadcast compared to MPR.
Energy aware clustering protocol (eacp)IJCNCJournal
Energy saving to prolong the network life is an important design issue while developing a new routing
protocol for wireless sensor network. Clustering is a key technique for this and helps in maximizing the
network lifetime and scalability. Most of the routing and data dissemination protocols of WSN assume a
homogeneous network architecture, in which all sensors have the same capabilities in terms of battery
power, communication, sensing, storage, and processing. Recently, there has been an interest in
heterogeneous sensor networks, especially for real deployments. This research paper has proposed a new
energy aware clustering protocol (EACP) for heterogeneous wireless sensor networks. Heterogeneity is
introduced in EACP by using two types of nodes: normal and advanced. In EACP cluster heads for normal
nodes are elected with the help of a probability scheme based on residual and average energy of the
normal nodes. This will ensure that only the high residual normal nodes can become the cluster head in a
round. Advanced nodes use a separate probability based scheme for cluster head election and they will
further act as a gateway for normal cluster heads and transmit their data load to base station when they
are not doing the duty of a cluster head. Finally a sleep state is suggested for some sensor nodes during
cluster formation phase to save network energy. The performance of EACP is compared with SEP and
simulation result shows the better result for stability period, network life and energy saving than SEP.
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)
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.
ENERGY EFFICIENT ROUTING ALGORITHM FOR MAXIMIZING THE MINIMUM LIFETIME OF WIR...ijasuc
In wireless sensor network, devices or nodes are generally battery powered devices. These nodes have
limited amount of initial energy that are consumed at different rates, depending on the power level. The
lifetime of the network is defined as the time until the first node fails (or runs out of battery). In this paper
different type of energy efficient routing algorithms are discussed and approach of these algorithms is to
maximize the minimum lifetime of wireless sensor network. Special attention has been devoted for
algorithms formulate the routing problem as a linear programming problem, which uses the optimal flow
path for data transmission and gives the optimum results. Advantages, limitations as well as comparative
study of these algorithms are also discussed in this paper.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
A Fast Convergence and Quick Route Updates Based Energy Aware Tree-Based Rout...iosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
A NOVEL ROUTING PROTOCOL FOR TARGET TRACKING IN WIRELESS SENSOR NETWORKSIJCNCJournal
Wireless sensor networks (WSNs) are large scale integration consists of hundreds or thousands or more
number of sensor nodes. They are tiny, low cost, low weight, and limited battery, primary storage,
processing power. They have wireless capabilities to monitor physical or environmental conditions. This
paper compared the performance analysis of some existing routing protocols for target tracking
application with proposed hierarchical binary tree structure to store the routing information. The sensed
information is stored in controlled way at multiple sensor nodes (e.g. node, parent node and grandparent
node) which deployed using complete binary tree data structure. This reduces traffic implosion and
geographical overlapping. Simulation result showed improved network lifetime by 20%, target detection
probability by 25%, and reduces error rate by 20%, energy efficiency, fault tolerance, and routing
efficiency. We have evaluated our proposed algorithm using NS2.
FUZZY-CLUSTERING BASED DATA GATHERING IN WIRELESS SENSOR NETWORK ijsc
Wireless Sensor Networks (WSN) is spatially distributed, collection of sensor nodes for the purpose of
monitoring physical or environmental conditions, such as temperature, sound, pressure, etc. and to
cooperatively pass their data through the network to a base station. The critical challenge is to minimize
the energy consumption in data gathering and forwarding from sensor nodes to the sink. Cluster based
data aggregation is one of the most popular communication protocols in this field. Clustering is an
important procedure for extending the network lifetime in wireless sensor networks. Cluster Heads (CH)
aggregate data from relevant cluster nodes and send it to the base station. A main challenge in WSNs is to
select suitable CHs. Another communication protocol is based on a tree construction. In this protocol,
energy consumption is low because there are short paths between the sensors. In this paper, Dynamic
Fuzzy Clustering data aggregation is introduced. This approach is based on clustering and minimum
spanning tree. The proposed method initially uses fuzzy decision making approach for the selection of CHs.
Afterward a minimum spanning tree is constructed based on CHs. CHs are selected efficiently and
accurately. The combining clustering and tree structure is reclaiming the advantages of the previous
structures. Our method is compared to the well-known data aggregation methods, in terms of energy
consumption and the amount of energy residuary in each sensor network lifetime. Our method decreases
energy consumption of each node. When the best CHs selected and the minimum spanning tree is formed by
the best CHs, the remaining energy of the nodes will be preserved. Node lifetime has an important role in
WSN. Using our proposed data aggregation algorithm, survival of the network is improved
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.
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.
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.
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.
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.
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.
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.
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.
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.
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
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 International Journal of Advanced Smart Sensor Network Systems ( IJASSN ) (20)
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )
1. International Journal Of Advanced Smart Sensor Network Systems ( IJASSN ), Vol 2, No.2, April 2012
DOI: 10.5121/ijassn.2012.2202 15
ELITIST GENETIC ALGORITHM BASED ENERGY
EFFICIENT ROUTING SCHEME FOR WIRELESS
SENSOR NETWORKS
Vinay Kumar Singh1
, Vidushi Sharma2
1
Department of Computer Science & Engineering and Information Technology,
Anand Engineering College, Agra, India,
vksingh100@rediffmail.com
2
School of Information & Communication Technology, Gautam Buddha University,
Greater Noida, India,
vidushi@gbu.ac.in
ABSTRACT
Wireless Sensor Networks have gained world-wide attention in recent years due to the advances made in
wireless communication, information technologies and electronics field. They consist of resource
constrained sensor nodes that are usually randomly or manually deployed in an area to be observed,
collecting data from the sensor field and transmitting the gathered data to a distant Base Station. The
nodes are energy limited sensors, and therefore it is important to increase the network lifetime. Energy
saving is one of the critical issues in the routing design in WSNs. The factors causing the unequal energy
dissipation are firstly, the distance between the nodes and base station and secondly, the distance between
the nodes themselves. Using traditional methods it is difficult to obtain the high precision of solution as the
problem is NP hard. Applying genetic algorithms (GAs) in finding energy efficient shortest route for WSNs
is emerging as an important field. The routing in WSN is a combinatorial optimization problem, hence GA
can provide optimized solution to energy efficient shortest path problem in WSN. This paper uses a forward
address based shortest path routing in the network. Genetic algorithm with elitism concept is used to obtain
energy efficient routing by minimizing the path length and thus maximizing the life of the network. The
proposed algorithm has its inherent advantage that it keeps the elite solutions in the next generation so as
to quickly converge towards the global optima. The results show that GAs are efficient for finding the
optimal energy constrained route as they can converge faster than other traditional methods used for
combinatorial optimization problems.
KEYWORDS
Energy Efficient, Genetic Algorithm, Elitism, Wireless Sensor Networks
1. INTRODUCTION
A Wireless sensor network consists of randomly/manually deployed sensors that sense the
physical or environmental events and send the data to the base station. A large number of small,
inexpensive, disposable and autonomous sensor nodes are generally deployed in an ad hoc
manner in vast geographical areas for remote operations. Sensor nodes in a WSN are constrained
in storage capacity, computation power, bandwidth and power supply[1, 2, 3]. The development
2. International Journal Of Advanced Smart Sensor Network Systems ( IJASSN ), Vol 2, No.2, April 2012
16
of low-cost, low-power, a multifunctional sensor has received increasing attention from various
industries. Sensor nodes are smaller in size and capable of sensing, gathering and processing data.
They also communicate with other nodes in the network, via radio frequency (RF) channel. The
areas of applications of WSNs vary from civil, healthcare, and environmental to military[4].
Energy Efficient Routing in Wireless sensor networks has gained a lot of attraction from the
researchers in the recent years. In [5, 6] summary of recent research results on energy efficient
data routing in sensor networks is given. To increase the network lifetime, the design of efficient
routing protocol for communication is very important. An illustration of the existing routing
protocol for wireless sensor network using data centric approach and present performance
analysis of these protocols is done in [7]. Evolutionary Algorithms can be used effectively to find
the energy efficient path in wireless sensor networks [8]. A simple approach to minimize the
average path length is proposed in [9] where they considered the wireless network of transceiver
nodes with a known spatial distribution using a Genetic Algorithm optimization method. Each of
the nodes consists of a relatively simple a transceiver (antennas, a receiver and a transmitter). The
goal of the optimization is to minimize the average path length from source to destination to
minimize the transmitted power. Further, a method proposed in [10] has used a multipath routing
protocol for wireless sensor networks that enhances the reliability of WSN by using multipath
routing. It is useful for delivering data in unreliable environments. The idea is to define many
paths from source to sink and send through them the same subpackets. This implies that the traffic
will increase significantly (not energy aware), but increasing the reliability of the network. The
idea is to split the original data packet into subpackets through each path. This can offer at the
end, even with the loss of subpackets, the reconstruction of the original message. Energy aware
consideration is not done which may reduce the lifetime of the sensor network. The energy
awareness in multi path routing is done in [11-14] with consideration of maximum lifetime
routing in Wireless Sensor Networks. This protocol routes data through a path whose nodes have
the largest residual energy. The path is switched whenever a better path is discovered. The
primary path will be used until its energy is below the energy of the backup path. By means of
this approach, the nodes in the primary route will not exhaust their energy by the continual use of
the same path, thus achieving longer lifetime.
Recent advances in WSN have led to searching for new routing schemes for wireless sensors
where energy awareness is essential consideration [15]. The aim of networks is to achieve high
quality of service (QoS) communication, thus sensor network schemes must focus primarily on
power conservation. Ad hoc routing techniques proposed in the literature do not usually fit the
requirements of the sensor networks. Hence, it is necessary to design a special multi hop wireless
routing technique between the sensor nodes and the sink node with a focus on energy efficiency.
A clustering method is proposed in [16] where a fixed number of cluster heads are selected based
on maximum residual energy of the nodes. Each cluster head is associated with a group of nodes
based on the minimum distance among them. In such scheduling, all the nodes dissipate uniform
energy and subsequently remain alive for long time.
Rest of the paper is organized as follows: Section 2 describes the network model used in this
paper, section 3 talks about the modified GA approach with elitism used for WSN routing, section
4 provides and analysis of the results obtained using the proposed scheme and section 5 is the
conclusion.
2. THE PROPOSED MODEL
The model considered in this paper realizes a powerful Base Station which has adequate source of
energy supply and it is located far away from the sink. The sensor nodes are homogeneous and
have limited energy. All the nodes have uniform initial energy allocation. The first order radio
3. International Journal Of Advanced Smart Sensor Network Systems ( IJASSN ), Vol 2, No.2, April 2012
17
model is used for calculation of the energy dissipation for data communication operations like
transmission and reception. The energy spent by a node in transmitting a k-bit packet to another
node d meters away, is given by:
ETXሺk, dሻ = ሺξୣ୪ୣୡ + ξୟ୫୮ ∗ d୬
ሻ ∗ k ሺ1ሻ
and the energy spent in receiving the packet is,
ETXሺkሻ = ξୣ୪ୣୡ ∗ k (2)
The energy spent in transmitting a packet from node i to j is the same as that from node j to i for
any given value of SNR i.e. there is a symmetric channel. The computational energy is negligible
in comparison to communicational energy and can be ignored. A routing path or chain is an
ordered sequence of the nodes in the network that transmit the data message towards the sink
node. A time interval in which a node generates a packet and transmits it towards its neighbor is
called a data collecting round. After receiving a packet from its previous node, every node relays
it to the next node in the chain. The task is to minimize the energy dissipation in the nodes, by the
formation of an optimal data collecting chain. Considering N nodes in the network, the total
energy expended in a typical data gathering round is the summation of the energy dissipated by
the individual sensor nodes. Total energy spent can be calculated for a packet size of k as follows,
E = {൫ξୣ୪ୣୡ + ξୟ୫୮ ∗ d୬
൯ + ξୣ୪ୣୡ} ∗ k
ିଵ
୧ୀଵ
ሺ3ሻ
di denotes the distance between the ith node and the (i+1)th node in the data collecting chain. A
threshold value is imposed on the communication radius between the nodes as dTH. This ensures
reliable communication in between the nodes reducing unwanted noise and packet loss
probability also this is necessary to reduce the energy consumption.
3. IMPROVED GENETIC ALGORITHM
Genetic Algorithms (GAs) are stochastic search mechanisms. They are mainly a probabilistic
search & optimization technique inspired by the mechanics of (Darwinian) natural selection and
genetics [17]. It has been shown [18-20] that genetic algorithm performs well in solving the
problem of finding path optimization for WSN. It works on a group of optimal or suboptimal
solution during the search and gives the optimal search path within a short time.
The algorithm works by storing useful information about the individuals from the current
population either implicitly through redundant representations [21-23].The elitist strategy ensures
that the best individual will not be destroyed. Instead, the best individual will take place of the
worst individual after the operations of crossover and mutation. If the energy of a particular node
in the routing reaches below a predefined level, the node is replaced in the routing chain based on
some probability. This is done, to prolong the lifetime of the network. Also new individuals are
inserted into the population after every generation so that the diversity is maintained and GA does
not get converge into local optima as shown in Figure 1. The steps of the modified GA are:
1. Population Initialization: In the first step N individuals (chromosomes) are produced randomly
and the evolutionary generation starts with iteration 0. The distance threshold (communication
radius) is initialized.
4. International Journal Of Advanced Smart Sensor Network Systems ( IJASSN ), Vol 2, No.2, April 2012
18
2. Fitness Calculation: The fitness function is designed to increase the lifetime of the network,
which evaluates whether, a particular chromosome increases lifetime of the network or not. The
algorithm preserves the historically obtained best chromosome, that is, with the highest fitness
value this is called elitism. The fitness of each chromosome is calculated by
fሺCሻ = d୧
ଶ
ିଵ
୧ୀଵ
Above Equation calculates the energy of a chromosome C containing N genes and di denotes the
distance between the (i+1)th node (or, gene) and the ith node in the data gathering chain. A
greater value of the chromosome energy indicates a longer data gathering chain and which means
an inferior solution.
3. Selection: This step selects the better individuals according to the corresponding selection
operator. The selection operator used here is tournament selection where by a mating pool of the
individuals with above average fitness value is maintained and two parents are randomly selected
for crossover.
4. Crossover: This step produces the new individuals to complete the global search according to
the corresponding crossover operator. Two point crossover operator is used in this paper. In two
point crossover two points are randomly selected in a chromosome and all the genes from one
point to another point are copied from the first chromosome to the second chromosome.
5. Repair: This step removes the routing loop. The genes values which are repeated in the
chromosome are deleted and thus the looping is removed. If a child violates the imposed
constraints (distance threshold), then it is rejected and again the crossover is performed.
6. Mutation: This step produces the new individuals to maintain the diversity in the population. In
mutation, a node is randomly selected from the best chromosome obtained in the past generation
and a gene value is changed randomly to produce a new offspring. If the new offspring violates
the constraints like distance threshold, it is rejected and mutation is performed again using repair
function. The mutation operation can help the search to exit out of the local optima and search for
global optima.
7. Elitism: In this step the best solutions from the population are maintained in the next generation
so that the convergence is faster.
8. Checking the Terminating Criteria: If the maximum number of generations has elapsed or the
energy of the network has fallen below predefined level, the algorithm is terminated.
9.Producing the Result:. The program outputs the best chromosome found so far as the result.
4. SIMULATION RESULTS
The energy dissipated per bit (in equation (3)) to run the radio electronics is ξelec (50nJ/bit) and
ξamp (10pJ/bit/m2) is the energy required by the transmit amplifier to maintain an acceptable
signal to noise ratio (SNR) in order to transfer data messages reliably. n is called the path loss
exponent, whose value enhances with increasing channel non-linearity (usually, 2.0 ≤ n ≤ 4.0).
The value of n is 2 for free space transmission.
5. International Journal Of Advanced Smart Sensor Network Systems ( IJASSN ), Vol 2, No.2, April 2012
19
The simulations are done under the MATLAB programming environment. Custom code is written
to simulate the wireless sensor network. The number of sensor nodes is varied from 10 to 50.The
sensors are randomly distributed in the area of 100m × 100m. The sink node is at (100,100).
The initial energy of sensor nodes is 1J. Every node transmits ten 4000-bits messages every
round. The number of individuals in the population is the same as that of total number of nodes in
the network, and the maximum number of generations for genetic algorithm is ten times as that of
total number of nodes in the network.
The Figure 2 shows the comparison of the following two situations: (i) direct communication
between the member node and the sink node using Simple GA (ii) using the modified elitism
based genetic algorithm. The algorithms are tested for up to maximum of 50 nodes. It is observed
that there is much improvement in the network lifetime using the proposed GA with elitism.
Figure (3) shows the residual energy of twenty nodes for 100mx100m network area when the first
dead node appears. The average residual energy of the network using Simple GA is 0.6972J. The
average energy of the network using the proposed algorithm is 0.1530J which is an improvement
over the other algorithms discussed. This shows that the proposed algorithm better utilizes the
network energy.
Fig 2: (a) The comparison of network lifetime under the different number of the nodes using Simple
Genetic Algorithm and Elitism based Genetic Algorithm
Fig 3: (a) The comparison of residual energy of the network using Simple Genetic Algorithm and Elitism
based Genetic Algorithm
10 15 20 25 30 35 40 45 50
50
100
150
200
Number of Nodes
NetworkLifetime(Rounds)
Simple GA
Elitism based GA
0 5 10 15 20
0
0.2
0.4
0.6
0.8
1
Node Serial Number
TheRoundEnergy(J)
Simple GA
Elitism based GA
6. International Journal Of Advanced Smart Sensor Network Systems ( IJASSN ), Vol 2, No.2, April 2012
20
6. CONCLUSIONS
In this paper, the basic genetic algorithm is improved using the elitism concept to provide the
solution to combinatorial optimization problem of finding the energy efficient shortest routing for
the wireless sensor networks. The modified GA uses elitist strategy so that the best individual is
preserved and carried to the next generation so that there is significant improvement in the
convergence. The node energy falling below predefined level is restrained from the path based on
some probability to increase the overall lifetime of the network.
REFERENCES
[1] Goldberg D. E. (1989), “Genetic Algorithms in Search, Optimization, and Machine Learning”
Reading, MA: Addison-Wesley.
[2] Akyildiz I. F., Su W., Sankarasubramaniam Y. (2002), Cayirci E., “A Survey On Sensor Networks,”
IEEE Communications Magazine, Vol. 40, Issue 8.
[3] Raghavendra V. K., Förster A. (2011), Venayagamoorthy G. K., “Computational Intelligence in
Wireless Sensor Networks: A Survey,” IEEE Communications Surveys & Tutorials, Vol. 13, No. 1,
pp. 68-96.
[4] Heikalabad S. R., Ghaffari A., Hadian A., Rasouli H. (2011), “DPCC: Dynamic Predictive
Congestion Control in Wireless Sensor Networks,” IJCSI International Journal of Computer Science
Issues, Vol. 8, Issue 1, pp.472-477.
[5] Min R., Bhardwaj M., Cho S. H. (2001), "Low Power Wireless Sensor Networks," Proceedings for
International. Conference on VLSI Design, Bangalore, India ,pp.221-226.
[6] Akkaya K., Younis M. (2005), “A Survey on Routing Protocols for Wireless Sensor Networks,”
Elsevier Ad Hoc Networks, Vol. 3, Issue 3, pp. 325–349.
[7] Azni A. H., Saudi M. M., Azman A., Johari A. S. (2009), “Performance Analysis of Routing Protocol
for WSN using Data Centric Approach,” World Academy of Science, Engineering and Technology,
Issue 53.
[8] Singh V. K., Sharma V. (2011), “Conference on Advancements in Communication, Computing &
Signal Processing (COMMUNE CACCS 2011)”.
[9] Johnson J. M., Samii Y. R. (1995), “Genetic Algorithm Optimization of Wireless Communication
Networks,” Proceedings for Antennas and Propagation Society International Symposium, AP-S.
Digest.
[10] Li Q., Aslam J. Rus D. (2001), "Hierarchical Power-Aware Routing in Sensor Networks,"
Proceedings of DIMACS Workshop on Pervasive Networking.
[11] Murthy S., Garcia-Luna-Aceves J. J. (1996), “An Efficient Routing Protocol for Wireless Networks,”
ACM Mobile Networks Applications”, Vol. 1, Issue 2, pp.183-197.
[12] Singh S., Woo M., Mghavendra C.S. (1998), “Power-Aware Routing in Mobile Ad Hoc Networks,”
ACM SIGMOBILE Mobile Computing and Communications Review,, pp. 181-190.
[13] Heinzelman W. R., Chandrakasan A., Balakrishnan H. (2000), “Energy-Efficient Communication
Protocol for Wireless Microsensor Networks,” Proceedings for the Hawaii International Conference
on System Sciences, (IEEE), January 4-7, pp.876–882.
[14] Chang J.H., Tassiulas L. (2004), "Maximum Lifetime Routing in Wireless Sensor Networks," Journal
IEEE/ACM Transactions on Networking (TON), Vol. 12 Issue 4.
[15] Yick J., Mukherjee B., Ghosal D. (2008), “Wireless Sensor Network Survey,” Elsevier Computer
Networks, Vol. 52, Issue 12, pp. 2292–2330.
[16] Azad P., Singh B., Sharma V. (2011), “A Novel Clustering Approach For Extending The Lifetime For
Wireless Sensor Networks”, International journal of Advances in Engineering & Technology, Vol. 1
Issue 5 Pg 441-446.
[17] Wenliang G., Huichang S., Jun Y., Yifei Z. (2009), ”Application of Genetic Algorithm in Energy-
Efficient Routing” China-Japan Joint Microwave Conference, Page(s): 737 – 740.
[18] Guo L., Tang Q. (2010), “An Improved Routing Protocol in WSN with Hybrid Genetic Algorithm”
Second International Conference on Networks Security Wireless Communications and Trusted
Computing (NSWCTC), Vol.: 2, Page(s): 289 – 292.
7. International Journal Of Advanced Smart Sensor Network Systems ( IJASSN ), Vol 2, No.2, April 2012
21
[19] Islam O., Hussain S. (2006), “An Intelligent Multi-hop Routing for Wireless Sensor Networks”
International Conference on Web Intelligence and Intelligent Agent Technology Workshops, 2006.
WI-IAT 2006 Workshops. 2006 IEEE/WIC/ACM, Page(s): 239 – 242.
[20] Al-Ghazal M. El-Sayed A., Kelash, H. (2007), “Routing Optimization using Genetic Algorithm in Ad
Hoc Networks” The IEEE Symposium on Signal Processing and Information Technology (ISSPIT)
Cairo.
[21] D. Dasgupta and D. McGregor (1992), “Nonstationary function optimization using the structured
genetic algorithm,” in Proc. 2nd Int. Conf. Parallel Problem Solving Nature, pp. 145–154.
[22] E. Lewis and G. Ritchie (1998), “A comparison of dominance mechanisms and simple mutation on
non-stationary problems,” in Proc. 5th Int. Conf. Parallel Problem Solving Nature, pp. 139–148.
[23] A. Uyar and A. Harmanci (2005), “A new population based adaptive dominance change mechanism
for diploid genetic algorithms in dynamic environments,” Soft Comput., vol. 9, no. 11, pp. 803–815.
Authors
Vinay Kumar Singh received his B.E.(Computer Engineering) degree from University of
Pune, (Maharashtra), India in 1994 and M. Tech. degree from Dayalbagh Educational
Institute, Agra (U.P) India in 2002. He is a research scholar at Gautam Buddha
University, Greater Noida, (U.P.) India, and is presently working as Assistant Professor
in Department of Computer Science & Engineering and Information Technology in
Anand Engineering College, Agra (U.P.) India. His research interests are Evolutionary
Algorithms, Optimization and Energy Efficient Routing in Wireless Sensor Networks.
Vidushi Sharma has done Ph.D in computer Science and is presently working as
Assistant Professor in Gautam Buddha University, Greater Noida (U.P.), India. She
teaches post graduate and graduate level courses and has large number of International
and national publications and has also written a book on Information Technology. Her
research interests includes IT applications in management and performance evaluation
of Information Systems which includes Wireless Systems, Application Software,
Ecommerce System.