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.
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...ijsrd.com
In Wireless Sensor Network (WSNs), gather the data by using mobile sinks has become popular. Reduce the number of messages which is used for sink location broadcasting, efficient energy data forwarding, become accustomed to unknown earthly changes are achieved by a protocol which is projected by a SinkTrail. The forecast of mobile sinks’ location are done by using logical coordinate system. When sensor nodes don’t have any data to send, at that time they switch to sleep mode to save the energy and to increase the network lifetime. And due to this reason there is a chance of the involvement of nodes that are in sleeping state between the path sources to the mobile sink which is selected by the SinkTrail protocol. Before become the fully functional and process the information, these sleeping nodes can drop the some information. Due to this reason, it is vital to wake-up the sleeping nodes on the path earlier than the sender can start transferring of sensed data. In this paper, on-demand wake-up scheduling algorithm is projected which is used to activates sleeping node on the path before data delivery. Here, in this work the multi-hop communication in WSN also considers. By incorporating wake-up scheduling algorithm to perk up the dependability and improve the performance of on-demand data forwarding extends the SinkTrail solution in our work. This projected algorithm improves the quality of service of the network by dishonesty of data or reducing the loss due to sleeping nodes. The efficiency and the effectiveness projected solution are proved by the evaluation results.
An Energy Efficient Protocol To Increase Network Life In WSNIOSR Journals
Abstract : Wireless Sensor Network consists of several sensor nodes, these nodes loss some of their energy after the process of communication. So an energy efficient approach is required to improve the life of the network. In case of broadcast network, LEACH protocol uses an aggregative approach by creating cluster of nodes. Now the major concern is to built such clusters over WSN in an optimized way. This work presents the improvement over LEACH protocol. Hence we have different work environments where the network is having different capacities. The proposed work shows how the life time of the network will improve when the number of nodes varies within the network. Keywords - LEACH, energy, lifetime, cluster based, WSN\
Energy efficient node deployment for target coverage in wireless sensor networkGaurang Rathod
Network lifetime plays an integral role in setting up an efficient wireless sensor network. Coverage in a network needs to guarantee that the region is monitored with the required degree of reliability. Locations of sensor nodes constitute the basic input for the algorithms that examine coverage of the network. Coverage problems can be broadly classified as area coverage problem and target coverage problem. Area coverage focuses on monitoring the entire region of interest, whereas target coverage concerns monitoring only certain specific points in a given region. Target coverage can be categorized as simple coverage, k-coverage and Q-coverage.
Lower coverage level (simple coverage) is enough for environmental or habitat monitoring or applications like home security. Higher degree of coverage (k-coverage) will be required for some applications like target tracking to track the targets accurately, or if sensors work in a hostile environment such as battle fields or chemically polluted areas. More reliable results are produced for higher degree of coverage which requires multiple sensor nodes to monitor the region/targets. An example of Q-coverage is video surveillance systems deployed for monitoring hostile territorial area where some sensitive targets like a nuclear plant may need more sensors cooperate to ensure source redundancy for precise data. Sensor nodes deterministically deployed by using artificial bee colony algorithm, so as to achieve the required target coverage level and maximize the network lifetime.
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksIJMER
This paper contains optimize set coverage problem in wireless sensor networks with adaptable sensing range. Communication and sensing consume energy, so efficient power management can extended the network lifetime. In this paper we consider a enormous number of sensors with adaptable sensing range that are randomly positioned to monitor a number of targets. Every single target may be redundantly covered by various sensors. For preserving energy resources we organize sensors in sets stimulated successively. In this paper we introduce the Optimize Set Coverage (OSC) problem that has in unbiased finding with an extreme number of set covers in which every sensor node to be activated is connected to the base station. A sensor can be participated in various sensor sets, but the overall energy consumed in all groups is forced by the primary energy reserves. We show that the OSC problem is NP-complete and we propose the solutions: an integer programming for OSC problem, a linear programming for OSC problem with greedy approach, and a distributed and localized heuristic. Simulation results are presented and validated to our approaches.
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.
Proactive Data Reporting of Wireless sensor Network using Wake Up Scheduling ...ijsrd.com
In Wireless Sensor Network (WSNs), gather the data by using mobile sinks has become popular. Reduce the number of messages which is used for sink location broadcasting, efficient energy data forwarding, become accustomed to unknown earthly changes are achieved by a protocol which is projected by a SinkTrail. The forecast of mobile sinks’ location are done by using logical coordinate system. When sensor nodes don’t have any data to send, at that time they switch to sleep mode to save the energy and to increase the network lifetime. And due to this reason there is a chance of the involvement of nodes that are in sleeping state between the path sources to the mobile sink which is selected by the SinkTrail protocol. Before become the fully functional and process the information, these sleeping nodes can drop the some information. Due to this reason, it is vital to wake-up the sleeping nodes on the path earlier than the sender can start transferring of sensed data. In this paper, on-demand wake-up scheduling algorithm is projected which is used to activates sleeping node on the path before data delivery. Here, in this work the multi-hop communication in WSN also considers. By incorporating wake-up scheduling algorithm to perk up the dependability and improve the performance of on-demand data forwarding extends the SinkTrail solution in our work. This projected algorithm improves the quality of service of the network by dishonesty of data or reducing the loss due to sleeping nodes. The efficiency and the effectiveness projected solution are proved by the evaluation results.
An Energy Efficient Protocol To Increase Network Life In WSNIOSR Journals
Abstract : Wireless Sensor Network consists of several sensor nodes, these nodes loss some of their energy after the process of communication. So an energy efficient approach is required to improve the life of the network. In case of broadcast network, LEACH protocol uses an aggregative approach by creating cluster of nodes. Now the major concern is to built such clusters over WSN in an optimized way. This work presents the improvement over LEACH protocol. Hence we have different work environments where the network is having different capacities. The proposed work shows how the life time of the network will improve when the number of nodes varies within the network. Keywords - LEACH, energy, lifetime, cluster based, WSN\
Energy efficient node deployment for target coverage in wireless sensor networkGaurang Rathod
Network lifetime plays an integral role in setting up an efficient wireless sensor network. Coverage in a network needs to guarantee that the region is monitored with the required degree of reliability. Locations of sensor nodes constitute the basic input for the algorithms that examine coverage of the network. Coverage problems can be broadly classified as area coverage problem and target coverage problem. Area coverage focuses on monitoring the entire region of interest, whereas target coverage concerns monitoring only certain specific points in a given region. Target coverage can be categorized as simple coverage, k-coverage and Q-coverage.
Lower coverage level (simple coverage) is enough for environmental or habitat monitoring or applications like home security. Higher degree of coverage (k-coverage) will be required for some applications like target tracking to track the targets accurately, or if sensors work in a hostile environment such as battle fields or chemically polluted areas. More reliable results are produced for higher degree of coverage which requires multiple sensor nodes to monitor the region/targets. An example of Q-coverage is video surveillance systems deployed for monitoring hostile territorial area where some sensitive targets like a nuclear plant may need more sensors cooperate to ensure source redundancy for precise data. Sensor nodes deterministically deployed by using artificial bee colony algorithm, so as to achieve the required target coverage level and maximize the network lifetime.
Greedy – based Heuristic for OSC problems in Wireless Sensor NetworksIJMER
This paper contains optimize set coverage problem in wireless sensor networks with adaptable sensing range. Communication and sensing consume energy, so efficient power management can extended the network lifetime. In this paper we consider a enormous number of sensors with adaptable sensing range that are randomly positioned to monitor a number of targets. Every single target may be redundantly covered by various sensors. For preserving energy resources we organize sensors in sets stimulated successively. In this paper we introduce the Optimize Set Coverage (OSC) problem that has in unbiased finding with an extreme number of set covers in which every sensor node to be activated is connected to the base station. A sensor can be participated in various sensor sets, but the overall energy consumed in all groups is forced by the primary energy reserves. We show that the OSC problem is NP-complete and we propose the solutions: an integer programming for OSC problem, a linear programming for OSC problem with greedy approach, and a distributed and localized heuristic. Simulation results are presented and validated to our approaches.
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
An Energy-Efficient Min-Max Optimization with RSA Security in Wireless Sensor...IJMTST Journal
A Novel Energy-efficient Min-max Optimization (NEMO) is proposed to improve the data delivery
performance and provide security in WSN. The NEMO scheme is applied in the virtual grid environment to
periodically collect the data from source node to the mobile sink through the cell headers. Here the movement
of sink is in controlled fashion and collects the data from the border line cell headers. For efficient data
delivery Fruit Fly Optimization (FFO) algorithm is applied here to find the best path by using the fitness value
calculated between the nodes based on the distance. The optimal path is chosen by first calculating the
minimum hop count paths and then finds the maximum of total fitness value along those paths. In that way
best path is selected by considering the shortest path which improves the data delivery performance and
also it minimizes the energy consumption. The proposed scheme enables the sensor nodes to maintain the
optimal path towards the latest location of mobile sink by using the FFO algorithm which leads to maximize
the network lifetime in wireless sensor networks. RSA digital signature is used to provide the security
between the intermediate nodes during the data delivery. The source node generates the keys and broadcast
it to all other nodes in the network. Source node signs the data using its private key and the intermediate
nodes verifies the data using the source’s public key which is already broadcasted by the source node. If the
data is valid then it forwards to the next intermediate nodes and till the sink node gets the data, forwarding
takes place. Else the data packets are dropped and inform that node as misbehaving node and the source
chooses the next best path without having that misbehaving node in the path..
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.
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Mobile Relay Configuration in Data-Intensuive Wireless Sensor with Three Rout...IJERA Editor
Wireless sensor network are increasingly used in data-intensive applications such as micro-climate monitoring,
precision agriculture and audio/video surveillance. A key challenges faced by data-intensive wsn’s is to transmit
all the data generated with an application’s lifetime to the base station despite the fact that sensor nodes have
limited power supply. We propose using low-cost disposable mobile really and our work in the following
aspects First, it does not require complex motion planning of mobile nodes. Second we integrate the energy
consumption due to both mobility and wireless transmission. Our framework consists of first algorithm
computes an optimal routing tree. The second, we integrate the energy consumption due to both mobility and
wireless transmissions .The second algorithm improves the topology of the routing tree by greedily adding new
nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology.
Frequently forming a network topology without the use of any existing network infrastructure. We compare the
performance of the three prominent routing protocols for the mobile relay is Adhoc on Demand Distance Vector
(ADVO), Destination Sequenced Distance Vector (DSDV) and Temporally Ordered Routing Protocols (TORA).
We have chosen four performance metrics such as Average Delay, Packet Delivery Fraction, Routing load and
varying Mobility nodes, simulation for the popular routing protocols AODV, DSDV, and TORA. The
simulation is carried out on NS-2. The performance differentials are analyzed using varying network size and
simulations times. The simulation results confirm that ADVO performs well in terms of Average Delay, Packet
Delivery Fraction. As far as routing load concers TORA performs well.
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.
An Adaptive Energy Efficient Reliable Routing Protocol for Wireless Sensor Ne...IDES Editor
A reliable routing protocol for wireless sensor
networks (WSN) should be capable of adjusting to
constantly varying network conditions while conserving
maximum power. Existing Routing protocols provide
reliability at the cost of high energy consumption. In this
paper, we propose to develop an Adaptive Energy Efficient
Reliable Routing Protocol (AEERRP) with the aim of
keeping the energy consumption low while achieving high
reliability. In our proposed protocol, the data forwarding
probability is adaptively adjusted based on the measured
loss conditions at the sink. So only for high loss rates, a node
makes use of high transmission power to arrive at the sink.
Whenever the loss rate is low, it adaptively lessens the
transmission power. Since the source rebroadcasts the data,
until the packet loss is minimized, high data reliability is
achieved. By simulation results we show that the proposed
protocol achieves high reliability while ensuring low energy
consumption and overhead.
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.
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...chokrio
The major challenge for wireless sensor networks is energy consumption minimization. Wireless transmission consumes much more of energy. In the clustered network, a few nodes become cluster heads which causes the energetic heterogeneity. Therefore the behavior of the sensor network becomes very unstable. Hence, the need to apply the balancing of energy consumption across all nodes of the heterogeneous network is very important to prevent the death of those nodes and thereafter increase the
lifetime of the network. DEEC (Distributed Energy Efficient Clustering) is one of routing protocols
designed to extend the stability time of the network by reducing energy consumption. A disadvantage of
DEEC, which doesn’t takes into account the cluster size and the density of nodes in this cluster to elect the
cluster heads. When multiple cluster heads are randomly selected within a small area, a big extra energy
loss occurs. The amount of lost energy is approximately proportional to the number of cluster heads in this
area. In this paper, we propose to improve DEEC by a modified energy efficient algorithm for choosing
cluster heads that exclude a number of low energy levels nodes due to their distribution density and their
dimensions area. We show by simulation in MATLAB that the proposed approach increases the number of
received messages and prolong the lifetime of the network compared to DEEC. We conclude by studying
the parameters of heterogeneity that proposed technique provides a longer stability period which increases
by increasing the number of nodes which are excluded from the cluster head selection.
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK IJCNCJournal
Wireless Sensor Network (WSN) is commonly used to collect information from a remote area and one of the most important challenges associated with WSN is to monitor all targets in a given area while maximizing network lifetime. In wireless communication, energy consumption is proportional to the breadth of sensing range and path loss exponent. Hence, the energy consumption of communication can be minimized by varying the sensing range and decreasing the number of messages being sent. Sensing energy can be optimized by reducing the repeated coverage target. In this paper, an Adaptive Sensor Sensing Range (ASSR) technique is proposed to maximize the WSN Lifetime. This work considers a sensor network with an adaptive sensing range that are randomly deployed in the monitoring area. The sensor is adaptive in nature and can be modified in order to save power while achieving maximum time of monitoring to increase the lifetime of WSN network. The objective of ASSR is to find the best sensing range for each sensor to cover all targets in the network, which yields maximize the time of monitoring of all targets and eliminating double sensing for the same target. Experiments were conducted using an NS3 simulator to verify our proposed technique. Results show that ASSR is capable to improve the network lifetime by 20% as compared to other recent techniques in the case of a small network while achieving an 8% improvement for the case of a large networks.
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.
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
An Energy-Efficient Min-Max Optimization with RSA Security in Wireless Sensor...IJMTST Journal
A Novel Energy-efficient Min-max Optimization (NEMO) is proposed to improve the data delivery
performance and provide security in WSN. The NEMO scheme is applied in the virtual grid environment to
periodically collect the data from source node to the mobile sink through the cell headers. Here the movement
of sink is in controlled fashion and collects the data from the border line cell headers. For efficient data
delivery Fruit Fly Optimization (FFO) algorithm is applied here to find the best path by using the fitness value
calculated between the nodes based on the distance. The optimal path is chosen by first calculating the
minimum hop count paths and then finds the maximum of total fitness value along those paths. In that way
best path is selected by considering the shortest path which improves the data delivery performance and
also it minimizes the energy consumption. The proposed scheme enables the sensor nodes to maintain the
optimal path towards the latest location of mobile sink by using the FFO algorithm which leads to maximize
the network lifetime in wireless sensor networks. RSA digital signature is used to provide the security
between the intermediate nodes during the data delivery. The source node generates the keys and broadcast
it to all other nodes in the network. Source node signs the data using its private key and the intermediate
nodes verifies the data using the source’s public key which is already broadcasted by the source node. If the
data is valid then it forwards to the next intermediate nodes and till the sink node gets the data, forwarding
takes place. Else the data packets are dropped and inform that node as misbehaving node and the source
chooses the next best path without having that misbehaving node in the path..
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.
AN EFFICIENT SLEEP SCHEDULING STRATEGY FOR WIRELESS SENSOR NETWORKijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Mobile Relay Configuration in Data-Intensuive Wireless Sensor with Three Rout...IJERA Editor
Wireless sensor network are increasingly used in data-intensive applications such as micro-climate monitoring,
precision agriculture and audio/video surveillance. A key challenges faced by data-intensive wsn’s is to transmit
all the data generated with an application’s lifetime to the base station despite the fact that sensor nodes have
limited power supply. We propose using low-cost disposable mobile really and our work in the following
aspects First, it does not require complex motion planning of mobile nodes. Second we integrate the energy
consumption due to both mobility and wireless transmission. Our framework consists of first algorithm
computes an optimal routing tree. The second, we integrate the energy consumption due to both mobility and
wireless transmissions .The second algorithm improves the topology of the routing tree by greedily adding new
nodes. The third algorithm improves the routing tree by relocating its nodes without changing its topology.
Frequently forming a network topology without the use of any existing network infrastructure. We compare the
performance of the three prominent routing protocols for the mobile relay is Adhoc on Demand Distance Vector
(ADVO), Destination Sequenced Distance Vector (DSDV) and Temporally Ordered Routing Protocols (TORA).
We have chosen four performance metrics such as Average Delay, Packet Delivery Fraction, Routing load and
varying Mobility nodes, simulation for the popular routing protocols AODV, DSDV, and TORA. The
simulation is carried out on NS-2. The performance differentials are analyzed using varying network size and
simulations times. The simulation results confirm that ADVO performs well in terms of Average Delay, Packet
Delivery Fraction. As far as routing load concers TORA performs well.
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.
An Adaptive Energy Efficient Reliable Routing Protocol for Wireless Sensor Ne...IDES Editor
A reliable routing protocol for wireless sensor
networks (WSN) should be capable of adjusting to
constantly varying network conditions while conserving
maximum power. Existing Routing protocols provide
reliability at the cost of high energy consumption. In this
paper, we propose to develop an Adaptive Energy Efficient
Reliable Routing Protocol (AEERRP) with the aim of
keeping the energy consumption low while achieving high
reliability. In our proposed protocol, the data forwarding
probability is adaptively adjusted based on the measured
loss conditions at the sink. So only for high loss rates, a node
makes use of high transmission power to arrive at the sink.
Whenever the loss rate is low, it adaptively lessens the
transmission power. Since the source rebroadcasts the data,
until the packet loss is minimized, high data reliability is
achieved. By simulation results we show that the proposed
protocol achieves high reliability while ensuring low energy
consumption and overhead.
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.
NEW APPROACH TO IMPROVING LIFETIME IN HETEROGENEOUS WIRELESS SENSOR NETWORKS ...chokrio
The major challenge for wireless sensor networks is energy consumption minimization. Wireless transmission consumes much more of energy. In the clustered network, a few nodes become cluster heads which causes the energetic heterogeneity. Therefore the behavior of the sensor network becomes very unstable. Hence, the need to apply the balancing of energy consumption across all nodes of the heterogeneous network is very important to prevent the death of those nodes and thereafter increase the
lifetime of the network. DEEC (Distributed Energy Efficient Clustering) is one of routing protocols
designed to extend the stability time of the network by reducing energy consumption. A disadvantage of
DEEC, which doesn’t takes into account the cluster size and the density of nodes in this cluster to elect the
cluster heads. When multiple cluster heads are randomly selected within a small area, a big extra energy
loss occurs. The amount of lost energy is approximately proportional to the number of cluster heads in this
area. In this paper, we propose to improve DEEC by a modified energy efficient algorithm for choosing
cluster heads that exclude a number of low energy levels nodes due to their distribution density and their
dimensions area. We show by simulation in MATLAB that the proposed approach increases the number of
received messages and prolong the lifetime of the network compared to DEEC. We conclude by studying
the parameters of heterogeneity that proposed technique provides a longer stability period which increases
by increasing the number of nodes which are excluded from the cluster head selection.
ADAPTIVE SENSOR SENSING RANGE TO MAXIMISE LIFETIME OF WIRELESS SENSOR NETWORK IJCNCJournal
Wireless Sensor Network (WSN) is commonly used to collect information from a remote area and one of the most important challenges associated with WSN is to monitor all targets in a given area while maximizing network lifetime. In wireless communication, energy consumption is proportional to the breadth of sensing range and path loss exponent. Hence, the energy consumption of communication can be minimized by varying the sensing range and decreasing the number of messages being sent. Sensing energy can be optimized by reducing the repeated coverage target. In this paper, an Adaptive Sensor Sensing Range (ASSR) technique is proposed to maximize the WSN Lifetime. This work considers a sensor network with an adaptive sensing range that are randomly deployed in the monitoring area. The sensor is adaptive in nature and can be modified in order to save power while achieving maximum time of monitoring to increase the lifetime of WSN network. The objective of ASSR is to find the best sensing range for each sensor to cover all targets in the network, which yields maximize the time of monitoring of all targets and eliminating double sensing for the same target. Experiments were conducted using an NS3 simulator to verify our proposed technique. Results show that ASSR is capable to improve the network lifetime by 20% as compared to other recent techniques in the case of a small network while achieving an 8% improvement for the case of a large networks.
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.
89 jan-roger linna - 7032576 - capillary heating control and fault detectio...Mello_Patent_Registry
Jan-Roger Linna, John Paul Mello - Capillary Heating Control and Fault Detection System and Methodology for Fuel System in an Internal Combustion Engine
Improvising Network life time of Wireless sensor networks using mobile data a...Editor IJCATR
Energy consumption becomes a primary concern in a Wireless Sensor Network. To pursue high energy saving at sensor
nodes, a mobile collector should traverse the transmission range of each sensor in the field such that each data packet can be directly
transmitted to the mobile collector without any relay.
An Ant colony optimization algorithm to solve the broken link problem in wire...IJERA Editor
Aco is a well –known metahuristic in which a colony of artificial ants cooperates in explain Good solution to a combinational optimization problem. Wireless sensor consisting of nodes with limited power is deployed to gather useful information From the field. In wireless sensor network it is critical to collect the information in an energy efficient Manner.ant colony optimization, a swarm intelligence based optimization technique, is widely used In network routing. A novel routing approach using an ant colony optimization algorithm is proposed for wireless sensor Network consisting of stable nodes illustrative example details description and cooperative performance test result the proposed approach are included. The approach is also implementing to a small sized hardware component as a router chip simulation result show that proposed algorithm Provides promising solution allowing node designers to efficiency operate routing tasks.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
CUTTING DOWN ENERGY USAGE IN WIRELESS SENSOR NETWORKS USING DUTY CYCLE TECHNI...ijwmn
A wireless sensor network is composed of many sensor nodes, that have beengiven out in a
specific zoneandeach of them hadanability of collecting information from the environment and
sending collected data to the sink. The most significant issues in wireless sensor networks,
despite the recent progress is the trouble of the severe limitations of energy resources.Since that
in different applications of sensor nets, we could throw a static or mobile sink, then all aspects of
such networks should be planned with an awareness of energy.One of the most significant topics
related to these networks, is routing. One of the most widely used and efficient methods of
routing isa hierarchy (based on clustering) method.
In The present study with the objective of cutting down energy consumption and persistence of
network coverage, we have offered a novel algorithm based on clustering algorithms and multihop routing.To achieve this goal, first, we layer the network environment based on the size of the
network.We will identify the optimal number of cluster heads and every cluster head based on
the mechanism of topology control will start to accept members.Likewise, we set the first layer
as gate layer and subsequently identifying the gate’s nodes, we’d turn away half of the sensors
and then stop using energy and the remaining nodes in this layer will join the gate’s nodes
because they hold a critical part in bettering the functioning of the system. Cluster heads off
following layers send the information to cluster heads in the above layer until sent data will be
sent to gate’s nodes and finally will be sent to sink. We have tested the proposed algorithm in
two situations 1) when the sink is off and 2)when a sink is on and simulation data shows that
proposed algorithm has better performance in terms of the life span of a network than LEACH
and ELEACH protocols.
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
Anchor Point Based Data Gathering with Energy Provisioning In Wireless Rechar...IJTET Journal
Abstract: Several studies have demonstrated in Wireless Sensor Network for reducing the energy consumption of nodes However, these benifits are dependent on the path taken by the SenCar, particularly in delay-sensitive applications, as all sensed data must be collected within a given time constraint. An approach proposed to address this challenge is to form a hybrid moving pattern in which a mobile-sink node only visits anchor points, as opposed to all nodes. Sensor nodes that are no anchor point forward their sensed data via multihopping to the nearest anchor point. The optimal TSP nearest neighbour algorithm is used for finding the optimal path taken by the SenCar . The new method is proposed for energy transfer mobile collector to sensor nodes by using WerMDG. The simulation result show that the energy consumption is reduced when comber with the existing method.
QoS Framework for a Multi-stack based Heterogeneous Wireless Sensor Network IJECEIAES
Wireless sensor nodes consist of a collection of sensor nodes with constrained resources in terms of processing power and battery energy. Wireless sensors networks are used increasingly in many industrial and consumer applications. Sensors detect events and send via multi hop routing to the sink node for processing the event. The routing path is established through proactive or reactive routing protocols. To improve the performance of the Wireless Sensor Networks, multi stack architecture is addressed. But the multi stack architecture has many problems with respect to life time, routing loop and QOS. In this work we propose a solution to address all these three problems of life time, routing loop and QOS in case of multi stack architecture.
A Review Paper on Energy Capable Routing in Wireless Sensor Networkijtsrd
This day’s wireless sensor networks draw the attention of researchers more due to their admired applications in environment monitoring systems, radiation uses and nuclear threat detection applications weapon sensors for ships battlefield reconnaissance and surveillance military power, control mechanism, intelligence centre, communications and targeting systems and biomedical applications. Wireless sensor network provides cheap cost solution to various world problems. Sensors are low cost devices with limited storage, computational power systems. Several security mechanisms for sensor network must be energy efficient as security is the major concerned when they will be used in large scale as sensors have limited power and computational capability and should not be computational intensive. In this review paper we study the various energy efficient secure routing methods for WSN. Prof. Pooja | Prof. Sakena Benazer. S | Prof. Ajay Kumar "A Review Paper on Energy Capable Routing in Wireless Sensor Network" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-6 | Issue-3 , April 2022, URL: https://www.ijtsrd.com/papers/ijtsrd49546.pdf Paper URL: https://www.ijtsrd.com/engineering/electrical-engineering/49546/a-review-paper-on-energy-capable-routing-in-wireless-sensor-network/prof-pooja
Energy Efficient Clustering and Routing in Mobile Wireless Sensor Networkijwmn
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing
as the sensor nodes have scarce energy resource. The nodes’ mobility in MWSN poses a challenge to
design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the
organization complexity overhead of the network which is proportional to the number of nodes in the
network. This paper proposes a novel hybrid multipath routing algorithm with an efficient clustering
technique. A node is selected as cluster head if it has high surplus energy, better transmission range and
least mobility. The Energy Aware (EA) selection mechanism and the Maximal Nodal Surplus Energy
estimation technique incorporated in this algorithm improves the energy performance during routing.
Simulation results can show that the proposed clustering and routing algorithm can scale well in dynamic
and energy deficient mobile sensor network.
Issues in optimizing the performance of wireless sensor networkseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A Review of Sensor Node in Wireless Sensor Networksijtsrd
Wireless Sensor Networks WSNs are collection of tiny sensor nodes capable of sensing, processing and broadcasting data correlated to some occurrence in the network area. The sensor nodes have severe limitation, such as bandwidth, short communication range, limited CPU processing facility, memory and energy. Enhancing the lifetime of wireless sensors network and efficient utilizations of bandwidth are essential for the proliferation of wireless sensor network in different applications. We provide an in depth study of applying wireless sensor networks WSNs to real world habitat monitoring. A set of system design requirements were developed that cover the hardware design of the nodes, the sensor network software, protective enclosures, and system architecture to meet the requirements of biologists. Although researchers anticipate some challenges arising in real world deployments of WSNs, many problems can only be discovered through experience. We present a set of experiences from a four month long deployment on a remote island. We analyze the environmental and node health data to evaluate system performance. The close integration of WSNs with their environment provides environmental data at densities previously impossible. We show that the sensor data is also useful for predicting system operation and network failures. Based on over one million data readings, we analyze the node and network design and develop network reliability profiles and failure models. Jobanputra Paresh Ashokkumar | Prof. Arun Jhapate ""A Review of Sensor Node in Wireless Sensor Networks"" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-4 , June 2019, URL: https://www.ijtsrd.com/papers/ijtsrd23620.pdf
Paper URL: https://www.ijtsrd.com/engineering/computer-engineering/23620/a-review-of-sensor-node-in-wireless-sensor-networks/jobanputra-paresh-ashokkumar
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.
Node Failure Prevention by Using Energy Efficient Routing In Wireless Sensor ...IJTET Journal
The most necessary issue that has to be solved in coming up with an information transmission rule for
wireless unplanned networks is a way to save unplanned node energy whereas meeting the wants of applications
users because the unplanned nodes are battery restricted. Whereas satisfying the energy saving demand, it’s
conjointly necessary to realize the standard of service. Just in case of emergency work, it's necessary to deliver the
information on time. Achieving quality of service in is additionally necessary. So as to realize this demand, Power -
efficient Energy-Aware routing protocol for wireless unplanned networks is planned that saves the energy by
expeditiously choosing the energy economical path within the routing method. When supply finds route to
destination, it calculates α for every route. The worth α is predicated on largest minimum residual energy of the trail
and hop count of the trail. If a route has higher α, then that path is chosen for routing the information. The worth of α
are higher, if the most important of minimum residual energy of the trail is higher and also the range of hop count is
lower. Once the trail is chosen, knowledge is transferred on the trail. So as to extend the energy potency any
transmission power of the nodes is additionally adjusted supported the situation of their neighbour. If the neighbours
of a node are closely placed thereto node, then transmission vary of the node is diminished. Thus it's enough for the
node to own the transmission power to achieve the neighbour at intervals that vary. As a result transmission power
of the node is cut back that later on reduces the energy consumption of the node. Our planned work is simulated
through Network machine (NS-2). Existing AODV and Man-Min energy routing protocol conjointly simulated
through NS-2 for performance comparison. Packet Delivery quantitative relation, Energy Consumption and end-toend
delay.
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Ramesh Iyer
In today's fast-changing business world, Companies that adapt and embrace new ideas often need help to keep up with the competition. However, fostering a culture of innovation takes much work. It takes vision, leadership and willingness to take risks in the right proportion. Sachin Dev Duggal, co-founder of Builder.ai, has perfected the art of this balance, creating a company culture where creativity and growth are nurtured at each stage.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf91mobiles
91mobiles recently conducted a Smart TV Buyer Insights Survey in which we asked over 3,000 respondents about the TV they own, aspects they look at on a new TV, and their TV buying preferences.
Smart TV Buyer Insights Survey 2024 by 91mobiles.pdf
F017544247
1. IOSR Journal of Computer Engineering (IOSR-JCE)
e-ISSN: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 5, Ver. IV (Sep. – Oct. 2015), PP 42-47
www.iosrjournals.org
DOI: 10.9790/0661-17544247 www.iosrjournals.org 42 | Page
Maximizing Wireless Sensor Networks Life Time through Sink
Mobility
Prof.Geeta Patil
Department of Computer Science & Engg,BKIT, Bhalki-585328
Abstract: The main objective of this paper is to optimise wireless sensor network life time by moving the sink
to a finite number of locations. If any node is having energy less than minimum, that node is not considered in
communication path then alternate path is created by routing algorithm AODV. Information gathered by mobile
sink can reduce the energy consumption of sensor nodes by reducing multihop communication, automatically
network lifetime is improved.
Key words: Sensor, mobility, AODV, Routing, Energy, Optimization, Dimension., Protocol.
I. Introduction
A.What is Wireless Sensor Network?
Wireless sensor node (simply sensor node) consists of sensing, computing, communication, actuation,
and power components. These components are integrated on a single or multiple boards, and packaged in a few
cubic inches.WSN usually consists of tens to thousands of such nodes that communicate through wireless
channels for information sharing and cooperative processing.The basic philosophy behind WSNs is that, while
the capability of each individual sensor node is limited .
B. What is the Problem existing in the current application?
Existing energy-conserving routing. The protocols aim at balancing the energy consumption instead of
minimizing the absolute consumed power. The mobile sink approach, by further involving mobility, increases
the dimension of such optimization problems.
C. What is the solution?
So to solve above mentioned problem , a framework has built is to optimising wireless sensor network
life time by moving the sink to a finite number of locations. If any node is having energy less than minimum,
that node is not considered in communication path then alternate path is created by routing algorithm AODV.
Information gathered by mobile sink can reduce the energy consumption of sensor nodes by reducing multi hop
communication, automatically network lifetime is improved. Initially it is developed to solve the problem
involving a single sink, then we generalized this to approximate the original problem involving multiple sinks.
II. Design & Implementation
A).Design steps:
Sensor node wants to send data packet to sink node by moving sinks to the finite set of location
Algorithm: Node has information or Data packet
Step 1: First select a sensor nodes and make them as active by initializing active =1.
Step 2: Set up a Sink Node and initialize to 0.
Step3: Find Route from source node to sink node using AODV routing, protocol, a Hello packets are exchanged
between them by sending RREQ to the Sink Node. If the path has found, then sink node sends RREQ in the
same path.
Step 4: The Sensor Nodes senses the data.
Step 5: Sink nodes gather the information from neighbouring sensor nodes .
Step 6: If any Sensor node is having Energy less than minimum value (Threshold) then Calculate the battery life
and drop that node, by passing Sensor node, again find route.
Step 7: If the Sensor nodes having energy larger than minimum value(Threshold) forward the data packet and
calculate the battery life.
Step 8:Sink node will stay in the current position and gather the information till specified pausetime.After
completion of the specified pause time sink node moves to the new location in the network.
Step 9:Repeat step 1,still simulation time is over.
Step 10.End of the algorithm.
2. Maximizing Wireless Sensor Networks Life Time Through Sink Mobility
DOI: 10.9790/0661-17544247 www.iosrjournals.org 43 | Page
B. Methodology
Functioning of the proposed sensor networks is given by.
Application Layer.
All the sensor nodes which are active are start sending or generating data, Sink node is equated to 0 ,to
send data from current source node to destination node. The sensor will check if route exist to the destination or
not , if route exists it will start sending a data if not there it will generate route request message .
Physical Layer Energy Model
Energy is a phenomenon of physical layer and energy loss due to transmission and reception is much
higher than that of idle time energy loss. Therefore in this project we assume that one unit energy is lost for
every packet reception and three units of energy at the transmission time i.e.,when packet arrives from MAC
layer node energy is given by.
Energy=Energy-loss
Energy Optimization through Mobility
The condition for mobility is that a sink move in such a point randomly in the network where at least
one sensor is present and no other sink is present. A pause time is the time period for which a node waits in its
current position before moving again.
C). The implementation depicts wireless sensor network that consists .
-Sink without mobility.
-Sink with mobility.
-Multiple sinks with mobility.
A snapshot of the simulation scenario is shown in Figures. Every sensor in the network is assigned a
defined transmission power . we assume that one unit energy is lost for every packet reception and three units
of energy at the transmission time i.e.,when packet arrives from MAC layer energy is given by.
Energy=Energy-loss.
III. Interpretation Of Results
A .Sink without Mobility
Sink in the middle and sensor nodes are across it
3. Maximizing Wireless Sensor Networks Life Time Through Sink Mobility
DOI: 10.9790/0661-17544247 www.iosrjournals.org 44 | Page
Radio links established
B .Sink with Mobility
Initial network structure
Sink node at Position 1.
Sink node at position 2
4. Maximizing Wireless Sensor Networks Life Time Through Sink Mobility
DOI: 10.9790/0661-17544247 www.iosrjournals.org 45 | Page
C . Multiple Sinks with Mobility
Initial Network Structure
Sink nodes at position1
Sinks nodes at position2
6. Maximizing Wireless Sensor Networks Life Time Through Sink Mobility
DOI: 10.9790/0661-17544247 www.iosrjournals.org 47 | Page
0
10
20
30
40
50
60
70
80
90
100
60 70 80 90 100 110 120
LifeTimeinSec
Node
MULTI_SINK_MOBILE
SINGLE_SINK_MOBILE
SINGLE_SINK_STABLE
Figure 5.6: Nodes v/s Network Life Tim
IV. Applications
Area monitoring
Environmental monitoring
-Air pollution monitoring
-Forest fires detection
-Greenhouse monitoring
-Landslide detection
Industrial monitoring
Agriculture etc.
V. Conclusion And Future Enhancements
This paper explains that how the energy conservation can be reduced by moving the sinks in a planned
way therefore subsequently distributing the power consumption across the networks. Initially problem is solved
by involving a single sink, then generalized this to approximate the original problem involving multiple sinks.
Finally, the results demonstrate that network lifetime can be significantly improved using this technique and
also results in better packet delivery ratio and low bit error rate.
Further it can be used for node maintenance protocol (battery replacing or recharging for sensor
nodes).The protocol can be extensible to any sensor architecture. This design work considered static sensor
nodes but same can be extended for dynamic (moving) nodes as well.
References
[1]. Suyoung Yoon; Dutta, R.; Sichitiu, M.L.; North Carolina State Univ., Raleigh –“Power Aware Routing Algorithms for Wireless
Sensor Networks”, Wireless and Mobile Communications, 2007. ICWMC '07. Third International Conference , ISBN: 0-7695-
2796-5.
[2]. Archan Misra, Suman Banerjee-MRPC: Maximizing Network Lifetime for Reliable Routing inWireless Environments, IBM
T.J. Watson Research Center 30 Saw Mill River Road Hawthorne, NY 10532, USA
[3]. Katja Schwieger, Amrit Kumart XGeIrh ard Fettweis- On the Impact of the Physical Layer on Energy Consumption in Sensor
Networks, *Vodafone Chair Mobile Communications Systems Dresden University of Technology, Mommsenstr. 18, D-
01062 Dresden, Germany. Indian Institute of Technology (IIT), Guwahati, 690799, India
[4]. Li-Hsing Yen, Ming-Zhou Cai, Yang-Min Cheng, and Ping-Yuan Yang- Minimizing Energy Expense for Chain-Based
Data Gathering in Wireless Sensor Networks , Department of Computer Science and Information Engineering
ChungHua'University,Taiwan300, R.O.C.[Conference name]
[5]. Chen Avin and Gunes Ercal-Bounds on the Mixing Time and Partial Cover of Ad-Hoc and Sensor Networks, Computer Science
Department University of California, Los Angeles Los Angeles, CA 90095-1596, USA.
[6]. Erdal Cayrrci, Tolga Caplii, &lem Emiroglu - Power Aware Many to Many Routing in Wireless Sensor and Actuator
Networks, Sensors, Actuators and Networking Laboratory Istanbul TechnicaI University
[7]. W. Liang, J. Luo, and X. Xu, “Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks,” in IEEE
Global Telecommunications Conference (GLOBECOM 2010). IEEE, Dec.2010.
[8]. Z. Wang, S. Basagni, E. Melachrinoudis, and C. Petrioli, “Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime,” in
Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS 2005).[6] Vinay Kumar Singh and
Vidushi Sharma, “Elitist Genetic Algorithm based Energy Efficient Routing Scheme for Wireless Sensor Networks”, International
Journal of Advanced Smart Sensor Network Systems, Vol. 2, No. 2, pp. 15-21, 2012.
[9]. Snehal Sarangi and Biju Thankchan, “Particle Swarm Optimization based A Novel Routing Algorithm for Wireless Sensor
Network”, International Journal of Research in Engineering, Information Technology and Social Sciences, Vol. 2, No. 11, 2012 .
[10]. Amol P. Bhondekar, Renu Vig, Madan Lal Singla, C. Ghanshyam and Pawan Kanpur, “Genetic Algorithm Based Node Placement
Methodology for Wireless Sensor Networks”, Proceedings of the International MultiConference of Engineers and Computer
Scientists, Vol. 1, 2009.