This document summarizes key routing protocols proposed for network structure in wireless sensor networks (WSNs). It classifies routing protocols into three categories: flat-based, hierarchical-based, and location-based routing. Flat-based routing treats all nodes equally, while hierarchical-based routing uses cluster heads to reduce energy consumption. Location-based routing exploits node positions. Key protocols discussed include SPIN, directed diffusion, LEACH, PEGASIS, and SOP. The document provides an overview of how each protocol operates and its advantages.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document analyzes and compares the performance of two routing protocols for wireless sensor networks: LEACH and SPIN. LEACH is a hierarchical clustering protocol that randomly selects cluster heads to aggregate and transmit data to the base station. SPIN is a data-centric protocol that uses data negotiation to disseminate data and avoid redundant transmissions. The document simulates both protocols and finds that SPIN has lower overall energy consumption than LEACH due to its negotiation-based approach. Key differences between the protocols include LEACH using clusters and SPIN being flat, with SPIN allowing for possible node mobility and multipath transmission.
Iaetsd a survey on geographic routing relay selection inIaetsd Iaetsd
The document summarizes research on geographic routing and relay selection in wireless sensor networks. It discusses how geographic routing uses location information to route packets towards a destination but faces challenges around connectivity holes and optimal relay selection. The document reviews several existing approaches and their limitations. It then describes an alternative method called ALBA-R that was proposed to more efficiently route around holes while enhancing relay selection to maximize node lifetime. Simulation results showed ALBA-R outperformed other methods with respect to metrics like overhead and end-to-end delay.
The document proposes an improved data routing protocol for wireless sensor networks. It aims to address deficiencies in existing chain-based routing protocols like Chiron and PEGASIS that can cause longer transmission delays and redundant paths. The key aspects of the proposed protocol are:
1) The sensing area is divided into fan-shaped groups using beamforming from the base station, instead of concentric clusters. Shorter chains are formed within each group for data transmission.
2) The node with maximum residual energy in each chain is elected as the chain leader, rather than taking turns, to aggregate and transmit data to the base station.
3) Transmission between chain leaders is optimized to avoid longer distances and redundant paths.
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
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
Routing techniques in wireless sensor networks a surveyAmandeep Sohal
This document provides an overview of routing techniques in wireless sensor networks. It discusses the key challenges in wireless sensor network routing due to constraints such as limited energy, bandwidth and processing resources. It classifies routing protocols into three categories based on network structure - flat, hierarchical and location-based routing. It also categorizes routing protocols based on their operation such as multipath, query-based, negotiation-based and QoS-based routing. The document concludes by highlighting various routing paradigms and identifying possible areas for future research.
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.
IJCER (www.ijceronline.com) International Journal of computational Engineerin...ijceronline
The document analyzes and compares the performance of two routing protocols for wireless sensor networks: LEACH and SPIN. LEACH is a hierarchical clustering protocol that randomly selects cluster heads to aggregate and transmit data to the base station. SPIN is a data-centric protocol that uses data negotiation to disseminate data and avoid redundant transmissions. The document simulates both protocols and finds that SPIN has lower overall energy consumption than LEACH due to its negotiation-based approach. Key differences between the protocols include LEACH using clusters and SPIN being flat, with SPIN allowing for possible node mobility and multipath transmission.
Iaetsd a survey on geographic routing relay selection inIaetsd Iaetsd
The document summarizes research on geographic routing and relay selection in wireless sensor networks. It discusses how geographic routing uses location information to route packets towards a destination but faces challenges around connectivity holes and optimal relay selection. The document reviews several existing approaches and their limitations. It then describes an alternative method called ALBA-R that was proposed to more efficiently route around holes while enhancing relay selection to maximize node lifetime. Simulation results showed ALBA-R outperformed other methods with respect to metrics like overhead and end-to-end delay.
The document proposes an improved data routing protocol for wireless sensor networks. It aims to address deficiencies in existing chain-based routing protocols like Chiron and PEGASIS that can cause longer transmission delays and redundant paths. The key aspects of the proposed protocol are:
1) The sensing area is divided into fan-shaped groups using beamforming from the base station, instead of concentric clusters. Shorter chains are formed within each group for data transmission.
2) The node with maximum residual energy in each chain is elected as the chain leader, rather than taking turns, to aggregate and transmit data to the base station.
3) Transmission between chain leaders is optimized to avoid longer distances and redundant paths.
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
LOAD BALANCING AND PROVIDING SECURITY USING RSA IN WIRELESS SENSOR NETWORKSIJARIIT
This paper presents load balancing and provides security using RSA algorithm. This is brief introduction to handle the traffic on node. This represents the converge-casting protocol in wireless sensor networks. The protocol is localized and distributed, and adapts efficiently to vary traffic. Graphs are analyzed using NS-2 simulator, here end-to-end packet latency, packet delivery ratio, throughput are analyzed. This is done for 30 nodes in NS-2 simulation.
Routing protocols for wireless sensor networks face several unique challenges compared to other wireless networks. This document discusses routing challenges in wireless sensor networks and provides an overview of different routing protocol approaches, including flat routing, hierarchical routing, location-based routing, and QoS-based routing. It specifically describes two flat routing protocols: directed diffusion, which uses data negotiation and aggregation to reduce energy costs, and SPIN, which employs data description messages to avoid redundant transmissions through negotiation between sensor nodes.
Routing techniques in wireless sensor networks a surveyAmandeep Sohal
This document provides an overview of routing techniques in wireless sensor networks. It discusses the key challenges in wireless sensor network routing due to constraints such as limited energy, bandwidth and processing resources. It classifies routing protocols into three categories based on network structure - flat, hierarchical and location-based routing. It also categorizes routing protocols based on their operation such as multipath, query-based, negotiation-based and QoS-based routing. The document concludes by highlighting various routing paradigms and identifying possible areas for future research.
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.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
This document summarizes a research paper that proposes a new routing protocol called U-LEACH for wireless sensor networks. U-LEACH aims to prolong the lifetime of sensor networks by uniformly distributing cluster head selection throughout the network, unlike the original LEACH protocol. It describes how LEACH works and its limitations in ensuring uniform cluster head distribution. The proposed U-LEACH protocol incorporates a Uniform Distribution Technique to select cluster heads in a way that ensures each sensor node is within transmission range of a cluster head, extending the overall network lifetime.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
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.
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...Yayah Zakaria
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the
problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
M.E Computer Science Wireless Communication ProjectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.E Computer Science students.
The document discusses wireless sensor networks and energy-efficient routing. It introduces WSNs and outlines their typical energy consumption from transmission, reception, and sensing. It describes deterministic and random deployment strategies and their impact on energy use. The document then examines WSN routing protocols and strategies, including flooding, interest-based, and location-based. It analyzes hierarchical protocols like LEACH and DECSA, noting how DECSA improves on LEACH by considering distance and residual energy to better balance energy consumption and prolong network lifetime.
Performance Analysis of Routing Protocols of Wireless Sensor NetworksDarpan Dekivadiya
The document summarizes different types of routing protocols that can be used in wireless sensor networks. It categorizes the protocols based on their mode of functioning, participation style of nodes, and network structure. Some key routing protocols discussed include LEACH, which is a proactive clustering protocol, SPIN that uses direct communication, and TEEN which is a reactive clustering protocol. The document also discusses challenges in routing for wireless sensor networks given the constraints of sensor nodes.
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.
M.Phil Computer Science Wireless Communication ProjectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.Phil Computer Science students.
Routing protocol on wireless sensor networkshashankcsnits
The document summarizes routing protocols for wireless sensor networks. It first defines wireless sensor networks and describes their key characteristics. It then surveys traditional routing techniques like flooding and gossiping, as well as current techniques including flat routing protocols like SPIN and directed diffusion, hierarchical routing protocols like LEACH and PEGASIS, and location-based routing protocols like GEAR. For each protocol, it provides a brief overview of how it works and compares their advantages and disadvantages. In conclusion, it states that hierarchical routing protocols generally outperform flat routing protocols, and references several papers on sensor network routing.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN Sathish Silence
GSTEB is a self-organized tree-based energy-balance routing protocol for wireless sensor networks. It aims to prolong network lifetime by balancing energy consumption across nodes. In GSTEB, the base station selects a root node and broadcasts its ID. Then each node selects its parent in a way that minimizes its distance to the root while balancing energy levels. The network operates in rounds, where a routing tree is constructed and nodes transmit sensed data to the base station along the tree. GSTEB dynamically changes the root node between rounds to further balance energy usage among all nodes. Simulation results show GSTEB outperforms other protocols in balancing energy consumption and extending network lifetime.
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
This document proposes a secure clock synchronization technique for wireless sensor networks used in event-driven measurement applications. The technique aims to 1) provide high synchronization accuracy around detected events, 2) ensure long network lifetime, and 3) provide secure packet transmission. It divides nodes into an improved synchronization subset (ISS) with high accuracy around events, and a default synchronization subset (DSS) with lower accuracy elsewhere. When an event is detected, neighboring nodes in the ISS exchange synchronization packets more frequently for better accuracy. Authentication is used to securely transmit packets and identify intercepted messages. Simulation results show the technique accurately records event occurrence times while maintaining network lifetime through efficient energy usage.
1) The document analyzes the performance of the OLSR routing protocol in MANETs in terms of throughput and delay. It implements RSA encryption at the protocol level to detect and prevent black hole attacks.
2) The simulation results show that OLSR with the RSA-based security mechanism is effective at improving security against black hole attacks. It analyzes throughput and delay under different network conditions using the OLSR protocol.
3) Common routing protocols for MANETs like DSDV, DSR, AODV, and OLSR are discussed. Security is a major challenge for MANETs due to the open wireless medium and lack of centralized monitoring. The paper aims to enhance OLSR
Comparison of energy efficient data transmission approaches for flat wireless...ijassn
In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless
sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks,
its precise usage is highly desirable both for the faithful performance of network and to increase the
network life time. For this work, we have considered a flat network topology where every node has the
same responsibility and capability. We have compared two energy efficient algorithms and analyzed their
performances when all sensor nodes in a network have either homogeneous or heterogeneous energy with
increase in number of nodes, time rounds and node failures.
This document evaluates the performance of the AODV and DSR routing protocols under black hole attacks in a mobile ad hoc network (MANET). It conducts simulations using the network simulator NS-2 to compare the protocols' throughput, packet delivery ratio, and end-to-end delay both with and without black hole attacks from malicious nodes. The results show that under black hole attacks, the throughput and packet delivery ratio of both protocols decreases as the number of malicious nodes increases. However, AODV is shown to be more resistant to the effects of black hole attacks compared to DSR, experiencing smaller decreases in performance under black hole attacks.
This document outlines a presentation on value innovation for engineers. The presentation discusses the need for innovation due to relentless competition and the need for sustainable development. It defines innovation as creative solutions to problems and profitable implementation of ideas. The presentation covers understanding innovation, different types of innovation including business and social innovation. It introduces the concepts of value innovation over mere innovation and tools for value innovation such as the innovation canvas and four actions framework. Examples of value innovation include the personal finance software industry and several frugal innovations from India. The presentation emphasizes looking beyond one's industry and engaging stakeholders to develop innovative solutions.
This document discusses the concepts of sustainable versus transient competitive advantages. It provides examples of companies that pursue each approach. Sustainable advantages involve defending a strong position for an extended period, while transient advantages involve continuously starting new strategic initiatives to build and exploit many advantages simultaneously. The document also discusses the stages a transient company goes through when launching a new initiative - launch, ramp up, exploitation, reconfiguration, and disengagement. It notes the types of skills and talents needed at each stage.
A NOVEL APPROACH FOR ENERGY EFFICIENT HIERARCHY BASED ROUTING IN SENSOR NETWO...cscpconf
Wireless sensor network (WSN) is the collection of many micro-sensor nodes, connecting each other by a
wireless medium. WSN exhibits different approaches to provide reliable sensing of the environment,
detecting and reporting events. In this paper, we have proposed an algorithm for hierarchy based protocols
of wireless sensor networks, which consist of two groups of sensor nodes in a single cluster node. Each
cluster consists of a three cluster head. The event driven data sensing mechanism is used in this paper and
this sensed data is transmitted to the master section head. Hence efficient way of data transmission is possible with larger group of nodes. In this approach, using hierarchy based protocols; the lifetime of the sensor network is increased.
ENERGY EFFICIENT, LIFETIME IMPROVING AND SECURE PERIODIC DATA COLLECTION PROT...ijcsa
The most emerging prominent sensor network applications collect data from sensor nodes and monitors
periodically. Resource constraint Sensor motes sense the environment and transit data to the remote sink
via multiple hops. Minimum energy dissipation and secure data transmission are crucial to such
applications. This paper delivers an energy efficient, lifetime improving, secure periodic Data Gathering
scheme that is a hybrid of heuristic path establishment and secure data transmission. This protocol uses
artificial intelligence (AI) based A* heuristic search algorithm to establish energy efficient admissible
optimal path to sink in terms of high residual energy, minimum hop counts and high link quality. This
scheme also adopts block encryption Rivest Cipher (RC6) Algorithm to secure the transmission of packets.
This code and speed optimized block encryption provides confidentiality against critical data and
consumes less energy for encryption. This proposed method increases the network lifetime there by
reducing the total traffic load. Evaluation of performance analysis of this algorithm using Network
Simulator (NS2) shows the superiority of the proposed scheme
This document summarizes a research paper that proposes a new routing protocol called U-LEACH for wireless sensor networks. U-LEACH aims to prolong the lifetime of sensor networks by uniformly distributing cluster head selection throughout the network, unlike the original LEACH protocol. It describes how LEACH works and its limitations in ensuring uniform cluster head distribution. The proposed U-LEACH protocol incorporates a Uniform Distribution Technique to select cluster heads in a way that ensures each sensor node is within transmission range of a cluster head, extending the overall network lifetime.
Data Centric Approach Based Protocol using Evolutionary Approach in WSNijsrd.com
The evolution of wireless communication and circuit technology has enabled the development of an infrastructure consists of sensing, computation and communication units that makes administrator capable to observe and react to a phenomena in a particular environment. In a Wireless Sensor Network (WSN), nodes are scattered densely in a large area. Sensor nodes can communicate with the sink node directly or through other nodes. Data transmission is the major issue in WSN. Each node has limited energy which is used in transmitting and receiving the data. Various routing protocols have been proposed to save the energy during the transmission of data. data centric approach based routing protocol which efficiently propagates information between sensor nodes in an energy constrained mode. This paper proposes a data centric routing Using evolutionary apporoach in WSN.The main objective of this protocol with evolutionary apporoach is to use artificial intelligence, to reduce the energy consumption by the nodes in transmitting and receiving the data. Implementation of Basic SEP, intelligence cluster routing and proposed protocols will be done using MATLAB.
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.
Improving the Proactive Routing Protocol using Depth First Iterative Deepenin...Yayah Zakaria
Owing to the wireless and mobility nature, nodes in a mobile ad hoc network are not within the transmission range. It needs to transfer data through the multi-intermediate nodes. Opportunistic data forwarding is an assuring solution to make use of the broadcast environment of wireless communication links. Due to absence of source routing capability with efficient proactive routing protocol, it is not widely used. To rectify the
problem, we proposed memory and routing efficient proactive routing protocol using Depth-First Iterative-Deepening and hello messaging scheme. This protocol can conserve the topology information in every node in the network. In experimental analysis and discussion, we implemented the proposed work using NS2 simulator tool and proved that the proposed technique is performed well in terms of average delay, buffer and throughput.
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
M.E Computer Science Wireless Communication ProjectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.E Computer Science students.
The document discusses wireless sensor networks and energy-efficient routing. It introduces WSNs and outlines their typical energy consumption from transmission, reception, and sensing. It describes deterministic and random deployment strategies and their impact on energy use. The document then examines WSN routing protocols and strategies, including flooding, interest-based, and location-based. It analyzes hierarchical protocols like LEACH and DECSA, noting how DECSA improves on LEACH by considering distance and residual energy to better balance energy consumption and prolong network lifetime.
Performance Analysis of Routing Protocols of Wireless Sensor NetworksDarpan Dekivadiya
The document summarizes different types of routing protocols that can be used in wireless sensor networks. It categorizes the protocols based on their mode of functioning, participation style of nodes, and network structure. Some key routing protocols discussed include LEACH, which is a proactive clustering protocol, SPIN that uses direct communication, and TEEN which is a reactive clustering protocol. The document also discusses challenges in routing for wireless sensor networks given the constraints of sensor nodes.
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.
M.Phil Computer Science Wireless Communication ProjectsVijay Karan
List of Wireless Communication IEEE 2006 Projects. It Contains the IEEE Projects in the Domain Wireless Communication for M.Phil Computer Science students.
Routing protocol on wireless sensor networkshashankcsnits
The document summarizes routing protocols for wireless sensor networks. It first defines wireless sensor networks and describes their key characteristics. It then surveys traditional routing techniques like flooding and gossiping, as well as current techniques including flat routing protocols like SPIN and directed diffusion, hierarchical routing protocols like LEACH and PEGASIS, and location-based routing protocols like GEAR. For each protocol, it provides a brief overview of how it works and compares their advantages and disadvantages. In conclusion, it states that hierarchical routing protocols generally outperform flat routing protocols, and references several papers on sensor network routing.
Comparative Simulation Study Of LEACH-Like And HEED-Like Protocols Deployed I...IOSRJECE
WSNs represents one of the most interesting research areas with deep impact on technological development because of their potential usage in a wide variety of applications such as fire monitoring, border surveillance medical care, and highway traffic coordination. Therefore, WSNs researchers have defined many routing protocols for this type of network. In this paper, we have implemented and analyzed different clustering protocols, namely LEACH, LEACH-C, LEACH-1R, and HEED using MATLAB environment. These routing protocols are compared in different terms such as residual energy, data delivery to the base station, number of rounds and live nodes
A General Self Organized Tree Based Energy Balance Routing Protocol for WSN Sathish Silence
GSTEB is a self-organized tree-based energy-balance routing protocol for wireless sensor networks. It aims to prolong network lifetime by balancing energy consumption across nodes. In GSTEB, the base station selects a root node and broadcasts its ID. Then each node selects its parent in a way that minimizes its distance to the root while balancing energy levels. The network operates in rounds, where a routing tree is constructed and nodes transmit sensed data to the base station along the tree. GSTEB dynamically changes the root node between rounds to further balance energy usage among all nodes. Simulation results show GSTEB outperforms other protocols in balancing energy consumption and extending network lifetime.
Security based Clock Synchronization technique in Wireless Sensor Network for...iosrjce
This document proposes a secure clock synchronization technique for wireless sensor networks used in event-driven measurement applications. The technique aims to 1) provide high synchronization accuracy around detected events, 2) ensure long network lifetime, and 3) provide secure packet transmission. It divides nodes into an improved synchronization subset (ISS) with high accuracy around events, and a default synchronization subset (DSS) with lower accuracy elsewhere. When an event is detected, neighboring nodes in the ISS exchange synchronization packets more frequently for better accuracy. Authentication is used to securely transmit packets and identify intercepted messages. Simulation results show the technique accurately records event occurrence times while maintaining network lifetime through efficient energy usage.
1) The document analyzes the performance of the OLSR routing protocol in MANETs in terms of throughput and delay. It implements RSA encryption at the protocol level to detect and prevent black hole attacks.
2) The simulation results show that OLSR with the RSA-based security mechanism is effective at improving security against black hole attacks. It analyzes throughput and delay under different network conditions using the OLSR protocol.
3) Common routing protocols for MANETs like DSDV, DSR, AODV, and OLSR are discussed. Security is a major challenge for MANETs due to the open wireless medium and lack of centralized monitoring. The paper aims to enhance OLSR
Comparison of energy efficient data transmission approaches for flat wireless...ijassn
In this paper we have analyzed energy efficient neighbour selection algorithms for routing in wireless
sensor networks. Since energy saving or consumption is an important aspect of wireless sensor networks,
its precise usage is highly desirable both for the faithful performance of network and to increase the
network life time. For this work, we have considered a flat network topology where every node has the
same responsibility and capability. We have compared two energy efficient algorithms and analyzed their
performances when all sensor nodes in a network have either homogeneous or heterogeneous energy with
increase in number of nodes, time rounds and node failures.
This document evaluates the performance of the AODV and DSR routing protocols under black hole attacks in a mobile ad hoc network (MANET). It conducts simulations using the network simulator NS-2 to compare the protocols' throughput, packet delivery ratio, and end-to-end delay both with and without black hole attacks from malicious nodes. The results show that under black hole attacks, the throughput and packet delivery ratio of both protocols decreases as the number of malicious nodes increases. However, AODV is shown to be more resistant to the effects of black hole attacks compared to DSR, experiencing smaller decreases in performance under black hole attacks.
This document outlines a presentation on value innovation for engineers. The presentation discusses the need for innovation due to relentless competition and the need for sustainable development. It defines innovation as creative solutions to problems and profitable implementation of ideas. The presentation covers understanding innovation, different types of innovation including business and social innovation. It introduces the concepts of value innovation over mere innovation and tools for value innovation such as the innovation canvas and four actions framework. Examples of value innovation include the personal finance software industry and several frugal innovations from India. The presentation emphasizes looking beyond one's industry and engaging stakeholders to develop innovative solutions.
This document discusses the concepts of sustainable versus transient competitive advantages. It provides examples of companies that pursue each approach. Sustainable advantages involve defending a strong position for an extended period, while transient advantages involve continuously starting new strategic initiatives to build and exploit many advantages simultaneously. The document also discusses the stages a transient company goes through when launching a new initiative - launch, ramp up, exploitation, reconfiguration, and disengagement. It notes the types of skills and talents needed at each stage.
This document summarizes research on students' and teachers' perspectives on effective teaching. According to a student survey, the most important factors for an outstanding professor were rapport (35.8%), delivery (30.3%), and fairness (16.4%). A separate teacher survey found that master teachers emphasize communication skills, real-world experience, caring, student involvement, and organization. Both studies provide insights for improving teaching but caution that pleasing students should not compromise educational standards. The document concludes by inviting discussion on revisiting the art of teaching.
Stalin used cult-like tactics and consolidated power to eliminate enemies after helping lead the Bolshevik Revolution, establishing an authoritarian regime that divided Europe with the Iron Curtain and Eastern Bloc despite conferences aiming to cooperate after World War II. Some saw him as a tyrant while others viewed him as a hero for his leadership.
This document discusses entrepreneurship and innovation. It begins by outlining some myths about creative thinking and lists positive attitudes that enable creative thinking, such as curiosity and perseverance. Barriers to creative thinking like fear of failure are also presented. The document then discusses what innovation is, providing examples of product, service, and process innovation. It introduces the concept of value innovation and presents a framework called "Four Actions" for innovating value. Key lessons discussed are questioning industry standards and thinking "upside down" to innovate services. The document concludes by stating that big problems can be solved through innovation.
Gandhi and Mandela were both pioneers of freedom who helped minority groups. While Mandela coordinated sabotage campaigns and prepared for possible guerilla war, making him believed in violence as a last resort, Gandhi used non-cooperation and involvement of masses to indirectly attack opposition without physical violence. Both were extremely influential figures who promoted values of peace and equality.
On-Demand Multicast Routing Protocol.
This paper presents a novel multicast routing protocol for mobile ad hoc wireless networks. The protocol, termed ODMRP (On-Demand Multicast Routing Protocol), is a mesh-based, rather than a conventional tree- based, multicast scheme and uses a forwarding group concept (only a sub- set of nodes forwards the multicast packets via scoped flooding). It applies on-demand procedures to dynamically build routes and maintain multicast group membership. ODMRP is well suited for ad hoc wireless networks with mobile hosts where bandwidth is limited, topology changes frequently, and power is constrained. We evaluate ODMRP’s scalability and performance via simulation.
This document summarizes a research paper presented at the National Conference on Current Trends in Computer Science and Engineering. The paper proposes a Sink-initiated Geographic Multicast (SIGM) protocol for wireless sensor networks that allows mobile sinks to construct their own data delivery paths from a source node and merge these paths to form a multicast tree. This reduces location updates and achieves fast multicast tree construction and data delivery. The paper also presents a round-based virtual infrastructure to further improve the SIGM protocol's energy efficiency and ability to handle sink mobility. Simulation results show SIGM outperforms other source-initiated multicast protocols in terms of energy consumption and data delivery latency.
This document discusses power aware routing protocols for wireless sensor networks. It begins by describing wireless sensor networks and how they are used to monitor environmental conditions. It then classifies routing protocols for sensor networks based on their functioning, node participation style, and network structure. Specific examples are provided for different types of routing protocols, including LEACH, TEEN, APTEEN, SPIN, Rumor Routing, and PEGASIS. Chain-based and clustering routing protocols are also summarized.
Energy Efficient PEGASIS Routing Protocol in Wireless Sensor NetworkIRJET Journal
This document discusses the PEGASIS routing protocol for wireless sensor networks. It begins with an abstract that introduces PEGASIS as an energy-efficient chain-based hierarchical protocol. It then provides background on wireless sensor networks and discusses challenges like energy efficiency and network lifetime. It explains how PEGASIS forms chains between sensor nodes so that each node only communicates with nearby neighbors, extending network lifetime. The document compares PEGASIS to LEACH, finding that PEGASIS provides more balanced energy distribution and longer network lifetime. It then outlines the PEGASIS algorithm and discusses potential improvements like minimizing delay. Simulation results show PEGASIS increases network efficiency and lifespan over LEACH. The conclusion is that
COMPARISON OF ENERGY EFFICIENT DATA RANSMISSION APPROACHES FOR FLAT WIRELESS ...ijassn
The document compares two energy efficient routing approaches - highest energy (HE) and minimum energy consumption route (MECRT) - for flat wireless sensor networks. Through simulations, it finds that in homogeneous networks, MECRT outperforms HE in terms of energy consumption and network lifetime. However, in heterogeneous networks, HE performs better than MECRT for medium sized networks. Overall, the document analyzes and compares the performance of these two energy efficient routing techniques for both homogeneous and heterogeneous wireless sensor networks of varying sizes.
This document summarizes and compares various routing protocols for wireless sensor networks. It categorizes routing protocols into three types: data-centric, hierarchical, and location-based. For each type, it describes some representative protocols, outlines their advantages and disadvantages, and discusses their application domains. The document concludes that routing in wireless sensor networks faces challenges due to constraints like limited energy, bandwidth and memory in sensor nodes, and more research is still needed to develop efficient and adaptive routing techniques.
The document discusses energy efficient routing protocols for clustered wireless sensor networks. It provides an overview of wireless sensor networks and discusses how clustering is commonly used to improve energy efficiency and scalability. The document reviews several existing clustering-based routing protocols and analyzes their approaches for prolonging network lifetime by minimizing energy consumption in wireless sensor networks.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
This document presents a comparative study of flat-based/data-centric wireless sensor network (WSN) specific routing protocols. It first provides background on data-centric approaches in WSNs and discusses some popular flat-based/data-centric routing protocols, including Directed Diffusion, Minimum Cost Forwarding Algorithm (MCFA), Threshold sensitive Energy Efficient sensor Network protocol (TEEN), Adaptive Periodic Threshold sensitive Energy Efficient sensor Network protocol (APTEEN), Energy Aware Data (EAD) Centric Routing Protocol, RUMOR Routing, Sensor Protocols for Information via Negotiation (SPIN), Constrained Anisotropic Diffusion Routing (CADR), COUGAR,
A review of Hierarchical energy Protocols in Wireless Sensor Networkiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
This document provides an overview of hierarchical energy protocols in wireless sensor networks. It discusses several key protocols including LEACH, PEGASIS, TEEN, and APTEEN. LEACH is described as a clustered-based protocol that randomly selects cluster heads to help distribute the energy load. PEGASIS is presented as an improvement on LEACH that forms chains between sensor nodes to help reduce energy usage. TEEN is a reactive protocol designed for time-critical applications, using hard and soft thresholds to reduce transmissions. Finally, APTEEN is summarized as an extension of TEEN that aims to support both periodic data collection and responding to important events.
This document summarizes three routing strategies - Cluster and Chain Based (CCB), Transmission Ranges and Chain Based (TRCB), and GRAdient Broadcast (GRAB) - proposed for wireless sensor networks to improve energy efficiency. CCB uses both clustering from LEACH and chain formation from PEGASIS to transmit sensor data to the base station. TRCB uses transmission ranges and distances to transmit sensor data within clusters to heads, which then form chains to the base station. GRAB builds and maintains a cost field to efficiently transmit data along descending costs towards the base station along multiple paths. Simulation results show GRAB performs better than CCB and TRCB in terms of network lifetime.
This document summarizes a research paper that evaluates the performance of two routing protocols, AODV and DSR, in wireless sensor networks. The paper analyzes the protocols based on two metrics: media access delay and network load. Through simulations with 20 nodes in OPNET, the paper finds that DSR has lower network load for mobile and stationary nodes, while AODV has lower media access delay for mobile nodes and initially for stationary nodes. Overall, the superior protocol depends on the scenario and performance metric considered.
The development of the wireless sensor networks (WSNs) in various applications like Defense, Health,
Environment monitoring, Industry etc. always attract many researchers in this field. WSN is the network
which consists of collection of tiny devices called sensor nodes. Sensor node typically combines wireless
radio transmitter-receiver and limited energy, restricted computational processing capacity and
communication band width. These sensor node sense some physical phenomenon using different
transduces. The current improvement in sensor technology has made possible WSNs that have wide and
varied applications. While selecting the right sensor for application a number of characteristics are
important. This paper provides the basics of WSNs including the node characteristics. It also throws light
on the different routing protocols.
Characterization of directed diffusion protocol in wireless sensor networkijwmn
Wireless sensor network (WSN) has enormous applications in many places for monitoring the environments
of importance. Sensor nodes are capable of sensing, computing, and communicating. These sensor nodes
are energy constraint and operated by batteries. Since energy consumption is an important issue of WSN,
there have been many energy-efficient protocols proposed for the WSN. Directed diffusion (DD) is a datacentric
protocol that focuses on the energy efficiency of the networks. Since the first proposal of DD
protocol by Deborah, there have been various versions of DD protocols proposed by many scientists across
the globe. These upgraded versions of DD protocols add on various features to the original DD protocol
such as energy, scalability, network lifetime, security, reliability, and mobility. In this paper, we discuss
and classify various characteristics of themost populardirected diffusion protocols that have been proposed
over couple of years.
Data Aggregation Routing Protocols in Wireless Sensor Networks : A TaxonomyIJCNCJournal
Routing in Wireless Sensor Network (WSN) aims to interconnect sensor nodes via single or multi-hop
paths. The routes are established to forward data packets from sensor nodes to the sink. Establishing a
single path to report each data packet results in increasing energy consumption in WSN, hence, data
aggregation routing is used to combine data packets and consequently reduce the number of transmissions.
This reduces the routing overhead by eliminating redundant and meaningless data. There are two models
for data aggregation routing in WSN: mobile agent and client/server. This paper describes data
aggregation routing and classifies then the routing protocols according to the network architecture and
routing models. The key issues of the data aggregation routing models (client/server and mobile agent) are
highlighted and discussed.
The International Journal of Engineering and Science (IJES)theijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
VEBEK is an energy-efficient framework for secure communication in wireless sensor networks. It uses dynamic encryption keys based on the residual virtual energy of sensor nodes, eliminating the need for rekeying messages. Each packet is encrypted with a different one-time key, improving security. VEBEK provides authentication, integrity, and non-repudiation without enlarging packets through modular design. It can efficiently detect and filter malicious data through two operational modes: VEBEK-1 watches all neighbors, VEBEK-2 watches some nodes statistically. Evaluation shows VEBEK eliminates malicious data without transmission overhead.
Improved routing scheme with ACO in WSN in comparison to DSDVijsrd.com
Routing is the process of selecting best paths in a network in terms of energy and distance. In adhoc it is critical to collect the information in an efficient manner as it has limitations in terms of centralized congestion. In such case to perform the effective communication there is the requirement of some such routing approach that can provide the routing with optimized path. In this work, ACO based routing approach is defined to generate the optimized path in comparison to DSDV over the network. The presented approach is implemented in matlab environment and obtained results shows the effective results in terms of optimized path.
Energy Efficient Routing Strategies for Large Scale Wireless Sensor in Hetero...ijtsrd
The efficiency of a wireless sensor network depends on its life time. By conserving the energy of each sensor for increase in the network life time. The basic operations of a wireless sensor network are sensing 1 the data to the energy sink term is for next transmitting node. The communication or routing 2 process operation be allowed in any operations for all nodes 3 . We propose to select a specific collection of nodes for communication with considering the importance of wireless sensor where security 4 and power usage 5 is taken as top priority. O. Sampath | . P. Suryanarayana Babu "Energy Efficient Routing Strategies for Large Scale Wireless Sensor in Heterogeneous Networks" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-3 | Issue-2 , February 2019, URL: https://www.ijtsrd.com/papers/ijtsrd20281.pdf
Paper URL: https://www.ijtsrd.com/computer-science/computer-network/20281/energy-efficient-routing-strategies-for-large-scale-wireless-sensor-in-heterogeneous-networks/o-sampath
Bidirectional data centric routing protocol to improve the energy efficiency ...prj_publication
This document summarizes a research paper that proposes a novel bidirectional data-centric routing protocol to improve energy efficiency in wireless sensor networks. The protocol aims to overcome issues with existing protocols like SPIN and Directed Diffusion, such as data redundancy, resource blindness, and packet loss. It uses meta-data descriptors to route data along the shortest path based on source and sink interests. Simulation results showed the proposed protocol increases bandwidth, network lifetime, and disseminates data with higher percentage compared to other protocols.
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS ijasuc
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured
with limited energy, computation and transmission power. Each node in the network coordinates with
every other node in forwarding their packets to reach the destination. Since these nodes operate in a
physically insecure environment; they are vulnerable to different types of attacks such as selective
forwarding and sinkhole. These attacks can inject malicious packets by compromising the node.
Geographical routing protocols of wireless sensor networks have been developed without considering the
security aspects against these attacks. In this paper, a secure routing protocol named secured greedy
perimeter stateless routing protocol (S-GPSR) is proposed for mobile sensor networks by incorporating
trust based mechanism in the existing greedy perimeter stateless routing protocol (GPSR). Simulation
results prove that S-GPSR outperforms the GPSR by reducing the overhead and improving the delivery
ratio of the networks.
Similar to Network structure routing_protocols_in_wsn (20)
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
Network structure routing_protocols_in_wsn
1. National Conference on Current Trends in Computer Science and Engineering - CSECONF2012
Network Structure Routing Protocols in WSN
Jain Pratik P1, Manjunath CR2 , DrNagaraj GS3
1 nd
MTech 2 Sem, SET, JAIN University, pratikjain1690@gmail.com
2
Asst Prof, Dept of CSE, SET, JAIN University, manjucr123@gmail.com
3
professor, Dept of CSE, RVCE
ABSTRACT- Routing protocols are in charge of play different roles in the network. In location-
discovering and maintaining the routes in the based routing, sensor nodes' positions are exploited
network. This paper presents a review of the main to route data in the network [2]. A routing protocol
routing protocols proposed for Network Structure in is considered adaptive if certain system parameters
WSN. Based on the study, they are classified into
can be controlled in order to adapt to the current
three categories: SPIN & Directed Diffusion in Flat-
based, LEACH, PEGASIS & SOP in Hierarchical- network conditions and available energy levels.
based, SPAN & GOFAR in Location-based, which Another class of routing protocols is called the
underlying Network Structure. cooperative routing protocols. In cooperative
routing, nodes send data to a central node where
Keywords- Wireless Sensor Network, Routing data can be aggregated and may be subject to
Protocols: Flat-based, Hierarchical-based, Location- further processing, hence reducing route cost in
based. terms of energy use [2].
I. INTRODUCTION II. Flat-based Routing Protocols
Wireless Sensor Networks (WSN) are The first category of routing protocol is
intended for monitoring an environment. The main the multi-hop flat routing protocols. In flat
task of a wireless sensor node is to sense and networks, each node typically plays the same role
collect data from a certain domain, process them and sensor nodes collaborate together to perform
and transmit it to the sink where the application the sensing task. Due to the large number of such
lies. Areas of applications are like, physical nodes, it is not feasible to assign a global identifier
parameters (e.g., humidity, temperature, light, etc.), to each node. This consideration has led to data
to safety and security-oriented (intrusion detection, centric routing, where the BS sends queries to
natural disaster detection, etc.), to monitor soldiers certain regions and waits for data from the sensors
in the battle field (military applications), patients in located in the selected regions. Since data is being
nursing institutes (e-health applications), fire requested through queries, attribute-based naming
brigades and policemen (security/safety is necessary to specify the properties of data. Early
applications) [1, 6]. works on data centric routing, e.g., SPIN and
The use of potentially unique identifier directed diffusion were shown to save energy
such as the MAC (Medium Access Control) through data negotiation and elimination of
address or the GPS coordinates is not redundant data.
recommended as it forces a significant payload in
the messages. However, this drawback is easily
overcome in wireless sensor networks since an IP
address is not required to identify the destination
node of a specific packet. In fact, attribute-based
addressing fits better with the specificities of
wireless sensor networks. In this case, an attribute
such as node location and sensor type is used to
identify the final destination. Once nodes are
identified, routing protocols are in charge of
constructing and maintaining routes between
distant nodes. The different ways in which routing
protocols operate make them appropriate for
certain applications [6].
Figure1: Routing Protocols in WSN
In general, network structure routing in
WSNs can be divided into flat-based routing,
SPIN:
hierarchical-based routing, and location-based
Sensor Protocols for Information via
routing depending on the envirnoment.
Negotiation (SPIN) that enables a user to query any
In flat-based routing, all nodes are
node and get the required information immediately.
typically assigned equal roles or functionality. In
These protocols make use of the property that
hierarchical-based routing, however, nodes will
nodes in close proximity have similar data, and
23
2. National Conference on Current Trends in Computer Science and Engineering - CSECONF2012
hence there is a need to only distribute the data that SPIN-RL: When a channel is lossy, a protocol
other nodes do not posses. The SPIN family of called SPIN-RL is used where adjustments are
protocols uses data negotiation and resource- added to the SPIN-PP protocol to account for the
adaptive algorithms. Nodes running SPIN assign a lossy channel.
high-level name to completely describe their Advantages: Topological changes are localized
collected data (called meta-data) and perform meta- since each node needs to know only its single-hop
data negotiations before any data is transmitted. neighbors. SPIN provides much energy savings
This assures that there is no redundant data sent than flooding and meta-data negotiation almost
throughout the network. The semantics of the meta halves the redundant data. However, SPINs data
data format is application-specific and is not advertisement mechanism cannot guarantee the
specified in SPIN. For example, sensors might use delivery of data. To see this, consider the
their unique IDs to report meta-data if they cover a application of intrusion detection where data
certain known region. In addition, SPIN has access should be reliably reported over periodic intervals
to the current energy level of the node and adapts and assume that nodes interested in the data are
the protocol it is running based on how much located far away from the source node and the
energy is remaining. These protocols work in a nodes between source and destination nodes are not
time-driven fashion and distribute the information interested in that data, such data will not be
all over the network, even when a user does not delivered to the destination at all [2].
request any data. The SPIN family is designed to
address the deficiencies of classic flooding by Directed Diffusion:
negotiation and resource adaptation. The SPIN Directed diffusion is a data-centric (DC)
family of protocols is designed based on two basic and application-aware paradigm in the sense that
ideas: all data generated by sensor nodes is named by
1) Sensor nodes operate more efficiently and attribute-value pairs. The main idea of the DC
conserve energy by sending data that describe the paradigm is to combine the data coming from
sensor data instead of sending all the data; for different sources enroute (in-network aggregation)
example, image and sensor nodes must monitor the by eliminating redundancy, minimizing the number
changes in their energy resources. of transmissions; thus saving network energy and
2) Conventional protocols like flooding or prolonging its lifetime. Unlike traditional end-to-
gossiping based routing protocols waste energy and end routing, DC routing finds routes from multiple
bandwidth when sending extra and un-necessary sources to a single destination that allows in-
copies of data by sensors covering overlapping network consolidation of redundant data.
areas. The drawbacks of flooding include In directed diffusion, sensors measure
implosion, which is caused by duplicate messages events and create gradients of information in their
sent to the same node, overlap when two nodes respective neighborhoods. The base station
sensing the same region will send similar packets requests data by broadcasting interests. Interest
to the same neighbor and resource blindness by describes a task required to be done by the
consuming large amounts of energy without network. Interest diffuses through the network hop-
consideration for the energy constraints. by-hop, and is broad-cast by each node to its
SPIN is a 3-stage protocol as sensor nodes neighbors. As the interest is propagated throughout
use three types of messages ADV, REQ and DATA the network, gradients are setup to draw data
to communicate. ADV is used to advertise new satisfying the query towards the requesting node,
data, REQ to request data, and DATA is the actual i.e., a BS may query for data by disseminating
message itself. The protocol starts when a SPIN interests and intermediate nodes propagate these
node obtains new data that it is willing to share. It interests. Each sensor that receives the interest
does so by broadcasting an ADV message setup a gradient toward the sensor nodes from
containing meta-data. If a neighbor is interested in which it receives the interest. This process
the data, it sends a REQ message for the DATA continues until gradients are setup from the sources
and the DATA is sent to this neighbor node. The back to the BS. More generally, a gradient specifies
neighbor sensor node then repeats this process with an attribute value and a direction. The strength of
its neighbors. As a result, the entire sensor area will the gradient may be different towards different
receive a copy of the data. neighbors resulting in different amounts of
The SPIN family of protocols includes information flow. At this stage, loops are not
many protocols. checked, but are removed at a later stage. Figure2
SPIN-BC: This protocol is designed for broadcast shows an example of the working of directed
channels. diffusion ((a) sending interests, (b) building
SPIN-PP: This protocol is designed for a point to gradients, and (c) data dissemination). When
point communication, i.e., hop-by-hop routing. interests fit gradients, paths of information flow are
SPIN-EC: This protocol works similar to SPIN- formed from multiple paths and then the best paths
PP, but with an energy heuristic added to it. are reinforced so as to prevent further flooding
24
3. National Conference on Current Trends in Computer Science and Engineering - CSECONF2012
according to a local rule. In order to reduce known techniques with special advantages related
communication costs, data is aggregated on the to scalability and efficient communication. As
way. The goal is to find a good aggregation tree such, the concept of hierarchical routing is also
which gets the data from source nodes to the BS. utilized to perform energy-efficient routing in
The BS periodically refreshes and re-sends the WSNs. In a hierarchical architecture, higher energy
interest when it starts to receive data from the nodes can be used to process and send the
source(s). This is necessary because interests are information while low energy nodes can be used to
not reliably transmitted throughout the network. perform the sensing in the proximity of the target.
This means that creation of clusters and assigning
special tasks to cluster heads can greatly contribute
to overall system scalability, lifetime, and energy
efficiency. Hierarchical routing is an efficient way
to lower energy consumption within a cluster and
by performing data aggregation and fusion in order
to decrease the number of transmitted messages to
the BS. Hierarchical routing is mainly two-layer
routing where one layer is used to select cluster
heads and the other layer is used for routing.
LEACH protocol:
Low Energy Adaptive Clustering
Hierarchy (LEACH) is a cluster-based protocol,
which includes distributed cluster formation.
LEACH, randomly selects a few sensor nodes as
cluster-heads (CHs) and rotate this role to evenly
distribute the energy load among the sensors in the
network. In LEACH, the cluster-head (CH) nodes
compress data arriving from nodes that belong to
the respective cluster, and send an aggregated
packet to the base station in order to reduce the
amount of information that must be transmitted to
the base station. LEACH uses a TDMA/CDMA
MAC to reduce inter-cluster and intra-cluster
collisions. However, data collection is centralized
and is performed periodically. Therefore, this
protocol is most appropriate when there is a need
Figure2: Examples of Interest Diffusion in Sensor for constant monitoring by the sensor network. A
Network user may not need all the data immediately. Hence,
periodic data transmissions are unnecessary which
Directed diffusion differs from SPIN in may drain the limited energy of the sensor nodes.
two aspects: After a given interval of time, a randomized
1) Directed diffusion issues on demand rotation of the role of the CH is conducted so that
data queries as the BS send queries to the sensor uniform energy dissipation in the sensor network is
nodes by flooding some tasks. In SPIN, however, obtained. The authors found, based on their
sensors advertise the availability of data allowing simulation model, that only 5% of the nodes need
interested nodes to query that data. to act as cluster heads.
2) All communication in directed The operation of LEACH is separated into
diffusion is neighbor-to-neighbor with each node two phases, the setup phase and the steady state
having the capability of performing data phase.
aggregation and caching. Unlike SPIN, there is no In the setup phase, the clusters are
need to maintain global network topology in organized and CHs are selected. In the steady state
directed diffusion. However, directed diffusion phase, the actual data transfer to the base station
may not be applied to applications (e.g., takes place. The duration of the steady state phase
environmental monitoring) that require continuous is longer than the duration of the setup phase in
data delivery to the BS. order to minimize overhead. During the setup
phase, a predetermined fraction of nodes, p, elect
III. Hierarchical-based Routing Protocols themselves as CHs as follows. A sensor node
chooses a random number, r, between 0 and 1. If
Hierarchical or cluster-based routing, this random number is less than a threshold value,
originally proposed in wireline networks, are well- T(n), the node becomes a cluster-head for the
25
4. National Conference on Current Trends in Computer Science and Engineering - CSECONF2012
current round. The threshold value is calculated fashion. Simulation results showed that PEGASIS
based on an equation that incorporates the desired is able to increase the lifetime of the network twice
percentage to become a cluster-head, the current as much the lifetime of the network under the
round, and the set of nodes that have not been LEACH protocol. Such performance gain is
selected as a cluster-head in the last (1/P) rounds, achieved through the elimination of the overhead
denoted by caused by dynamic cluster formation in LEACH
G. It is given by: and through decreasing the number of
transmissions and reception by using data
aggregation.
Where, G is the set of nodes that are SOP:
involved in the CH election. Each elected CH Self Organizing Protocol is used to build
broadcast an advertisement message to the rest of architecture to support heterogeneous sensors.
the nodes in the network that they are the new These sensors can be mobile or stationary. Some
cluster-heads. All the non-cluster head nodes, after sensors probe the environment and forward the data
receiving this advertisement, decide on the cluster to a designated set of nodes that act as routers.
to which they want to belong to. This decision is Router nodes are stationary and form the backbone
based on the signal strength of the advertisement. for communication. Collected data are forwarded
The non cluster-head nodes inform the appropriate through the routers to the more powerful BS nodes.
cluster-heads that they will be a member of the Each sensing node should be able to reach a router
cluster. After receiving all the messages from the in order to be part of the network. A routing
nodes that would like to be included in the cluster architecture that requires addressing of each sensor
and based on the number of nodes in the cluster, node has been proposed. Sensing nodes are
the cluster-head node creates a TDMA schedule identifiable through the address of the router node
and assigns each node a time slot when it can they are connected to. The routing architecture is
transmit. This schedule is broadcast to all the nodes hierarchical where groups of nodes are formed and
in the cluster. [2]. merge when needed. Local Markov Loops (LML)
algorithm, which performs a random walk on
PEGASIS: spanning trees of a graph, was used to support fault
Power-Efficient Gathering in Sensor tolerance and as a means of broadcasting. Such
Information Systems (PEGASIS) is a near optimal approach is similar to the idea of virtual grid used
chain-based protocol. The basic idea of the in some other protocols that will be discussed later
protocol is that in order to extend network lifetime, under location-based routing protocols. In this
nodes need only communicate with their closest approach, sensor nodes can be addressed
neighbors and they take turns in communicating individually in the routing architecture, and hence
with the base-station. When, the round of all nodes it is suitable for applications where communication
communicating with the base-station ends, a new to a particular node is required. Furthermore, this
round will start and so on. This reduces the power algorithm incurs a small cost for maintaining
required to transmit data per round as the power routing tables and keeping a balanced routing
draining is spread uniformly over all nodes. Hence, hierarchy. It was also found that the energy
PEGASIS has two main objectives: consumed for broadcasting a message is less than
1) Increase the lifetime of each node by that consumed in the SPIN protocol. This protocol,
using collaborative techniques and as a result the however, is not an on-demand protocol especially
network lifetime will be increased. in the organization phase of algorithm. Another
2) Allow only local coordination between issue is related to the formation of hierarchy. It
nodes that are close together so that the bandwidth could happen that there are many cuts in the
consumed in communication is reduced. Unlike network, and hence the probability of applying
LEACH, PEGASIS avoids cluster formation and reorganization phase increases, which will be an
uses only one node in a chain to transmit to the BS expensive operation [2].
instead of using multiple nodes.
To locate the closest neighbor node in VGA:
PEGASIS, each node uses the signal strength to Virtual Grid Architecture routing is an
measure the distance to all neighboring nodes and energy-efficient routing paradigm, proposed in
then adjusts the signal strength so that only one utilizes data aggregation and in-network processing
node can be heard. The chain in PEGASIS will to maximize the network lifetime. A GPS-free
consist of those nodes that are closest to each other approach is used to build clusters that are fixed,
and form a path to the base-station. The aggregated equal, adjacent, and non-overlapping with
form of the data will be sent to the base-station by symmetric shapes. In square clusters were used to
any node in the chain and the nodes in the chain obtain a fixed rectilinear virtual topology. Inside
will take turns in sending to the base-station. The each zone, a node is optimally selected to act as
chain construction is performed in a greedy
26
5. National Conference on Current Trends in Computer Science and Engineering - CSECONF2012
cluster-head. Data aggregation is performed at two certain region rather than sending the interests to
levels: local and then global. The set of cluster- the whole network. By doing this, GEAR can
heads, also called Local Aggregators (LAs), conserve more energy than directed diffusion. Each
perform the local aggregation, while a subset of node in GEAR keeps an estimated cost and a
these Las, are used to perform global aggregation. learning cost of reaching the destination through its
However, the determination of an optimal selection neighbors. The estimated cost is a combination of
of global aggregation points, called Master residual energy and distance to destination. The
Aggregators (MAs), is NP-hard problem. Figure 6 learned cost is a refinement of the estimated cost
illustrates an example of fixed zoning and the that accounts for routing around holes in the
resulting VGA used to perform two level data network. A hole occurs when a node does not have
aggregation. Note that the location of the base any closer neighbor to the target region than itself.
station is not necessarily at the extreme corner of If there are no holes, the estimated cost is equal to
the grid rather it can be located at any arbitrary the learned cost. The learned cost is propagated one
place. hop back every time a packet reaches the
destination so that route setup for next packet will
be adjusted. There are two phases in the algorithm:
1) Forwarding packets towards the target
region: Upon receiving a packet, a node checks its
neighbors to see if there is one neighbor, which is
closer to the target region than itself. If there is
more than one, the nearest neighbor to the target
region is selected as the next hop. If they are all
further than the node itself, this means there is a
hole. In this case, one of the neighbors is picked to
forward the packet based on the learning cost
function. This choice can then be updated
Figure3: Regular shape tessellation applied to the according to the convergence of the learned cost
network area. In each zone, a cluster-head is during the delivery of packets.
selected for local aggregation. Subsets of those 2) Forwarding the packets within the
cluster-heads, called Master nodes, are optimally region: If the packet has reached the region, it can
selected to do global aggregation. be diffused in that region by either recursive
geographic forwarding or restricted flooding.
Restricted flooding is good when the sensors are
IV. Location based routing protocols
not densely deployed. In high-density networks,
In this kind of routing, sensor nodes are recursive geographic flooding is more energy
addressed by means of their locations. The distance efficient than restricted flooding. In that case, the
between neighboring nodes can be estimated on the region is divided into four sub regions and four
basis of incoming signal strengths. Relative copies of the packet are created. This splitting and
coordinates of neighboring nodes can be obtained forwarding process continues until the regions with
by exchanging such information between only one node are left [2].
neighbors. Alternatively, the location of nodes may
be available directly by communicating with a GOAFR:
satellite, using GPS (Global Positioning System), if The Greedy Other Adaptive Face Routing.
nodes are equipped with a small low power GPS The greedy algorithm of GOAFR always picks the
receiver. To save energy, some location based neighbor closest to a node to be next node for
schemes demand that nodes should go to sleep if routing. However, it can be easily stuck at some
there is no activity. More energy savings can be local minimum, i.e. no neighbor is closer to a node
obtained by having as many sleeping nodes in the than the current node. Other Face Routing (OFR) is
network as possible. The problem of designing a variant of Face Routing (FR). The Face Routing
sleep period schedules for each node in a localized (FR) algorithm is the first one that guarantees
manner was addressed in. In the rest of this section, success if the source and the destination are
we review most of the location or geographic based connected. However, the worst-case cost of FR is
routing protocols. proportional to the size of the network in terms of
number of nodes. The first algorithm that can
GEAR:
The protocol, called Geographic and compete with the best route in the worst-case is the
Energy Aware Routing (GEAR), uses energy aware Adaptive Face Routing (AFR) algorithm.
and geographically-informed neighbor selection Moreover, by a lower bound argument, AFR is
heuristics to route a packet towards the destination shown to be asymptotically worst-case optimal. But
region. The key idea is to restrict the number of AFR is not average-case efficient. OFR utilizes the
interests in directed diffusion by only considering a face structure of planar graphs such that the
27
6. National Conference on Current Trends in Computer Science and Engineering - CSECONF2012
n
message is routed from node s to node t by protocols in wireless sensor networks which have
traversing a series of face boundaries. The aim is to been presented in the literature.
find the best node on the boundary, i.e., the closest Overall, the routing techniques are
e
node to the destination t by using geometric planes. classified based on the network structure into three
When finished, the algorithm returns to s the best categories: SPIN & Directed Diffusion in Flat Flat-
node on the boundary. The simple greedy based, LEACH, PEGASIS & SOP in Hierarchical
Hierarchical-
algorithm behaves well in dense networks, but it based, SPAN & GOFAR in Location
Location-based.
fails for very simple configurations. It was shown
that GOAFR algorithm can achieve both worst worst- REFERENCES
[1] Luca Borsani, Sergio Guglielmi, Alessandro Redondi &
case optimality and average-case efficiency. Based
case
Matteo Cesana, “Tree based Routing protocols in WSN,”
on the simulation results of GOAFR, there are Dipartimento di Elettronica e Informazio
Informazione,Politecnico di
several ways to further improve the average case
average- Milano, Italy
performance. It was also shown that GOAFR [2] Jamal N. Al-Karaki, Ahmed E. Kamal, “
Karaki, “Routing Techniques
in Wireless Sensor Networks: A Survey*,” Dept. of Electrical
outperforms other prominent algorithms, such as
and Computer Engineering
GPSR or AFR [2]. Iowa State University, Ames, Iowa
[3] M.Simek, D.Komosny, R.Burget & J.S.Silva, Multicast
J.S.Silva,”
SPAN: Routing in Wireless Sensor Networks
Networks,” Member, IEEE,
Department of Telecommunications & Department of
Another position based algorithm called
Informatics Engineering
SPAN selects some nodes as coordinators based on [4] Rong Fan, Jian Chen, Jian-Qing Fu, Ling
Qing Ling-Di Ping,” A
their positions. The coordinators form a network Steiner-Based Secure Multicast Routing Protocol for Wireless
Based
backbone that is used to forward messages. A node Sensor Network,” College of Computer Science and
Technology, Zhejiang University, presenting on 2010 Second
,
should become a coordinator if two neighbor of a
neighbors
International Conference on Future Networks Hang Zhou,
Networks,
non-coordinator node cannot reach each other
coordinator China
directly or via one or two coordinators (3 hop [5] Shibo Wu, K. Selc¸uk Candan,” GMP: Distributed
reachability). New and existing coordinators are Geographic Multicast Routing in Wireless Sensor Networks
Networks,”
Department of Computer Science, Arizona State University,
not necessarily neighbors, which, makes the design
Tempe, AZ, USA.
less energy efficient because of the need to [6] Luis Javier García Villalba *, Ana Lucila Sandoval Orozco,
maintain the positions of two or three hop Alicia Triviño Cabrera and Cláudia Jacy Barenco Abbas,”
cia
neighbors in the complicated SPAN algorithm [2]. Routing Protocols in Wireless Sensor Networks”, Department of
Software Engineering and Artificial Intelligence, Ciudad
Universitaria, Madrid, Spain.
Figure 4: Classification and Comparision of
omparision
Routing Protocols in WSN.
V. CONCLUSION
Routing in sensor networks is a new a
area
of research and rapidly growing set of research
results. In this paper, we presented a
comprehensive survey of network structure routing
28