Issues in designing a routing and Transport Layer protocol for Ad hoc networks- proactive
routing, reactive routing (on-demand), hybrid routing- Classification of Transport Layer
solutions-TCP over Ad hoc wireless Networks
Module 1: Introduction Lectures 8 hrs.
Fundamentals of wireless communication technology – the electromagnetic spectrum – radio
propagation mechanisms – characteristics of the wireless channel – Mobile Ad-hoc Networks
(MANETS) and Wireless Sensor Networks (WSNs): concepts and architectures. Applications
of Ad-hoc and sensor networks. Design challenges in Ad-hoc and sensor networks.
The document discusses ad hoc networks and wireless sensor networks. It defines an ad hoc network as a temporary network composed of mobile nodes without preexisting infrastructure that is self-organizing. Wireless sensor networks are introduced as a collection of sensor nodes densely deployed to monitor conditions and cooperatively pass data back to central nodes. The document outlines key characteristics of both networks including their temporary and adaptive nature, multi-hop routing, and challenges of mobility, power constraints, and dynamic topology changes.
LAR utilizes location information to improve routing efficiency by reducing control overhead. It uses GPS to obtain geographical information. There are two zones in LAR - the ExpectedZone where the destination is expected to be, and the RequestZone which is the area where routing packets can propagate. PAR aims to minimize energy consumption per packet by calculating the sum of energy required at each hop. It also aims for maximum network connectivity and uniform distribution of power consumption across all nodes.
The document discusses on-demand driven reactive routing protocols. It provides an overview of table-driven vs on-demand routing protocols and describes two popular on-demand protocols - Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) in detail. DSR uses source routing by adding the complete route to packet headers. AODV maintains routing tables at nodes and relies on dynamically establishing next hop information for routes.
This slide contains the basic and advanced concept of OSPF routing protocol, according to the latest version of Cisco books, and I presented it at IRAN TIC company. In the next slide, I will upload an attractive advanced feature about OSPF.
Unit 4 ec8702 - ad hoc and wireless sensor networks unit -4 mr.darwin nesaku...Darwin Nesakumar
This document provides an overview of sensor network security. It begins with objectives to learn about ad hoc and sensor network security aspects, attacks, and transport layer security issues. It then covers topics like security requirements, challenges in provisioning security, network security attacks categorized by layer (physical, data link, network, transport, application), and possible solutions for jamming, tampering, black hole attacks, and flooding attacks. The document also discusses key distribution, management techniques and procedures, and secure routing protocols like SPINS.
The document discusses ad hoc networks. It defines an ad hoc network as a temporary network connection between devices without fixed infrastructure. Key characteristics of ad hoc networks include dynamic topology, nodes that can freely join and leave, multi-hop routing, and limited bandwidth. The document compares ad hoc networks to wired and managed wireless networks. It also discusses different types of ad hoc networks and routing protocols like DSR and AODV. Applications of ad hoc networks include military operations, conferences, and emergency response situations.
Module 1: Introduction Lectures 8 hrs.
Fundamentals of wireless communication technology – the electromagnetic spectrum – radio
propagation mechanisms – characteristics of the wireless channel – Mobile Ad-hoc Networks
(MANETS) and Wireless Sensor Networks (WSNs): concepts and architectures. Applications
of Ad-hoc and sensor networks. Design challenges in Ad-hoc and sensor networks.
The document discusses ad hoc networks and wireless sensor networks. It defines an ad hoc network as a temporary network composed of mobile nodes without preexisting infrastructure that is self-organizing. Wireless sensor networks are introduced as a collection of sensor nodes densely deployed to monitor conditions and cooperatively pass data back to central nodes. The document outlines key characteristics of both networks including their temporary and adaptive nature, multi-hop routing, and challenges of mobility, power constraints, and dynamic topology changes.
LAR utilizes location information to improve routing efficiency by reducing control overhead. It uses GPS to obtain geographical information. There are two zones in LAR - the ExpectedZone where the destination is expected to be, and the RequestZone which is the area where routing packets can propagate. PAR aims to minimize energy consumption per packet by calculating the sum of energy required at each hop. It also aims for maximum network connectivity and uniform distribution of power consumption across all nodes.
The document discusses on-demand driven reactive routing protocols. It provides an overview of table-driven vs on-demand routing protocols and describes two popular on-demand protocols - Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) in detail. DSR uses source routing by adding the complete route to packet headers. AODV maintains routing tables at nodes and relies on dynamically establishing next hop information for routes.
This slide contains the basic and advanced concept of OSPF routing protocol, according to the latest version of Cisco books, and I presented it at IRAN TIC company. In the next slide, I will upload an attractive advanced feature about OSPF.
Unit 4 ec8702 - ad hoc and wireless sensor networks unit -4 mr.darwin nesaku...Darwin Nesakumar
This document provides an overview of sensor network security. It begins with objectives to learn about ad hoc and sensor network security aspects, attacks, and transport layer security issues. It then covers topics like security requirements, challenges in provisioning security, network security attacks categorized by layer (physical, data link, network, transport, application), and possible solutions for jamming, tampering, black hole attacks, and flooding attacks. The document also discusses key distribution, management techniques and procedures, and secure routing protocols like SPINS.
The document discusses ad hoc networks. It defines an ad hoc network as a temporary network connection between devices without fixed infrastructure. Key characteristics of ad hoc networks include dynamic topology, nodes that can freely join and leave, multi-hop routing, and limited bandwidth. The document compares ad hoc networks to wired and managed wireless networks. It also discusses different types of ad hoc networks and routing protocols like DSR and AODV. Applications of ad hoc networks include military operations, conferences, and emergency response situations.
BGP is the exterior gateway protocol that connects different autonomous systems on the internet. It allows for the exchange of routing and reachability information between these systems. BGP operates using a finite state machine to manage the states of connections between peers. It establishes TCP connections between routers to exchange routing updates and keep connections alive through regular keepalive messages. BGP version 4, defined in RFC 4271, is the current standard implementation which supports features like classless inter-domain routing and route aggregation.
This document provides an overview of wireless communications and mobile technologies. It discusses early wireless technologies from the 1860s through the development of 1G analog cellular networks in the 1980s using technologies like AMPS. 2G digital cellular networks from the 1990s are described that used standards like GSM, CDMA, and TDMA. 2.5G technologies from the early 2000s like GPRS that added packet data capabilities to GSM networks are also summarized. The document covers wireless characteristics, degrees of mobility, wireless network architectures, and comparisons of standards and their data rates.
Mobile ad-hoc networks have frequent host and topology changes with no cellular infrastructure and require multi-hop wireless links for data transmission between nodes. Routing protocols must discover routes between nodes that may not be directly connected. Table-driven protocols like Destination Sequenced Distance Vector (DSDV) and Wireless Routing Protocol (WRP) maintain up-to-date routing tables through periodic broadcasts but generate significant control overhead. DSDV uses sequence numbers to distinguish stale routes and avoid loops while WRP maintains four tables for routing information.
Ultra-wideband (UWB) is a short-range, high-bandwidth wireless technology that can provide data transmission rates up to 480 Mbps. It operates by transmitting short pulses across a wide spectrum of frequency bands between 3.1-10.6 GHz. UWB offers advantages over other wireless technologies like Bluetooth and WiFi by providing faster data transfer speeds, better multipath performance, and precise localization capabilities. Potential applications of UWB include wireless USB, high quality video transmission, and radar/imaging systems.
Routing protocols for ad hoc wireless networks Divya Tiwari
The document discusses routing protocols for ad hoc wireless networks. It outlines several key challenges for these protocols, including mobility, bandwidth constraints, error-prone shared wireless channels, and hidden/exposed terminal problems. It also categorizes routing protocols based on how routing information is updated (proactively, reactively, or through a hybrid approach), whether they use past or future temporal network information, the type of network topology supported (flat or hierarchical), and how they account for specific resources like power.
The document provides an introduction to traffic engineering, which applies statistical analysis methods used for telephony networks to analyze unpredictable user behavior and optimize resource sharing. It describes key concepts in traffic modeling like call arrivals, blocking probability, Erlang units, and the Erlang B and C models for calculating grade of service based on traffic load and number of trunks. The objective of traffic engineering is to provision network resources to minimize costs while meeting quality of service requirements.
MPLS (Multi-Protocol Label Switching) simplifies packet forwarding by assigning labels to packets and using these labels for forwarding instead of long network addresses. It allows for traffic engineering and quality of service by establishing Label Switched Paths (LSPs) to direct different types of traffic over specific paths. MPLS supports various Layer 2 and Layer 3 protocols and improves network performance and scalability compared to traditional IP routing. It is widely used to implement virtual private networks (VPNs) across shared infrastructures.
Ad hoc wireless networks allow devices to connect and communicate with each other without a centralized access point. Nodes in an ad hoc network relay messages through intermediate hops to reach destinations. Examples include Bluetooth networks and wireless mesh networks. Issues in ad hoc networks include medium access control, routing with mobility and bandwidth constraints, and providing quality of service guarantees.
UMTS Long Term Evolution, LTE, is the technology of choice for the majority of network operators worldwide for providing mobile
broadband data and high-speed internet access to their subscriber base. Due to the high commitment LTE is the innovation platform
for the wireless industry for the next decade.
This class will provide the basics of this fascinating technology. After attending this course you will have an understanding of
OFDM-principles including SC-FDMA as the transmission scheme of choice for the LTE uplink. Multiple antenna technology (MIMO),
a fundamental part of LTE, will be explained as well as its impact on the design of device and network architecture. We’ll give a quick
introduction into the evolution of this technology including future upgrades of LTE features like multimedia broadcast, location based
services and increasing bandwidth through carrier aggregation.
The second part of the course will provide an overview including practical examples and exercises on how to test a LTE-capable device
while performing standardized RF measurements such as power, signal quality, spectrum and receiver sensitivity. We’ll address how
to automate these measurements in a simple and cost-effective way. We will introduce application based testing by demonstrating
end-to-end (E2E), throughput and application testing using the Rohde & Schwarz R&S®CMW500 Wideband Radio Communication
Tester. Examples of application tests are voice over LTE, VoLTE or Video over LTE.
This document discusses clustering-based ad hoc routing protocols. It introduces the Clusterhead Gateway Switch Routing (CSGR) protocol, which uses a hierarchical network topology with mobile nodes grouped into clusters led by cluster heads. Each node maintains a cluster member table mapping nodes to cluster heads and a routing table to select the next hop towards the destination cluster head. The Least Cluster Change algorithm aims to minimize changes to cluster heads. The document provides an example routing from node 1 to node 12 and compares CSGR to the table-driven DSDV protocol.
Mobile ad hoc networking: imperatives and challengesguest1b5f71
Mobile ad hoc networks (MANETs) are wireless networks formed dynamically by independent mobile nodes without using pre-existing infrastructure. MANETs have applications in tactical operations, sensor networks, emergency services, and more. Key challenges in MANETs include energy conservation to limit battery drain, providing network security without centralized administration, and ensuring quality of service for applications. Open research areas focus on developing secure routing protocols, improving quality of service, and enabling low power consumption in mobile ad hoc networks.
WIRELESS NETWORKS _ BABU M_ unit 3 ,4 & 5 PPT
EC 6802 WIRELESS NETWORKS PPT
POWER POINT PRESENTAION ON WIRELESS NETWORKS
BABU M
ASST PROFESSOR/ ELECTRONICS AND COMMUNICATION ENGINEERING,
RMK COLLEGE OF ENGINEERING AND TECHNOLOGY
CHENNAI, THIRUVALLUR DISTRICT
ATM is a connection-oriented transfer mode that uses fixed-length cells. It was originally developed for B-ISDN networks. Key aspects of ATM include:
- Cells are 53 bytes, with a 5-byte header and 48-byte payload
- Connections can be permanent (PVC) or switched (SVC)
- Four service categories provide different quality of service guarantees
- Segmentation and reassembly is performed by the ATM adaptation layer to map various data types to cells
This document provides an overview of Dense Wavelength Division Multiplexing (DWDM) technology. It discusses key topics such as optical transmission, DWDM components like multiplexers/demultiplexers and amplifiers, DWDM networks and topologies, and transmission quality parameters. The presentation contains 32 slides and is intended to briefly explain DWDM as a means of achieving effective fiber-optic transmission and increasing bandwidth.
HiperLAN was developed as a wireless local area network standard by ETSI to provide higher data rates than early 802.11 standards. HiperLAN Type 1 achieved data rates up to 2 Mbps for ad hoc networking. HiperLAN Type 2 was later developed to provide connection-oriented service up to 54 Mbps, with quality of service guarantees, security, and flexibility. It uses OFDM in the 5 GHz spectrum for robust transmission. While early products only achieved 25 Mbps, the standard provides a framework for higher speeds as technologies advance. HiperLAN is intended to complement wired networks by providing wireless connectivity in hotspot areas like offices, homes, and public places.
This document summarizes several reactive routing protocols for mobile ad hoc networks (MANETs). Reactive protocols create routes only when needed by a source. Dynamic Source Routing uses route requests and replies to find paths, while Temporally-Ordered Routing Algorithm builds and maintains a directed acyclic graph rooted at destinations. Some protocols aim to improve quality of service or support real-time data streams through techniques like bandwidth estimation and mobility prediction. Source Routing with Local Recovery reduces overhead by allowing intermediate nodes to perform local error recovery using route caches when possible.
The document summarizes the T-MAC protocol, an adaptive energy efficient MAC protocol for wireless sensor networks. It introduces the problems with traditional MAC protocols like idle listening wasting energy. T-MAC reduces idle listening by transmitting messages in bursts and sleeping between bursts. It uses an adaptive duty cycle that ends the active part dynamically based on activation events. Nodes communicate using RTS, CTS, data and ACK packets. The active period ends after no activation for a time TA. The document discusses problems like early sleeping in asymmetric traffic and provides solutions like future RTS and priority for full buffers.
The document discusses GPRS network architecture and processes. It describes how a mobile station (MS) attaches to and detaches from the GPRS network by communicating with the SGSN and HLR. It also describes how a temporary block flow (TBF) is established to enable data transfer between the MS and network. Additionally, it outlines how a packet data protocol (PDP) context is activated and deactivated to manage the subscriber's data session.
The document discusses MAC layer protocols, specifically CSMA/CD and CSMA/CA.
CSMA/CD is used for wired networks and works by having nodes listen to check if the medium is free before transmitting. If a collision is detected, transmission stops and resumes after a backoff time.
CSMA/CA is used for wireless networks and aims to avoid collisions through the use of request to send, clear to send, and acknowledgement frames exchanged between nodes, rather than detecting collisions.
Both protocols reduce collisions compared to simple CSMA, but CSMA/CA is less efficient and cannot completely solve collisions in wireless networks due to issues like hidden terminals.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
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.
BGP is the exterior gateway protocol that connects different autonomous systems on the internet. It allows for the exchange of routing and reachability information between these systems. BGP operates using a finite state machine to manage the states of connections between peers. It establishes TCP connections between routers to exchange routing updates and keep connections alive through regular keepalive messages. BGP version 4, defined in RFC 4271, is the current standard implementation which supports features like classless inter-domain routing and route aggregation.
This document provides an overview of wireless communications and mobile technologies. It discusses early wireless technologies from the 1860s through the development of 1G analog cellular networks in the 1980s using technologies like AMPS. 2G digital cellular networks from the 1990s are described that used standards like GSM, CDMA, and TDMA. 2.5G technologies from the early 2000s like GPRS that added packet data capabilities to GSM networks are also summarized. The document covers wireless characteristics, degrees of mobility, wireless network architectures, and comparisons of standards and their data rates.
Mobile ad-hoc networks have frequent host and topology changes with no cellular infrastructure and require multi-hop wireless links for data transmission between nodes. Routing protocols must discover routes between nodes that may not be directly connected. Table-driven protocols like Destination Sequenced Distance Vector (DSDV) and Wireless Routing Protocol (WRP) maintain up-to-date routing tables through periodic broadcasts but generate significant control overhead. DSDV uses sequence numbers to distinguish stale routes and avoid loops while WRP maintains four tables for routing information.
Ultra-wideband (UWB) is a short-range, high-bandwidth wireless technology that can provide data transmission rates up to 480 Mbps. It operates by transmitting short pulses across a wide spectrum of frequency bands between 3.1-10.6 GHz. UWB offers advantages over other wireless technologies like Bluetooth and WiFi by providing faster data transfer speeds, better multipath performance, and precise localization capabilities. Potential applications of UWB include wireless USB, high quality video transmission, and radar/imaging systems.
Routing protocols for ad hoc wireless networks Divya Tiwari
The document discusses routing protocols for ad hoc wireless networks. It outlines several key challenges for these protocols, including mobility, bandwidth constraints, error-prone shared wireless channels, and hidden/exposed terminal problems. It also categorizes routing protocols based on how routing information is updated (proactively, reactively, or through a hybrid approach), whether they use past or future temporal network information, the type of network topology supported (flat or hierarchical), and how they account for specific resources like power.
The document provides an introduction to traffic engineering, which applies statistical analysis methods used for telephony networks to analyze unpredictable user behavior and optimize resource sharing. It describes key concepts in traffic modeling like call arrivals, blocking probability, Erlang units, and the Erlang B and C models for calculating grade of service based on traffic load and number of trunks. The objective of traffic engineering is to provision network resources to minimize costs while meeting quality of service requirements.
MPLS (Multi-Protocol Label Switching) simplifies packet forwarding by assigning labels to packets and using these labels for forwarding instead of long network addresses. It allows for traffic engineering and quality of service by establishing Label Switched Paths (LSPs) to direct different types of traffic over specific paths. MPLS supports various Layer 2 and Layer 3 protocols and improves network performance and scalability compared to traditional IP routing. It is widely used to implement virtual private networks (VPNs) across shared infrastructures.
Ad hoc wireless networks allow devices to connect and communicate with each other without a centralized access point. Nodes in an ad hoc network relay messages through intermediate hops to reach destinations. Examples include Bluetooth networks and wireless mesh networks. Issues in ad hoc networks include medium access control, routing with mobility and bandwidth constraints, and providing quality of service guarantees.
UMTS Long Term Evolution, LTE, is the technology of choice for the majority of network operators worldwide for providing mobile
broadband data and high-speed internet access to their subscriber base. Due to the high commitment LTE is the innovation platform
for the wireless industry for the next decade.
This class will provide the basics of this fascinating technology. After attending this course you will have an understanding of
OFDM-principles including SC-FDMA as the transmission scheme of choice for the LTE uplink. Multiple antenna technology (MIMO),
a fundamental part of LTE, will be explained as well as its impact on the design of device and network architecture. We’ll give a quick
introduction into the evolution of this technology including future upgrades of LTE features like multimedia broadcast, location based
services and increasing bandwidth through carrier aggregation.
The second part of the course will provide an overview including practical examples and exercises on how to test a LTE-capable device
while performing standardized RF measurements such as power, signal quality, spectrum and receiver sensitivity. We’ll address how
to automate these measurements in a simple and cost-effective way. We will introduce application based testing by demonstrating
end-to-end (E2E), throughput and application testing using the Rohde & Schwarz R&S®CMW500 Wideband Radio Communication
Tester. Examples of application tests are voice over LTE, VoLTE or Video over LTE.
This document discusses clustering-based ad hoc routing protocols. It introduces the Clusterhead Gateway Switch Routing (CSGR) protocol, which uses a hierarchical network topology with mobile nodes grouped into clusters led by cluster heads. Each node maintains a cluster member table mapping nodes to cluster heads and a routing table to select the next hop towards the destination cluster head. The Least Cluster Change algorithm aims to minimize changes to cluster heads. The document provides an example routing from node 1 to node 12 and compares CSGR to the table-driven DSDV protocol.
Mobile ad hoc networking: imperatives and challengesguest1b5f71
Mobile ad hoc networks (MANETs) are wireless networks formed dynamically by independent mobile nodes without using pre-existing infrastructure. MANETs have applications in tactical operations, sensor networks, emergency services, and more. Key challenges in MANETs include energy conservation to limit battery drain, providing network security without centralized administration, and ensuring quality of service for applications. Open research areas focus on developing secure routing protocols, improving quality of service, and enabling low power consumption in mobile ad hoc networks.
WIRELESS NETWORKS _ BABU M_ unit 3 ,4 & 5 PPT
EC 6802 WIRELESS NETWORKS PPT
POWER POINT PRESENTAION ON WIRELESS NETWORKS
BABU M
ASST PROFESSOR/ ELECTRONICS AND COMMUNICATION ENGINEERING,
RMK COLLEGE OF ENGINEERING AND TECHNOLOGY
CHENNAI, THIRUVALLUR DISTRICT
ATM is a connection-oriented transfer mode that uses fixed-length cells. It was originally developed for B-ISDN networks. Key aspects of ATM include:
- Cells are 53 bytes, with a 5-byte header and 48-byte payload
- Connections can be permanent (PVC) or switched (SVC)
- Four service categories provide different quality of service guarantees
- Segmentation and reassembly is performed by the ATM adaptation layer to map various data types to cells
This document provides an overview of Dense Wavelength Division Multiplexing (DWDM) technology. It discusses key topics such as optical transmission, DWDM components like multiplexers/demultiplexers and amplifiers, DWDM networks and topologies, and transmission quality parameters. The presentation contains 32 slides and is intended to briefly explain DWDM as a means of achieving effective fiber-optic transmission and increasing bandwidth.
HiperLAN was developed as a wireless local area network standard by ETSI to provide higher data rates than early 802.11 standards. HiperLAN Type 1 achieved data rates up to 2 Mbps for ad hoc networking. HiperLAN Type 2 was later developed to provide connection-oriented service up to 54 Mbps, with quality of service guarantees, security, and flexibility. It uses OFDM in the 5 GHz spectrum for robust transmission. While early products only achieved 25 Mbps, the standard provides a framework for higher speeds as technologies advance. HiperLAN is intended to complement wired networks by providing wireless connectivity in hotspot areas like offices, homes, and public places.
This document summarizes several reactive routing protocols for mobile ad hoc networks (MANETs). Reactive protocols create routes only when needed by a source. Dynamic Source Routing uses route requests and replies to find paths, while Temporally-Ordered Routing Algorithm builds and maintains a directed acyclic graph rooted at destinations. Some protocols aim to improve quality of service or support real-time data streams through techniques like bandwidth estimation and mobility prediction. Source Routing with Local Recovery reduces overhead by allowing intermediate nodes to perform local error recovery using route caches when possible.
The document summarizes the T-MAC protocol, an adaptive energy efficient MAC protocol for wireless sensor networks. It introduces the problems with traditional MAC protocols like idle listening wasting energy. T-MAC reduces idle listening by transmitting messages in bursts and sleeping between bursts. It uses an adaptive duty cycle that ends the active part dynamically based on activation events. Nodes communicate using RTS, CTS, data and ACK packets. The active period ends after no activation for a time TA. The document discusses problems like early sleeping in asymmetric traffic and provides solutions like future RTS and priority for full buffers.
The document discusses GPRS network architecture and processes. It describes how a mobile station (MS) attaches to and detaches from the GPRS network by communicating with the SGSN and HLR. It also describes how a temporary block flow (TBF) is established to enable data transfer between the MS and network. Additionally, it outlines how a packet data protocol (PDP) context is activated and deactivated to manage the subscriber's data session.
The document discusses MAC layer protocols, specifically CSMA/CD and CSMA/CA.
CSMA/CD is used for wired networks and works by having nodes listen to check if the medium is free before transmitting. If a collision is detected, transmission stops and resumes after a backoff time.
CSMA/CA is used for wireless networks and aims to avoid collisions through the use of request to send, clear to send, and acknowledgement frames exchanged between nodes, rather than detecting collisions.
Both protocols reduce collisions compared to simple CSMA, but CSMA/CA is less efficient and cannot completely solve collisions in wireless networks due to issues like hidden terminals.
Study of Attacks and Routing Protocol in Wireless Networkijsrd.com
Wireless mesh networks (WMNs) are attractive as a new communication paradigm. Ad hoc routing protocols for WMNs are classified into: (1) proactive, (2) reactive, and (3) hybrid approaches. In general, proactive routing is more suitable for a stationary network, while reactive routing is better for a mobile network with a high mobility. In many applications, a node in WMN is mobile but it can fluctuate between being mobile. Wireless mesh networks is an emergent research area, which is becoming important due to the growing amount of nodes in a network.
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.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A SURVEY OF ENHANCED ROUTING PROTOCOLS FOR MANETspijans
This document summarizes and surveys several enhanced routing protocols that have been developed for mobile ad hoc networks (MANETs). It begins by providing background on routing challenges in MANETs and classifications of routing protocols. It then describes several traditional and widely used routing protocols, including DSDV, OLSR, TORA, DSR, and AODV. The document focuses on summarizing several new routing protocols that have been proposed to improve upon existing protocols. It discusses protocols such as BAWB-DSR, CCSR, RAMP, AODV-SBA, CBRP-R, and CBTRP - noting techniques, advantages, and disadvantages of each. The overall purpose is to review
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
Comparing: Routing Protocols on Basis of sleep modeIJMER
The architecture of ad hoc wireless network consists of mobile nodes for communication
without the use of fixed-position routers. The communication between them takes place without
centralized control. Routing is a very crucial issue, so to deal with this routing algorithms must deliver
the packet in significant delay. There are different protocols for handling the mobile environment like
AODV, DSR and OLSR. But this paper will focus on performance of AODV and OLSR routing protocols.
The performance of these protocols is analyzed on two metrics: time and throughput
Routing protocols for ad hoc networks can be classified as table-driven, on-demand, or hybrid. Table-driven protocols maintain fresh routing tables through periodic updates but generate high overhead. On-demand protocols discover routes only when needed via flooding but have high latency. Hybrid protocols combine the advantages of both approaches. Example protocols discussed include DSDV, DSR, AODV, and CGSR.
Performance Comparison and Analysis of Table-Driven and On-Demand Routing Pro...Narendra Singh Yadav
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. In order to facilitate communication within the network, a routing protocol is used to discover routes between nodes. The primary goal of such an ad hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols for mobile ad hoc networks– the Destination Sequenced Distance Vector (DSDV), the table- driven protocol and the Ad hoc On- Demand Distance Vector routing (AODV), an On –Demand protocol and evaluates both protocols based on packet delivery fraction, normalized routing load, average delay and throughput while varying number of nodes, speed and pause time.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
In this paper, we proposed a replacement hybrid multipath routing protocol for
MANET known as Hybrid Multipath Progressive Routing Protocol for MANET (HMPRP),
during this work we improve the performance of accepted MANET routing protocols,
namely, the Ad-hoc On-demand Distance Vector routing protocol and use of their most
popular properties to formulate a replacement Hybrid routing protocol using the received
signal strength. The proposed routing protocol optimizes the information measure usage of
MANETs by reducing the routing overload and overhead. This proposed routing protocol
additionally extends the battery lifetime of the mobile devices by reducing the specified
variety of operations for (i) Route determination (ii) for packet forwarding. Simulation
results are used to draw conclusions regarding the proposed routing algorithm and
compared it with the AODV, OLSR, and ZRP protocol. Experiments carried out based on
this proposed algorithm, shows that better performance are achieved with regard to AODV,
OLSR, and ZRP routing algorithm in terms of packet delivery ratio, throughput, energy
consumed and end-to-end packet delay.
Progressive Routing Protocol using Hybrid Analysis for MANETsidescitation
This document summarizes a research paper that proposes a new hybrid multipath routing protocol for mobile ad hoc networks called Hybrid Multipath Progressive Routing Protocol (HMPRP). It improves upon existing routing protocols like AODV and OLSR by utilizing multiple paths based on received signal strength to increase packet delivery and reduce overhead. Simulation results showed the proposed protocol achieved better performance than AODV, OLSR and ZRP in terms of packet delivery ratio, throughput, energy consumption and delay.
A New Theoretical Approach to Location Based Power Aware RoutingIOSR Journals
This document proposes a new theoretical approach to location based power aware routing in mobile ad hoc networks (MANETs). It aims to extend the network lifetime by improving power utilization during routing. The approach uses nodes' location information, remaining battery power, and bandwidth status to assign link stability and select routes with lower "uptime values" and minimum bandwidth over time. This is hypothesized to better utilize nodes' power sources and bandwidth. The document outlines calculating a root up time factor for each node based on its power backup and required power, and only using nodes with maximum backup. It concludes future work will design and validate a new protocol based on this approach.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
The document summarizes a study that evaluated the performance of three mobile ad hoc network (MANET) routing protocols: AODV, DSDV, and DSR. The protocols were simulated using the NS-2 network simulator across networks of 30 to 70 nodes. Key performance metrics analyzed include packet delivery fraction, average end-to-end delay, normalized routing load, and packet loss. The results found that AODV performed best in terms of packet delivery fraction and shortest end-to-end delay, while DSDV had the lowest normalized routing load and DSR had the lowest packet loss. Overall, the document compares the performance of these three MANET routing protocols under different conditions using simulation results.
Abstract— A MANETs is a self-configuring network is a collection of mobile hosts that are connected via a wireless link. Opportunistic data forwarding has drawn much attention in the research community of multihop wireless networks. Opportunistic data forwarding is the lack of an efficient, lightweight proactive routing scheme with strong source routing capability. In this project proposed to a lightweight proactive source routing (PSR) protocol. PSR can be maintained at different network topology information than distance vector (DV), link state (LS), optimized link State routing (OLSR), then reactive source routing [e.g., dynamic source routing (DSR)]. In this project concentrate on reducing the overhead at the base line protocols, then testing to the better data transportation. Network Simulator (NS-2) help in testing and implementing to this project for effectively reduced to the overhead in the data transportation.
Tree Based Proactive Source Routing Protocol for MANETspaperpublications3
bstract: A mobile adhoc network (MANET) is a wireless communication network and the node that does not lie within the direct transmission range of each other depends on the intermediate nodes to forward data. Opportunistic data forwarding has not been widely utilized in mobile adhoc networks (MANETs) and the main reason is the lack of an efficient lightweight proactive routing scheme with strong source routing capability. PSR protocol facilitates opportunistic data forwarding in MANETs. In PSR, each node maintains a breadth-first search spanning tree of the network rooted at it-self. This information is periodically exchanged among neighboring nodes for updated network topology information. Here added a Mobile sink to reduce the overhead in case of number of child node increases and also to reduce the delay.
Load aware and load balancing using aomdv routing in manetijctet
1. The document discusses load aware and load balancing techniques using multipath routing in mobile ad hoc networks (MANETs).
2. It notes that effective load balancing is challenging in MANETs due to their dynamic nature and topology changes. Nodes can differ significantly in communication and processing capabilities.
3. The paper proposes identifying multiple routing backbones from source to destination using intermediate nodes with better capabilities, to improve load balancing, quality of service, and congestion control based on network traffic levels and node loads.
Load aware and load balancing using aomdv routing in manetijctet
This document discusses load aware and load balancing techniques using multipath routing in mobile ad hoc networks (MANETs). It proposes using a location aided routing (LAR) protocol with the Ad-hoc On-demand Multipath Distance Vector (AOMDV) routing protocol to identify multiple routing backbones from the source to destination nodes based on the intermediate nodes' communication and processing capabilities. This helps distribute traffic loads evenly across multiple paths to improve load balancing, reduce congestion, and enhance quality of service in the MANET.
IRJET- Survey on Enhancement of Manet Routing ProtocolIRJET Journal
This document discusses routing protocols for mobile ad hoc networks (MANETs). It provides an overview of several popular routing protocols, including AODV, DSDV, DSR, AOMDV and discusses their advantages and disadvantages. The document aims to analyze how the AOMDV protocol could be improved, for example by considering nodes' remaining battery power. It proposes developing a new routing algorithm based on this to achieve better performance than existing protocols.
This document discusses mobile ad-hoc networks (MANETs) and wireless sensor networks (WSNs). It defines a MANET as a network formed spontaneously by wireless mobile nodes without any preexisting infrastructure. Key characteristics of MANETs include dynamic topologies, energy-constrained operation, limited bandwidth, and security threats. Applications include collaborative work, crisis management, and personal area networks. The document also describes different routing protocols for MANETs including table-driven, source-initiated, and hybrid protocols. It then discusses challenges in WSNs such as ad-hoc deployment, limited resources, scalability, and fault tolerance and how these influence routing protocol design.
This document analyzes the effect of node density on different routing protocols under FTP and HTTP applications. It simulates scenarios with varying node densities (20-130 nodes) using routing protocols AODV, DSR, GRP and OLSR. Key quality of service (QoS) metrics - throughput, delay, network load and packet delivery ratio - are evaluated and compared. The results show that OLSR generally performs best in terms of throughput and delay for both FTP and HTTP applications. GRP performs best for network load, while AODV has the highest packet delivery ratio for FTP. In conclusion, OLSR is the best overall routing protocol for supporting FTP and HTTP applications in mobile ad-hoc networks according to
Similar to Module 3: Routing Protocols and Transport Layer in Ad-hoc Networks (20)
This project report was submitted by 4 students from Sitamarhi Institute of Technology for their Bachelor of Technology degree in Computer Science and Engineering. It documents their project work on an unspecified topic for partial fulfillment of their degree requirements. The report includes declarations by the students and their guide, acknowledgments, and outlines the introduction, related work, objectives, requirements, proposed work, system design, code, results, conclusion, and references. It was certified by the guide and head of the department.
Cyber security concepts and terminology are introduced, including the CIA triad of confidentiality, integrity, and availability. Various cyber attacks, threats, and exploits are defined, such as denial of service attacks, social engineering, and zero-day exploits. Information gathering techniques like footprinting, scanning, and enumeration are explained. Free and open source tools for scanning networks, including Nmap and Zenmap, are also covered.
The document discusses various types of malware like viruses, worms, trojans, spyware, ransomware, and backdoors. It explains what malware is, how it infects systems, and its objectives. Various malware analysis techniques like static analysis, dynamic analysis, code analysis, and behavioral analysis are also summarized. The document also discusses antivirus software, how it works, and examples like Bitdefender, Avast, and Panda. It covers memory management techniques and task management.
The document discusses several topics related to cyber security including biometrics, mobile device hardening, web application security, identity management for web services, authorization patterns, security considerations, and challenges. Specifically, it provides best practices for securing evolving technologies, mobile devices, web servers, web services, implementing identity management, common authorization patterns, important security considerations, and challenges related to implementing security.
The document discusses cybersecurity laws, regulations, and forensics. It provides an overview of cyber laws, which govern internet usage and cybercrimes. Cyber forensics is the process of collecting and analyzing digital evidence for cybercrime investigations. The document also discusses India's National Cyber Security Policy 2013, which aims to create a secure cyber environment in India through public-private partnerships and developing cybersecurity skills. Cybersecurity standards and the roles of governments and the private sector in ensuring cybersecurity are also summarized.
This document provides an overview of cyber security topics including cryptography, cryptanalysis, symmetric and asymmetric key cryptography, hashing, digital signatures, firewalls, user management, and virtual private networks (VPNs). It defines these terms and concepts, compares different techniques like symmetric vs asymmetric cryptography, and packet filtering vs stateful inspection firewalls. The document also discusses the importance of using firewalls and how VPNs can provide privacy and anonymity online.
This document provides an overview of various topics related to cyber security including infrastructure and network security, system security, server security, operating system (OS) security, physical security, network packet sniffing, network design simulation, denial of service (DOS) and distributed denial of service (DDOS) attacks, asset management and audits, intrusion detection and prevention techniques, host-based intrusion prevention systems, security information management, network session analysis, system integrity validation, and some open-source, free and trial tools that can be used for security purposes like DOS/DDOS attacks, packet sniffing, firewalls, and intrusion detection.
The document discusses several topics related to cyber security including vulnerabilities, safeguards, internet security, cloud computing security, and social network security. Some common cyber security vulnerabilities mentioned are weak passwords, outdated software, phishing attacks, malware, and data breaches. Safeguards to address these vulnerabilities include strong passwords, regular software updates, employee training, encryption, access controls and monitoring. The document also outlines security challenges and mitigation strategies for internet usage, cloud computing and social media platforms.
Photosynthesis converts light energy to chemical energy in chloroplasts using chlorophyll. Chloroplasts contain thylakoids which are stacked to form grana. Photosynthesis uses carbon dioxide, water, and light energy to produce glucose and oxygen. The light reactions in thylakoid membranes use photosystems to split water, producing ATP, NADPH, and oxygen. The Calvin cycle in the chloroplast stroma uses ATP and NADPH to reduce carbon dioxide into glucose.
This document discusses different types of gene interactions and single gene disorders. It describes how gene expression can be affected by other genes, either through allelic or non-allelic interaction. Epistasis occurs when a gene's effect depends on the presence or absence of other genes. Single gene disorders can result from mutations in dominant, recessive, or X-linked genes. X-linked disorders particularly affect males since they only have one X chromosome.
Genetics is the scientific study of heredity and inherited variations. Offspring acquire genes from parents through the inheritance of chromosomes. Sexual reproduction combines genes from two parents, leading to genetically diverse offspring. Meiosis produces haploid gametes with one set of chromosomes through two cell divisions in the ovaries and testes. During fertilization, the egg and sperm unite forming a zygote that develops into a multicellular organism through mitosis.
1. The document discusses the key differences between science and engineering. Science aims to understand natural laws through observation, while engineering applies scientific knowledge to solve problems and develop new technologies.
2. It also discusses the importance of studying biology for engineers. Biology can help engineers understand living systems and inspire new designs. It can also help solve problems involving biological processes.
3. The document then answers several questions about basic biology concepts. It defines biology and lists the key characteristics of living organisms. It also explains concepts like Mendel's laws of inheritance, gene interaction, the genetic code, and compares mechanisms of bird flight and aircraft flight.
Enzymes are globular proteins that act as biological catalysts, speeding up chemical reactions without being consumed. They are typically named after their substrate with the suffix "-ase". Enzyme activity can be monitored by measuring changes in substrate or product concentration. Mass spectrometry provides an alternative detection method without needing a chromophore. The enzyme binds its substrate at the active site, forming an enzyme-substrate complex. This lowers the activation energy and allows the reaction to proceed, with the unaltered enzyme then dissociating to catalyze more reactions. Kinetic analysis reveals the individual reaction steps and how enzyme activity is controlled.
Gregor Mendel conducted experiments breeding pea plants to discover the basic principles of heredity. He found that organisms have discrete factors (now known as genes) that determine traits, which exist in two versions (alleles). During reproduction, parents contribute one of each allele to offspring randomly. Mendel also discovered that traits are inherited independently and that dominant alleles mask recessive alleles when both are present. His work formed the basis of classical genetics and established the laws of segregation and independent assortment.
Microbiology is the study of single-celled organisms called microorganisms. Microorganisms are classified into three domains: Archaea, Bacteria, and Eukarya. They are identified using staining techniques, molecular and phylogenetic analysis, growth in special media, microscopy, and other methods. Microscopes, including light microscopes and electron microscopes, are important tools used to visualize microorganisms. Light microscopes use visible light while electron microscopes use electron beams. Microorganisms demonstrate flexibility in surviving extreme environments and use various energy and carbon sources. Studying them provides insights into relationships between life and the environment.
The document discusses biology concepts including the differences between science and engineering, the need for engineers to study biology, the definition and characteristics of living organisms, the working principles of the human eye and digital cameras, Mendel's laws of inheritance, genetic code, gene interaction, and epistasis. It provides detailed explanations of these concepts through examples and definitions in response to multiple questions. The key points are that science aims to understand nature while engineering applies scientific knowledge, biology is relevant for engineering fields involving living systems, and genetics concepts such as Mendel's laws, genetic code, and gene interaction help explain inheritance and variation in traits.
This document discusses the classification of life and the hierarchy of life forms. It notes that biologists categorize organisms into groups and subgroups to make their study easier. Classification is based on characteristics like morphology, anatomy, biochemistry, and ecology. All living things share common themes of organization, information processing, energy and matter transformation, and interactions at different hierarchical levels. Cells are the basic unit of life, and while they can differ, they all descend from earlier cells and share common features. Organisms are classified as unicellular or multicellular depending on whether they are composed of single or multiple cells.
Amino acids are organic molecules that contain an amine group, a carboxyl group, a central carbon atom called the alpha carbon, and a variable side chain. There are 20 common amino acids that differ in their side chains and physical/chemical properties. Amino acids can polymerize through peptide bonds between their carboxyl and amine groups to form polypeptides. Polypeptides are linear chains of amino acids that can further fold into three-dimensional protein structures and carry out biological functions.
Biology is the scientific study of life and living organisms. It explores the structure, function, development, behavior, and evolution of living things through various subdisciplines. The fundamental units of biology are the cell, genes, and evolution. Biology seeks to understand the mechanisms that allow living things to maintain their internal organization and adapt to environmental changes.
Paradigm Shifts in User Modeling: A Journey from Historical Foundations to Em...Erasmo Purificato
Slide of the tutorial entitled "Paradigm Shifts in User Modeling: A Journey from Historical Foundations to Emerging Trends" held at UMAP'24: 32nd ACM Conference on User Modeling, Adaptation and Personalization (July 1, 2024 | Cagliari, Italy)
What Not to Document and Why_ (North Bay Python 2024)Margaret Fero
We’re hopefully all on board with writing documentation for our projects. However, especially with the rise of supply-chain attacks, there are some aspects of our projects that we really shouldn’t document, and should instead remediate as vulnerabilities. If we do document these aspects of a project, it may help someone compromise the project itself or our users. In this talk, you will learn why some aspects of documentation may help attackers more than users, how to recognize those aspects in your own projects, and what to do when you encounter such an issue.
These are slides as presented at North Bay Python 2024, with one minor modification to add the URL of a tweet screenshotted in the presentation.
Performance Budgets for the Real World by Tammy EvertsScyllaDB
Performance budgets have been around for more than ten years. Over those years, we’ve learned a lot about what works, what doesn’t, and what we need to improve. In this session, Tammy revisits old assumptions about performance budgets and offers some new best practices. Topics include:
• Understanding performance budgets vs. performance goals
• Aligning budgets with user experience
• Pros and cons of Core Web Vitals
• How to stay on top of your budgets to fight regressions
Data Protection in a Connected World: Sovereignty and Cyber Securityanupriti
Delve into the critical intersection of data sovereignty and cyber security in this presentation. Explore unconventional cyber threat vectors and strategies to safeguard data integrity and sovereignty in an increasingly interconnected world. Gain insights into emerging threats and proactive defense measures essential for modern digital ecosystems.
How RPA Help in the Transportation and Logistics Industry.pptxSynapseIndia
Revolutionize your transportation processes with our cutting-edge RPA software. Automate repetitive tasks, reduce costs, and enhance efficiency in the logistics sector with our advanced solutions.
AC Atlassian Coimbatore Session Slides( 22/06/2024)apoorva2579
This is the combined Sessions of ACE Atlassian Coimbatore event happened on 22nd June 2024
The session order is as follows:
1.AI and future of help desk by Rajesh Shanmugam
2. Harnessing the power of GenAI for your business by Siddharth
3. Fallacies of GenAI by Raju Kandaswamy
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/07/intels-approach-to-operationalizing-ai-in-the-manufacturing-sector-a-presentation-from-intel/
Tara Thimmanaik, AI Systems and Solutions Architect at Intel, presents the “Intel’s Approach to Operationalizing AI in the Manufacturing Sector,” tutorial at the May 2024 Embedded Vision Summit.
AI at the edge is powering a revolution in industrial IoT, from real-time processing and analytics that drive greater efficiency and learning to predictive maintenance. Intel is focused on developing tools and assets to help domain experts operationalize AI-based solutions in their fields of expertise.
In this talk, Thimmanaik explains how Intel’s software platforms simplify labor-intensive data upload, labeling, training, model optimization and retraining tasks. She shows how domain experts can quickly build vision models for a wide range of processes—detecting defective parts on a production line, reducing downtime on the factory floor, automating inventory management and other digitization and automation projects. And she introduces Intel-provided edge computing assets that empower faster localized insights and decisions, improving labor productivity through easy-to-use AI tools that democratize AI.
Video traffic on the Internet is constantly growing; networked multimedia applications consume a predominant share of the available Internet bandwidth. A major technical breakthrough and enabler in multimedia systems research and of industrial networked multimedia services certainly was the HTTP Adaptive Streaming (HAS) technique. This resulted in the standardization of MPEG Dynamic Adaptive Streaming over HTTP (MPEG-DASH) which, together with HTTP Live Streaming (HLS), is widely used for multimedia delivery in today’s networks. Existing challenges in multimedia systems research deal with the trade-off between (i) the ever-increasing content complexity, (ii) various requirements with respect to time (most importantly, latency), and (iii) quality of experience (QoE). Optimizing towards one aspect usually negatively impacts at least one of the other two aspects if not both. This situation sets the stage for our research work in the ATHENA Christian Doppler (CD) Laboratory (Adaptive Streaming over HTTP and Emerging Networked Multimedia Services; https://athena.itec.aau.at/), jointly funded by public sources and industry. In this talk, we will present selected novel approaches and research results of the first year of the ATHENA CD Lab’s operation. We will highlight HAS-related research on (i) multimedia content provisioning (machine learning for video encoding); (ii) multimedia content delivery (support of edge processing and virtualized network functions for video networking); (iii) multimedia content consumption and end-to-end aspects (player-triggered segment retransmissions to improve video playout quality); and (iv) novel QoE investigations (adaptive point cloud streaming). We will also put the work into the context of international multimedia systems research.
Coordinate Systems in FME 101 - Webinar SlidesSafe Software
If you’ve ever had to analyze a map or GPS data, chances are you’ve encountered and even worked with coordinate systems. As historical data continually updates through GPS, understanding coordinate systems is increasingly crucial. However, not everyone knows why they exist or how to effectively use them for data-driven insights.
During this webinar, you’ll learn exactly what coordinate systems are and how you can use FME to maintain and transform your data’s coordinate systems in an easy-to-digest way, accurately representing the geographical space that it exists within. During this webinar, you will have the chance to:
- Enhance Your Understanding: Gain a clear overview of what coordinate systems are and their value
- Learn Practical Applications: Why we need datams and projections, plus units between coordinate systems
- Maximize with FME: Understand how FME handles coordinate systems, including a brief summary of the 3 main reprojectors
- Custom Coordinate Systems: Learn how to work with FME and coordinate systems beyond what is natively supported
- Look Ahead: Gain insights into where FME is headed with coordinate systems in the future
Don’t miss the opportunity to improve the value you receive from your coordinate system data, ultimately allowing you to streamline your data analysis and maximize your time. See you there!
Are you interested in dipping your toes in the cloud native observability waters, but as an engineer you are not sure where to get started with tracing problems through your microservices and application landscapes on Kubernetes? Then this is the session for you, where we take you on your first steps in an active open-source project that offers a buffet of languages, challenges, and opportunities for getting started with telemetry data.
The project is called openTelemetry, but before diving into the specifics, we’ll start with de-mystifying key concepts and terms such as observability, telemetry, instrumentation, cardinality, percentile to lay a foundation. After understanding the nuts and bolts of observability and distributed traces, we’ll explore the openTelemetry community; its Special Interest Groups (SIGs), repositories, and how to become not only an end-user, but possibly a contributor.We will wrap up with an overview of the components in this project, such as the Collector, the OpenTelemetry protocol (OTLP), its APIs, and its SDKs.
Attendees will leave with an understanding of key observability concepts, become grounded in distributed tracing terminology, be aware of the components of openTelemetry, and know how to take their first steps to an open-source contribution!
Key Takeaways: Open source, vendor neutral instrumentation is an exciting new reality as the industry standardizes on openTelemetry for observability. OpenTelemetry is on a mission to enable effective observability by making high-quality, portable telemetry ubiquitous. The world of observability and monitoring today has a steep learning curve and in order to achieve ubiquity, the project would benefit from growing our contributor community.
Blockchain and Cyber Defense Strategies in new genre timesanupriti
Explore robust defense strategies at the intersection of blockchain technology and cybersecurity. This presentation delves into proactive measures and innovative approaches to safeguarding blockchain networks against evolving cyber threats. Discover how secure blockchain implementations can enhance resilience, protect data integrity, and ensure trust in digital transactions. Gain insights into cutting-edge security protocols and best practices essential for mitigating risks in the blockchain ecosystem.
An invited talk given by Mark Billinghurst on Research Directions for Cross Reality Interfaces. This was given on July 2nd 2024 as part of the 2024 Summer School on Cross Reality in Hagenberg, Austria (July 1st - 7th)
How to Avoid Learning the Linux-Kernel Memory ModelScyllaDB
The Linux-kernel memory model (LKMM) is a powerful tool for developing highly concurrent Linux-kernel code, but it also has a steep learning curve. Wouldn't it be great to get most of LKMM's benefits without the learning curve?
This talk will describe how to do exactly that by using the standard Linux-kernel APIs (locking, reference counting, RCU) along with a simple rules of thumb, thus gaining most of LKMM's power with less learning. And the full LKMM is always there when you need it!
The Rise of Supernetwork Data Intensive ComputingLarry Smarr
Invited Remote Lecture to SC21
The International Conference for High Performance Computing, Networking, Storage, and Analysis
St. Louis, Missouri
November 18, 2021
How Netflix Builds High Performance Applications at Global ScaleScyllaDB
We all want to build applications that are blazingly fast. We also want to scale them to users all over the world. Can the two happen together? Can users in the slowest of environments also get a fast experience? Learn how we do this at Netflix: how we understand every user's needs and preferences and build high performance applications that work for every user, every time.
Module 3: Routing Protocols and Transport Layer in Ad-hoc Networks
1. UNIT III:
Routing Protocols And Transport Layer In Ad Hoc Wireless Networks:
Routing Protocol: Issues in designing a routing protocol for Ad hoc networks,
Classification: proactive routing, reactive routing (on-demand), hybrid routing,
Transport Layer protocol for Ad hoc networks, Design Goals of a Transport Layer
Protocol for Ad Hoc Wireless Networks, Classification of Transport Layer
solutions,TCP over Ad hoc wireless, Network Security: Security in Ad Hoc Wireless
Networks, Network Security Requirements.
Issues in designing a routing protocol for Ad hoc networks,
The major challenges that a routing protocol designed for ad hoc wireless networks faces
are:
Network topology is highly dynamic due to movement of nodes. hence, an ongoing session
suffers frequent path breaks.
Disruption occurs due to the movement of either intermediate nodes in the path or end
nodes .
Wired network routing protocols cannot be used in adhoc wireless networks because
the nodes are here are not stationary and the convergence is very slow in wired
networks.
Mobility of nodes results in frequently changing network topologies
Routing protocols for ad hoc wireless networks must be able to perform efficient and
effective mobility management.
Abundant bandwidth is available in wired networks due to the advent of fiber optics
and due to the exploitation of wavelength division multiplexing (WDM) technologies.
In a wireless network, the radio band is limited, and hence the data rates it can offer
are much less than what a wired network can offer.
This requires that the routing protocols use the bandwidth optimally by keeping the
overhead as low as possible.
The limited bandwidth availability also imposes a constraint on routing protocols in
maintaining the topological information.
The broadcast nature of the radio channel poses a unique challenge in ad hoc wireless
networks.
The wireless links have time-varying characteristics in terms of link capacity and
link-error probability.
This requires that the adhoc wireless network routing protocol interact with the MAC
layer to find alternate routes through better-quality links.
Transmissions in ad hoc wireless networks result in collisions of data and control
packets.
Therefore, it is required that ad hoc wireless network routing protocols find paths
with less congestion.
The hidden terminal problem refers to the collision of packets at a receiving node due
to the simultaneous transmission of those nodes that are not within the direct
transmission range of the receiver, but are within the transmission range of the
receiver.
Collision occurs when both nodes transmit packets at the same time without knowing
about the transmission of each other.
Classification:
2. Based on the Routing Information Update Mechanism
Ad hoc wireless network routing protocols can be classified into 3 major categories based on
the routing information update mechanism. They are:
Proactive routing protocols :
These are also known as table-driven routing protocols. Each mobile node maintains a
separate routing table which contains the information of the routes to all the possible
destination mobile nodes.
Since the topology in the mobile ad-hoc network is dynamic, these routing tables are
updated periodically as and when the network topology changes. It has a limitation that is
doesn’t work well for the large networks as the entries in the routing table becomes too large
since they need to maintain the route information to all possible nodes.
Every node maintains the network topology information in the form of routing tables by
periodically exchanging routing information.
Routing information is generally flooded in the whole network.
Whenever a node requires a path to a destination, it runs an appropriate path-finding
algorithm on the topology information it maintains.
1.Destination Sequenced Distance Vector Routing Protocol (DSDV):
It is a pro-active/table driven routing protocol. It actually extends the distance vector
routing protocol of the wired networks as the name suggests. It is based on the Bellman-
ford routing algorithm. Distance vector routing protocol was not suited for mobile ad-hoc
networks due to count-to-infinity problem. Hence, as a solution Destination Sequenced
Distance Vector Routing Protocol (DSDV) came into picture.
Destination sequence number is added with every routing entry in the routing table
maintained by each node. A node will include the new update in the table only if the
entry consists of the new updated route to the destination with higher sequence number.
2. Global State Routing (GSR):
It is a pro-active/table driven routing protocol. It actually extends the link state routing of
the wired networks. It is based on the Dijkstra’s routing algorithm. Link state routing
protocol was not suited for mobile ad-hoc networks because in it, each node floods the link
state routing information directly into the whole network i.e. Global flooding which may
lead to the congestion of control packets in the network.
3. Hence, as a solution Global State Routing Routing Protocol (GSR) came into the picture.
Global state routing doesn’t flood the link state routing packets globally into the network.
In GSR, each of the mobile node maintains one list and three tables namely, adjacency list,
topology table, next hop table and distance table.
Reactive routing protocols:
These are also known as on-demand routing protocol. In this type of routing, the route is
discovered only when it is required/needed. The process of route discovery occurs by
flooding the route request packets throughout the mobile network. It consists of two major
phases namely, route discovery and route maintenance.
Do not maintain the network topology information.
It Obtains the necessary path when it is required, by using a connection establishment
process.
Dynamic Source Routing protocol (DSR):
It is a reactive/on-demand routing protocol. In this type of routing, the route is discovered
only when it is required/needed. The process of route discovery occurs by flooding the route
request packets throughout the mobile network.
It consists of two phases:
Route Discovery:
This phase determines the most optimal path for the transmission of data packets between
the source and the destination mobile nodes.
Route Maintenance:
This phase performs the maintenance work of the route as the topology in the mobile ad-
hoc network is dynamic in nature and hence, there are many cases of link breakage
resulting in the network failure between the mobile nodes.
Ad-Hoc On Demand Vector Routing protocol (AODV):
It is a reactive/on-demand routing protocol. It is an extension of dynamic source routing
protocol (DSR) and it helps to remove the disadvantage of dynamic source routing
protocol. In DSR, after route discovery, when the source mobile node sends the data packet
to the destination mobile node, it also contains the complete path in its header. Hence, as
the network size increases, the length of the complete path also increases and the data
packet’s header size also increases which makes the whole network slow.
Hence, Ad-Hoc On Demand Vector Routing protocol came as solution to it. The
main difference lies in the way of storing the path, AODV stores the path in the
routing table whereas DSR stores it in the data packet’s header itself. It also
operates in two phases in the similar fashion: Route discovery and Route
maintenance.
Hybrid routing protocols:
It basically combines the advantages of both, reactive and pro-active routing protocols.
These protocols are adaptive in nature and adapts according to the zone and position of the
source and destination mobile nodes. One of the most popular hybrid routing protocol
is Zone Routing Protocol (ZRP).
The whole network is divided into different zones and then the position of source and
destination mobile node is observed. If the source and destination mobile nodes are present
in the same zone, then proactive routing is used for the transmission of the data packets
between them. And if the source and destination mobile nodes are present in different
zones, then reactive routing is used for the transmission of the data packets between them.
Combine the best features of the above two categories.
4. Nodes within a certain distance from the node concerned, or within a particular
geographical region, are said to be within the routing zone of the given node.
For routing within this zone, a table-driven approach is used.
For nodes that are located beyond this zone, an on-demand approach is used.
Transport Layer protocol for Ad hoc networks
• The objectives of a transport layer protocol include setting up of:
• End-to-end connection
• End-to-end delivery of data packets
• Flow control
• Congestion control
• Transport layer protocols
• User Datagram Protocol (UDP): It is simplest Transport Layer
communication protocol available of the TCP/IP protocol suite. It involves
minimum amount of communication mechanism. Unreliable and connection-
less transport layer protocols. It send short packets of data, called datagrams.
• Transmission Control Protocol (TCP): It is one of the main protocols in
TCP/IP networks. Whereas the IP protocol deals only with packets, TCP
enables two hosts to establish a connection and exchange streams of data. TCP
guarantees delivery of data and the delivery in the same order in which they
were sent. It is reliable, byte-stream-based, and connection-oriented transport
layer protocols.
• These traditional wired transport layer protocols are not suitable for ad hoc wireless
networks.
Issues :
Issues while designing a transport layer protocol for ad hoc wireless networks:
Induced traffic refers to the traffic at any given link due to the relay traffic through
neighboring links.
• Induced throughput unfairness refers to the throughput unfairness at the transport
layer due to the throughput/delay unfairness existing at the lower layers such as the
network and MAC layers.
• Separation of congestion control, reliability, and flow control could improve the
performance of the transport layer.
• Power and bandwidth constraints affects the performance of a transport layer
protocol.
• Misinterpretation of congestion occurs in ad hoc wireless networks.
• Completely decoupled transport layer needs to adapt to the changing network
environment.
• Dynamic topology affects the performance of a transport layer.
Design Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks
The following are the important goals to be met while designing a transport layer
protocol for ad hoc wireless networks:
• The protocol should maximize the throughput per connection.
• It should provide throughput fairness across contending flows.
• The protocol should incur minimum connection setup and connection maintenance
overheads. It should minimize the resource requirements for setting
up and maintaining the connection in order to make the protocol scalable in
large networks.
• The transport layer protocol should have mechanisms for congestion control
5. and flow control in the network.
• It should be able to provide both reliable and unreliable connections as per
the requirements of the application layer.
• The protocol should be able to adapt to the dynamics of the network such as
the rapid change in topology and changes in the nature of wireless links from
uni-directional to bidirectional or vice versa.
• One of the important resources, the available bandwidth, must be used efficiently.
• The protocol should be aware of resource constraints such as battery power
and buffer sizes and make efficient use of them.
• The transport layer protocol should make use of information from the lower
layers in the protocol stack for improving the network throughput.
• It should have a well-defined cross-layer interaction framework for effective,
scalable, and protocol-independent interaction with lower layers.
• The protocol should maintain end-to-end semantics.
Classification of Transport Layer solutions
The top-level classification divides the protocols as extensions
of TCP for ad hoc wireless networks and other transport layer protocols which
are not based on TCP. The solutions for TCP over ad hoc wireless networks can
further be classified into split approaches and end-to-end approaches.
TCP over Ad hoc wireless
The transmission control protocol (TCP) is the most predominant transport layer
protocol in the Internet today. It transports more than 90% percent of the traffic
on the Internet. Its reliability, end-to-end congestion control mechanism, bytestream
transport mechanism, and, above all, its elegant and simple design have
not only contributed to the success of the Internet, but also have made TCP an
influencing protocol in the design of many of the other protocols and applications.
Its adaptability to the congestion in the network has been an important feature
leading to graceful degradation of the services offered by the network at times of
extreme congestion. TCP in its traditional form was designed and optimized only
for wired networks. Extensions of TCP that provide improved performance across
wired and single-hop wireless networks were discussed in Chapter 4. Since TCP is
6. widely used today and the efficient integration of an ad hoc wireless network with
the Internet is paramount wherever possible, it is essential to have mechanisms that
can improve TCP’s performance in ad hoc wireless networks. This would enable the
seamless operation of application-level protocols such as FTP, SMTP, and HTTP
across the integrated ad hoc wireless networks and the Internet.
This section discusses the issues and challenges that TCP experiences when used
in ad hoc wireless networks as well as some of the existing solutions for overcoming
them.
TCP NOT PERFORM WELL IN AD-HOC WIRELESS NETWORKS DUE TO
FOLLOWING REASONS
• Misinterpretation of packet loss
• Frequent path breaks
• Effect of path length
• Misinterpretation of congestion window
• Asymmetric link behavior
• Uni-directional path: TCP ACK requires RTS-CTS-Data-ACK exchange
• Multipath routing
• Network partitioning and remerging
• The use of sliding-window-based transmission
Split-TCP
• It provides a unique solution to the channel fairness problem by splitting the
transport layer objectives into congestion control and end-to-end reliability.
• Splits a long TCP connection into a set of short concatenated TCP connections
with a number of selected intermediate nodes as terminating points of these
short connections.
• Advantages
• Improved throughput
• Improved throughput fairness
• Reduced impact of mobility
• Disadvantages
• It requires modifications to TCP protocol.
• The end-to-end connection handling of traditional TCP is disturbed.
• The failure of substitution nodes can lead to throughput degradation.
TCP with Explicit Link Failure Notification (TCP-ELFN)
• Handle explicit link failure notification
• Use TCP probe packets for detecting the route reestablishment.
7. • The ELFN is originated by the node detecting a path break upon detection of a
link failure to the TCP sender.
• Advantages:
• improves the TCP performance by decoupling the path break
information from the congestion information by the use of ELFN.
• Less dependent on the routing protocol and requires only link failure
notification
• Disadvantages
• When the network is partitioned, the path failure may last longer
• The congestion window after a new route is obtained may not reflect
the achievable transmission rate acceptable to the network and TCP
receiver.
Feedback-based TCP (TCP Feedback – TCP-F)
• Requires the support of a reliable link layer and a routing protocol that can
provide feedback to the TCP sender about the path breaks.
• The routing protocol is expected to repair the broken path within a reasonable
time period.
• Advantages: Simple, permits the TCP congestion control mechanism to
respond to congestion
• Disadvantages:
• If a route to the sender is not available at the failure point (FP), then
additional control packets may need to be generated for routing the
route failure notification (RFN) packet.
• Requires modification to the existing TCP.
• The congestion window after a new route is obtained may not reflect
the achievable transmission rate acceptable to the network and the
TCP-F receiver.
TCP Over Ad Hoc Wireless Network TCP with buffering capability and
sequence information (TCP-BuS)
It Uses feedback information from an intermediate node on detection of a
path break.
Use localized query (LQ) and REPLY to find a partial path
Upon detection of a path break, an upstream intermediate node originates an
explicit route disconnection notification (ERDN) message.
8. Advantages
Performance improvement and avoidance of fast retransmission
Use on-demand routing protocol
Disadvantages
Increased dependency on the routing protocol and the buffering at the
intermediate nodes
The failure of intermediate nodes may lead to loss of packets.
The dependency of TCP-BuS on the routing protocol many degrade its
performance.
Ad Hoc TCP (ATCP)
• uses a network layer feedback mechanism to make the TCP sender aware of
the status of the network path
• Based on the feedback information received from the intermediate nodes, the
TCP sender changes its state to the persist state, congestion control state, or
the retransmit state.
• When an intermediate node finds that the network is partitioned, then the TCP
sender state is changed to the persist state.
• The ATCP layer makes use of the explicit congestion notification (ECN) for
maintenance for the states.
• Advantages
• Maintain the end-to-end semantics of TCP
• Compatible with traditional TCP
• Provides a feasible and efficient solution to improve throughput of
TCP
• Disadvantages
• The dependency on the network layer protocol to detect the route
changes and partitions
• The addition of a thin ATCP layer to the TCP/IP protocol changes the
interface functions currently being used.
9. Other transport layer protocols:
Application Controlled Transport Protocol (ACTP)
• A light-weight transport layer protocol and not an extension to TCP.
• ACTP assigns the responsibility of ensuring reliability to the application layer.
• ACTP stands in between TCP and UDP where TCP experiences low
performance with high reliability and UDP provides better performance with
high packet loss in ad hoc wireless networks.
• Advantages
• Provides the freedom of choosing the required reliability level to the
application layer.
• Scalable for large networks
• There is no congestion window
• Disadvantages
• It is not compatible with TCP.
• Could lead to heavy congestion
Ad Hoc Transport Protocol
Ad hoc transport protocol (ATP) is specifically designed for ad hoc wireless networks and is
not a variant of TCP. The major aspects by which ATP defers from TCP are
(i) coordination among multiple layers,
(ii) rate based transmissions,
(iii) decoupling congestion control and reliability, and
(iv) assisted congestion control.
Similar to other TCP variants proposed for ad hoc wireless networks, ATP uses
services from network and MAC layers for improving its performance. ATP uses
information from lower layers for
(i) estimation of the initial transmission rate,
(ii) detection, avoidance, and control of congestion, and
(iii) detection of path breaks.
Network Security
Security in Ad Hoc Wireless Networks:
As mentioned , due to the unique characteristics of ad hoc wireless networks,
such networks are highly vulnerable to security attacks compared to wired networks
or infrastructure-based wireless networks. The following sections discuss the various
security requirements in ad hoc wireless networks, the different types of attacks
possible in such networks, and some of the solutions proposed for ensuring network
security.
Network Security Requirements
A security protocol for ad hoc wireless networks should satisfy the following requirements.
The requirements listed below should in fact be met by security protocols
for other types of networks also.
• Confidentiality: The data sent by the sender (source node) must be comprehensible
only to the intended receiver (destination node). Though an intruder
might get hold of the data being sent, he/she must not be able to derive any
useful information out of the data. One of the popular techniques used for
ensuring confidentiality is data encryption.
• Integrity: The data sent by the source node should reach the destination
10. node as it was sent: unaltered. In other words, it should not be possible for any
malicious node in the network to tamper with the data during transmission.
• Availability: The network should remain operational all the time. It must
be robust enough to tolerate link failures and also be capable of surviving
various attacks mounted on it. It should be able to provide the guaranteed
services whenever an authorized user requires them.
• Non-repudiation: Non-repudiation is a mechanism to guarantee that the
sender of a message cannot later deny having sent the message and that the
recipient cannot deny having received the message. Digital signatures, which
function as unique identifiers for each user, much like a written signature, are
used commonly for this purpose.