IOSR Journal of Electronics and Communication Engineering(IOSR-JECE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of electronics and communication engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in electronics and communication engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
ENERGY EFFICIENT 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.
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.
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 Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
K dag based lifetime aware data collection in wireless sensor networksijwmn
Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In
this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's
neighbours while providing the worst-case latency guarantee for data collection, and a distributed
algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the lengths of the
longest path and the shortest path of each sensor node to the base station differ by at most k. By adding
sibling edges to a SPD, our distributed algorithm allows critical nodes to have more routing choices. The
simulation results show that our approach significantly outperforms the SPD-based data collection
approach in both network lifetime and load balance.
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.
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.
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 Data Transmission through Relay Nodes in Wireless Sensor Net...IDES Editor
In a Wireless Sensor Network (WSN) having a single
sink, information is given to the distant nodes from beacons
by overhearing. Since it is out of the communication range,
information is not sent directly to the static sink (SS). If a
distant node is not able to communicate directly, then it should
send its own packet to another node which is closer to the
Base Station (BS) so that the received packets are relayed to
the BS by this node. In this paper, we propose a relay node
selection algorithm to reduce contention and improve energy
efficiency. In this algorithm, each data packet of direct
communication should include the received signal strength
(RSS) of the beacon packet. The distant node selects a node
with the maximum RSS value as a relay. The algorithm also
assigns transmitting intervals to each relay node. By our
simulation results, we show that our proposed algorithm
improves the packet delivery ratio and energy efficiency.
K dag based lifetime aware data collection in wireless sensor networksijwmn
Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In
this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's
neighbours while providing the worst-case latency guarantee for data collection, and a distributed
algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the lengths of the
longest path and the shortest path of each sensor node to the base station differ by at most k. By adding
sibling edges to a SPD, our distributed algorithm allows critical nodes to have more routing choices. The
simulation results show that our approach significantly outperforms the SPD-based data collection
approach in both network lifetime and load balance.
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.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
A Novel Cluster-Based Energy Efficient Routing With Hybrid Protocol in Wirele...IJERA Editor
In wireless sensor network, lifetime of sensor nodes is the most essential parameters. sensor node's lifetime may be extended using LEACH and HEED scheme which is allowing to move the cluster head surrounded by the sensor nodes try to allocate the energy consumption over all nodes in the network. Energy efficiency is depends on the selection of cluster head. In this paper, we proposed the clustering algorithm to minimize the overhead of control packets by using LEACH and HEED and Efficient utilization of node near sink and to implements the hybrid protocol which would be better than the existing protocol.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
Quality of service improved in WSNs using Improved Efficient Quality of Servi...IJTET Journal
Abstract— As Wireless Sensor Networks(WSNs) gains popularity significant research have been devoted to supporting real time transmission with stringent quality of service requirements for wireless applications. Existing work exploits Quality of Service Oriented Distributed Routing Protocol (QOD) for QoS provisioning with delay and energy constraints in WSNs but they are not sufficient to provide quality of service in WSNs. In this paper improve the quality of QOD routing protocol and enhance the Improved Efficient Quality of Service Oriented Distributed Routing Protocol (IEQOD).The improved efficient quality of service oriented distributed routing protocol which combines selfish node isolation method and awake and sleep scheduling to enhance the performance of QOD. Selfish isolation method is the method in which the energy less nodes are isolated from the network and find and alternative route for packet transmission. Awake and sleep scheduling proactively wake-up the nodes in the transmission route and awakened node reduction. Hence we could improve the quality of service in terms of packet delivery ratio, delay and energy consumption. The IEQOD protocol simulated using ns-2 software. Evaluation result demonstrate that IEQOD significantly improve the QOS in WSNs.
FTTCP: Fault Tolerant Two-level Clustering Protocol for WSNIDES Editor
In this paper, we propose an agreement-based fault
detection and recovery protocol for cluster head (CH) in
wireless sensor networks (WSNs) of two level cluster
hierarchy. The aim of protocol is to accurately detect CH
failure to avoid unnecessary energy consumption caused by a
mistaken detection process. For this, it allows each cluster
member to detect its CH failure independently. Cluster
members employ distributed agreement protocol to reach an
agreement on failure of the CH among multiple cluster
members. The detection process runs concurrently with
normal network operation by periodically performing a
distributed detection process at each cluster member To
reduce energy consumption, it makes use of heartbeat
messages sent periodically by a CH for fault detection.
Simulation results show, our protocol provides high detection
accuracy because of agreement protocol.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksIJRES Journal
In this paper, we focus on improving wireless networks survivability in terms of increasing network lifetime and its energy efficiency via clustering the network in an efficient way. Clustering the network is the procedure of partitioning it into groups, where each of them is known as a cluster. Each cluster elects the station with the highest power to be a cluster head. The remaining stations follow the nearest cluster head. Instead of having each station sends its packets to a remote receiver, the cluster head receives packets from all stations within its cluster, aggregates them, and forwards the resulting packets to the remote receiver. The most significant benefit of clustering the network that we focus on is to decrease distances between sending and receiving stations, which in turn reduces the transmission energy. This reduction in the energy yields an increase in the network lifetime and its survivability.
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Net...IJASCSE
Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. The data aggregation mechanism is one of the possible solutions to prolong the lifetime of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption.
Optimal Transmit Power and Packet Size in Wireless Sensor Networks in Shadowe...IDES Editor
This paper investigates the effects of
shadowing on the optimal transmit power required to
sustain the network connectivity while maintaining a
predefined maximum tolerable Bit Error Rate (BER) in
a Wireless Sensor Networks (WSN). Optimization of
transmit power is of great importance in WSN since
sensor nodes are battery driven and optimization helps
to increase battery life by reducing inter node
interference significantly. An infinite Automatic Repeat
Request (ARQ) model has been considered to assess the
impact of shadowing and other network conditions on
energy requirement for successful packet transmission in
WSN. We also find the optimal packet length based on
energy efficiency. Effects of shadowing on optimal packet
size and energy efficiency in packetized data
transmission are also investigated. Further energy
consumption is minimized considering a variable packet
length based transmission. Use of optimal packet size
shows a significant reduction in energy spending.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
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.
International Journal of Advanced Smart Sensor Network Systems ( IJASSN )ijassn
With the availability of low cost, short range sensor technology along with advances in wireless networking, sensor networks has become a hot topic of discussion. The International Journal of Advanced Smart Sensor Network Systems is an open access peer-reviewed journal which focuses on applied research and applications of sensor networks. While sensor networks provide ample opportunities to provide various services, its effective deployment in large scale is still challenging due to various factors. This journal provides a forum that impacts the development of high performance computing solutions to problems arising due to the complexities of sensor network systems. It also acts as a path to exchange novel ideas about impacts of sensor networks research.
A Novel Cluster-Based Energy Efficient Routing With Hybrid Protocol in Wirele...IJERA Editor
In wireless sensor network, lifetime of sensor nodes is the most essential parameters. sensor node's lifetime may be extended using LEACH and HEED scheme which is allowing to move the cluster head surrounded by the sensor nodes try to allocate the energy consumption over all nodes in the network. Energy efficiency is depends on the selection of cluster head. In this paper, we proposed the clustering algorithm to minimize the overhead of control packets by using LEACH and HEED and Efficient utilization of node near sink and to implements the hybrid protocol which would be better than the existing protocol.
International Journal of Advanced Smart Sensor Network Systems (IJASSN)ijcseit
The placement of base stations in wireless sensor networks affect the energy consumption for
communication between sensor node and base station. In this paper we analyzed the performance of the
zone based clustering protocol [2] under varying position of base stations, different zone sizes and the
effect on network life time with multiple base stations. While evaluating the communication overhead of
various cluster sizes, we observed that the optimal cluster size for a given network is complex, depending
on a range of parameters. Simulation results show that communication overhead decreases as we increase
the number of zone in the network. We show that placing multiple base stations in place of single base
station in zone based routing protocol enhance the network life time.
Quality of service improved in WSNs using Improved Efficient Quality of Servi...IJTET Journal
Abstract— As Wireless Sensor Networks(WSNs) gains popularity significant research have been devoted to supporting real time transmission with stringent quality of service requirements for wireless applications. Existing work exploits Quality of Service Oriented Distributed Routing Protocol (QOD) for QoS provisioning with delay and energy constraints in WSNs but they are not sufficient to provide quality of service in WSNs. In this paper improve the quality of QOD routing protocol and enhance the Improved Efficient Quality of Service Oriented Distributed Routing Protocol (IEQOD).The improved efficient quality of service oriented distributed routing protocol which combines selfish node isolation method and awake and sleep scheduling to enhance the performance of QOD. Selfish isolation method is the method in which the energy less nodes are isolated from the network and find and alternative route for packet transmission. Awake and sleep scheduling proactively wake-up the nodes in the transmission route and awakened node reduction. Hence we could improve the quality of service in terms of packet delivery ratio, delay and energy consumption. The IEQOD protocol simulated using ns-2 software. Evaluation result demonstrate that IEQOD significantly improve the QOS in WSNs.
FTTCP: Fault Tolerant Two-level Clustering Protocol for WSNIDES Editor
In this paper, we propose an agreement-based fault
detection and recovery protocol for cluster head (CH) in
wireless sensor networks (WSNs) of two level cluster
hierarchy. The aim of protocol is to accurately detect CH
failure to avoid unnecessary energy consumption caused by a
mistaken detection process. For this, it allows each cluster
member to detect its CH failure independently. Cluster
members employ distributed agreement protocol to reach an
agreement on failure of the CH among multiple cluster
members. The detection process runs concurrently with
normal network operation by periodically performing a
distributed detection process at each cluster member To
reduce energy consumption, it makes use of heartbeat
messages sent periodically by a CH for fault detection.
Simulation results show, our protocol provides high detection
accuracy because of agreement protocol.
Wireless sensor network are emerging in various fields like environmental monitoring, mining, surveillance
system, medical monitoring. LEACH protocol is one of the predominantly used clustering routing protocols
in wireless sensor networks. In Leach each node has equal chance to become a cluster head which make
the energy dissipated of each node be moderately balanced. We have pioneered an improved algorithm
named as Novel Leach based on Leach protocol. The proposed algorithm shows the significant
improvement in network lifetime .Comparison of proposed algorithm is done with basic leach in terms of
network life time, cluster head selection, energy consumption, and data transmission to base station. The
simulation results shows that proposed algorithm can reduce network energy consumption and prolong
network life commendably. Simulation of our protocol is done with Matlab.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Enhancing Survivability, Lifetime, and Energy Efficiency of Wireless NetworksIJRES Journal
In this paper, we focus on improving wireless networks survivability in terms of increasing network lifetime and its energy efficiency via clustering the network in an efficient way. Clustering the network is the procedure of partitioning it into groups, where each of them is known as a cluster. Each cluster elects the station with the highest power to be a cluster head. The remaining stations follow the nearest cluster head. Instead of having each station sends its packets to a remote receiver, the cluster head receives packets from all stations within its cluster, aggregates them, and forwards the resulting packets to the remote receiver. The most significant benefit of clustering the network that we focus on is to decrease distances between sending and receiving stations, which in turn reduces the transmission energy. This reduction in the energy yields an increase in the network lifetime and its survivability.
Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Net...IJASCSE
Energy efficiency is the most important issue in all facets of wireless sensor networks (WSNs) operations because of the limited and non-replenish able energy supply. The data aggregation mechanism is one of the possible solutions to prolong the lifetime of sensor nodes and on the other hand it also helps in eliminating the data redundancy and improving the accuracy of information gathering, is essential for WSNs. In this paper we propose a Clustering based lifetime maximizing aggregation tree (CLMAT) in which we create aggregation tree which aim to reduce energy consumption.
Optimal Transmit Power and Packet Size in Wireless Sensor Networks in Shadowe...IDES Editor
This paper investigates the effects of
shadowing on the optimal transmit power required to
sustain the network connectivity while maintaining a
predefined maximum tolerable Bit Error Rate (BER) in
a Wireless Sensor Networks (WSN). Optimization of
transmit power is of great importance in WSN since
sensor nodes are battery driven and optimization helps
to increase battery life by reducing inter node
interference significantly. An infinite Automatic Repeat
Request (ARQ) model has been considered to assess the
impact of shadowing and other network conditions on
energy requirement for successful packet transmission in
WSN. We also find the optimal packet length based on
energy efficiency. Effects of shadowing on optimal packet
size and energy efficiency in packetized data
transmission are also investigated. Further energy
consumption is minimized considering a variable packet
length based transmission. Use of optimal packet size
shows a significant reduction in energy spending.
Energy Efficient Data Aggregation in Wireless Sensor Networks: A Surveyijsrd.com
The use of Wireless Sensor Networks (WSNs) is anticipated to bring lot of changes in data gathering, processing and dissemination for different environments and applications. However, a WSN is a power constrained system, since nodes run on limited power batteries which shorten its lifespan. Prolonging the network lifetime depends on efficient management of sensing node energy resource. Energy consumption is therefore one of the most crucial design issues in WSN. Hierarchical routing protocols are best known in regard to energy efficiency. By using a clustering technique hierarchical routing protocols greatly minimize energy consumed in collecting and disseminating data. To prolong the lifetime of the sensor nodes, designing efficient routing protocols is critical. In this paper, we have discussed various energy efficient data aggregation protocols for sensor networks.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
IOSR Journal of Mechanical and Civil Engineering (IOSR-JMCE) is an open access international journal that provides rapid publication (within a month) of articles in all areas of mechanical and civil engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in mechanical and civil engineering. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Effects of Eccentric Strength Training’s Time on Daily Plasma Testosterone Le...IOSR Journals
This study aims to evaluate the effects of the eccentric physical training’s time on daily plasma concentrations of testosterone among sedentary athletes. Sixty male athletes, with homogeneous age, size and weight were selected for the study during three months. They were subjects to a strength training of the extensor and flexor muscles of the knee. After they were divided in two groups of thirty subjects and then had physical training either in the morning between 6 and 7, or in the evening, between 16 and 17. The dosage of testosterone on each athlete was performed before and after submission to an eccentric physical program at the antecubital vein in a restful sitting. Our results have shown that eccentric physical training induces the increase of this steroid hormone in the two groups of athletes and the training in the evening promotes better its production. Our results also showed that the rate of this androgen drop significantly during the day in both groups of athletes trained in the morning or in the evening as well as their respective controls. However, the decline was even more pronounced for subjects trained in the morning
IOSR Journal of Humanities and Social Science is an International Journal edited by International Organization of Scientific Research (IOSR).The Journal provides a common forum where all aspects of humanities and social sciences are presented. IOSR-JHSS publishes original papers, review papers, conceptual framework, analytical and simulation models, case studies, empirical research, technical notes etc.
In wireless sensor network energy cutback is considered as a principle intensive challenge which is studied largely in the Wireless Sensor Networks (WSN) literature. Wireless Sensor Networks (WSNs) are pertinent in numerous arenas where WSNs may be used for sensing, ciphering, and communication elements that give a user or administrator the ability to instrument, observe, and retort to events and phenomena in a specific environment. But sensor devices are resource curbed, positioned in an open and unattended environment, different types of attacks and conventional techniques against these attacks are not desirable due to the resource constrained nature of these kinds of networks. An energy-balanced routing method based on forward-aware factor (FAF-EBRM) in which the next-hop node is elected according to the awareness of link weight and forward energy density. FAF-EBRM is compared with Ladder Diffusion Algorithm, which balances the energy utilization, sustain the function era and guarantees high QoS of WSN. The FAF-EBRM is proposed with Secure Routing Layer (SRL) Protocol which ensures that the secure data transmission is achieved without releasing private sensor readings and without introducing significant overhead on the battery-limited sensors.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
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 Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
Energy Efficient Zone Divided and Energy Balanced Clustering Routing Protocol...csijjournal
Wireless sensor network has proven its significance in almost every field in today’s era. Wireless sensor network consists of large number of sensor nodes distributed randomly in some areas. In WSN the main objective has been increasing the network lifetime. There is zone divisional approach which has shown sound improvement in increasing the network lifetime over the Leach and EEUC protocols. The proposed protocol Energy efficient zone divided and energy balanced clustering routing protocol (EEZECR) has not only much higher network lifetime as compare to ZECR and it also has much better load balancing in the network. In the EEZECR the concept of double cluster head in a cluster is introduced which reduces the load on cluster head and very efficiently does the task of load balancing in the network thoroughly which
makes this protocol favorite for many real time applications. Simulations are performed in MATLAB.
Throughput analysis of energy aware routing protocol for real time load distr...eSAT Journals
Abstract Wireless sensor network (WSNs) are self-organized systems that depend on highly distributed and scattered low cost tiny devices. These devices have some limitations such as processing capability, memory size, communication distance coverage and energy capabilities. In order to maximize the autonomy of individual nodes and indirectly the lifetime of the network, most of the research work is done on power saving techniques. Hence, we propose energy-aware load distribution technique that can provide an excellent data transfer of packets from source to destination via hop by hop basis. Therefore, by making use of the cross-layer interactions between the physical layer and the network layer thus leads to an improvement in energy efficiency of the entire network when compared with other protocols and it also improves the response time in case of network change. Keywords:- wireless sensor network, energy-aware, load distribution, power saving, cross layer interactions.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
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 efficient load balanced routing protocol for wireless sensor networkscsandit
Telecommunications is increasingly vital to the society at large, and has become essential to
business, academic, as well as social activities. Due to the necessity to have access to
telecommunications, the deployment requires regulations and policy. Otherwise, the deployment
of the infrastructures would contribute to environment, and human complexities rather than
ease of use.
However, the formulation of telecommunication infrastructure deployment regulation and
policy involve agents such as people and processes. The roles of the agents are critical, and are
not as easy as it meant to belief. This could be attributed to different factors, as they produce
and reproduce themselves overtime.
This paper presents the result of a study which focused on the roles of agents in the formulation
of telecommunication infrastructures deployment regulation and policy. In the study, the
interactions that take place amongst human and non-human agents were investigated. The study
employed the duality of structure, of Structuration theory as lens to understand the effectiveness
of interactions in the formulation of regulations, and how policy is used to facilitate the
deployment of telecommunications infrastructure in the South African environment.
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.
Chain Based Wireless Sensor Network Routing Using Hybrid Optimization (HBO An...IJEEE
In Wireless Sensor Network, due to the
energy restriction of each nodes, efficient routing is very
important in order to save the energy of the hybrid
optimization technique. The results of new protocol i.e.
hybrid have been compared with EEPB and IEEPB.
Simulation results show that the lifetime of Hybrid is better
as compared to EEPB and IEEPB.
Spread Spectrum Based Energy Efficient Wireless Sensor NetworksIDES Editor
The Wireless Sensor Networks (WSN) is
considered to be one of the most promising emerging
technologies. However one of the main constraints which
is holding back its wide range of applications is the
battery life of the sensor node and thus effecting the
network life. A new approach to this problem has been
presented in this paper. The proposed method is suitable
for event driven applications where the event occurrence
is very rare. The system uses spread spectrum as a means
of communication.
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.
The main aim of energy efficient routing is to
minimize the energy required to transmit or receive packets also
called as active communication energy. Inactive energy is the
energy which not only tries to reduce the energy consumed
when a mobile node stays idle but also listens to the wireless
medium for any possible communication requests from other
nodes. To conserve energy, many energy efficient routing
protocols have been proposed. Networks of small, inexpensive,
disposable, smart sensors are emerging as a new technology with
tremendous potential. Wireless sensor networks can be randomly
deployed inside or close to phenomenon to be monitored. The
advantage of these networks is the fact that they are selfconfiguring,
which means that a sensor network can be deployed
randomly on a battlefield, in a disaster area or in an inaccessible
area without the need for human intervention. The energy
supplies of nodes are not replenished or replaced and therefore
nodes only participate in the network for as long as they have
energy. This fact necessitates energy efficiency in the design of
every aspect of such nodes. Energy consumption in sensor nodes
occurs mainly due to computational processing and, to a greater
extent, communication. The routing protocol employed by these
sensor nodes can minimize the number of transmissions that
nodes make as well as the computational complexity of routing
path selection. It is therefore of critical importance that the
routing protocol be designed with energy efficiency in mind.
An Adaptive Energy Aware Clustering Based Reliable Routing for in-Network Agg...Editor IJCATR
Wireless Sensor Network (WSN) consists of spatially distributed autonomous devices that cooperatively sense physical or
environmental conditions. Due to the non-uniform node deployment, the energy consumption among nodes are more
imbalanced in cluster-based wireless sensor networks this factor will affect the network life time. Cluster-based routing and EADC
algorithm through an efficient energy aware clustering algorithm is employed to avoid imbalance network distribution. Our proposed
protocol EADC aims at minimizing the overall network overhead and energy expenditure associated with the multi hop data retrieval
process while also ensuring balanced energy consumption among SNs and prolonged network life time .A optimal one-hop based
selective node in building cluster structures consisted of member nodes that route their measured data to their assigned cluster head is
identified to ensure efficient communication. The proposed routing algorithm increases forwarding tasks of the nodes in scarcely
covered areas by forcing cluster heads to choose nodes with higher energy and fewer member nodes and finally, achieves
imbalanced among cluster head and improve the network life time.
1. IOSR Journal of Electronics and Communication Engineering (IOSR-JECE)
e-ISSN: 2278-2834, p- ISSN: 2278-8735. Volume 5, Issue 1 (Jan. - Feb. 2013), PP 52-59
www.iosrjournals.org
Energy Saving In Wireless Sensor Network Using Burst
Algorithm
1
S.Punithashankari, 2P.Kalyanasundaram, 3Dr.T.Gnanasekaran
1
Student of M.E, 2Associate Professor,3Professor Department of IT,R.M.K Engineering
College,Gummidipoondi. Nandha Engineering College.Erode-52.
Abstract: A wireless sensor network is composed of a large number of low-cost devices distributed over a
geographic area. Sensor nodes have limited processing capabilities therefore simplified protocol architecture
should be designed so as to make communications simple and efficient. Moreover, the power supply unit is
based on an energy-limited battery the networks should be aimed at minimizing the energy consumption. A
forwarding scheme for WSN aimed at combining low computational complexity and high performance in terms
of energy efficiency and reliability. The approach relies on a packet-splitting algorithm based on the BURST
algorithm. The performance of burst is to be obtained by Shortest Path with Load Balancing (SP).The energy
efficiency is low in this splitting process compare to those shortest paths. To estimation of the mean energy
reduction factor achievable with the forwarding scheme should be derived and the reassembling is done in
destination side, the values to be coded in code block. Simulated using MATLAB simulator. The proposed
algorithm outperforms in terms of energy saving and increases the network lifetime.
Index: BURST, WSN, SP, ENERGY EFFICIENCY, PACKETS.
I. Introduction
A.WIRELESS SENSOR NETWORKS
A wireless sensor network is a collection of sensor nodes organized into a cooperative networks. A
sensor is a small device which observes the environment of physical parameters such as temperature, pressure,
relative humidity, sound, vibration, motion or pollutants, at different locations. Wireless Sensor Networks
(WSN) is highly distributed networks of wireless sensor nodes, deployed in large numbers to monitor the
environment or system.
Sensor nodes have limited transmission ranges and organize themselves in an ad hoc manner, which
means that two wireless sensor nodes that cannot reach each other directly transmit on other sensor nodes to
relay data between them .In general ,data packets from the source node have to traverse multiple hops before
they reach the destination. Second, since sensors are usually small and inexpensive, they are usually, battery
powered and are often deployed in a rough or hostile physical environment.
The introduction of redundancy in data to increase the probability of data delivery. The redundancy
adopted is in the form of multiple copies of the same packet that travel to the destination along multiple paths.
However, as multiple paths could remarkably consume more energy than the single shortest path because
several copies of the same packet have to be sensor the splitting procedure as a method for reducing energy
consumption. An attempt to guaranteed reliability, while minimizing the energy consumption at the same time,
considering a packet-splitting procedure, use distinct paths of erasure codes to provide reliability in the network
to increases the life time of the networks and cost effective.
B.WIRELESS SENSOR NETWORKS APPLICATIONS
In recent years, the use of wireless sensor networks for industrial applications has rapidly increased.
However, throughput utilization, energy consumption still remains one of the main limitations of this
technology. As communication typically accounts for the major power consumption, the activity of the
transceiver should be minimized, in order to prolong the network lifetime. To end this problem, various
protocols have been designed such as ASLEEP protocol, Fountain Reprogramming protocol.
In-network aggregation deals with this distributed processing of data within the network. In-network
aggregation is the global process of gathering and routing information through a multihop network, processing
data at intermediate nodes with the objective of reducing resource consumption, thereby increasing network
lifetime. Wireless sensor network technologies enable a wide variety of applications (e.g., environmental
monitoring). The challenge to designing such in-network node reprogramming protocols lies in the potentially
large amount of energy required to successfully transmit the entire program to every node in the network. The
wireless channels used by small sensor nodes are potentially loss and highly variable. The use of uncast
retransmissions to correct errors for each node can be prohibitive in terms of traffic generation and hence
transmission cost.
www.iosrjournals.org 52 | Page
2. Energy Saving In Wireless Sensor Network Using Burst Algorithm
Transmission techniques are known to result in feedback implosion in dense networks. Therefore, coding
solutions allowing different errors at various nodes to be corrected with single packet transmissions are
preferable. However, many such techniques, using forward error correction codes (FEC) tend to be inefficient
for wireless sensor networks.
II. Methodology
A. REDUCING ENERGY CONSUPTION
The aim of reducing energy consumption while taking the algorithmic complexity into account,
proposed a novel approach that burst the original messages into several packets, such that each node in the
network will forward only small sub packets. The bursting procedure is achieved applying the BURST
algorithm. The sink node, once all sub packets (called Burst components) are received correctly, will recombine
them, thus reconstructing the original message. The splitting procedure is especially helpful for those
forwarding nodes that are more solicited than others due to their position inside the network.
The proposed approach, almost all nodes operate as in a classical forwarding algorithm and, with the
exception of the sink, a few low-complex arithmetic operations are needed. The sink node is computationally
and energetically more equipped than the other sensor nodes, the overall complexity remains low and suitable
for a WSN. Moreover, the proposed technique does not require the use of disjoint paths. Some preliminary
results of this approach have been presented but they were empirical only and obtained through simulations on a
sensor network where it is assumed that an ideal communication among neighbor sensors occurs, and all the
burst components can be received correctly between a pair of nodes.
Through analytical model allows us to derive accurate results regarding energy consumption and
complexity. The effect of important parameters such as nodes density and transmission range through both
extensive simulations and an analytical study of the tradeoff between energy saving, complexity, and reliability
of the proposed technique. In WSN, data generated by each node, are to travel from multiple sources to a data
recipient or sink rather the communication between nodes.
B.PACKET FORWARDING
A sensor network where sensor nodes periodically send messages to a sink node through a multihop
transmission. The basic idea is to burst the messages sent by the source nodes so that a reduced number of bits
are transmitted by each forwarder node. In order to better understand the main idea, the example in Figure 1.
Nodes A and B have to forward a packet to the sink S and can do it through nodes X, Y, and Z, which are all in
the coverage range of A and B. If a normal forwarding scheme is adopted, two cases ,Case a) A and B select
different next-hop nodes .This happens with probability 23. Case b) A and B select the same next-hop node
.This happens with probability 13.
If there are bits for each packet, the maximum numbers of bits transmitted by a node belonging to
the set {X, Y,Z} is w bits in the case a) and 2 bits in the case b). Let now assume that each node in the set {X,
Y, Z} knows that A and B have three possible next-hops and that a different forwarding scheme is adopted, as
shown in Figure 1. In particular, when X, Y, and Z receive a packet, they split it and send to the sink only a part.
In this case, X, Y, and Z have to transmit at most bits each. While comparing the two forwarding methods, its
concluded that the last one reduces the maximum number of bits transmitted by a node belonging to the set {X,
Y, Z} .More precisely, the reduction factor is 1-23=13. When comparing the bursting procedure with the
procedure shown in case a), and (2-23).12 = 23 when the bursting procedure is compared to the procedure
shown in case b). Summarizing, an average reduction factor of 4/9 is obtained.
Accordingly, the lifetime of a sensor network increases as the energy consumption is more distributed
among the nodes. It is worth remarking that the bursting procedure has to be performed in a simple manner, and
consequently with low energy consumption.
Figure.1. Packet forwarding using different next-hops
www.iosrjournals.org 53 | Page
3. Energy Saving In Wireless Sensor Network Using Burst Algorithm
The total amount of transmitted bits does not change (bits are transmitted anyway, either with or without
splitting); by bursting of packets it is possible to reduce the maximum number of transmitted bits per node and
therefore the mean energy that each node consumes for the transmission..
Finally, it can be observed that if a perfect balancing is possible, which occurs when the number of next-hop
nodes is a factor of the number of transmitted messages (i.e., the number of messages is exactly divisible by the
number of next-hops), the energy consumed by nodes will be the same either with or without bursting.
However, if this is not the case, using a bursting technique makes the number of forwarded bits significantly
reduced. Moreover, the reduction increases if the ratio “message length over number of components “decreases.
III. Burst Algorithm
BURST algorithm is different from the original bin packing. A precise statement of the problem is as follows:
1) We are given a fixed rectangular bin B of width W and height H. The bin B has an area A equal to W×H.
2) We are also given a set of n items {b1, b2, …, bn}. The ith item bi has an area Ai
3) Determine a rectangular shape for the ith item with width Wi and height Hi such that Ai. Wi × Hi
4) Width Wi < W for all i. Similarly, height Hi < H for all i.
5) Wi, Hi, W, and H are all integers.
6) Since the mapped region is more than the desired allocation Ai, the extra resource is wasted and so, Wi×Hi -
Ai, should be minimized.
7) Due to the rectangular considerations, all n items may not fit the bin B, the goal is to minimize the additional
resource width W that is required to fit all n items.
A .BURST-BASED FORWARDING TECHNIQUE
Basically, in its simpler form, the burst can be formulated as following: Given N primes Pi>1 ,with I
{1,2…..N}, by considering their product M=πi Pi , then for any set of given integers{ m1, m2,…..Mn } ,there
exists a unique integer m<M that solves the system of simultaneous congruence m=m i (mod Pi) ,and it can be
obtained. The coefficients Ci are given by Ci =Qi qi , where Qi =M/Pi and qi is its modular inverse . For
instance, its consider the system: m= 1 (mod 3); m =4 (mod 5); m= 1 (mod 7). It is simple to prove that m= 64
solves the system and that it can be obtained through the above equations (In fact, we have M=105; C1 =70; C2
=21; C3 =15 and m= 64).
C. METRICES FOR ENERGY EFFICIENCY
According to the BURST algorithm, the number m can be alternatively identified with the set of
numbers mi provided that pi are known. The sink knowing Pi ∈ {1,2,3}and using the burst approach, will be able
to reconstruct mA. In general, if considered that the energy consumption is proportional to the maximum number
of bits transmitted, and assuming as the number of bits in the original message m and as the maximum
number of bits of a burst component.
In particular, for comparison purposes, the Shortest Path with Load Balancing (SP) is considered. The SP
approach is very similar to the probabilistic routing. A sensor node having a packet to forward choose randomly
as relayers a neighbor node toward the sink so that the number of hops needed to reach the sink is minimized.
Load balancing (i.e., a random choice of the relayer) allows prolonging the network lifetime, avoiding that some
nodes could be overloaded.
Throughout, considered that an SP packet is composed by K words of bits each and that the burst-
based splitting procedure can be applied to each word by considering that the same is used for all the words of
same packet. The overhead due to the MAC layer head, but it is worth noting that all the words in the packet
generated by the splitting procedure are represented with the same number of bits and therefore their length can
be obtained from the prime number used to split the packet. With the above hypothesis, the expected energy
reduction factor can be expressed by considering mean energy consumed by a node in the case of the proposed
burst-based and the SP forwarding technique respectively, where and are the mean number of forwarded packets
with the above forwarding schemes, is the mean number of bits needed to represent the burst components, and is
the energy needed to transmit a bit.
However, if a large number of packets are considered, the expected total number of bits is .In several
papers about WSNs, the network lifetime is related to the time until the death of the first node. In this case, the
maximum energy consumed by a node should be also considered. Therefore, in this project it investigates also
the energy reduction factor related to the maximum energies where and are the maximum number of forwarded
packets. Obviously, the set o of primes should be properly chosen in order to maximize the above matrices.
D. ENERGY REDUCTION FACTOR
It is important to observe that the set of prime numbers with can be arbitrarily chosen provided that.
Therefore, the number of bits needed to represent can be reduced by choosing the prime numbers as small as
www.iosrjournals.org 54 | Page
4. Energy Saving In Wireless Sensor Network Using Burst Algorithm
possible. As a consequence of this choice, the MERF is maximized. Throughout, it indicates with Minimum
Primes Set (MPS) the set of the smallest consecutive primes that satisfy the condition. For instance, if and is a
40-bit word, the MPS will be (this is the set of smallest four consecutive primes that satisfies the condition). The
MERF in this case is 0.725. However, when the primes set are chosen as above, the message can be
reconstructed if and only if all the burst components are correctly received by the sink. Let’s consider another
primes set.
The choice it is possible to reconstruct the original message even if component is lost (i.e., if we have
one failure). In fact, whatever the lost component is, the product of the primes associated with the received
components satisfies the condition, and therefore it respects the hypothesis of the burst theorem. For instance, if
the last component is not received, it is again possible to obtain as, where is the product of the first three primes,
and the first three burst coefficients computed for the MPS-1.
1. The number of components is not changed (i.e., the same number of forwarders is needed).
2. The MERF obtained with the new set is 0.65, i.e., MERF is reduced by about 11%.
Because usually sensor nodes have simple processing units, it is mandatory to have a low complex procedure for
obtaining values. This goal can be easily reached if is fixed or takes only a few values. This is a very fast
procedure.
IV. System Implementation
A. FORWARDING ALGORITHM
The forwarding algorithm is based on two temporal phases, the Initialization phase and the Forwarding
phase. The initialization phase is to split data’s and the forwarding phase performs forwarding.
B. INITIALIZATION PHASE
This phase organizes the network in clusters and also has the advantage of minimizing the number of
hops needed to reach the sink .The Initialization phase has been described in detail and it is realized through an
exchange of initialization messages (IMs) starting from the sink that is supposed to belong to the cluster. Re-
transmit the IM. On the basis of the received IMs, at the end of the procedure each node in the network will
know its own next-hops, which other nodes will use it as a next-hop, and into how many parts the received
packets.
Figure.2. Sink sends the first IM
The sink sends the first IM for the initialization phase each node can obtain the MPS and select a
different prime number of the MPS-f by considering the order of the addresses specified in the IM.Recall that in
order to obtain the MPS- f, it is sufficient to know to be either fixed or specified within the IMs, while the
number of primes corresponds to the number of possible next-hops (that each forwarding node knows on the
basis of the received IMs) Because could be different for each source node , it use the notation .
However, the sink, in order to reconstruct the messages, also needs to know the index of the received
component (i.e., for each). For this purpose, it will assume that in the header of each packet there is a field
called mask. The mask could be the binary representation of the index followed by the number of components
[i.e., pair] or a “one-hot” coding bit sequence followed by a tail bit .Its assumed that the overhead introduced by
the mask is negligible. According to the previous initialization procedure shown in Figure .It will receive the IM
with from the node X, and it decides to belong to, node Y will have only one next-hop (i.e., X) because Y is at
www.iosrjournals.org 55 | Page
5. Energy Saving In Wireless Sensor Network Using Burst Algorithm
the end of the coverage range of nodes belonging to. Now, we consider what happens with the modified
procedure.
Figure.3. Clustering of burst packets
The proposed initialization procedure can be further refined in order to increase in some cases the
number of possible next hops that a node can use as forwarders. In particular, when a node receives very few
IMs with, it does not choose immediately to belong to the cluster, but it waits for the IMs with the next sequence
number in order to belong to the last cluster if it is more convenient.
When node Y receives the IM with, it postpones its decision to belong to other node. After some time,
it will receive two new IMs with from nodes A and B, and therefore it decides to belong to in order to have two
possible next-hops instead of one as shown in Figure 3. Basically, that anode can postpone its decision to belong
to a particular cluster if the number of IMs received is less than a chosen threshold, but this can be done just one
time in order to avoid an increase of the number of hops needed to reach the sink. The threshold can be a
constant value (either specified in the IM or pre stored in the node memory, and therefore already known by the
node). Moreover, if the number of received IM is less than the threshold, it is possible to use the conventional
shortest path approach (SP) that keeps working also with our technique.
The initialization procedure is performed only when the network is activated for the first time, and it is not
necessary to run it when either a new node joins the network or a node runs out of energy. In both cases, it is
sufficient that few IMs are exchanged between the node and its neighbors belonging to the near clusters. More
details about the operations needed for the above cases have been described. Moreover, in order to consider the
unreliability of the channel, which causes loss of IM packets and consequently nodes with an in sufficient
number of neighbors, each node can start periodically a new joining procedure.
C. FORWARDING PHASE
Once the network has been organized, the Forwarding phase is applied. Basically; all nodes follow the
same forwarding rule: If there is a number of neighbors at least equal to, and the packet has not previously split,
then split the packet; else use conventional shortest path approach. Let’s consider the network shown, where
clusters are obtained according to the initialization procedure already described in the previous section. The
messages sent by each node when the source node H sends a message to the sink S.According to the
initialization procedure, node G knows that it is the only next-hop of node H, and therefore it must forward the
packet without performing a splitting procedure. It is worth highlighting that it is not necessary for G to specify
the list of the destination addresses in the packet. In fact, in the initialization phase, nodes have already received
the IM message, and therefore they know that node G has four next-hops and that all of them have to split the
messages received from G into NG=4 parts.
Therefore, when they receive the packet, according to both the packet size and they independently
select the prime numbers 3 and send the components, together with a proper mask, to one of the possible next-
hops. When the sink receives a component, it identifies the number of expected components on the basis of the
mask, and therefore it calculates the MPS-f and the coefficients needed to reconstruct the original message.
www.iosrjournals.org 56 | Page
6. Energy Saving In Wireless Sensor Network Using Burst Algorithm
Figure.4. Forwarding phase
Concerning the complexity of the algorithm, it is worth mentioning that the message splitting is
performed only one time by the nodes that are the closest to the source and have the opportunity to do it (e.g., if
they are in proximity of a number of neighbors higher than the threshold specified for the initialization phase),
whereas the other sensor nodes in the network will just forward the sub packets. Moreover, only the sink node
will reconstruct the original message through more complex operations as described, but this can be consider
that usually the sink node is computationally and energetically more equipped than the other sensor nodes.
Obviously, in the case of very large packets, it is possible to split the packets recursively, but in order to keep
the complexity of the proposed algorithm very low ,its consider that a packet can be split only one time.
V. Performance Evaluation
In this section, the comparison of the performance of BURST in terms of energy consumption to those
obtained by SP. Moreover, provided some results obtained comparing the BURST to the most naive splitting
scheme, a simple packet division into chunks.
The results have been obtained through a custom MATLAB simulator. A comparison between the
results obtained through the analysis and those obtained through the simulator. Then, we analyze some other
parameters in order to show the advantages of the proposed technique.
40
result
35
execution time
30
25
20 25 30 35 40 45 50 55 60
amount of data
Figure.5. Amount of Data vs Execution Time
Figure 6.2 shows the values of transmission 1 and transmission 2 are taken by simulating the packet forwarding
Let consider a sensor network where nodes are randomly distributed in a square area of size m, with density
nodes/m . Sensor nodes are assumed to be static as usual in most application.
www.iosrjournals.org 57 | Page
7. Energy Saving In Wireless Sensor Network Using Burst Algorithm
100
90
80
70
execution time
60
50
40
30
20
10
0
0 100 200 300 400 500 600 700 800 900 1000
No.of CRT transmission
Figure.6. No of Transmission vs Execution Time
Figure.6, shows the values of transmission 1 and transmission 2 are taken by simulating the packet forwarding
In each simulation, the sink node is located in the center of the square grid, and each sensor node has a
transmission range equal to m .
40
transmission analysis
35
execution time
30
25
5 10 15 20 25 30 35
transmission rate
Figure.7. Transmission Rate vs Execution Time
Figure.7 shows the evaluation between transmission rate and execution time. The network is organized in
clusters numbered in ascending order starting from the cluster where is located the sink node, which is identified
with the events randomly occur in faraway clusters. Simulations neglect the effect of collisions and
retransmissions at the MAC layer.
VI. Conclusion
A novel forwarding technique for wireless sensor networks based on the BURST algorithm is able to
predict the energy efficiency of the process. The choice of the burst algorithm parameters in order to keep the
processing complexity low, and then the tradeoff between energy consumption and reliability are measurable.
Finally, the overhead introduced in terms of packet header size in MAC layer will be reduced. Simulation results
have confirmed the results obtained and have shown that applying the BURST-based technique significantly
reduces the energy consumed for each burst node, reduces computational complexity and consequently
increases the network lifetime.
References
[1] Giuseppe Campobello, Alessandro Leonardi, and Sergio (2012), ”Improving Energy Saving and Reliability in Wireless Sensor
Networks Using a Simple CRT-Based Packet-Forwarding solution ieee/acm transactions on networking, vol. 20.
[2] Vuran .M.C and Akyildiz .I.F (2009), “Error control in wireless sensor networks:A cross layer analysis” ,ieee /acm transaction ,vol.
17, no. 4, pp. 1186–1199.
[3] Shayegh .F and Soleymani .M.R (2009), “A low complexity iterative technique for soft decision decoding of Reed–Solomon codes,”
in Proc.ieee icc, Dresden, Germany, pp. 1–6.
[4] Campobello .G, and Palazzo .S (2009) , “A novel reliable and energy-saving forwarding technique for wireless sensor networks,” in
Proc. acm Mobile adHoc, New Orleans, LA, May 18–21, pp. 269–278.
[5] Leonardi .A, and Palazzo .S (2008),“On the use of Chinese Remainder Theorem for energy saving in wireless sensor networks ,”in
Proc. ieee icc, Beijing, China, May , pp. 2723–2727.
www.iosrjournals.org 58 | Page
8. Energy Saving In Wireless Sensor Network Using Burst Algorithm
[6] Crepaldi .R , Harris .A.F, Rossi .M , Zanca .G and Zorzi .M (2007), “Fountain reprogramming protocol: A reliable data
dissemination scheme for wireless sensor networks using fountain codes, demo abstract,” in Proc.acm Sensor System , Sydney,
Australia, Nov pp. 389–390.
[7] Burchfield .T.R , Venkatesan.S , and Weiner .D (2007), “Maximizing throughput in ZigBee wireless networks through analysis,
simulation sand implementations,” in Proc. Int. Workshop Localized Algorithm Protocols WSNs, Santa Fe, NM, pp. 15–29.
[8] Xu .Y, Xu. J , and Lee .W.C (2007) , “Analysis of a loss-resilient proactive data transmission protocol in wireless sensor networks,”
in Proc. 26thieee Anchorage, AK, pp. 1712–1720.
[9] Fasolo. E, Rossi .M , Widmer .J , and Zorzi .M (2007), “In network aggregation techniques for wireless sensor networks: A survey,”
ieee wireless Communication, vol. 14, no. 2, pp. 70–87.
[10] Anastasi .G ,Di Francesco .M, and Passarella . A (2007) , “How to prolong the lifetime of wireless sensor network,” in Handbook of
Mobile Ad Hoc and Pervasive Communications. Valencia, CA: American Scientific Publishers.
[11] Xiong .Z, Yang .Z , Liu .W and Feng. Z (2006), “A lightweight FEC algorithmfor fault tolerant routing in wireless sensor
networks,” in Proc. Wuhan, China, pp. 1–4.
[12] Djukic. P and Valaee .S (2004), “Minimum energy reliable ad hoc networks,”in Proc. 22nd Bienni. Symp. Commun., Kingston, ON,
Canada, pp. 150–152.
[13] Deb .B , Bhatnagar .S , and Nath .B (2003), “ReInForM: Reliable information forwarding using multiple paths in sensor networks,”
in Proc. Bonn, Germany, pp. 406–415.
[14] Akyildiz .I.F , Su .W , Sankarasubramaniam .Y (2002), and Cayirci .E , “A survey on sensor networks,” IEEE Commun. Mag., vol.
40, no. 8, pp.102–114.
[15] Papoulis .A and Pillai .S.U (2002) , Probability, Random Variables and Stochastic Processes. New York: McGraw-Hill.
[16] Ganesan .D , Govindan .R, Shenker .S, and Estrin.D (2001),“Highly resilient energy efficient multipath routing in wireless sensor
networks ,”Mobile Computing. Communication vol. 5, no. 4, pp. 10–24.
[17] Luby .M , Mitzenmacher. M , Shokrollah .A and Spielman .D.A (2001)“Efficient erasure correcting codes,” ieee Trans. Inf. Theory,
vol. 47,no. 2, pp. 569–584.
[18] Hong .J.H ,Wu .C.H and Wu .C.W ( 2001) , “RSA crypto system based on the Chinese Remainder Theorem,” in Proc. ASP-DAC,
Yokohama, Japan , pp. 391–395.
[19] Rizzo.L (1997) “Effective erasure codes for reliable computer communication protocols,” Computing . vol. 27, no. 2, pp. 24–36.
[20] Gittelsohn .A.M (1969) , “An occupancy problem,” Amer. Statistician, vol.23, no. 2, pp. 11–12.
[21] Feller .W (1968), An Introduction to Probability Theory, 3rd ed.Wiley, vol. 1.
[22] Stone .J (1963) , “Multiple-burst error correction with the Chinese Remainder Theorem,” J. Soc. Ind. Appl. Math., vol. 11, no. 1, pp.
74–81.
[23] Robinson .R.M(1954),“Mersenne and fermat numbers,” Proc. Amer. Math. Soc., vol. 5, pp. 842–846.
[24] [Online].Available: http://www.isi.edu/nsnam/ns/index.html.
www.iosrjournals.org 59 | Page