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
Lecture 19 22. transport protocol for ad-hoc Chandra Meena
This document discusses transport layer protocols for mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the need for new network architectures and protocols to support new types of networks. It then provides an overview of TCP/IP and how TCP works, including congestion control mechanisms. The document discusses challenges for TCP over wireless networks, where packet losses are often due to errors rather than congestion. It covers different versions of TCP and their approaches to congestion control. The goal is to design transport layer protocols that can address the unreliable links and frequent topology changes in MANETs.
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.
This document provides an overview of routing protocols in ad hoc networks. It begins with an abstract describing the objectives of surveying and comparing different classes of ad hoc routing protocols. The document then outlines the topics to be covered, including the characteristics, applications, and types of ad hoc routing protocols. Several representative routing protocols are described in detail, including table-driven, hybrid, source-initiated, location-aware, multipath, hierarchical, multicast, and power-aware protocols. The document concludes by discussing future work related to improving reusability and security of ad hoc routing protocols.
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.
This document discusses wireless sensor networks and routing protocols. It covers several key topics:
1) It describes single-hop and multihop data transmission in wireless sensor networks and the advantages of multihop in increasing network lifetime and reducing interference.
2) It discusses routing challenges in wireless sensor networks due to constraints like energy, bandwidth and changing environments. It also covers routing strategies like proactive, reactive and hybrid routing.
3) It provides details on common routing protocols for wireless sensor networks like flooding, gossiping, SPIN and LEACH, outlining their key mechanisms and advantages/disadvantages. LEACH uses clustering to improve energy efficiency.
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.
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.
Lecture 19 22. transport protocol for ad-hoc Chandra Meena
This document discusses transport layer protocols for mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the need for new network architectures and protocols to support new types of networks. It then provides an overview of TCP/IP and how TCP works, including congestion control mechanisms. The document discusses challenges for TCP over wireless networks, where packet losses are often due to errors rather than congestion. It covers different versions of TCP and their approaches to congestion control. The goal is to design transport layer protocols that can address the unreliable links and frequent topology changes in MANETs.
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.
This document provides an overview of routing protocols in ad hoc networks. It begins with an abstract describing the objectives of surveying and comparing different classes of ad hoc routing protocols. The document then outlines the topics to be covered, including the characteristics, applications, and types of ad hoc routing protocols. Several representative routing protocols are described in detail, including table-driven, hybrid, source-initiated, location-aware, multipath, hierarchical, multicast, and power-aware protocols. The document concludes by discussing future work related to improving reusability and security of ad hoc routing protocols.
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.
This document discusses wireless sensor networks and routing protocols. It covers several key topics:
1) It describes single-hop and multihop data transmission in wireless sensor networks and the advantages of multihop in increasing network lifetime and reducing interference.
2) It discusses routing challenges in wireless sensor networks due to constraints like energy, bandwidth and changing environments. It also covers routing strategies like proactive, reactive and hybrid routing.
3) It provides details on common routing protocols for wireless sensor networks like flooding, gossiping, SPIN and LEACH, outlining their key mechanisms and advantages/disadvantages. LEACH uses clustering to improve energy efficiency.
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.
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.
IP multicast is a method of sending Internet Protocol (IP) datagrams to a group of interested receivers in a single transmission. It is often employed for streaming media applications on the Internet and private networks.(wikipedia)
The document summarizes several routing protocols used in wireless networks. It discusses both table-driven protocols like DSDV and on-demand protocols like AODV. It provides details on how each protocol performs routing and maintains routes. It also outlines some advantages and disadvantages of protocols like DSDV, AODV, DSR, and TORA.
Mac protocols for ad hoc wireless networks Divya Tiwari
The document discusses MAC protocols for ad hoc wireless networks. It addresses key issues in designing MAC protocols including limited bandwidth, quality of service support, synchronization, hidden and exposed terminal problems, error-prone shared channels, distributed coordination without centralized control, and node mobility. Common MAC protocol classifications and examples are also presented, such as contention-based protocols, sender-initiated versus receiver-initiated protocols, and protocols using techniques like reservation, scheduling, and directional antennas.
A description about IEEE 802.16 Standard based on the text book "Ad Hoc Wireless Networks: Architectures and Protocols" by C. Siva Ram Murthy and B. S. Manoj.
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 discusses several routing protocols for mobile ad hoc networks:
- DSR allows nodes to cache and share routing information for more efficient routing but has larger packet headers due to source routing. AODV uses only next hop information, keeping routing tables smaller.
- Both protocols use route discovery and maintenance, but AODV proactively refreshes routes while DSR reacts to failures. AODV also uses sequence numbers to prevent loops and choose fresher routes.
- Overall, DSR is better for networks where routes change infrequently while AODV scales better and maintains only active routes, at the cost of higher routing overhead during route discovery. Security remains a challenge for both protocols.
This document discusses various techniques for energy efficient unicast routing in wireless sensor networks. It describes algorithms such as Dijkstra's algorithm, minimizing energy per packet, maximizing network lifetime, and routing based on available battery energy. Additional algorithms covered include minimum battery cost routing, minimum-max battery cost routing, and conditional max-min battery capacity routing. The document also discusses multipath unicast routing techniques including constructing disjoint and braided paths, and simultaneously transmitting over multiple paths.
Transport control protocols for Wireless sensor networksRushin Shah
The document discusses traditional transport control protocols and their feasibility for use in wireless sensor networks. It describes how TCP and UDP are generally not suitable for WSNs due to their overhead and lack of features like congestion control that are needed in low power lossy networks. The document then outlines key considerations for designing new transport protocols for WSNs, including performing congestion control and reliable delivery, simplifying connection establishment, avoiding packet loss to reduce energy waste, and providing fairness across nodes. Transport protocols for WSNs need hop-by-hop approaches and mechanisms to reduce buffer usage and packet loss while conserving energy.
The document discusses security challenges in wireless ad-hoc networks and potential solutions. It outlines that ad-hoc networks have no infrastructure, are self-organizing, and use multi-hop wireless communication. This introduces security vulnerabilities like eavesdropping, fake messages, and dynamic topology changes. The document then covers common attacks, why security is needed, challenges, and proposes solutions like using a trusted third party, secure routing protocols, and packet leashes to address issues like black holes and wormholes.
The document discusses several MAC protocols for ad hoc networks including MACA, MACAW, and PAMAS. MACA uses RTS and CTS packets to avoid collisions but does not provide ACK. MACAW is a revision of MACA that includes ACK. It significantly increases throughput but does not fully solve hidden and exposed terminal problems. PAMAS uses a separate signaling channel for RTS-CTS and a data channel. It allows nodes to power down transceivers when not transmitting to save energy.
This document discusses localization techniques in wireless sensor networks. It begins with introducing wireless sensor networks and their components. It then discusses the need for localization to track objects within sensor networks. There are two main types of localization schemes - range-based which uses distance or angle measurements, and range-free which uses approximate distance estimates. Examples of range-based techniques include time of arrival, time difference of arrival, received signal strength indicator, and angle of arrival. Range-free techniques include proximity and distance-based localization using hop counts. The document compares the advantages and disadvantages of different localization methods.
This document discusses security issues and attacks in mobile ad hoc networks (MANETs). It provides an introduction to MANETs and their characteristics. It outlines the general objectives of analyzing flooding attacks on MANETs and preventing such attacks for networks with high node mobility. It describes common attacks on MANETs such as flooding attacks, blackhole attacks, wormhole attacks, and Byzantine attacks. The document also discusses security mechanisms for MANETs including preventive cryptography-based approaches and reactive intrusion detection system approaches. It stresses the need for comprehensive security solutions to deal with the diverse attacks that are facilitated by the open and dynamic nature of MANETs.
This document provides an overview of quality of service (QoS) technologies for computer networks. It discusses two main QoS frameworks: Differentiated Services, which classifies traffic into groups and handles each group differently without resource reservation; and Integrated Services, which involves reserving resources for each session to guarantee performance levels. The document also compares the two frameworks and their approaches to service type, service scope, complexity, and scalability.
This document discusses security issues and proposed solutions for wireless sensor networks. It begins by defining wireless sensor networks and describing common applications. It then outlines several security threats like denial of service attacks, wormhole attacks, sybil attacks, and traffic analysis attacks. It also discusses proposed cryptography and authentication schemes to provide data confidentiality, integrity, and freshness. Finally, it advocates for a holistic security approach that considers all network layers rather than focusing on single layers.
Improving tcp performance over mobile ad hoc networksArpita Naskar
This document discusses improving TCP performance over mobile ad-hoc networks. It first introduces TCP and how it is generally used for wired networks where packet loss indicates congestion. However, in wireless mobile ad-hoc networks (MANETs), packet loss can occur for other reasons like interference or fading. The document then outlines some key challenges for TCP in MANETs, such as route failures, shared wireless medium issues, high bit error rates, and inability to differentiate congestion losses from other losses. It reviews some approaches to improve TCP performance in MANETs, including modified TCP, cross-layer solutions, ATP, and ADHOCTCP which aims to identify network state like congestion or errors. The conclusion is that TCP needs
This document discusses different types of routing protocols for mobile ad hoc networks. It begins by classifying routing protocols into four categories: proactive (table-driven), reactive (on-demand), hybrid, and geographic location-assisted. It then provides more details on proactive protocols like DSDV, and reactive protocols like DSR and AODV. For DSDV, it describes how routing tables are regularly exchanged and updated when link breaks occur. For DSR and AODV, it explains how routes are discovered on-demand via route requests and replies. Key differences between DSR and AODV are also summarized.
The document summarizes key points from an 8th lecture on wireless sensor networks. It discusses various medium access control (MAC) protocols that control when nodes can access a shared wireless medium. These include contention-based protocols like MACA that use RTS/CTS handshaking and schedule-based protocols with fixed or dynamic scheduling. It also describes energy-efficient MAC protocols for low data rate sensor networks like S-MAC, T-MAC, and preamble sampling that increase sleep time to reduce energy use through synchronized sleep schedules or long preambles.
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.
IP multicast is a method of sending Internet Protocol (IP) datagrams to a group of interested receivers in a single transmission. It is often employed for streaming media applications on the Internet and private networks.(wikipedia)
The document summarizes several routing protocols used in wireless networks. It discusses both table-driven protocols like DSDV and on-demand protocols like AODV. It provides details on how each protocol performs routing and maintains routes. It also outlines some advantages and disadvantages of protocols like DSDV, AODV, DSR, and TORA.
Mac protocols for ad hoc wireless networks Divya Tiwari
The document discusses MAC protocols for ad hoc wireless networks. It addresses key issues in designing MAC protocols including limited bandwidth, quality of service support, synchronization, hidden and exposed terminal problems, error-prone shared channels, distributed coordination without centralized control, and node mobility. Common MAC protocol classifications and examples are also presented, such as contention-based protocols, sender-initiated versus receiver-initiated protocols, and protocols using techniques like reservation, scheduling, and directional antennas.
A description about IEEE 802.16 Standard based on the text book "Ad Hoc Wireless Networks: Architectures and Protocols" by C. Siva Ram Murthy and B. S. Manoj.
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 discusses several routing protocols for mobile ad hoc networks:
- DSR allows nodes to cache and share routing information for more efficient routing but has larger packet headers due to source routing. AODV uses only next hop information, keeping routing tables smaller.
- Both protocols use route discovery and maintenance, but AODV proactively refreshes routes while DSR reacts to failures. AODV also uses sequence numbers to prevent loops and choose fresher routes.
- Overall, DSR is better for networks where routes change infrequently while AODV scales better and maintains only active routes, at the cost of higher routing overhead during route discovery. Security remains a challenge for both protocols.
This document discusses various techniques for energy efficient unicast routing in wireless sensor networks. It describes algorithms such as Dijkstra's algorithm, minimizing energy per packet, maximizing network lifetime, and routing based on available battery energy. Additional algorithms covered include minimum battery cost routing, minimum-max battery cost routing, and conditional max-min battery capacity routing. The document also discusses multipath unicast routing techniques including constructing disjoint and braided paths, and simultaneously transmitting over multiple paths.
Transport control protocols for Wireless sensor networksRushin Shah
The document discusses traditional transport control protocols and their feasibility for use in wireless sensor networks. It describes how TCP and UDP are generally not suitable for WSNs due to their overhead and lack of features like congestion control that are needed in low power lossy networks. The document then outlines key considerations for designing new transport protocols for WSNs, including performing congestion control and reliable delivery, simplifying connection establishment, avoiding packet loss to reduce energy waste, and providing fairness across nodes. Transport protocols for WSNs need hop-by-hop approaches and mechanisms to reduce buffer usage and packet loss while conserving energy.
The document discusses security challenges in wireless ad-hoc networks and potential solutions. It outlines that ad-hoc networks have no infrastructure, are self-organizing, and use multi-hop wireless communication. This introduces security vulnerabilities like eavesdropping, fake messages, and dynamic topology changes. The document then covers common attacks, why security is needed, challenges, and proposes solutions like using a trusted third party, secure routing protocols, and packet leashes to address issues like black holes and wormholes.
The document discusses several MAC protocols for ad hoc networks including MACA, MACAW, and PAMAS. MACA uses RTS and CTS packets to avoid collisions but does not provide ACK. MACAW is a revision of MACA that includes ACK. It significantly increases throughput but does not fully solve hidden and exposed terminal problems. PAMAS uses a separate signaling channel for RTS-CTS and a data channel. It allows nodes to power down transceivers when not transmitting to save energy.
This document discusses localization techniques in wireless sensor networks. It begins with introducing wireless sensor networks and their components. It then discusses the need for localization to track objects within sensor networks. There are two main types of localization schemes - range-based which uses distance or angle measurements, and range-free which uses approximate distance estimates. Examples of range-based techniques include time of arrival, time difference of arrival, received signal strength indicator, and angle of arrival. Range-free techniques include proximity and distance-based localization using hop counts. The document compares the advantages and disadvantages of different localization methods.
This document discusses security issues and attacks in mobile ad hoc networks (MANETs). It provides an introduction to MANETs and their characteristics. It outlines the general objectives of analyzing flooding attacks on MANETs and preventing such attacks for networks with high node mobility. It describes common attacks on MANETs such as flooding attacks, blackhole attacks, wormhole attacks, and Byzantine attacks. The document also discusses security mechanisms for MANETs including preventive cryptography-based approaches and reactive intrusion detection system approaches. It stresses the need for comprehensive security solutions to deal with the diverse attacks that are facilitated by the open and dynamic nature of MANETs.
This document provides an overview of quality of service (QoS) technologies for computer networks. It discusses two main QoS frameworks: Differentiated Services, which classifies traffic into groups and handles each group differently without resource reservation; and Integrated Services, which involves reserving resources for each session to guarantee performance levels. The document also compares the two frameworks and their approaches to service type, service scope, complexity, and scalability.
This document discusses security issues and proposed solutions for wireless sensor networks. It begins by defining wireless sensor networks and describing common applications. It then outlines several security threats like denial of service attacks, wormhole attacks, sybil attacks, and traffic analysis attacks. It also discusses proposed cryptography and authentication schemes to provide data confidentiality, integrity, and freshness. Finally, it advocates for a holistic security approach that considers all network layers rather than focusing on single layers.
Improving tcp performance over mobile ad hoc networksArpita Naskar
This document discusses improving TCP performance over mobile ad-hoc networks. It first introduces TCP and how it is generally used for wired networks where packet loss indicates congestion. However, in wireless mobile ad-hoc networks (MANETs), packet loss can occur for other reasons like interference or fading. The document then outlines some key challenges for TCP in MANETs, such as route failures, shared wireless medium issues, high bit error rates, and inability to differentiate congestion losses from other losses. It reviews some approaches to improve TCP performance in MANETs, including modified TCP, cross-layer solutions, ATP, and ADHOCTCP which aims to identify network state like congestion or errors. The conclusion is that TCP needs
This document discusses different types of routing protocols for mobile ad hoc networks. It begins by classifying routing protocols into four categories: proactive (table-driven), reactive (on-demand), hybrid, and geographic location-assisted. It then provides more details on proactive protocols like DSDV, and reactive protocols like DSR and AODV. For DSDV, it describes how routing tables are regularly exchanged and updated when link breaks occur. For DSR and AODV, it explains how routes are discovered on-demand via route requests and replies. Key differences between DSR and AODV are also summarized.
The document summarizes key points from an 8th lecture on wireless sensor networks. It discusses various medium access control (MAC) protocols that control when nodes can access a shared wireless medium. These include contention-based protocols like MACA that use RTS/CTS handshaking and schedule-based protocols with fixed or dynamic scheduling. It also describes energy-efficient MAC protocols for low data rate sensor networks like S-MAC, T-MAC, and preamble sampling that increase sleep time to reduce energy use through synchronized sleep schedules or long preambles.
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.
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.
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.
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.
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive functioning. Exercise boosts blood flow, releases endorphins, and promotes changes in the brain which help regulate emotions and stress levels.
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.
What is an RPA CoE? Session 2 – CoE RolesDianaGray10
In this session, we will review the players involved in the CoE and how each role impacts opportunities.
Topics covered:
• What roles are essential?
• What place in the automation journey does each role play?
Speaker:
Chris Bolin, Senior Intelligent Automation Architect Anika Systems
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Keywords: AI, Containeres, Kubernetes, Cloud Native
Event Link: https://meine.doag.org/events/cloudland/2024/agenda/#agendaId.4211
TrustArc Webinar - Your Guide for Smooth Cross-Border Data Transfers and Glob...TrustArc
Global data transfers can be tricky due to different regulations and individual protections in each country. Sharing data with vendors has become such a normal part of business operations that some may not even realize they’re conducting a cross-border data transfer!
The Global CBPR Forum launched the new Global Cross-Border Privacy Rules framework in May 2024 to ensure that privacy compliance and regulatory differences across participating jurisdictions do not block a business's ability to deliver its products and services worldwide.
To benefit consumers and businesses, Global CBPRs promote trust and accountability while moving toward a future where consumer privacy is honored and data can be transferred responsibly across borders.
This webinar will review:
- What is a data transfer and its related risks
- How to manage and mitigate your data transfer risks
- How do different data transfer mechanisms like the EU-US DPF and Global CBPR benefit your business globally
- Globally what are the cross-border data transfer regulations and guidelines
The Department of Veteran Affairs (VA) invited Taylor Paschal, Knowledge & Information Management Consultant at Enterprise Knowledge, to speak at a Knowledge Management Lunch and Learn hosted on June 12, 2024. All Office of Administration staff were invited to attend and received professional development credit for participating in the voluntary event.
The objectives of the Lunch and Learn presentation were to:
- Review what KM ‘is’ and ‘isn’t’
- Understand the value of KM and the benefits of engaging
- Define and reflect on your “what’s in it for me?”
- Share actionable ways you can participate in Knowledge - - Capture & Transfer
"Choosing proper type of scaling", Olena SyrotaFwdays
Imagine an IoT processing system that is already quite mature and production-ready and for which client coverage is growing and scaling and performance aspects are life and death questions. The system has Redis, MongoDB, and stream processing based on ksqldb. In this talk, firstly, we will analyze scaling approaches and then select the proper ones for our system.
Session 1 - Intro to Robotic Process Automation.pdfUiPathCommunity
👉 Check out our full 'Africa Series - Automation Student Developers (EN)' page to register for the full program:
https://bit.ly/Automation_Student_Kickstart
In this session, we shall introduce you to the world of automation, the UiPath Platform, and guide you on how to install and setup UiPath Studio on your Windows PC.
📕 Detailed agenda:
What is RPA? Benefits of RPA?
RPA Applications
The UiPath End-to-End Automation Platform
UiPath Studio CE Installation and Setup
💻 Extra training through UiPath Academy:
Introduction to Automation
UiPath Business Automation Platform
Explore automation development with UiPath Studio
👉 Register here for our upcoming Session 2 on June 20: Introduction to UiPath Studio Fundamentals: https://community.uipath.com/events/details/uipath-lagos-presents-session-2-introduction-to-uipath-studio-fundamentals/
From Natural Language to Structured Solr Queries using LLMsSease
This talk draws on experimentation to enable AI applications with Solr. One important use case is to use AI for better accessibility and discoverability of the data: while User eXperience techniques, lexical search improvements, and data harmonization can take organizations to a good level of accessibility, a structural (or “cognitive” gap) remains between the data user needs and the data producer constraints.
That is where AI – and most importantly, Natural Language Processing and Large Language Model techniques – could make a difference. This natural language, conversational engine could facilitate access and usage of the data leveraging the semantics of any data source.
The objective of the presentation is to propose a technical approach and a way forward to achieve this goal.
The key concept is to enable users to express their search queries in natural language, which the LLM then enriches, interprets, and translates into structured queries based on the Solr index’s metadata.
This approach leverages the LLM’s ability to understand the nuances of natural language and the structure of documents within Apache Solr.
The LLM acts as an intermediary agent, offering a transparent experience to users automatically and potentially uncovering relevant documents that conventional search methods might overlook. The presentation will include the results of this experimental work, lessons learned, best practices, and the scope of future work that should improve the approach and make it production-ready.
Getting the Most Out of ScyllaDB Monitoring: ShareChat's TipsScyllaDB
ScyllaDB monitoring provides a lot of useful information. But sometimes it’s not easy to find the root of the problem if something is wrong or even estimate the remaining capacity by the load on the cluster. This talk shares our team's practical tips on: 1) How to find the root of the problem by metrics if ScyllaDB is slow 2) How to interpret the load and plan capacity for the future 3) Compaction strategies and how to choose the right one 4) Important metrics which aren’t available in the default monitoring setup.
An All-Around Benchmark of the DBaaS MarketScyllaDB
The entire database market is moving towards Database-as-a-Service (DBaaS), resulting in a heterogeneous DBaaS landscape shaped by database vendors, cloud providers, and DBaaS brokers. This DBaaS landscape is rapidly evolving and the DBaaS products differ in their features but also their price and performance capabilities. In consequence, selecting the optimal DBaaS provider for the customer needs becomes a challenge, especially for performance-critical applications.
To enable an on-demand comparison of the DBaaS landscape we present the benchANT DBaaS Navigator, an open DBaaS comparison platform for management and deployment features, costs, and performance. The DBaaS Navigator is an open data platform that enables the comparison of over 20 DBaaS providers for the relational and NoSQL databases.
This talk will provide a brief overview of the benchmarked categories with a focus on the technical categories such as price/performance for NoSQL DBaaS and how ScyllaDB Cloud is performing.
QR Secure: A Hybrid Approach Using Machine Learning and Security Validation F...AlexanderRichford
QR Secure: A Hybrid Approach Using Machine Learning and Security Validation Functions to Prevent Interaction with Malicious QR Codes.
Aim of the Study: The goal of this research was to develop a robust hybrid approach for identifying malicious and insecure URLs derived from QR codes, ensuring safe interactions.
This is achieved through:
Machine Learning Model: Predicts the likelihood of a URL being malicious.
Security Validation Functions: Ensures the derived URL has a valid certificate and proper URL format.
This innovative blend of technology aims to enhance cybersecurity measures and protect users from potential threats hidden within QR codes 🖥 🔒
This study was my first introduction to using ML which has shown me the immense potential of ML in creating more secure digital environments!
ScyllaDB Leaps Forward with Dor Laor, CEO of ScyllaDBScyllaDB
Join ScyllaDB’s CEO, Dor Laor, as he introduces the revolutionary tablet architecture that makes one of the fastest databases fully elastic. Dor will also detail the significant advancements in ScyllaDB Cloud’s security and elasticity features as well as the speed boost that ScyllaDB Enterprise 2024.1 received.
Introducing BoxLang : A new JVM language for productivity and modularity!Ortus Solutions, Corp
Just like life, our code must adapt to the ever changing world we live in. From one day coding for the web, to the next for our tablets or APIs or for running serverless applications. Multi-runtime development is the future of coding, the future is to be dynamic. Let us introduce you to BoxLang.
Dynamic. Modular. Productive.
BoxLang redefines development with its dynamic nature, empowering developers to craft expressive and functional code effortlessly. Its modular architecture prioritizes flexibility, allowing for seamless integration into existing ecosystems.
Interoperability at its Core
With 100% interoperability with Java, BoxLang seamlessly bridges the gap between traditional and modern development paradigms, unlocking new possibilities for innovation and collaboration.
Multi-Runtime
From the tiny 2m operating system binary to running on our pure Java web server, CommandBox, Jakarta EE, AWS Lambda, Microsoft Functions, Web Assembly, Android and more. BoxLang has been designed to enhance and adapt according to it's runnable runtime.
The Fusion of Modernity and Tradition
Experience the fusion of modern features inspired by CFML, Node, Ruby, Kotlin, Java, and Clojure, combined with the familiarity of Java bytecode compilation, making BoxLang a language of choice for forward-thinking developers.
Empowering Transition with Transpiler Support
Transitioning from CFML to BoxLang is seamless with our JIT transpiler, facilitating smooth migration and preserving existing code investments.
Unlocking Creativity with IDE Tools
Unleash your creativity with powerful IDE tools tailored for BoxLang, providing an intuitive development experience and streamlining your workflow. Join us as we embark on a journey to redefine JVM development. Welcome to the era of BoxLang.
Northern Engraving | Nameplate Manufacturing Process - 2024Northern Engraving
Manufacturing custom quality metal nameplates and badges involves several standard operations. Processes include sheet prep, lithography, screening, coating, punch press and inspection. All decoration is completed in the flat sheet with adhesive and tooling operations following. The possibilities for creating unique durable nameplates are endless. How will you create your brand identity? We can help!
Guidelines for Effective Data VisualizationUmmeSalmaM1
This PPT discuss about importance and need of data visualization, and its scope. Also sharing strong tips related to data visualization that helps to communicate the visual information effectively.
Essentials of Automations: Exploring Attributes & Automation ParametersSafe Software
Building automations in FME Flow can save time, money, and help businesses scale by eliminating data silos and providing data to stakeholders in real-time. One essential component to orchestrating complex automations is the use of attributes & automation parameters (both formerly known as “keys”). In fact, it’s unlikely you’ll ever build an Automation without using these components, but what exactly are they?
Attributes & automation parameters enable the automation author to pass data values from one automation component to the next. During this webinar, our FME Flow Specialists will cover leveraging the three types of these output attributes & parameters in FME Flow: Event, Custom, and Automation. As a bonus, they’ll also be making use of the Split-Merge Block functionality.
You’ll leave this webinar with a better understanding of how to maximize the potential of automations by making use of attributes & automation parameters, with the ultimate goal of setting your enterprise integration workflows up on autopilot.
MongoDB to ScyllaDB: Technical Comparison and the Path to SuccessScyllaDB
What can you expect when migrating from MongoDB to ScyllaDB? This session provides a jumpstart based on what we’ve learned from working with your peers across hundreds of use cases. Discover how ScyllaDB’s architecture, capabilities, and performance compares to MongoDB’s. Then, hear about your MongoDB to ScyllaDB migration options and practical strategies for success, including our top do’s and don’ts.
In our second session, we shall learn all about the main features and fundamentals of UiPath Studio that enable us to use the building blocks for any automation project.
📕 Detailed agenda:
Variables and Datatypes
Workflow Layouts
Arguments
Control Flows and Loops
Conditional Statements
💻 Extra training through UiPath Academy:
Variables, Constants, and Arguments in Studio
Control Flow in Studio
How information systems are built or acquired puts information, which is what they should be about, in a secondary place. Our language adapted accordingly, and we no longer talk about information systems but applications. Applications evolved in a way to break data into diverse fragments, tightly coupled with applications and expensive to integrate. The result is technical debt, which is re-paid by taking even bigger "loans", resulting in an ever-increasing technical debt. Software engineering and procurement practices work in sync with market forces to maintain this trend. This talk demonstrates how natural this situation is. The question is: can something be done to reverse the trend?
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.