In wireless sensor network, node reform and restoration is an active area for research. Each sensor node fails either when some critical event occurs at the node or when the battery of the node is completely drained. The Wireless sensor actor network (WSAN) is an enhances the wireless sensor networks by providing more power and recovering a energy consumption. In the WSAN, sensors sense the environment and sent back their data to an actor node. Actors have to coordinate their operations, keep up a firmly associated system topology at all times and achieve the predefined application mission. The Defect Node Reformation Algorithm (DNR) reform a defect node using genetic and the grade diffusion algorithms. A category of solutions for this problem is Least Troublesome Topology Repair Algorithm (LTTR). LTTR is a limited and circulated calculation that influences existing course revelation exercises in the system. LTTR algorithm is used to minimize the power consumption and reform a transmission path. Our results show that achieves performance in terms of packet delivery ratio, packet loss ratio and end to end latency suitable for real network deployments.
Improved Development of Energy Efficient Routing Algorithm for Privacy Preser...IRJET Journal
This document proposes an algorithm to improve energy efficiency and privacy preservation for the sink node in wireless sensor networks. The algorithm uses node clustering, where sensor nodes are grouped into clusters with a cluster head node. Data is routed from cluster members to their cluster head, and then from cluster heads to the sink node. The algorithm elects a subset of cluster heads to broadcast data, obscuring the location of the sink node and distributing energy usage across nodes. Simulations analyze how effectively this approach preserves sink node anonymity while limiting energy depletion across varying network conditions.
EDEEC and LEACH are clustering protocols for wireless sensor networks. EDEEC is for heterogeneous networks where nodes have different energy levels, while LEACH is for homogeneous networks. The document compares the performance of EDEEC and LEACH in terms of network lifetime, energy consumption, and total data transmission. Simulation results show that EDEEC outperforms LEACH by prolonging network lifetime, reducing energy consumption rate over time, and increasing total data transmitted to the base station.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
The document describes two wireless sensor network routing protocols: LEACH and PEGASIS. LEACH uses local processing to reduce global communication and randomly rotates cluster heads to distribute energy load. PEGASIS forms chains between nodes so that each node only communicates with a close neighbor, extending network lifetime compared to LEACH by up to 3 times. Both protocols aim to improve energy efficiency through data aggregation and minimizing transmission distances in wireless sensor networks.
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.
A Fault Tolerant Approach To Enhances WSN Lifetime In Star TopologyIRJET Journal
This document summarizes a research paper that proposes a fault-tolerant approach to increase the lifetime of wireless sensor networks using a star topology. It applies a Gradient Diffusion algorithm and Fault Node Recovery algorithm to identify and replace non-functioning sensor nodes. The Fault Node Recovery algorithm uses a genetic algorithm to determine the sequence of non-operating nodes and parameter thresholds. Simulation results showed the approach could increase the number of active nodes by 8-9 times, reduce data loss by up to 98%, and lower energy consumption by around 32%.
Analyzing the interaction of ascent with ieee 802.11E mac in wireless sensor ...IRJET Journal
This document analyzes the interaction between ASCENT, an adaptive wireless sensor network topology management scheme, and the IEEE 802.11e MAC layer. ASCENT has four node states - active, passive, test, and sleep - to manage energy usage while maintaining reliable data transmission. The IEEE 802.11e MAC layer provides quality of service by prioritizing traffic. The document simulates ASCENT using the NS2 simulator with and without IEEE 802.11e MAC. Results show that combining ASCENT with IEEE 802.11e MAC improves packet delivery ratio, throughput, and extends network lifetime compared to using just ASCENT with CSMA MAC.
An algorithm for fault node recovery of wireless sensor networkeSAT 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
Improved Development of Energy Efficient Routing Algorithm for Privacy Preser...IRJET Journal
This document proposes an algorithm to improve energy efficiency and privacy preservation for the sink node in wireless sensor networks. The algorithm uses node clustering, where sensor nodes are grouped into clusters with a cluster head node. Data is routed from cluster members to their cluster head, and then from cluster heads to the sink node. The algorithm elects a subset of cluster heads to broadcast data, obscuring the location of the sink node and distributing energy usage across nodes. Simulations analyze how effectively this approach preserves sink node anonymity while limiting energy depletion across varying network conditions.
EDEEC and LEACH are clustering protocols for wireless sensor networks. EDEEC is for heterogeneous networks where nodes have different energy levels, while LEACH is for homogeneous networks. The document compares the performance of EDEEC and LEACH in terms of network lifetime, energy consumption, and total data transmission. Simulation results show that EDEEC outperforms LEACH by prolonging network lifetime, reducing energy consumption rate over time, and increasing total data transmitted to the base station.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
The document describes two wireless sensor network routing protocols: LEACH and PEGASIS. LEACH uses local processing to reduce global communication and randomly rotates cluster heads to distribute energy load. PEGASIS forms chains between nodes so that each node only communicates with a close neighbor, extending network lifetime compared to LEACH by up to 3 times. Both protocols aim to improve energy efficiency through data aggregation and minimizing transmission distances in wireless sensor networks.
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.
A Fault Tolerant Approach To Enhances WSN Lifetime In Star TopologyIRJET Journal
This document summarizes a research paper that proposes a fault-tolerant approach to increase the lifetime of wireless sensor networks using a star topology. It applies a Gradient Diffusion algorithm and Fault Node Recovery algorithm to identify and replace non-functioning sensor nodes. The Fault Node Recovery algorithm uses a genetic algorithm to determine the sequence of non-operating nodes and parameter thresholds. Simulation results showed the approach could increase the number of active nodes by 8-9 times, reduce data loss by up to 98%, and lower energy consumption by around 32%.
Analyzing the interaction of ascent with ieee 802.11E mac in wireless sensor ...IRJET Journal
This document analyzes the interaction between ASCENT, an adaptive wireless sensor network topology management scheme, and the IEEE 802.11e MAC layer. ASCENT has four node states - active, passive, test, and sleep - to manage energy usage while maintaining reliable data transmission. The IEEE 802.11e MAC layer provides quality of service by prioritizing traffic. The document simulates ASCENT using the NS2 simulator with and without IEEE 802.11e MAC. Results show that combining ASCENT with IEEE 802.11e MAC improves packet delivery ratio, throughput, and extends network lifetime compared to using just ASCENT with CSMA MAC.
An algorithm for fault node recovery of wireless sensor networkeSAT 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
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
A Fault Tolerant Approach to Enhances Wsn Lifetime in Star TopologyIRJET Journal
This document presents a fault tolerant approach to increase the lifetime of wireless sensor networks using a star topology. It proposes using a gradient diffusion algorithm and fault node recovery algorithm to minimize packet loss and broadcast delay. The fault node recovery algorithm identifies non-functioning sensor nodes using a genetic algorithm and replaces them to extend the network lifetime. Simulation results show the approach increases active nodes by 8-10 times, reduces data loss by 98%, and decreases energy consumption by 27-32% compared to other algorithms. This is achieved by reusing sensor nodes and routing paths to prolong the usability of the wireless sensor network.
Fault Node Recovery Algorithm for a Wireless Sensor NetworkYogesh Vk
The WSN is made of nodes from a few to several hundred, where each node is connected to one or several sensors.
The basic components of a node are
o Sensor and actuator - an interface to the physical world designed to sense the environmental parameters like pressure and temperature.
o Controller - is to control different modes of operation for processing of data
o Memory - storage for programming data.
o Communication - a device like antenna for sending and receiving data over a wireless channel.
o Power Supply- supply of energy for smooth operation of a node like battery.
This project report summarizes a wireless sensor network project completed by three students. It describes the objectives and types of routing protocols used in wireless sensor networks, focusing on the LEACH hierarchical routing protocol. It then discusses some weaknesses of LEACH and proposes an improved DECSA algorithm that selects cluster heads based on both distance and remaining energy to try to overcome LEACH's energy imbalance issues and extend network lifetime.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
Sensors Scheduling in Wireless Sensor Networks: An Assessmentijtsrd
The wireless sensor networks WSN is a combination of a large number of low power, short lived, unreliable sensors. The main challenge of wireless sensor network is to obtain long system lifetime. Many node scheduling algorithms are used to solve this problem. This method can be divided into the following two major categories first is round based node scheduling and second is group based node scheduling. In this paper many node scheduling algorithm like one phase decomposition model, Tree Based distributed wake up scheduling and Clique based node scheduling Algorithm are analyzed. Manju Ghorse | Dr. Avinash Sharma "Sensors Scheduling in Wireless Sensor Networks: An Assessment" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-1 , December 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29560.pdfPaper URL: https://www.ijtsrd.com/computer-science/computer-network/29560/sensors-scheduling-in-wireless-sensor-networks-an-assessment/manju-ghorse
An energy efficient protocol based study of wsn to increase the lifetimeIAEME Publication
This document summarizes and compares several hierarchical routing protocols for wireless sensor networks that aim to improve energy efficiency and increase network lifetime. It discusses Low-Energy Adaptive Clustering Hierarchy (LEACH), Energy LEACH (e-LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), Threshold-sensitive Energy Efficient sensor Network (TEEN), and Hybrid Energy-Efficient Distributed clustering (HEED). It compares the protocols based on their concept, achieved network lifetime, energy efficiency, and drawbacks. LEACH uses random cluster head selection while e-LEACH selects heads based on residual energy. PEGASIS forms chains to reduce distances between nodes but has single point failures. TEEN
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
The document presents a graduate project on efficient data aggregation from polling points in wireless sensor networks. The proposed system called Mobi-Cluster aims to minimize overall network overhead and energy expenditure associated with multi-hop data retrieval while ensuring balanced energy consumption and prolonged network lifetime. This is achieved through building cluster structures consisting of member nodes that route data to assigned cluster heads, and selecting appropriate polling points to act as intermediaries between clusters and a mobile collector. The key stages of the Mobi-Cluster protocol are described as cluster head selection, polling point selection, cluster head attachment to polling points, data aggregation and forwarding to polling points, and communication between polling points and the mobile collector.
Directed diffusion for wireless sensor networkingHabibur Rahman
This document summarizes the key ideas of the "Directed Diffusion for Wireless Sensor Networking" paper. It introduces directed diffusion as a data-centric paradigm for wireless sensor networks that is designed for robustness, scalability, and energy efficiency. The core concepts of directed diffusion are interests, data, gradients, and reinforcement, which work together to efficiently route queries to sensor data in the network. Through localized interactions and data aggregation, directed diffusion is shown to significantly reduce energy consumption compared to flooding-based approaches in wireless sensor networks.
Multiple Sink Positioning and Relocation for Improving Lifetime in Wireless S...IRJET Journal
The document summarizes research on improving network lifetime in wireless sensor networks through techniques like multiple sink positioning and relocation. It first provides background on wireless sensor networks and their components. It then discusses how clustering sensor nodes and using multiple mobile sink nodes can help balance energy load and prolong network lifetime. Several existing studies that propose algorithms and schemes for optimally positioning and moving sink nodes are reviewed. The document concludes by introducing two new coordinated multiple mobile sink algorithms, MSMA and PMA, that aim to further improve network lifetime performance.
This document discusses approaches to improve reliability in wireless sensor networks. It proposes a dynamic sectoring scheme where the network area is divided into sectors with a sensor node assigned as sector head for each. When an event occurs, only that sector is activated, reducing congestion and energy use. This is expected to enhance packet delivery ratio and reduce losses. Prior work on using data fusion and opportunistic flooding algorithms to improve reliability is also reviewed. The dynamic sectoring approach aims to reliably transmit data with low congestion and energy usage.
This paper considers a heterogeneous network of energy constrained sensors deployed over a region. Each
Normal sensor node in a network is systematically gathering and transmitting sensed data to the clusterhead,
and then cluster head sending data to a base station (via intermediate cluster- heads). This paper
focuses on reducing the energy consumption and hence improving lifetime of wireless sensor Networks.
Clustering sensor node is an effective topology for the energy constrained networks. So energy saving
algorithm has been developed in which clusters are formed considering a subset of high energy nodes as a
cluster-head and another subset of powerful nodes is ask to go to sleep. When Cluster heads deplete their
energy another subset of nodes becomes active and acts as a cluster head. Proposed approach is
implemented in MATLAB, Simulation results shows that it can prolong the network lifetime than LEACH
protocol, and achieves better performance than the existing clustering algorithms such as LEACH.
Routing protocols in wireless sensor networks face several unique challenges compared to other wireless networks. The document discusses these challenges and provides an overview of common routing protocol approaches in WSNs, including flat routing protocols like SPIN and Directed Diffusion, hierarchical routing protocols like LEACH, and location-based routing protocols. It also covers routing design issues specific to WSNs such as energy efficiency, data delivery models, fault tolerance, and quality of service.
This document summarizes and compares three clustering algorithms for wireless sensor networks: LEACH, HEED, and PEGASIS. LEACH is the first protocol to use hierarchical routing to increase network lifetime. It forms clusters with local heads that collect data from members and transmit to the base station. HEED uses residual energy and network topology features to select distributed cluster heads. PEGASIS forms chains between sensors so each transmits to a close neighbor, avoiding hotspots. The document analyzes these algorithms and compares their effects on network lifetime.
This document provides an overview and critical review of routing protocols in wireless sensor networks. It begins with an introduction to wireless sensor networks and their applications. It then discusses several related works on routing protocols. The main body discusses different types of routing protocols, including location-based protocols like MECN and GEAR, hierarchical protocols like LEACH and PEGASIS, and data-centric protocols like SPIN and Directed Diffusion. It provides examples of each type and evaluates them based on factors like energy efficiency, scalability, reliability and more. Finally, it lists references for further reading on routing protocols in wireless sensor networks.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
Poornachandran Ramalingan is seeking a team leading position where he can utilize over 3 years of experience guiding project teams to achieve goals on time. He has a proven track record of maximizing team performance and motivating individuals through training and addressing weaknesses. His previous roles include Production Lead at ANZ Support Services India where he prepared reports, organized training, and ensured deadlines were met.
Airport Runway Detection Based On ANN AlgorithmIJTET Journal
This document presents a methodology for detecting airport runways in satellite images. The methodology consists of two main stages: 1) a segmentation stage that classifies image regions as "probably runway" or "not runway" based on textural features, and 2) a shape detection stage that analyzes segmented regions to identify long parallel lines characteristic of runway sides. The document describes various textural features extracted for segmentation, including Haralick textures, Gabor filters, Fourier spectra, and wavelet analyses. It also details an artificial neural network classifier trained on these features to perform the segmentation. Experimental results demonstrate the algorithm can successfully detect runways in satellite imagery.
Energy efficient routing in wireless sensor networksSpandan Spandy
The document summarizes several energy efficient multicast routing protocols for wireless sensor networks. It begins with an introduction to wireless sensor networks and routing challenges. It then summarizes the following protocols: MAODV, TEEN, APTEEN, SPEED, MMSPEED, RPAR, and LEACH. For each protocol, it provides a brief overview of the protocol's design, objectives, components, and how it aims to improve energy efficiency in wireless sensor network routing. The document concludes that providing energy-efficient multicast routing is important for wireless sensor network applications and that the protocols presented aim to achieve lower energy requirements through approaches like clustering, adaptive thresholding, and congestion control.
Improvement In LEACH Protocol By Electing Master Cluster Heads To Enhance The...Editor IJCATR
In wireless sensor networks, sensor nodes play the most prominent role. These sensor nodes are mainly un-chargeable, so it
raises an issue regarding lifetime of the network. Mainly sensor nodes collect data and transmit it to the Base Station. So, most of the
energy is consumed in the communication process between sensor nodes and the Base Station. In this paper, we present an
improvement on LEACH protocol to enhance the network lifetime. Our goal is to reduce the transmissions between cluster heads and
the sink node. We will choose optimum number of Master Cluster Heads from variation cluster heads present in the network. The
simulation results show that our proposed algorithm enhances the network lifetime as compare to the LEACH protocol.
A Fault Tolerant Approach to Enhances Wsn Lifetime in Star TopologyIRJET Journal
This document presents a fault tolerant approach to increase the lifetime of wireless sensor networks using a star topology. It proposes using a gradient diffusion algorithm and fault node recovery algorithm to minimize packet loss and broadcast delay. The fault node recovery algorithm identifies non-functioning sensor nodes using a genetic algorithm and replaces them to extend the network lifetime. Simulation results show the approach increases active nodes by 8-10 times, reduces data loss by 98%, and decreases energy consumption by 27-32% compared to other algorithms. This is achieved by reusing sensor nodes and routing paths to prolong the usability of the wireless sensor network.
Fault Node Recovery Algorithm for a Wireless Sensor NetworkYogesh Vk
The WSN is made of nodes from a few to several hundred, where each node is connected to one or several sensors.
The basic components of a node are
o Sensor and actuator - an interface to the physical world designed to sense the environmental parameters like pressure and temperature.
o Controller - is to control different modes of operation for processing of data
o Memory - storage for programming data.
o Communication - a device like antenna for sending and receiving data over a wireless channel.
o Power Supply- supply of energy for smooth operation of a node like battery.
This project report summarizes a wireless sensor network project completed by three students. It describes the objectives and types of routing protocols used in wireless sensor networks, focusing on the LEACH hierarchical routing protocol. It then discusses some weaknesses of LEACH and proposes an improved DECSA algorithm that selects cluster heads based on both distance and remaining energy to try to overcome LEACH's energy imbalance issues and extend network lifetime.
Qos group based optimal retransmission medium access protocol for wireless se...IJCNCJournal
This paper presents, a Group Based Optimal Retransmission Medium Access (GORMA) Protocol is
designed that combines protocol of Collision Avoidance (CA) and energy management for low-cost, shortrange,
low-data rate and low-energy sensor nodes applications in environment monitoring, agriculture,
industrial plants etc. In this paper, the GORMA protocol focuses on efficient MAC protocol to provide
autonomous Quality of Service (QoS) to the sensor nodes in one-hop QoS retransmission group and two
QoS groups in WSNs where the source nodes do not have receiver circuits. Hence, they can only transmit
data to a sink node, but cannot receive any control signals from the sink node. The proposed protocol
GORMA provides QoS to the nodes which work independently on predefined time by allowing them to
transmit each packet an optimal number of times within a given period. Our simulation results shows that
the performance of GORMA protocol, which maximize the delivery probability of one-hop QoS group and
two QoS groups and minimize the energy consumption.
Sensors Scheduling in Wireless Sensor Networks: An Assessmentijtsrd
The wireless sensor networks WSN is a combination of a large number of low power, short lived, unreliable sensors. The main challenge of wireless sensor network is to obtain long system lifetime. Many node scheduling algorithms are used to solve this problem. This method can be divided into the following two major categories first is round based node scheduling and second is group based node scheduling. In this paper many node scheduling algorithm like one phase decomposition model, Tree Based distributed wake up scheduling and Clique based node scheduling Algorithm are analyzed. Manju Ghorse | Dr. Avinash Sharma "Sensors Scheduling in Wireless Sensor Networks: An Assessment" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-1 , December 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29560.pdfPaper URL: https://www.ijtsrd.com/computer-science/computer-network/29560/sensors-scheduling-in-wireless-sensor-networks-an-assessment/manju-ghorse
An energy efficient protocol based study of wsn to increase the lifetimeIAEME Publication
This document summarizes and compares several hierarchical routing protocols for wireless sensor networks that aim to improve energy efficiency and increase network lifetime. It discusses Low-Energy Adaptive Clustering Hierarchy (LEACH), Energy LEACH (e-LEACH), Power-Efficient Gathering in Sensor Information Systems (PEGASIS), Threshold-sensitive Energy Efficient sensor Network (TEEN), and Hybrid Energy-Efficient Distributed clustering (HEED). It compares the protocols based on their concept, achieved network lifetime, energy efficiency, and drawbacks. LEACH uses random cluster head selection while e-LEACH selects heads based on residual energy. PEGASIS forms chains to reduce distances between nodes but has single point failures. TEEN
SIMULATION BASED ANALYSIS OF CLUSTER-BASED PROTOCOL IN WIRELESS SENSOR NETWORKijngnjournal
The modern growth in fabricate energy efficient Wireless Sensor Network is liberal a novel way to
systematize WSN in applications like surveillance, industrial monitoring, traffic monitoring, habitat
monitoring, cropping monitoring, crowd including etc. The rising use of these networks is making
engineers evolve novel and efficient ideas in this field. A group of research in data routing, data density
and in network aggregation has been proposed in recent years. The energy consumption is the main
apprehension in the wireless sensor network. There are many protocols in wireless sensor network to
diminish the energy consumption and to put in to the network lifetime. Among a range of types of
techniques, clustering is the most efficient technique to diminish the energy expenditure of network. In
this effort, LEACH protocol has been second-hand for clustering in which cluster heads are nominated on
the basis of distance and energy. The LEACH protocol is been implemented in a simulated environment
and analyze their performance graphically.
The document presents a graduate project on efficient data aggregation from polling points in wireless sensor networks. The proposed system called Mobi-Cluster aims to minimize overall network overhead and energy expenditure associated with multi-hop data retrieval while ensuring balanced energy consumption and prolonged network lifetime. This is achieved through building cluster structures consisting of member nodes that route data to assigned cluster heads, and selecting appropriate polling points to act as intermediaries between clusters and a mobile collector. The key stages of the Mobi-Cluster protocol are described as cluster head selection, polling point selection, cluster head attachment to polling points, data aggregation and forwarding to polling points, and communication between polling points and the mobile collector.
Directed diffusion for wireless sensor networkingHabibur Rahman
This document summarizes the key ideas of the "Directed Diffusion for Wireless Sensor Networking" paper. It introduces directed diffusion as a data-centric paradigm for wireless sensor networks that is designed for robustness, scalability, and energy efficiency. The core concepts of directed diffusion are interests, data, gradients, and reinforcement, which work together to efficiently route queries to sensor data in the network. Through localized interactions and data aggregation, directed diffusion is shown to significantly reduce energy consumption compared to flooding-based approaches in wireless sensor networks.
Multiple Sink Positioning and Relocation for Improving Lifetime in Wireless S...IRJET Journal
The document summarizes research on improving network lifetime in wireless sensor networks through techniques like multiple sink positioning and relocation. It first provides background on wireless sensor networks and their components. It then discusses how clustering sensor nodes and using multiple mobile sink nodes can help balance energy load and prolong network lifetime. Several existing studies that propose algorithms and schemes for optimally positioning and moving sink nodes are reviewed. The document concludes by introducing two new coordinated multiple mobile sink algorithms, MSMA and PMA, that aim to further improve network lifetime performance.
This document discusses approaches to improve reliability in wireless sensor networks. It proposes a dynamic sectoring scheme where the network area is divided into sectors with a sensor node assigned as sector head for each. When an event occurs, only that sector is activated, reducing congestion and energy use. This is expected to enhance packet delivery ratio and reduce losses. Prior work on using data fusion and opportunistic flooding algorithms to improve reliability is also reviewed. The dynamic sectoring approach aims to reliably transmit data with low congestion and energy usage.
This paper considers a heterogeneous network of energy constrained sensors deployed over a region. Each
Normal sensor node in a network is systematically gathering and transmitting sensed data to the clusterhead,
and then cluster head sending data to a base station (via intermediate cluster- heads). This paper
focuses on reducing the energy consumption and hence improving lifetime of wireless sensor Networks.
Clustering sensor node is an effective topology for the energy constrained networks. So energy saving
algorithm has been developed in which clusters are formed considering a subset of high energy nodes as a
cluster-head and another subset of powerful nodes is ask to go to sleep. When Cluster heads deplete their
energy another subset of nodes becomes active and acts as a cluster head. Proposed approach is
implemented in MATLAB, Simulation results shows that it can prolong the network lifetime than LEACH
protocol, and achieves better performance than the existing clustering algorithms such as LEACH.
Routing protocols in wireless sensor networks face several unique challenges compared to other wireless networks. The document discusses these challenges and provides an overview of common routing protocol approaches in WSNs, including flat routing protocols like SPIN and Directed Diffusion, hierarchical routing protocols like LEACH, and location-based routing protocols. It also covers routing design issues specific to WSNs such as energy efficiency, data delivery models, fault tolerance, and quality of service.
This document summarizes and compares three clustering algorithms for wireless sensor networks: LEACH, HEED, and PEGASIS. LEACH is the first protocol to use hierarchical routing to increase network lifetime. It forms clusters with local heads that collect data from members and transmit to the base station. HEED uses residual energy and network topology features to select distributed cluster heads. PEGASIS forms chains between sensors so each transmits to a close neighbor, avoiding hotspots. The document analyzes these algorithms and compares their effects on network lifetime.
This document provides an overview and critical review of routing protocols in wireless sensor networks. It begins with an introduction to wireless sensor networks and their applications. It then discusses several related works on routing protocols. The main body discusses different types of routing protocols, including location-based protocols like MECN and GEAR, hierarchical protocols like LEACH and PEGASIS, and data-centric protocols like SPIN and Directed Diffusion. It provides examples of each type and evaluates them based on factors like energy efficiency, scalability, reliability and more. Finally, it lists references for further reading on routing protocols in wireless sensor networks.
Data-Centric Routing Protocols in Wireless Sensor Network: A surveyAli Habeeb
This document summarizes several data-centric routing protocols for wireless sensor networks. It begins by outlining the challenges of routing in WSNs, including energy consumption, scalability, addressing, robustness, topology, and application-specific needs. It then describes several data-centric routing protocols, including flooding, directed flooding, constrained flooding, gossiping, fuzzy gossiping, location-based gossiping, and others. It notes advantages and disadvantages of these protocols for efficiently routing data in wireless sensor networks while minimizing energy consumption.
Poornachandran Ramalingan is seeking a team leading position where he can utilize over 3 years of experience guiding project teams to achieve goals on time. He has a proven track record of maximizing team performance and motivating individuals through training and addressing weaknesses. His previous roles include Production Lead at ANZ Support Services India where he prepared reports, organized training, and ensured deadlines were met.
Airport Runway Detection Based On ANN AlgorithmIJTET Journal
This document presents a methodology for detecting airport runways in satellite images. The methodology consists of two main stages: 1) a segmentation stage that classifies image regions as "probably runway" or "not runway" based on textural features, and 2) a shape detection stage that analyzes segmented regions to identify long parallel lines characteristic of runway sides. The document describes various textural features extracted for segmentation, including Haralick textures, Gabor filters, Fourier spectra, and wavelet analyses. It also details an artificial neural network classifier trained on these features to perform the segmentation. Experimental results demonstrate the algorithm can successfully detect runways in satellite imagery.
Improving The Performance Of Multiuser OFDM Wireless System With UWB ChannelIJTET Journal
The multi user OFDM system can be used to produce a highly flexible and effective communication
system. In the existing multi user OFDM system, resource allocation to each user is the major problem. Also the existing
multi user OFDM system uses frequency diversity technique that requires sparse bandwidth and multiple receivers
improving the complexity. In order to increase the system performance, the proposed system allows multiple user data to
be multiplexed together to form a single OFDM symbol where the resources are allocated equally to all users. The
proposed multiuser OFDM system achieves double the capacity and better performance in terms of Signal-to-Noise Ratio
and Bit Error Rate of a single user OFDM system and the UWB channel is used to securely transmit the data through the
channel. Also, the proposed system reduces the receiver complexity by using polarization diversity to receive the
multipath components for multiple users.
Comprehensive Path Quality Measurement in Wireless Sensor NetworksIJTET Journal
A wireless sensor network mostly relies on multi-hop transmissions to deliver a data packet. It is of essential importance to measure the quality of multi-hop paths and such information shall be utilized in designing efficient routing strategies. Existing metrics like ETF, ETX mainly focus on quantifying the link performance in between the nodes while overlooking the forwarding capabilities inside the sensor nodes. By combining the QoF measurements within a node and over a link, we are able to comprehensively measure the intact path quality in designing efficient multihop routing protocols. We propose QoF, Quality of Forwarding, a new metric which explores the performance in the gray zone inside a node left unattended in previous studies. We implement QoF and build a modified Collection Tree Protocol.
A Smart Handheld Measuring and Testing Electronic Device with Touch ScreenIJTET Journal
Hand in hand instrument replaces the old traditional way of measuring and testing in colleges and helps in easy way of understanding theoretical concepts based on practical knowledge. As there occurs shortage of instruments, long duration of calculation, large occupation of space, low accuracy, inconvenience come about in completing the work. A single Smart device which is a multipurpose handheld instrument overcomes the above difficulties and helps in measuring voltage, current, resistance, frequency, temperature, speed, sound and to observe waveforms for engineering students in the laboratories. In a single ARM Cortex M3 microcontroller all measurements are done and displayed within a fraction of time in the TFT graphical LCD display. The data and waveforms from oscilloscope can be saved and retrieved for future analyzing purpose which is done using a Micro SD memory card. The device is fully operated with touch screen and touch buttons. The device works with help of LPC1313, a powerful 32-bit ARM Cortex-M3 microcontroller from NXP Semiconductors.
An Efficient Image Encomp Process Using LFSRIJTET Journal
Lossless color image compression algorithm based on hierarchical prediction and Context Adaptive Lossless Image Compression (CALIC).The RGB Image decorrelation is done by Reversible Color Transformation (RCT). The output of RCT is Y Component and chrominance component (cucv). The Y Component is encoded by any conventional technique like raster scan predicted method. The Chrominance images (cucv) are encoded by hierarchical prediction. In Hierarchical prediction row wise decomposition and column wise decomposition are performed. From the predicted value in order to obtain the compressed image can apply the arithmetic coding. In that results we can apply the Security for the images using LFSR encryption.
Internet-Of-Things Based Intelligent Home-centric Healthcare SystemIJTET Journal
In recent years, the world is facing a common problem that the number of elderly people is increasing. Hence providing In-Home Health Care Services for elderly people is very important. The medication non-compliance problem has caused a serious threat to public health. Wireless sensor networks are now being widely used to structure home health care systems. Here, an Internet-of-Things (IOT) based intelligent home centric health care system has been proposed which connects smart sensors attached to human body for physiological monitoring and intelligent pharmaceutical packaging for daily medication management. The proposed system involves three key blocks: Biopatch, a wearable biomedical sensor used for acquisition of biosignals, iMed Box which serves as gateway to gather patient‟s physiological information and provide a variety of medical services and iMed Pack, an intelligent medication administration system for timely delivery of medication to patient. Thereby this system provides remote prescription and medication non-compliance services. The medicine deficiency datas are send to the doctor‟s mobile instantly using android application, once the medicine are insufficient over there. Representatives of the hospital are send to fill the medicine in the medicine box. This proposed Home-Centric Health system brings about ubiquitous and personalized healthcare.
Design and Analysis of Turbine Blades in a Micro Gas Turbine EngineIJTET Journal
This paper is based on the design and analysis of turbine blades in a micro gas turbine engine. Micro-gas
turbine engines offer advantages over the other technologies for small-scale power generation. A combustor is the heart
of any engine; where in the micro gas turbine, it should be compact, simple, inexpensive and robust in construction. The
burned gases from the combustor pass through the turbine blades. The designing and manufacturing of the turbine
blades are very difficult when the blade angle, blade size and shape are considered. The design of the turbine blade
passages is broadly based on aerodynamic considerations and it is to obtain optimum efficiency, compatibility with
compressor and combustor design. For this, the specifications of many micro gas turbine engines are taken by
conducting a literature survey to get the design data for an apt turbine blade. By these values, the flow parameters of the
engine are obtained and are taken for analyzing purposes to get increased momentum thrust. Here, the design is done by
using the software CATIA and it is then exported to FLUENT for analyzing. The result shows that the estimated design
and performance is achieved.
Numerical Optimization of Shoring Towers for Slab Formwork SystemsIJTET Journal
The usage of Shoring Tower for slab formwork is getting increased due to not only because of flexibility in the assemble and
construction over Prop-Supported Slab Formwork but also the capacity to withstand maximum construction working loads. The Shoring Tower is
generally used for the construction of heavy structures like Bridges, Culverts, staging of Retaining walls, etc. However a comprehensive scale down
of the shoring tower design goes well with the large span and increased slab thickness of conventional buildings. This research focuses primarily on
Analysis, Modelling, Design and Adaptability of shoring tower for slab formwork through computer models and optimized. The different models are
made from the combination of diameter of tubes with slab thickness and also with plywood thickness in Solid Works. Periodic analysis is done in
ANSYS for different load combinations with the variations of slab thickness and plywood thickness will gives the optimized results for the slab
formwork systems.
Comparative Study on NDCT with Different Shell Supporting StructuresIJTET Journal
Natural draft cooling towers are very essential in modern days in thermal and nuclear power stations. These are the hyperbolic shells of revolution in form and are supported on inclined columns. Several types of shell supporting structures such as A,V,X,Y are being used for construction of NDCT’s. Wind loading on NDCT governs critical cases and requires attention. In this paper a comparative study on reinforcement details has been done on NDCT’s with X and Y shell supporting structures. For this purpose 166m cooling tower with X and Y supporting structures being analyzed and design for wind (BS & IS code methods), seismic loads using SAP2000.
A Survey on Virtualization Data Centers For Green Cloud ComputingIJTET Journal
Abstract —Due to trends like Cloud Computing and Green cloud Computing, virtualization technologies are gaining increasing importance. Cloud is a atypical model for computing resources, which intent to computing framework to the network in order to cut down costs of software and hardware resources. Nowadays, power is one of big issue of IDC has huge impacts on society. Researchers are seeking to find solutions to make IDC reduce power consumption. These IDC (Internet Data Center) consume large amounts of energy to process the cloud services, high operational cost, and affecting the lifespan of hardware equipments. The field of Green computing is also becoming more and more important in a world with finite number of energy resources and rising demand. Virtual Machine (VM) mechanism has been broadly applied in data center, including flexibility, reliability, and manageability. The research survey presents about the virtualization IDC in green cloud it contains various key features of the Green cloud, cloud computing, data centers, virtualization, data center with virtualization, power – aware, thermal – aware, network-aware, resource-aware and migration techniques. In this paper the several methods that are utilze to achieve the virtualization in IDC in green cloud computing are discussed.
Retrieving Informations from Satellite Images by Detecting and Removing ShadowIJTET Journal
In accordance with the characteristics of remote sensing images, we put forward a color intensity method of
shadow detection and removal. Some approaches for shadow detection and removal use particular color and spectral
properties of shadows. In this method, the input satellite image color plane is calculated and the values of RGB are separated.
Then the chromaticity is calculated to determine the average value of the segmented region. The Color Intensity algorithm is
adopted to remove the shadow and retrieve the corresponding information.
Abstract- Delay Tolerant Network (DTN) in routing concerns itself with the ability to route data from source to destination which is the fundamental ability all communication network must have. During the transmission of packets it has the fixed landmark so that only one path can be chosen. It cannot choose the alternative path, that path is considered to be as the best path. To solve this problem, an optimized inter – landmark data routing algorithm, namely DTN – FLOW which chooses the alternative path that is considered to be as the shortest and best path. The DTN – FLOW algorithm not only transmit packet with the use of landmark and inter – landmark. The information message will be performed in all the nodes so the performance of each and every node decreases by means of traffic. In order to increase the high throughput, node to node communication can be done effectively in DTN network.
Multi Object Tracking Methods Based on Particle Filter and HMMIJTET Journal
This document discusses multi-object tracking methods based on particle filtering and hidden Markov models. It provides an overview of particle filtering and how it can be used for object tracking by approximating the posterior distribution of objects in video frames. It also discusses how hidden Markov models can be used for prediction and tracking objects at the global layer. Specifically, it describes a multi-object tracking method that uses a coupled layer approach with a local layer tracked using particle filtering and a global layer tracked using a hidden Markov model. This improves tracking efficiency and reduces computational time compared to other recent multi-object trackers.
IRIS Recognition Based Authentication System In ATMIJTET Journal
Security and Authentication of individuals is necessary for our daily lives especially in ATMs. It has been improved by using biometric verification techniques like face recognition, fingerprints, voice and other traits, comparing these existing traits, there is still need for considerable computer vision. Iris recognition is a particular type of biometric system that can be used to reliably identify a person uniquely by analyzing the patterns found in the iris. Initially Iris images are collected as datasets and maintained in agent memory. Then the Iris and pupil are detected from the image, removing noises. The features of the iris were encoded by convolving the normalized iris region with 2DGabor filter. The Hamming distance was chosen as a matching metric, which gave the measure of how many bits disagreed between the templates of the iris.
Design And Analysis Of Low Power High Performance Single Bit Full AdderIJTET Journal
Adder is the significant circuit in arithmetic operations. Adder cells are designed for power and delay
reduction. Now ground bounce noise is also necessary for good performance. In this paper the full adder is
designed using only 8 Transistors using Pass Transistor Logic (PTL). The power gating technique is one such a
best technique which reduces leakage power through the ground. This technique is implemented using sleep
transistor added between ground rail and actual ground. Here a single bit 8 Transistor full adder is proposed. We
will perform analysis and simulation of various parameters like power, delay and ground bounce noise using
tanner EDA tool 180nm CMOS Technology.
Certain Investigations on Security Issues in Smart Grid over Wireless Communi...IJTET Journal
Smart Grid (SG) communication has recently received significant attentions to facilitate intelligent and distributed electric power transmission systems. The advent of the smart grid promises to user in an era that will bring intelligence, efficiency, and optimality to the power grid. Most of these challenges will occur as an Internet-like communications network is super imposed on top of the current power grid using wireless mesh network technologies with the 802.15.4, 802.11 and WiMAX Standards. Each of these will expose the power grid to security threats. Wireless communication offers the benefits of low cost, rapid deployment, shared communication medium, and mobility. It causes many security and privacy challenges. The concept of dynamic secret is applied to design an encryption scheme for smart grid in wireless communication. Between two parties of communication, the previous packets are coded as retransmission sequence, where retransmitted packet is marked as ―1‖ and the other is marked as ―0‖.During the communication, the retransmission sequence is generated at both sides to update the dynamic encryption key. Any missing or misjudging sequence would prevent the adversary from achieving key. A Smart Grid platform is built, employing the ZigBee protocol for wireless communication. The Simulation results show that the retransmission and packet loss in ZigBee communication are inevitable and unpredictable and it is impossible of the adversary to track the updating of dynamic encryption key. Even though the DES scheme can protect the encryption key from attackers, the hackers can obtain the keys some time, due to the block size 64 bits used by DES that makes the adversary (hacker) to hack the data. It introduces vulnerabilities and liner crypt analysis; this can be achieved by using AES scheme. The AES uses 128 bits block size for a single encryption key a data of 256 billion gigabytes can be transmitted thus its provide much more safety to user from hacker and it reduces the end to end delay and increases packet transmission rate.
User Experience w instytucjach kulturyadamheleniak
Projektowanie doświadczeń czyli tworzenie produktów i usług wychodzących naprzeciw potrzebom odbiorców. Techniki i procesy przydatne w instytucjach kultury niezależnie od ich wielkości i budżetu.
Single Sink Repositioning Technique in Wireless Sensor Networks for Network L...IRJET Journal
This document presents a technique called single sink repositioning to extend the lifetime of wireless sensor networks. Sensor nodes have limited battery power, so energy consumption must be managed carefully. In typical static sink networks, nodes farther from the sink expend more energy transmitting data and drain their batteries quicker, shortening network lifetime. The proposed approach tracks the distance of each node to the sink and calculates an optimal sink position to minimize distances. It simulates moving the sink to this position using an algorithm in NS-2. Simulation results show repositioning the sink achieves significant energy savings compared to static sinks, helping improve overall network lifetime.
Reliable Data Aggregation Protocol (RDAT) uses functional reputation to improve data reliability in wireless sensor networks. It assigns separate reputation values for sensing, routing, and aggregation actions. Nodes monitor neighbors and exchange reputation tables. Before transmitting data, nodes evaluate aggregators' aggregation reputation to detect compromised ones. Aggregators run the Reliable Data Aggregation algorithm to further ensure integrity by using routing and sensing reputation to identify false reports. Simulation results show RDAT significantly improves data reliability over attacked networks compared to existing trust systems.
An implementation of recovery algorithm for fault nodes in a wireless sensor ...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
This document proposes an energy efficient framework for data collection in wireless sensor networks using prediction. The framework uses clustering, where sensor nodes are organized into clusters with a cluster head. The cluster head can enable or disable local prediction at sensor nodes to reduce data transmission. When prediction is enabled, sensors only transmit data if the value differs from the predicted value by more than a threshold. Sensors can also sleep when not transmitting to save energy. The document evaluates the performance of this framework through simulations, finding it reduces energy consumption compared to alternatives by integrating prediction with sleep/awake cycles.
1) The document proposes implementing an efficient K-means clustering algorithm to enhance connectivity and lifetime in wireless sensor networks.
2) It compares the proposed K-means algorithm to an existing Jumper Firefly algorithm based on energy consumption, network lifetime, and end-to-end delay.
3) Simulation results show the proposed K-means algorithm improves performance by reducing energy consumption from 16 to 12 Joules, increasing network lifetime by 96% compared to 83% for the existing algorithm, and lowering end-to-end delay from 3.7 to 2.7 seconds.
A Fault tolerant system based on Genetic Algorithm for Target Tracking in Wir...Editor IJCATR
In this paper, we explored the possibility of using Genetic Algorithm (GA) being used in Wireless Sensor Networks in general with
specific emphasize on Fault tolerance. In Wireless sensor networks, usually sensor and sink nodes are separated by long communication
distance and hence to optimize the energy, we are using clustering approach. Here we are employing improved K-means clustering algorithm to
form the cluster and GA to find optimal use of sensor nodes and recover from fault as quickly as possible so that target detection won’t be
disrupted. This technique is simulated using Matlab software to check energy consumption and lifetime of the network. Based on the
simulation results, we concluded that this model shows significant improvement in energy consumption rate and network lifetime than other
method such as Traditional clustering or Simulated Annealing
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 Novel Routing Algorithm for Wireless Sensor Network Using Particle Swarm O...IOSR Journals
This summary provides the key details about a novel routing algorithm for wireless sensor networks using particle swarm optimization:
1. The paper proposes a particle swarm optimization (PSO) based routing protocol (PSOR) that uses energy efficiency as the major criteria for routing and finding optimized paths for data transmission to the base station.
2. Simulation results show that the PSOR generates whole new routing paths by using energy as the fitness value to evaluate different paths and select the most optimized path with the lowest energy consumption compared to other routing paths.
3. Experiments comparing PSOR to a genetic algorithm (GROUP) routing protocol show that PSOR achieves better results in terms of energy consumption and extends the lifetime of the wireless sensor
Node Deployment in Homogeneous and Heterogeneous Wireless Sensor NetworkIJMTST Journal
Optimal sensor deployment is necessary condition in homogeneous and heterogeneous wireless sensor
network. Effective deployment of sensor nodes is a major point of concern as performance and lifetime of any
WSN. Proposed sensor deployment in WSN explore every sensor node sends its data to the nearest sink node
of the WSN. In addition to that system proposes a hexagonal cell based sensor deployment which leads to
optimal sensor deployment for both homogeneous and heterogeneous sensor deployment. Wireless sensor
networks are receiving significant concentration due to their potential applications ranging from surveillance
to tracking domains. In limited communication range, a WSN is divided into several disconnected sub-graphs
under certain conditions. We deploy sensor nodes at random locations so that it improves performance of the
network.This paper aims to study, discuss and analyze various node deployment strategies and coverage
problems for Homogeneous and Heterogeneous WSN.
This document describes an RSSI (received signal strength indicator) based localization algorithm for wireless sensor networks. It discusses using RSSI values measured from reference nodes to estimate distances and perform trilateration to locate a target sensor node. The algorithm design includes RSSI to distance conversion using a path loss model, trilateration implementation using circle intersections, and simplifying computations for resource-limited sensor node processors through techniques like Taylor series approximations of exponential functions. Pseudocode is provided for RSSI to distance conversion and trilateration calculations.
Features of wsn and various routing techniques for wsn a surveyeSAT 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.
Features of wsn and various routing techniques for wsn a surveyeSAT Journals
Abstract A Wireless Sensor Network is the collection of large number of sensor nodes, which are technically or economically feasible and measure the ambient condition in the environment surrounding them. The difference between usual wireless networks and WSNs is that sensors are sensitive to energy consumption. Most of the attention is given to routing protocols, for energy awareness, since they might differ depending on the application and network architecture. Routing techniques for WSN are classified into three categories based on network structure: Flat, hierarchical and location-based routing. Furthermore, these protocols can be classified into multi-path based, query based, negotiation-based, QoS-based, and coherent–based, depending on the protocol operation. In this paper the survey of routing techniques in WSNs is shown. It is also outlined the design challenges and performance metrics for routing protocols in WSNs. Finally We also highlight the advantages and performance issues of different routing techniques by it’s comparative analysis. Future-directions for routing in sensor network is also described. Index Terms: Wireless sensor network, Routing techniques, Routing challenges and future directions.
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.
The document discusses topology issues in wireless sensor networks. It defines two main categories of topology issues - topology control problems and topology awareness problems. Topology control problems involve maintaining sensor coverage topology and sensor connectivity topology. Approaches for sensor coverage include controlling node density and positioning for static, mobile, and hybrid sensor networks. Sensor connectivity approaches use power control and power management mechanisms. Topology awareness problems involve geographic routing to efficiently route packets based on node locations and addressing sensor holes that can disrupt routing. The document provides a taxonomy of topology issues and surveys various approaches studied in the literature to optimize wireless sensor network topology.
Design of Real-time Self Establish Wireless Sensor For Dynamic NetworkIJTET Journal
Abstract— Wireless sensor network in the recent trend engaged with high speed responsive real time system. This type of real time system requires reliable and compatible sensor to work in an environment where the sensor is dynamic in nature. Sensor network is to design to perform a set of high level information processing tasks such as detection, tracking or classification. Application of sensor networks is wide ranging and can vary significantly in application requirements, modes of deployment, sensing modality, power supply. Dynamic configuring of wireless sensor involves timing constraints to configure the sensor or to switch an adaptive sensor when working node failure due to energy, data rate, packet loss and range of the sensor. So the network, with such dynamic nature needs a background sensor which is able to be switched when the active sensor has a problem and improper functioning due to the network deploy environment. The background sensor lies inactive inside the range of the active sensor; ensure that the sensor is about to die and make sure the last data transfer successful find delay time to switch. Fault tolerance is achieved by switching the background sensor with the active sensor, where the background sensor self establish themselves in the network and perform similar routing metrics and configure them self with the network as soon they are switched. Once, the actual sensor retained back to the active condition then the background sensor will go to inactive state during this switching process the sensor will not loss data packet.
The document discusses clustering algorithms for wireless sensor networks. It describes four categories of clustering algorithms: 1) identity-based, which select cluster heads based on node identifiers, 2) neighborhood-based, which select heads based on number of neighbors, 3) probabilistic, which assign selection probabilities, and 4) biologically-inspired. Example algorithms described include the Linked Cluster Algorithm, Highest Connectivity Algorithm, and Weighted Clustering Algorithm. Clustering helps optimize energy usage and extend network lifetime by reducing transmissions and aggregating data at cluster heads.
This document discusses techniques for data dissemination and caching in wireless sensor networks. It aims to reduce energy consumption by minimizing unnecessary data transmission through cooperative caching. Sensor nodes can store data in their local cache or use nearby nodes' caches through cooperative caching. One node close to the sink is selected as the Immediate Dissemination Node to cache data, while other nodes along the path act as dissemination nodes. By caching data closer to the sink, this approach reduces network traffic and prolongs the battery life of sensor nodes. The paper also reviews several routing protocols and discusses how data negotiation, change expectancy, and discarding duplicate data can further improve energy efficiency in wireless sensor networks.
Abstract Now a day’s wireless sensor network has become an interesting research field. Network life time and energy efficiency are one of the main concerns for wireless sensor networks. Sensors are constrained in terms of battery power, storage, limited processing capacity etc. Because of these reasons new protocols are proposed for wireless sensor network. This paper only deals with cluster based hierarchical protocol TEEN (Threshold Sensitive Energy Efficient Sensor Network Protocol). The sensor network architecture in TEEN is based on a hierarchical clustering. TEEN is data-centric, reactive, event-driven protocol which is best suited for time critical application. It transmits data based on hard threshold and soft threshold values. If the thresholds are not reached, then nodes will never communicate. The user will not get any data from network and will not come to know if all the nodes die. So, user will not be able to distinguish between how many nodes are alive or dead in network and will not be able to know about network lifetime. This paper deals with that node will be able to tell base station or sink before leaving network and base station will be aware of alive and dead nodes in the network. Keywords: WSN; TEEN (Threshold Sensitive Energy Efficient Clustering); Hard Threshold; Soft Threshold;
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Similar to Improve a Network Life Time by Least Troublesome Topology Repair Algorithm in WSAN (20)
Beaglebone Black Webcam Server For SecurityIJTET Journal
Web server security using BeagleBone Black is based on ARM Cortex-A8 processor and Linux operating system
is designed and implemented. In this project the server side consists of BeagleBone Black with angstrom OS and interfaced
with webcam. The client can access the web server by proper authentication. The web server displays the web page forms
like home, video, upload, settings and about. The home web page describes the functions of Web Pages. The video Web page
displays the saved videos in the server and client can view or download the videos. The upload web page is used by the client
to upload the files to server. The settings web page is used to change the username, password and date if needed. The about web page provides the description of the project
Biometrics Authentication Using Raspberry PiIJTET Journal
This document discusses a biometrics authentication system using fingerprint recognition on a Raspberry Pi. It uses a fingerprint reader module connected to a Raspberry Pi. Fingerprint images are captured using a GUI application and converted to binary templates. The templates are stored in a PostgreSQL database. A Python script is used to match fingerprints by comparing templates and identifying matching ridge patterns between fingerprints. The system was able to accurately match fingerprints from the same finger and distinguish fingerprints from different fingers based on the ridge patterns. Future work involves improving the matching accuracy and developing the system for real-time high-end applications.
Conceal Traffic Pattern Discovery from Revealing Form of Ad Hoc NetworksIJTET Journal
Number of techniques has been planned supported packet secret writing to safeguard the
communication in MANETs. STARS functioning supported stastical characteristics of captured raw traffic.
STARS discover the relationships of offer to destination communication. To forestall STAR attack associate
offer hidding technique is introduced.The pattern aims to derive the source/destination probability distribution.
that's the probability for each node to entire traffic captured with link details message source/destination and
conjointly the end-to-end link probability distribution that's the probability for each strive of nodes to be
associate end-to-end communication strive. thence construct point-to-point traffic originate and then derive the
end-to-end traffic with a set of traffic filtering rules; thus actual traffic protected against revelation attack.
Through this protective mechanism efficiency of traffic enlarged by ninety fifth from attacked traffic. For a lot of
sweetening to avoid overall attacks second shortest path is chosen.
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.
Prevention of Malicious Nodes and Attacks in Manets Using Trust worthy MethodIJTET Journal
In Manet the first demand is co-operative communication among nodes. The malicious nodes might cause security issues like grey hole and cooperative attacks. To resolve these attack issue planning Dynamic supply routing mechanism, that is referred as cooperative bait detection theme (CBDS) that integrate the advantage of each proactive and reactive defence design is used. In region attacks, a node transmits a malicious broadcast informing that it's the shortest path to the destination, with the goal of intercepting messages. During this case, a malicious node (so-called region node) will attract all packets by victimisation solid Route Reply (RREP) packet to incorrectly claim that “fake” shortest route to the destination then discard these packets while not forwarding them to the destination. In grey hole attacks, the malicious node isn't abs initio recognized in and of itself since it turns malicious solely at a later time, preventing a trust-based security resolution from detective work its presence within the network. It then by selection discards/forwards the info packets once packets undergo it. During this we have a tendency to focus is on detective work grey hole/collaborative region attacks employing a dynamic supply routing (DSR)-based routing technique.
Effective Pipeline Monitoring Technology in Wireless Sensor NetworksIJTET Journal
Wireless detector nodes are a promising technology to play three-dimensional applications. Even it
will sight correct lead to could on top of ground and underground. In solid underground watching system makes
some challenges are there to propagating the signals. The detector node is moving entire the underground
pipeline and sending information to relay node that's placed within the on top of ground. If any relay node is
unsuccessful during this condition suggests that it'll not sending the info. In this watching system can specially
designed as a heterogeneous networks. Every high power relay nodes most covers minimum 2 low power relay
node. If any relay node is unsuccessful within the network, the constellation can modification mechanically
supported the heterogeneous network. The high power relay node is change the unsuccessful node and sending
the condition of pipeline. The benefits are thought-about to be extremely distributed, improved packet delivery
Raspberry Pi Based Client-Server Synchronization Using GPRSIJTET Journal
A low cost Internet-based attendance record embedded system for students which uses wireless technology to
transfer data between the client and server is designed. The proposed system consist of a Raspberry Pi which acts as a
client which stores the details of the students in the database by using user login system using web. When the user logs
into the database the data is sent through GPRS to the server machine which maintains the records of the employees and
the attendance is updated in the server database. The GPRS module provides a bidirectional real-time data transfer
between the client and server. This system can be implemented to any real time application so as to retrieve information
from a data source of the client system and send a file to the remote server through GPRS. The main aim is to avoid the
limitations in Ethernet connection and design a low cost and efficient attendance record system where the data is
transferred in a secure way from the client database and updated in the server database using GPRS technology
ECG Steganography and Hash Function Based Privacy Protection of Patients Medi...IJTET Journal
Data hiding can hide sensitive information into signals for covert communication. Most data hiding
techniques will distort the signal in order to insert additional messages. The distortion is often small; the irreversibility is
not admissible to some sensitive techniques. Most of the applications, lossless data hiding is desired to extract the
embedded data and the original host signal. The project proposes the enhancement of protection system for secret data
communication through encrypted data concealment in ECG signals of the patient. The proposed encryption technique
used to encrypt the confidential data into unreadable form and not only enhances the safety of secret carrier information by
making the information inaccessible to any intruder having a random method. For that we use twelve square ciphering
techniques. The technique is used make the communication between the sender and the receiver to be authenticated is hash
function. To evaluate the effectiveness of ECG wave at the proposed technique, distortion measurement techniques of two
are used, the percentage residue difference (PWD) and wavelets weighted PRD. Proposed technique provides high security protection for patient data with low distortion is proven in this proposed system.
An Efficient Decoding Algorithm for Concatenated Turbo-Crc CodesIJTET Journal
In this paper, a hybrid turbo decoding algorithm is used, in which the outer code, Cyclic Redundancy Check code is
not used for detection of errors as usual but for error correction and improvement. This algorithm effectively combines the iterative
decoding algorithm with Rate-Compatible Insertion Convolution Turbo Decoding, where the CRC code and the turbo code are
regarded as an integrated whole in the Decoding process. Altogether we propose an effective error detecting method based on
normalized Euclidean distance to compensate for the loss of error detection capability which should have been provided by CRC
code. Simulation results show that with the proposed approach, 0.5-2dB performance gain can be achieved for the code blocks
with short information length
Improved Trans-Z-source Inverter for Automobile ApplicationIJTET Journal
In this paper a new technology is proposed with a replacement of conventional voltage source/current
source inverter with Improved Trans-Z-source inverter in automobile applications. The improved Trans-Z-source
inverter has a high boost inversion capability and continues input current. Also this new inverter can suppress the
resonant current at the startup; this resonant current in the startup may lead the device to permanent damage. In
improved Trans-Z-source inverter a couple inductor is needed, instead of this coupled inductor a transformer is used.
By using a transformer with sufficient turns ratio the size can be reduced. The turn’s ratio of the transformer decides
the input voltage of the inverter. In this paper operating principle, comparison with conventional inverters, working
with automobiles simulation results, THD analysis, Hardware implementation using ATMEGA 328 P are included.
Wind Energy Conversion System Using PMSG with T-Source Three Phase Matrix Con...IJTET Journal
This document presents a wind energy conversion system using a permanent magnet synchronous generator (PMSG) connected to a T-source three-phase matrix converter. The system aims to efficiently harness wind power and deliver it to a load. A PMSG is connected to a three-phase diode rectifier and input capacitors, with the output fed to a T-source network and three-phase matrix converter. The converter can boost output voltage regardless of input voltage and regulate it through shoot-through control. MATLAB/Simulink models are developed and simulations show the converter produces controlled output voltage and current waveforms to power the load efficiently with fewer components than traditional converter topologies.
Optimizing Data Confidentiality using Integrated Multi Query ServicesIJTET Journal
Query services have experienced terribly massive growth within past few years for that reason large usage of services need to balance outsourcing data management to Cloud service providers that provide query services to the client for data owners, therefore data owner needs data confidentiality as well as query privacy to be guaranteed attributable to disloyal behavior of cloud service provider consequently enhancing data confidentiality must not be compromise the query processed performance. It is not significant to provide slow query services as the result of security along with privacy assurance. We propose the random space perturbation data perturbation method to provide secure with kNN(k-nearest-neighbor) range query services for protecting data in the cloud and Frequency Structured R-Tree (FSR-Tree) efficient range query. Our schemes enhance data confidentiality without compromising the FSR-TREE query processing performance that also increases the user experience.
Foliage Measurement Using Image Processing TechniquesIJTET Journal
Automatic detection of fruit and leaf diseases is essential to automatically detect the symptoms of diseases as early as they appear on the growing stage. This system helps to detect the diseases on fruit during farming , right from plan and easily monitoring the diseases of grapes leaf and apple fruit. By using this system we can avoid the economical loss due to various diseases in agriculture production. K-means clustering technique is used for segmentation. The features are extracted from the segmented image and artificial neural network is used for training the image database and classified their performance to the respective disease categories. The experimental results express that what type of disease can be affected in the fruit and leaf .
Harmonic Mitigation Method for the DC-AC Converter in a Single Phase SystemIJTET Journal
This document summarizes a research paper that proposes a harmonic mitigation method for a DC-AC converter without using a low pass filter. Specifically, it suggests using sine wave modulation of the converter along with injection of specific harmonics calculated using Fourier analysis to cancel out existing harmonics. A proportional-resonant integral controller is also used to eliminate any DC offset. Simulation results show the total harmonic distortion is reduced to 11.15% using this approach, avoiding the need for an output filter. The proposed method continuously monitors and mitigates harmonics in the output to improve power quality.
Experimental Investigation of Lateral Pressure on Vertical Formwork Systems u...IJTET Journal
The modeling of pressure distribution of fresh concrete poured in vertical formwork are rather dynamic than complex. Many researchers had worked on the pressure distribution modeling of concrete and formulated empirical relationship factors like formwork height, rate of pour, consistency classes of concrete. However, in the current scenario, most of high rise construction uses self compacting concrete(SCC) which is a special concrete which utilizes not only mineral and chemical admixtures but also varied aggregate proportions and hence modeling pressure distribution of SCC over other concrete in vertical formwork systems is necessitated. This research seeks to bridge the gap between the theoretical formulation of pressure distribution with the actual modeled (scaled) vertical formwork systems. The pressure distribution of SCC in the laboratory will be determined using pressure sensors, modeled and analyzed.
A Five – Level Integrated AC – DC ConverterIJTET Journal
This paper presents the implementation of a new five – level integrated AC – DC converter with high input power factor and reduced input current harmonics complied with IEC1000-3-2 harmonic standards for electrical equipments. The proposed topology is a combination of boost input power factor pre – regulator and five – level DC – DC converter. The single – stage PFC (SSPFC) approach used in this topology is an alternative solution to low – power and cost – effective applications.
A Comprehensive Approach for Multi Biometric Recognition Using Sclera Vein an...IJTET Journal
Sclera and finger print vein fusion is a new biometric approach for uniquely identifying humans. First, Sclera vein is identified and refined using image enhancement techniques. Then Y shape feature extraction algorithm is used to obtain Y shape pattern which are then fused with finger vein pattern. Second, Finger vein pattern is obtained using CCD camera by passing infrared light through the finger. The obtained image is then enhanced. A line shape feature extraction algorithm is used to get line patterns from enhanced finger vein image. Finally Sclera vein image pattern and Finger vein image pattern were combined to get the final fused image. The image thus obtained can be used to uniquely identify a person. The proposed multimodal system will produce accurate results as it combines two main traits of an individual. Therefore, it can be used in human identification and authentication systems.
Study of Eccentrically Braced Outrigger Frame under Seismic ExitationIJTET Journal
Outrigger braced structures has efficient structural form consist of a central core, comprising braced frames with
horizontal cantilever ”outrigger” trusses or girders connecting the core to the outer column. When the structure is loaded
horizontally, vertical plane rotation of the core is restrained by the outriggers through tension in windward column and
compression in leeward column. The effective structural depth of the building is greatly increased, thus augmenting the lateral
stiffness of the building and reducing the lateral deflections and moments in core. In effect, the outriggers join the columns to the
core to make the structure behave as a partly composite cantilever. By providing eccentrically braced system in outrigger frame by
varying the size of links and analyzing it. Push over analysis is carried out by varying the link size using computer programs, Sap
2007 to understand their seismic performance. The ductile behavior of eccentrically braced frame is highly desirable for structures
subjected to strong ground motion. Maximum stiffness, strength, ductility and energy dissipation capacity are provided by
eccentrically braced frame. Studies were conducted on the use of outrigger frame for the high steel building subjected to
earthquake load. Braces are designed not to buckle, regardless of the severity of lateral loading on the frame. Thus eccentrically
braced frame ensures safety against collapse.
Enhanced Hashing Approach For Image Forgery Detection With Feature Level FusionIJTET Journal
Image forgery detection and its accuracy are addressed in the proposed work. The image authentication process aims at finding the originality of an image. Due to the advent of many image editing software image tampering has become common. The Enhanced hashing approach is suggested for image authentication. The concept of Hashing has been used for searching images from large databases. It can also be applied to image authentication as it produces different results with respect to the change in image. But the hashing methods used for similarity searches cannot be used for image authentication since they are no sensitive for small changes. Moreover, we need a system that detects only perceptual changes. A new hashing method, namely, enhanced robust hashing is proposed for image authentication, which uses global and local properties of an image. This method is developed for detecting image forgery, including removal, insertion, and replacement of objects, and abnormal color modification, and for locating the forged area. The local models include position and texture information of object regions in the image. The hash mechanism uses secret keys for encryption and decryption. IP tracing is done to track the suspicious nodes.
Cascaded H-BRIDGE Converter for Domestic ApplicationsIJTET Journal
1) The document presents a five-level cascaded H-bridge multilevel inverter that uses separate DC sources from solar panels for each level.
2) The inverter is simulated using MATLAB and produces a five-level stepped voltage waveform as the output.
3) The cascaded H-bridge topology has advantages of modular structure, low component count per level, and potential for soft switching. It can be used for applications such as UPS, battery charging, and electric vehicles.
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
Leveraging Generative AI to Drive Nonprofit InnovationTechSoup
In this webinar, participants learned how to utilize Generative AI to streamline operations and elevate member engagement. Amazon Web Service experts provided a customer specific use cases and dived into low/no-code tools that are quick and easy to deploy through Amazon Web Service (AWS.)
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
Chapter wise All Notes of First year Basic Civil Engineering.pptxDenish Jangid
Chapter wise All Notes of First year Basic Civil Engineering
Syllabus
Chapter-1
Introduction to objective, scope and outcome the subject
Chapter 2
Introduction: Scope and Specialization of Civil Engineering, Role of civil Engineer in Society, Impact of infrastructural development on economy of country.
Chapter 3
Surveying: Object Principles & Types of Surveying; Site Plans, Plans & Maps; Scales & Unit of different Measurements.
Linear Measurements: Instruments used. Linear Measurement by Tape, Ranging out Survey Lines and overcoming Obstructions; Measurements on sloping ground; Tape corrections, conventional symbols. Angular Measurements: Instruments used; Introduction to Compass Surveying, Bearings and Longitude & Latitude of a Line, Introduction to total station.
Levelling: Instrument used Object of levelling, Methods of levelling in brief, and Contour maps.
Chapter 4
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of buildings, Plinth area, carpet area, floor space index, Introduction to building byelaws, concept of sun light & ventilation. Components of Buildings & their functions, Basic concept of R.C.C., Introduction to types of foundation
Chapter 5
Transportation: Introduction to Transportation Engineering; Traffic and Road Safety: Types and Characteristics of Various Modes of Transportation; Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.
Chapter 6
Environmental Engineering: Environmental Pollution, Environmental Acts and Regulations, Functional Concepts of Ecology, Basics of Species, Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon, Nitrogen & Phosphorus; Energy Flow in Ecosystems.
Water Pollution: Water Quality standards, Introduction to Treatment & Disposal of Waste Water. Reuse and Saving of Water, Rain Water Harvesting. Solid Waste Management: Classification of Solid Waste, Collection, Transportation and Disposal of Solid. Recycling of Solid Waste: Energy Recovery, Sanitary Landfill, On-Site Sanitation. Air & Noise Pollution: Primary and Secondary air pollutants, Harmful effects of Air Pollution, Control of Air Pollution. . Noise Pollution Harmful Effects of noise pollution, control of noise pollution, Global warming & Climate Change, Ozone depletion, Greenhouse effect
Text Books:
1. Palancharmy, Basic Civil Engineering, McGraw Hill publishers.
2. Satheesh Gopi, Basic Civil Engineering, Pearson Publishers.
3. Ketki Rangwala Dalal, Essentials of Civil Engineering, Charotar Publishing House.
4. BCP, Surveying volume 1
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) CurriculumMJDuyan
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
Beyond Degrees - Empowering the Workforce in the Context of Skills-First.pptxEduSkills OECD
Iván Bornacelly, Policy Analyst at the OECD Centre for Skills, OECD, presents at the webinar 'Tackling job market gaps with a skills-first approach' on 12 June 2024
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UPRAHUL
This Dissertation explores the particular circumstances of Mirzapur, a region located in the
core of India. Mirzapur, with its varied terrains and abundant biodiversity, offers an optimal
environment for investigating the changes in vegetation cover dynamics. Our study utilizes
advanced technologies such as GIS (Geographic Information Systems) and Remote sensing to
analyze the transformations that have taken place over the course of a decade.
The complex relationship between human activities and the environment has been the focus
of extensive research and worry. As the global community grapples with swift urbanization,
population expansion, and economic progress, the effects on natural ecosystems are becoming
more evident. A crucial element of this impact is the alteration of vegetation cover, which plays a
significant role in maintaining the ecological equilibrium of our planet.Land serves as the foundation for all human activities and provides the necessary materials for
these activities. As the most crucial natural resource, its utilization by humans results in different
'Land uses,' which are determined by both human activities and the physical characteristics of the
land.
The utilization of land is impacted by human needs and environmental factors. In countries
like India, rapid population growth and the emphasis on extensive resource exploitation can lead
to significant land degradation, adversely affecting the region's land cover.
Therefore, human intervention has significantly influenced land use patterns over many
centuries, evolving its structure over time and space. In the present era, these changes have
accelerated due to factors such as agriculture and urbanization. Information regarding land use and
cover is essential for various planning and management tasks related to the Earth's surface,
providing crucial environmental data for scientific, resource management, policy purposes, and
diverse human activities.
Accurate understanding of land use and cover is imperative for the development planning
of any area. Consequently, a wide range of professionals, including earth system scientists, land
and water managers, and urban planners, are interested in obtaining data on land use and cover
changes, conversion trends, and other related patterns. The spatial dimensions of land use and
cover support policymakers and scientists in making well-informed decisions, as alterations in
these patterns indicate shifts in economic and social conditions. Monitoring such changes with the
help of Advanced technologies like Remote Sensing and Geographic Information Systems is
crucial for coordinated efforts across different administrative levels. Advanced technologies like
Remote Sensing and Geographic Information Systems
9
Changes in vegetation cover refer to variations in the distribution, composition, and overall
structure of plant communities across different temporal and spatial scales. These changes can
occur natural.
LAND USE LAND COVER AND NDVI OF MIRZAPUR DISTRICT, UP
Improve a Network Life Time by Least Troublesome Topology Repair Algorithm in WSAN
1. INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY
VOLUME 5 ISSUE 2 – MAY 2015 - ISSN: 2349 - 9303
1
Improve a Network Life Time by Least Troublesome
Topology Repair Algorithm in WSAN
R. Ananthakumar1
1
PG scholar,1
Kalasalingam Institute of Technology,
Dept of CSE
ananthk860@gmail.com
R.Sankar2
2
Assistant Professor, 2
Kalasalingam Institute of Technology,
Dept of CSE
sankarwt@gmail.com
Abstract— In wireless sensor network, node reform and restoration is an active area for research. Each sensor node fails
either when some critical event occurs at the node or when the battery of the node is completely drained. The Wireless
sensor actor network (WSAN) is an enhances the wireless sensor networks by providing more power and recovering a
energy consumption. In the WSAN, sensors sense the environment and sent back their data to an actor node. Actors have
to coordinate their operations, keep up a firmly associated system topology at all times and achieve the predefined
application mission. The Defect Node Reformation Algorithm (DNR) reform a defect node using genetic and the grade
diffusion algorithms. A category of solutions for this problem is Least Troublesome Topology Repair Algorithm (LTTR).
LTTR is a limited and circulated calculation that influences existing course revelation exercises in the system. LTTR
algorithm is used to minimize the power consumption and reform a transmission path. Our results show that achieves
performance in terms of packet delivery ratio, packet loss ratio and end to end latency suitable for real network
deployments.
Index Terms— Defect Node Reformation (DNR), Least Troublesome Topology Repair (LTTR), Wireless Sensor
Network (WSN), Wireless Sensor Actor Network (WSAN)
—————————— ——————————
1 INTRODUCTION
Wireless sensor and actor networks (WSAN) consists of a group
of sensors and actors linked by a wireless medium to perform
distributed sensing and actuation tasks. In this network, sensors
gather information about the environment, then actors take decisions
and then takes appropriate actions departs the environment. This
network is communicating the environment using remote and
automated an interaction with the environment.
The Wireless sensor actor network consists of two types of node.
The nodes are actor and sensor. An actor node collects the data from
the environment and takes the actions according to the environment.
An actor node covers the some region of the network. The Sensor
node senses the particular environment and sent back to the data to
actor. The Sensor node is totally controlled by an actor node.
In WSANs, the roles of sensor and an actor node are to collect data
from the environment and perform appropriate actions based on this
collected data, respectively. Thus, as shown in Fig. 1.1 these node
are scattered in the sensor/actor field. In these figures constructs the
parts are sink, task manager, sensor and actor. The sink which
monitors the overall network and communicates with the task
manager node and sensor/actor node, if necessary, is separated from
the sensor/actor field. After sensors in the sensor/actor field, detect
the actions, they either sent their readings to an actor nodes, which
can process all incoming data and initiate suitable actions, or route
data back to the destination which issues action commands to actors.
The Wireless sensor actor network is based on the node
coordination. The node coordination Fig 1.2. is classified into the
three types. The node coordination types are sensor to sensor, sensor
to actor and actor to actor coordination. The Sensor to Sensor
coordination is basically an interaction between the two sensor
node. The source sensor sent the data to destination sensors and then
destination sensors sent back to the data to particular an actor node
based on sensor to actor coordination. The Sensor to Actor
coordination is basically interaction between the sensor and an actor
node,
• Which sensors communicate with which actors,
• How the transmission happens, and
• What are the requirements of this communication.
Fig 1.1 The Physical Architecture of Wireless Sensor Actor
Network
An actor node is controlled the number of sensor node and
responding based on the sensor node. An actor node is used to
restore the connectivity and response to an actor nodes, which is
based on actor to actor coordination. In Actor to actor coordination
communicating between the actor to actor node. Actor to Actor
coordination based on the communication can occur in the
following situation
• The actor recollects the sensing data from the environment
due to small range or insufficient energy.
2. INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY
VOLUME 5 ISSUE 2 – MAY 2015 - ISSN: 2349 - 9303
2
• If multiple actors receive the same information, these
actors should ‗‗talk‘‘ to each other so as to decide which one of
them performs the action.
• In case of multiple events occurring simultaneously, task
allocation can be done via actor to actor coordination.
• After an actor node receive event information, if the event
is spreading to other actors‘ acting areas, an actor node can transmit
the sensor data or action command to the particular actors. By this
way, there will be no need for sensor in those areas to send
information to their nearby actors.
• Which will considerably increase the network lifetime?
Moreover, this situation provides the action to be initiated much
earlier.
The property of the Wireless sensor Actor systems is,
• The sensor hubs are little, modest gadgets with restricted
sensing, processing and remote correspondence abilities, performers
are normally asset rich gadgets furnished with better transforming
capacities, stronger transmission forces and more battery life.
• In WSANs, contingent upon the application, there may be
a need to quickly react to sensor data. Also, to give right activities,
sensor information must even now be substantial at the time of
acting. Subsequently, the issue of ongoing correspondence is vital in
WSANs since activities are performed on nature in the wake of
sensing happens.
• The number of sensor hubs conveyed in considering a
marvel may be in the request of hundreds or thousands. In any case,
such a thick organization is redundant for performer hubs because
of the distinctive scope prerequisites and physical communication
routines for acting assignment. Thus, WSANs the quantity of on-
screen characters is much lower than the quantity of sensor.
• In request to give powerful sensing and acting, a conveyed
nearby coordination instrument is important between sensor and
actors.
Fig 1.2 Wireless Sensor Actor Network Coordination
2 RELATED WORKS
In the Wireless Sensor Actor Network, the number of strategies has
recently restored network connectivity. All of the strategies have
focused on reconstructing the networks without extending the
network topology. The several strategies are described in the below
techniques.
A. Recovery Through Node Repositioning
The main idea of this category of recovery schemes is to reposition
some of the strength node in the network to reestablish strong
connectivity. LTTR fits in this category. Published approaches
differ in the level of involvement expected from the strength node,
in the required network state that needs to be constructed, and in the
goal of the reforming purpose. For example, both Distributed Actor
Recovery Algorithm (DARA) [5] and PArtition Detection and
Recovery Algorithm (PADRA) [8] require every node to maintain a
list of their two-hop neighbor and determine the scope of the
recovery by checking whether the failed node is a cut vertex. When
a node fails, the best node used for replacement is selected from its
one hop neighbor. The node having lowest degree and least distant
from the failed node is selected. Any child node disconnected
during this process is recovered by the recursive relocation
procedure. Thus the shortest path between the node is not
maintained. DARA pursues a probabilistic scheme to identify cut
vertices.
A good candidate (GC) is selected from the one-hop neighbor of the
dead actor as a recovery initiator and to replace the defect node.
This selection criterion is based on the least node degree and
physical proximity to the defect node. The rearranging procedure is
circular applied to handle any disconnected children. In other words,
cascaded movement is used to sustain network connection. The
another algorithm of PADRA identifies a connected dominating set
to determine a dominate node. The dominate does not directly move
to the location of the failed node instead, a cascaded motion is
pursued to share the burden. In [6], the focus is also on recovering
from the failure of a cut vertex. Only a special case is considered
where the failures cause the network to split into two disjoint
blocks. To relink these blocks, the closest node is moved toward
each other. The other node in the blocks follows in a cascaded
manner. None of these approaches care for the path length between
node. While LTTR also employs cascaded relocation, the criteria for
selecting the leader node and other participants are different.
B. Recovery By Placement of Relay Node
The prior calculations mean to restore the system integration by
productively moving a portion of the current hubs. Notwithstanding,
at a few setups, it is not doable to move the neighbor of the fizzled
hub because of physical, logistical, and scope imperatives.
Accordingly, a few plans make integration among the disjoint
system fragments by putting new hubs. The distributed plans for the
most part contrast in the necessities of the recently structured
topology. Case in point, Spiderweb [9] and Dispersed calculation
for Improved Hand-off hub situation utilizing Least Steiner tree
(Residences) [7] select to restore the system integration as well as
accomplish a certain quality in the framed topology. Fundamentally,
both plans attempt to keep away from the presentation of cut
vertices with the goal that some level of strength, i.e., burden
adjusting and high hub degree, is presented in the repaired system
topology. Spiderweb also strives to minimize the required number
of relays. The Spiderweb deploy relays inwards toward the center of
the deployment area. The former considers the segments situated at
the perimeter and establishes a topology that resembles a spider
web. Meanwhile, it initially forms a star topology with all segments
connected through a relay placed at the center of the area. Then,
adjacent branches are further optimized by forming a Steiner tree
for connecting two segments and the center node to reduce the
required relay count.
Meanwhile, in [10], intersegment connectivity ought to maintain
some level of quality of service (QoS) while placing the least
number of relay node. The proposed approach initially models the
3. INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY
VOLUME 5 ISSUE 2 – MAY 2015 - ISSN: 2349 - 9303
3
deployed area as a grid with equal-sized cells. Each cell is assessed
based on the uncommitted capacity of the relay node residing in the
cell. Finally, meet the QoS requirement, the optimization is done by
finding the cell-based least cost paths and populating node along
these paths. On the other hand, form a biconnected intersegment
topology [13] by placing redundant node so that the failure of a
node can be tolerated and the network operations continues without
interruption. The connectivity restoration [14] as a node placement
problem on a grid and reposition the deployed node meet varying
requirements on the intersegment traffic. As mentioned earlier,
LTTR is reactive schemes that restore connectivity while imposing
the least travel overhead and in a distributed manner.
C. Topology Management
Topology management [11] issues are very important in the context
of wireless networks such as sensor networks. Topology
management is to ensure that the various network connectivity
parameters are managed so as to ensure that the parameter values
are within certain bounds. Each sensor node in a sensor network to
have only a pre-defined number of neighbor. This can be a
requirement of a higher sensor information processing application in
order to make sure that the sensor are distributed evenly over a
region. Topology management has been addressed from various
perspectives such as energy conservation in a wireless sensor actor
network. Topology based protocols use the principle that every node
in a network maintains topology information and that the main
process of protocol operations was based on the topology of the
network.
D. Fault Tolerant Management Routing Protocol
Fault Tolerant Management Routing Protocol [12] propose a
solution to fault management for Wireless sensor networks because
of their own limitations and the scalability issue. By introducing
new network equipments, one can improve the traditional
distributed hierarchical management structure, the equipment can
quickly locate the failure and analyze the cause of the failure,
therefore can greatly improve the efficiency of network
maintenance. We also propose a new low-energy fault management
protocol, which can quickly respond to failures. The experimental
results show that compared with traditional protocols, this protocol
can detect failure, responds quickly to failures and recover from
failure at minimal costs, therefore reduce the impact of failure on
networks. In these techniques, we analyze the cause of failure and
take the action based on the particular failure using low energy and
minimal costs and does not provide the efficiency of network
maintenance.
3 EXISTING SYSTEM
The Defect Node Reformation (DNR) algorithm [1] for WSNs
based on the grade diffusion (GD) algorithm and the genetic
algorithm (GA). The Grade Diffusion algorithms create a routing
for each sensor node. It is also identifies a set of neighbor node to
reduce the transmission loading. It can record the some information
regarding data relay and updates the routing path. This algorithm
creates the node information, node identifier, neighbor node for
each sensor node using the grade diffusion algorithms. The Grade
Diffusion algorithms are used to create the routing table and reform
the defect node using genetic algorithm. The Genetic algorithm is
based on the reform the defect node. The genetic algorithm is based
on the gene values. The genetic algorithm is classified into several
types.
Initialization has generated the chromosomes. The gene value is
based on zero or one. Each chromosome is a combination of the two
solutions. The chromosome length is based on the number of
depletion or nonfunctioning node. Evaluation is based on the fitness
values. The fitness value is calculated based on the fitness function.
The node is reformed using the fitness function. The fitness value is
used to reuse the routing paths. The Selection is based on the fitness
function. The Selection step removes a chromosome, which
chromosome has a low fitness value. Select two chromosomes from
a node according to their fitness .Keep the half of the chromosomes
with better fitness values. The worse chromosomes will be deleted.
Crossover is the similar to natural reproduction. Crossover
combines genetic material from two folks, with a specific end goal
to deliver predominant posterity. The Crossover is based on the
reform the single node at a time. Mutation introduces traits not
found in the original individuals. Flip a gene randomly in the
chromosome. Mutation is performed on a small part of the
population, keeping in mind the end goal to abstain from entering
the unsteady state.
E. Drawbacks
The drawbacks of the Defect Node Reformation algorithm is,
• It does not focus of multiple node failure.
• Node reformation time is high.
• Sensing area is small.
• It does not concentrate the topology management.
4 PROPOSED SYSTEM
Least Troublesome Topology Repair algorithm is localized and
distributed algorithm which restore network connectivity with
minimum number of node movements. This algorithm is a
decentralized algorithm. Each node coordinates with all the node.
Each node and routing information will store the routing table. Each
node aware the information of neighboring node with the help of
routing tables. The node recovery is based on the actor node and
sensor node. If the Sensor node failed in the network, the particular
sensor node reformed using another sensor or actor node. The
above operations is totally controlled by an actor node; otherwise
the actor node will fails, then reform an actor node using the
reconstruct the topology and restore the connectivity.
A. Modules Description
The Least Troublesome Topology Repair algorithm is classified into
several modules. The modules are briefly explained about the
proposed concepts. The modules are based on the creation of sensor
and an actor node. The sensor node has a low cost compared with an
actor node. An Actor node has a high power compared with the
sensor. The name of the modules is,
a. Topology Formation
b. Failure Detection
c. Identifying the smallest block
d. Replacing the failure node
e. Children Movement
a. Topology Formation
The topology formed between the sensor and actors node. The
Sensor nodes, which is used to screen the environment and send the
data to actors. Actors are more power devices which are capable of
responding, moving the actions. The network constructs the routing
table. The routing table carries the information such as node
4. INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY
VOLUME 5 ISSUE 2 – MAY 2015 - ISSN: 2349 - 9303
4
identifier, neighbor node and node position. The node position
identified from the routing table.
b. Failure Detection
The node screens the environment and when the node captures any
information from the environment then the particular node store the
information. Before the node transmits information to their one hop
distant neighbor periodically we should identify a set of paths to
reach the sink node. The source node selects one of the best paths
among the selecting paths. Then the source node sent the heart beat
messages to intermediate and sink node. The purposes of heartbeat
message checks the node energy of the particular intermediate and
sink node. The source node receive the response from the node and
then split the node based on the energy. If the node has high energy
then check the node availability; otherwise the node has low energy
then check the particular node failed or not.
The node availability checks the node status, such as busy or
available. If the node status is available then forward the data;
otherwise wait for some time and then forward the data when the
node status is available. If the particular node failed is conformed
then the data forward through the other alternative paths. The source
node finds if the failed node is critical or not in the network. If the
failed node is not critical, the actor can reform the node. Otherwise,
if the node is critical, it can reform the node based on the inter node
and actor connectivity. The node is critical in the sense it is a parent
node of the some sensor node.
c. Identifying the Smallest Block
After identifying the failed node, the smallest block must be
identified. The smallest block is the block which selects the number
of neighbor node of failed nodes. This block also selects the one hop
distant neighbor when the neighbor node has high children. The
failed node should replace among the selected node using the best
candidate.
d. Replacing the Failure Node
The selection of the best candidate is based on the least number of
node. The Selection of the best candidate is a one of the neighbor
node and one hop neighbor of failed nodes. Then, the failed node
location move into the best candidate location.
e. Children Movement
The node that are at two hops distance from the faulty node are
called children and those at a distance of three hops are called
grandchildren. Once the child knows that its parent is moving to a
new location, it tells its one hop neighbor that is grandchildren and
follows the path of its parent. If a child has two parent node that are
transposed, it rearranges to a position to maintain its connection
with both the parent node.
B. Flow Diagram
The flow diagram of Least Troublesome Topology Repair algorithm
generates originating information from the starting node of the
network. When the node gathers some information from the
environment and stores the information itself. The node should
construct the routing table. The node keeps the information such as
node identifier, neighbor node and node position. The node selects
the shortest path among the selected path in the network.
The particular node transmits the data before check the whether the
intermediate and sink node are good or bad determined using
heartbeat messages. If the source node receives the response then
forwards the data; otherwise the node would not receive the
response then assumed that the particular node has a low energy. If
the node has high energy, then check the system availability. If the
node status has available then forward the data; otherwise the node
has any busy status, then waits some time and then starts the
operations when the node is available status.
After finding the node failed, check whether the node is critical is
not. If the node is not critical then the failed node reformed using an
actor node and move to the neighbor node using least hop distance
with the help of routing tables. The node is critical whether the node
is an actor node or sensor node. If the sensor node is failed select the
best candidate among the smallest block. The smallest block is the
block finds the neighbor node of the failed node.
The best candidate is the one of the neighbor node. The best
candidate selection based on the least hops itself. The failed node
moves to the best candidate position which node has a least hop and
finds the new position. The failed node moved to the new position
and then sent the messages to children node itself. The children
node are move to the new position then broadcast the message to the
network. If the failed node is an actor node is based on the
reestablish the network connection. Then follows the above
procedure to recovers the particular an actor node and broadcast the
messages to the network.
Fig 4.1 Flow Diagram of Least Troublesome Topology Repair
Algorithm
C. Pseudocode
The pseudocode Fig 4.2 of this algorithm when the node is starting
the network operations and constructs the routing table. If the node J
detects a failed of the node F then check whether the node is critical
or not. If the node F is critical not, then moving to the neighbor
node position which node has the least distance and move to the
5. INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY
VOLUME 5 ISSUE 2 – MAY 2015 - ISSN: 2349 - 9303
5
particular node position; otherwise the node F is first critical selects
the smallest block. This block is selects the best candidate of node F
among the one of the neighbor node of the failed node F. The node J
has least hops compared with the neighbor node of F, then node F
move to the new position of node J. If the node F recovered by node
J, then the node J broadcast the message to the network.
After detecting the failed node F, then the node F reaches the sink
via the number of reachable node is zero. Then the node F compared
with the number of reachable node and the smallest block size. If
the smallest block size is greater than compared with the number of
reachable nodes then smallest block is assigned to the number of
reachable node. The smallest block size consists of number of
neighbor node of node F. The node F can recover by anyone
neighbor node of the network and then node F move to the
computing any new neighboring position.
The node J receive some notification message from node F, and
then forwards the data via node F. After that the node F is one of the
children of node J. Before the node F reformed, transmits the
message to the node F children. The node F has anyone children the
node F finds the best candidate using the smallest block size. The
smallest block size is found the number of neighbor node in the
network. If the node J is least hopped, then node F move to the new
position of node F; otherwise the node F finds another best
candidate of node F neighbor. Then the node F moves to the
particular recovering node position.
Fig 4.2 Pseudocode for LTTR algorithm
5 SIMULATION RESULTS
The simulation result consists of several results based on the
modules description. In Fig 5.1, the node 7 capturing the
information from the environment. Then the source node 7 selects
the best path to reach the destination. The node 7 check the node
energy by sent the heartbeat messages to intermediate and sink
node. In Fig 5.2, the node 7 checking the node energy. The failed
node is based on which node has low energy among the
intermediate and sink node. The node 15 has low energy and then
node 15 checking the node is critical or not. In Fig 5.3, after
detecting the failed node, the failed node select the best candidate.
The best candidate in the sense which node has a low hops
compared with other neighbors. The node 15 is critical in the sense
recovering a node 15 by using a node 16. In Fig 5.4, check the node
is available or not. The source, intermediate and sink nodes are
available and then forward the data. In these results, recovering the
multiple node failures and reduces the data losses.
Fig 5.1 Checking the Node Energy
Fig 5.2 Detection of Failure Node
6. INTERNATIONAL JOURNAL FOR TRENDS IN ENGINEERING & TECHNOLOGY
VOLUME 5 ISSUE 2 – MAY 2015 - ISSN: 2349 - 9303
6
Fig 5.3 Recovering a Failed Node
Fig 5.4 Checking the Node Status
6 CONCLUSION AND FUTURE ENHANCEMENT
Least Troublesome Topology Repair algorithm is used to
reconstructing the network connectivity without extending the
number of routing paths. LTTR also works very well in dense
networks and yields close to optimal performance even when node
is partially aware of the network topology. By using this algorithm
recover from multi node failures at a time; recover the transmission
and routing path at a time. Considering such a problem with gather
node failure is more complex and challenging with nature. In the
future enhancement, we plan to scrutinize this issue. Our future plan
also includes factoring in coverage and ongoing application tasks
with the recovery process, focusing on the security and developing a
test bed for evaluating the various failure recovery schemes.
REFERENCES
[1] Hong-Chi Shih, Jiun-Huei Ho, Bin-Yih Liao, and Jeng-Shyang
Pan, ―Fault Node Recovery Algorithm in WSN‖ IEEE SENSORS
JOURNAL, VOL. 13, NO. 7, JULY 2013.
[2] T. H. Liu, S. C. Yi, and X. W. Wang, ―A Fault Management
Protocol for Low-Energy and Efficient Wireless Sensor
Networks,‖ Journal of Information Hiding and Multimedia Signal
Processing, vol. 4, No. 1, pp. 34-45, 2013
[3] F. Akyildiz and I. H. Kasimoglu, Oct. 2004, ―Wireless sensor and
actor networks: Research challenges,‖ Ad Hoc Netw. J.,vol. 2, no.
4, pp. 351–367.
[4] A.Abbasi, M. Younis, and K. Akkaya, Sep. 2009, Movement-
assisted connectivity restoration in wireless sensor and actor
networks,‖ IEEE Trans. Parallel Distrib. Syst., vol. 20, no. 9, pp.
1366–1379.
[5] K. Akkaya, A. Thimmapuram, F. Senel, and S. Uludag, Mar. 2008
―Distributed recovery of actor failures in wireless sensor and actor
networks,‖ in Proc.IEEE WCNC, Las Vegas, NV, pp. 2480–2485.
[6] M. F. Younis, Sookyoung Lee, and Ameer Ahmed Abbasi, Dec.
2010, ―A Localized algorithms for restoring inter node
connectivity in networks of movable sensor,‖ IEEE Trans. On
computers, vol. 59, no. 12.
[7] K. Akkaya, F. Senel, A. Thimmapuram, and S. Uludag, Feb. 2010,
―Distributed recovery from network partitioning in movable
sensor/actor networks via controlled mobility,‖ IEEE Trans.
Comput., vol. 59, no. 2, pp. 258–271.
[8] F. Senel, M. Younis, and K. Akkaya, May 2011, ―Bio-inspired
relay node placement heuristics for repairing damaged wireless
sensor networks,‖ IEEE Trans. Veh. Technol., vol. 60, no. 4, pp.
1835–1848.
[9] S. Lee and M. Younis, Jun. 2009, ―QoS-aware relay node
placement in a segmented wireless sensor network,‖ in Proc. IEEE
ICC, Dresden, Germany, pp. 1–5.
[10] Nikolaos A. Pantaziz, Stefanos A. Nikolodakis and Dimitrios D.
Vergados, Jun.2010, ―Topology Management wireless sensor
network, ‖IEEE Communications survey Vol. 15 no. 2.
[11] T. H. Liu, S. C. Yi, and X. W. Wang, ―A fault management
protocol for low-energy and efficient wireless sensor networks,‖ J.
Inf. Hiding Multimedia Signal Process., vol. 4, no. 1, pp. 34–45,
2013
[12] W. Zhang, G. Xue, and S. Misra, ―Fault-tolerant relay node
placement in wireless sensor networks: Problems and algorithms,‖
in Proc. 26th Annu.Joint Conf. INFOCOM, Anchorage, AK, May
2007, pp. 1649–s1657.
[13] F. Al-Turjman, H. Hassanein, and M. Ibnkahla, ―Optimized node
repositioning to federate wireless sensor networks in
environmental applications,‖in Proc. IEEE Int. GLOBECOM,
Houston, TX, Dec. 2011, pp. 1–5.
[14] S. Lee and M. Younis, ―Recovery from multiple simultaneous
failures in wireless sensor networks using minimum Steiner tree,‖
J. Parallel Distrib.Comput., vol. 70, no. 5, pp. 525–536, May 2010.