The document discusses routing techniques in wireless sensor networks. It categorizes routing protocols based on network structure into flat-based, hierarchical-based, and location-based approaches. Examples of protocols are described within each category. The document also outlines challenges in wireless sensor networks and categorizes routing protocols based on protocol operation.
This document discusses energy-efficient sensor networks. It defines sensor networks and sensor nodes, which consist of sensing, processing, and communication devices. Common sensor node applications include environmental monitoring, structural health monitoring, medical diagnostics, and more. The document outlines challenges for sensor nodes related to limited resources and need for energy efficiency. It then discusses various techniques for conserving energy at the MAC layer and network layer, including efficient routing protocols like Directed Diffusion, LEACH, and GEAR.
This document discusses wireless sensor network protocols. It covers multi-hop routing, where sensor nodes act as relays to propagate data to the base station. Common routing protocols are discussed, including reactive protocols like AODV that establish routes on demand and proactive protocols like DSDV that maintain routing tables with periodic updates. MAC protocols help manage access to the shared wireless medium and examples covered include S-MAC and B-MAC. The OSI model layers and responsibilities are also summarized.
The document discusses routing protocols in wireless sensor networks. It outlines several key challenges for routing protocols including node deployment, network dynamics, energy conservation, fault tolerance, scalability, and hardware constraints. It then describes several common routing techniques used in wireless sensor networks, including proactive, reactive, and hybrid path establishment approaches, as well as flat, hierarchical, and location-based network structures. Finally, it discusses different protocol operations such as multipath routing, query-based routing, negotiation-based routing, and supporting quality of service metrics.
Energy Efficient Routing Approaches in Ad-hoc NetworksKishan Patel
This document discusses routing approaches and protocols for mobile ad hoc networks (MANETs). It begins with an overview of routing fundamentals and differences between MANET and traditional routing. It then describes the main types of MANET routing protocols - reactive, proactive, and hybrid. For each type, examples are provided such as AODV for reactive and OLSR for proactive. Security challenges in MANET routing are also mentioned. The document concludes with sections on energy efficiency issues, literature review summarizing several energy-efficient routing protocols, and a comparison table of conventional MANET routing protocols.
Location Based Routing Protocols and its Performances in Wireless Sensor Netw...Prashanta Bairagi
This document presents a research paper on location-based routing protocols and their performance in wireless sensor networks. It discusses the objectives, introduction, literature review, motivation, experimental results, conclusion, and future scope of the research. The key points are:
- The objectives are to study different location-based routing protocols, conduct simulations to evaluate their performance based on network parameters, and recommend protocols to improve network performance.
- Location-based routing uses sensor node positions to calculate distances and estimate energy consumption. Protocols discussed include GAF, GEAR, GPSR, and DREAM.
- Simulation results show that GEAR and GPSR perform better than others in terms of data loss and network delay. GEAR
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,
Wireless sensor networks consist of distributed sensors that monitor conditions like temperature and sound and transmit data to a central location. They have two types - structured networks which are pre-planned and unstructured which are randomly deployed. The document reviews issues in wireless sensor networks like energy constraints and quality of service. It also discusses network services, internal sensor systems, applications, and communication protocols. Open research areas are identified in localization, coverage, security, cross-layer optimization and mobility support to improve energy efficiency and performance.
Routing protocols designed for ad hoc wireless networks must address high node mobility, bandwidth constraints, and limited resources. Common issues in designing routing protocols include frequent path breaks due to node movement, overhead of maintaining topology information, and hidden and exposed terminal problems. Ideal routing protocols are distributed, adapt to topology changes quickly, are localized, avoid loops and stale routes, and optimize scarce resources like bandwidth and battery power. Routing protocols can be classified based on how routing information is updated, whether temporal information is used, the network topology, and how resources are utilized.
This document discusses wireless ad hoc and sensor networks and routing protocols. It begins by defining routing as the process of moving data packets from a source to destination, which is usually performed by routers. Common objectives of routing protocols are to route packets along optimal paths while adapting to changing network conditions. Routing protocols are then categorized as link-state or distance-vector protocols. The document also discusses the purposes and challenges of routing in wireless ad hoc networks, as well as requirements for ad hoc routing protocols. Finally, it provides an overview of different types of ad hoc unicast routing protocols, including table-driven, on-demand, and hybrid protocols.
This document provides guidance on writing a research paper, beginning with choosing a topic and developing a thesis statement. It outlines the steps of writing a paper, including selecting and analyzing primary and secondary sources, compiling information, avoiding plagiarism through proper paraphrasing and citation, and including a bibliography. The document emphasizes writing an outline before starting the paper, using multiple credible source types, and thoroughly proofreading the final draft. Research papers require following a process of topic selection, research, organization, citation, and revision to effectively communicate new information and ideas.
The document provides an overview of routing protocols in wireless sensor networks. It discusses several categories of routing protocols including data-centric, hierarchical, and location-based. For hierarchical routing protocols, it summarizes LEACH, PEGASIS, HEED, P-LEACH, H-LEACH, and other variants that aim to improve energy efficiency. It provides brief descriptions of how each protocol operates and highlights drawbacks. The document also summarizes several data-centric routing protocols including Directed Diffusion, Rumor Routing, and their limitations.
This document discusses ad-hoc and mobile ad-hoc networks (MANETs). It defines an ad-hoc network as a wireless local area network where devices are part of the network only during communication sessions. A MANET is defined as a self-configuring network of mobile routers connected by wireless links. The document outlines the network architecture of MANETs and discusses applications, characteristics, requirements, and challenges of routing in these networks. It describes different types of routing protocols for MANETs including proactive, reactive, table-driven, and hybrid protocols.
This document discusses wireless sensor networks and routing protocols for wireless sensor networks. It defines what a wireless sensor network is and its key characteristics. It then discusses objectives like understanding ad hoc network basics and various routing protocols. It covers topics like the differences between WSNs and ad hoc networks, what a network simulator is and reasons for using NS2, various routing techniques like flooding, gossiping, and hierarchical routing. It also discusses routing challenges, wireless nodes, packet transmission, applications and the future scope of WSNs.
This document discusses wireless sensor networks and routing protocols for wireless sensor networks. It defines what a wireless sensor network is and its key characteristics. It then discusses objectives like understanding ad hoc network basics and various routing protocols. It covers topics like the differences between WSNs and ad hoc networks, what a network simulator is and reasons for using NS2, various routing techniques like flooding, gossiping, and hierarchical routing. It also discusses routing challenges, wireless nodes, packet transmission, applications and the future scope of WSNs.
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
This document summarizes several cluster-based routing protocols for wireless sensor networks that aim to improve energy efficiency. It discusses both pre-established protocols like LEACH, EEHC, and HEED, as well as on-demand protocols like Passive Clustering and Energy Level-based Passive Clustering. For each protocol, it describes the key ideas such as random cluster head election, using residual energy to select cluster heads, and rotating cluster head roles to balance energy load among nodes. The document concludes that hierarchical routing protocols can improve energy efficiency but optimal clustering parameters and handling of network dynamics are still challenges.
This document presents an energy aware QoS routing protocol for wireless sensor networks. It finds the least-cost path that meets end-to-end delay requirements for real-time data using a queuing model. The protocol calculates link costs and uses a k-least cost path algorithm to find candidate routes. It then determines the optimal path's r-value, which represents the ratio of real-time to non-real-time bandwidth on each link. Simulation results show the protocol can improve QoS metrics like end-to-end delay while increasing network lifetime.
This document presents an energy aware QoS routing protocol for wireless sensor networks. It finds the least-cost path that meets end-to-end delay requirements for real-time data using a queuing model. The protocol calculates link costs and uses a k-least cost path algorithm to find candidate routes. It then determines the optimal path based on energy consumption and meeting the QoS requirements like end-to-end delay. Simulation results show that the protocol can improve performance with respect to energy efficiency and QoS metrics like delay.
Similar to Routing Techniques in Wireless Sensor Networks.pptx (20)
Numerical comaprison of various order explicit runge kutta methods with matla...DrAzizulHasan1
Numerical analysis is the area of mathematics and computer science that creates, analyzes andimplements numerical methods for solving numerically the problems of continuous mathematics. Such problems originates from real-world applications of algebra, geometry and calculus and they involve variables that vary continuously, such problems occur throughout the natural sciences, social science, engineering, medicine.
Reciprocating Air Compressor and its TypesAtif Razi
Air Compressors
Classification of Air Compressors
Reciprocating Air Compressor
Main Parts of Reciprocating Air Compressor
Working of Reciprocating Air Compressor
Types of Reciprocating Air Compressor
Applications of Reciprocating Air Compressor
Advantages & Disadvantages of Reciprocating Air Compressor
Computer Vision and GenAI for Geoscientists.pptxYohanes Nuwara
Presentation in a webinar hosted by Petroleum Engineers Association (PEA) in 28 July 2023. The topic of the webinar is computer vision for petroleum geoscience.
Structural Dynamics and Earthquake Engineeringtushardatta
Slides are prepared with a lot of text material to help young teachers to teach the course for the first time. This also includes solved problems. This can be used to teach a first course on structural dynamics and earthquake engineering. The lecture notes based on which slides are prepared are available in SCRIBD.
buy a fake University of London diploma supplementGlethDanold
Website: https://www.fakediplomamaker.shop/
Email: diplomaorder2003@gmail.com
Telegram: @fakeidiploma
skype: diplomaorder2003@gmail.com
wechat: jasonwilliam2003
buy bachelor degree from https://www.fakediplomamaker.shop/ to be competitive. Even if you are not already working and you havve just started to explore employment opportunities buy UK degree, buy masters degree from USA, buy bachelor degree from Australia, fake Canadian diploma where to buy diploma in Canada, It's still a great idea to purchase your degree and get a head start in your career. While many of the people your age will enlist in traditional programs and spend years learning you could accumulate valuable working experience. By the time they graduate you will have already solidified a respectable resume boasting both qualification and experience.
This unit explains cartesian coordinate system. This unit also explains different types of coordinate systems like one dimensional, two dimensional and three dimensional system
Good Energy Haus: PHN Presents Building Electrification, A Passive House Symp...TE Studio
Tim Eian's contribution to the Passive House Network's Building Electrification Symposium on July 25, 2024.
Topics covered:
- Our Motivation to Electrify
- The Context of the Project
- The Process of Electrification
- Considerations for Electrification
- Data
- Challenges of Electrification
- Successes
- Opportunities
Thesis on Assessment of Landslide Prone Area and Their Consequences Due to C...
Routing Techniques in Wireless Sensor Networks.pptx
1. ROUTING TECHNIQUES IN
WIRELESS SENSOR NETWORKS:
A
SURVEY
Presented By: Abbas Kazerouni
EE 360 paper presentation, winter 2014,
EE Department, Stanford University
JAMAL N. AL-KARAKI, AHMED E. KAMAL, 2004
1
2. OUTLINE
Challenges in WSNs
Categorization based on Network Structure
Flat-Based Routing
Hierarchical-Based Routing
Location-Based Routing
Categorization based on Protocol Operation
Summary
2
3. CHALLENGES IN WSNS
No global ID addressing
IP-based protocols do not apply
Stationary nodes
Constraints on energy, storage and processing capacity
High redundancy in different sensors’ data
3
6. FLAT-BASED ROUTING PROTOCOLS
1. Sensor Protocol for Information Negotiation (SPIN):
• Sending meta-data to neighboring nodes, instead of data
• Requesting for the desired data
Avoid redundant data transmission
Adaptation to remaining energy increase network lifetime
2. Directed Diffusion:
• BS continuously sends query to the neighboring nodes
• Node with the desired data transmit all the way back to BS
Saving energy by selecting the optimal return path
Not practical for continuous data demand cases
6
7. 7
FLAT-BASED ROUTING PROTOCOLS
3. Rumor Routing:
• Variation of Directed Diffusion
• Each node has an event table
• Event agent flooding instead of query flooding
Significant energy saving
Good for when number of events is less than queries
4. Minimum Cost Forwarding Algorithm (MCFA):
• Each node knows the least cost path between itself and BS
• Least cost path can be acquired via initialization
Saving energy by selecting the optimal return path
Good for small networks 7
8. 8
NETWORK STRUCTURE CATEGORIZATION
8
Routing Protocols
Flat-Based Hierarchical-Based Location-Based
Higher energy nodes for transmission, lower energy nodes for sensing
Two layer routing
Increasing the life time
9. HIERARCHICAL ROUTING
9
1. Low Energy Adaptive Clustering Hierarchy(LEACH):
• Random and variation Cluster Head (CH) selection
• Compression and transmission of arriving data at CHs
Constant monitoring applications
Good for small networks
Extra overhead because of clustering
2. Self Organizing Protocol (SOP):
• Mobile sensors to probe the environment
• Stationary nodes as the routers
• LML algorithm for routing
Energy consumption is less than SPIN
10. 10
HIERARCHICAL ROUTING
10
3. Virtual Grid Architecture
• Symmetric, non-overlapping clusters with optimal CH
• Local and global data aggregation
NP-hard to find the optimal
global aggregators
4. Hierarchical power-aware routing
• Proximate nodes form zones
• Routes through the zones which has
maximum minimum residual energy
Dijkstra algorithm can be exploited
11. 11
11
NETWORK STRUCTURE CATEGORIZATION
11
Routing Protocols
Flat-Based Hierarchical-Based Location-Based
Sensor nodes are addressed based on their location
Location are acquired by GPS or via coordination among nodes
12. 12
LOCATION-BASED ROUTING
12
1. Geographical Adaptive Fidelity (GAF):
• Network divided into zones
• Only one node is awake in each zone, the rest sleep
Conserves energy by turning off unnecessary nodes
Increases the network life time
2. SPAN:
• Some nodes are selected as coordinators based on their positions
• Enough coordinators such that network is three-hop reachable
Not energy efficient as the others
13. ROUTING PROTOCOLS BASED ON PROTOCOL
OPERATION
1. Multipath routing
• Increases fault tolerance
• Sophisticated case: have back up paths
2. Query-based routing
• Query transmitted and the date is sent back
3. Negotiation-based routing
• High-level data description
• Elimination of redundant data transmission
4. QoS-baed routing
• Balance between data quality and energy consumption
13
14. SUMMARY
WSNs needs have specific characteristics.
WSNs need specific routing algorithm.
Large number of algorithms has been designed, but no
optimal one!
Based on the network structure, routing algorithms can be
categorized into 3 main groups.
We briefly discussed some examples of each group. 14