ASN notes(1,2,3)

Download as pdf or txt
Download as pdf or txt
You are on page 1of 49

ASN

UNIT -I
Introduction to Ad Hoc Networks –

Mobile Ad hoc Network (MANET)

 An ad hoc network

 Formed as needed

 Does not require support from any existing network infrastructure

Formal definition of MANET:

 An autonomous system of mobile nodes or MSs (also serving as routers) connected by


wireless links, the union of which forms a communications network modeled in the form of
an arbitrary communication graph.

 Autonomous: Does not require support from any existing network infrastructure.

o Might be able to use such support if available.

o Such support might be available from time to time.

o Support could be: an Internet gateway or some fixed stations.

How it differs from a cellular network:

 Cellular networks require infrastructure (e.g., BS, MSC, backbone network, etc.) and are not
ad hoc.

Characteristics of MANETs:
 Dynamically changing topology:

o The topology changes unpredictably as nodes are free to move.

 Limited power:

o Nodes often have limited power, such as batteries, which influences their operation
and communication.

 Local communication:

o Nodes usually communicate with neighboring nodes, primarily to conserve power.

 Peer-to-peer nature:

o There are no hierarchically “more important” or “less important” nodes; all nodes
function as equals.

 Store-and-forward transmission:

o Information is transmitted using a store-and-forward mechanism, often represented


by multi-hop routing.
 Nodes also serve as routers:

o Mobile stations (MSs) not only communicate but also serve as routers to forward
data to other nodes.

 Topology information must be updated

 Example: MS2 changes attachment from MS3 to MS4

Communication characteristics for MANETs:

 Each node is equipped with a wireless transmitter and receiver with an appropriate antenna

 It is impossible to have all nodes within each other’s radio range

 When the nodes are close by (within each other's radio range), they can communicate
directly

o If direct communication occurs, no routing is needed (one hop)

 Wireless connectivity is modeled by a random multi-hop graph between the nodes

Dynamic Topologies

 Network topology may change dynamically as the nodes are free to move.

Bandwidth-Constrained, Variable Capacity Links

 Wireless links typically have lower capacity than wired links.

 Realized throughput of wireless communication is lower than the radio’s maximum


transmission rate.

 Link capacity is relatively low, leading to common congestion (collisions occur frequently as
application demand approaches link capacity).

Energy-Constrained Operation

 Nodes in ad hoc networks may rely on batteries or other limited energy sources.
 Energy conservation may be a dominant design factor.

Limited Physical Security

 More prone to physical security threats than wired networks.

 Includes risks such as stealing mobile ad hoc devices.

 Many attacks, such as eavesdropping, spoofing, and DoS attacks, are easier to execute.

Decentralized Network Control

 Eliminates single points of failure, leading to better reliability.

Scalability Problems

 Issues arise as the network size increases.

Applications of MANETs :
Wearable Computing (PAN)

 Defense applications

 Crisis-management applications

o Useful during natural disasters when the entire communication infrastructure is in


disarray.

 Telemedicine

o Example: Assistance by a surgeon during an emergency.


Collaborative Work

Virtual Navigation

 Data from a remote database transmitted to a navigation device in a car or handheld device.

 May contain graphical representations of streets, buildings, and the latest traffic
information.

 Can assist the driver in selecting a route.

Education and Internet Access

 K-12 education, continued education, etc., for people in remote areas.

o Example: Email-by-bus services in remote villages.

Challenges of MANETs:
• Scalability;

• Quality of service-packet loss,jitter,delay,throughput

• Client server model shift;

• Security;

• Interoperation with the Internet-as manet and internet are different networks

• Energy conservation;

• Node cooperation;

• Interoperation.

Routing in MANETs –
Factors Affecting Routing in MANETs:

 Models of topology

 Selection of routers

 Initiation of route requests

 Specific underlying characteristics

o Example: Application-based characteristics

Major Goals in Selecting Routing Protocols:

 Provide the maximum possible reliability (use alternative routes if an intermediate node
fails)

 Choose a route with the least cost

o Example: Minimal number of hops from source to destination

 Ensure the best possible response time and throughput for nodes

Routing in MANETs:

 Each node in MANETs is expected to serve as a router

 All nodes execute the same routing protocol

 The protocol calculates the route

4.1. Need for Routing in MANETs

Goals for Routing in MANETs:

1. Route computation must be distributed

o Centralized routing in a dynamic network is usually too expensive.

2. Routing computation should not involve the maintenance of global state

o Would require maintaining a lot of information in a dynamic topology.

3. Each node must only be concerned about the routes to its destinations.

4. Stale routes must be avoided or detected and eliminated.

5. Broadcasts should be avoided.

o Broadcasts can be highly unreliable in MANETs.

6. It is desirable to have a backup route.


o Used when the primary route becomes stale.

A Major Challenge in Designing Routing Protocols:

 The protocol must know how to route a packet at least via its neighbors.

 Network topology can change frequently.

 A large number of network nodes (MSs) could lead to extensive updates, requiring a clever
protocol design to handle this efficiently.

Criteria for classification:


Types of Routing Protocols:

1. Proactive Protocols:

o Keep routes ready at all times.

o When a packet needs to be forwarded, the route is already known.

o Example: Distance Vector Routing Protocols.

2. Reactive (On-Demand) Protocols:

o Route determination on demand.

o Determine a route only when there is a packet to send.

o Examples: Flooding Routing Algorithms, Ad Hoc On-Demand Distance Vector


(AODV), Temporarily Ordered Routing Algorithm (TORA).

Proactive vs. Reactive:

 In Proactive: A route is available immediately.

 In Reactive:

1. A significant delay.

2. Significant traffic of control messages (searching for a route).

Proactive vs. Reactive for MANETs:

 Proactive Protocols:

o Disadvantage: Use too much bandwidth for control messages to continually update
routing information. In highly dynamic MANETs, where topology changes rapidly,
many routes become obsolete and unused, resulting in inefficient bandwidth usage.

 Reactive Protocols:

o Disadvantage: Can be too slow for real-time applications due to the delay in route
discovery and the additional control message traffic required to find routes on-
demand.

Orthogonal Types of Routing Protocols:


1. Table-Driven Protocols

2. Source-Initiated On-Demand Protocols

3. Hybrid Protocols

Taxonomy of MANET routing algorithms, Topology-based routing


algorithms-Proactive: DSDV; Reactive: DSR, AODV: Hybrid: ZRP:
Topology-Based:

 Depends on the information about existing links.

Position-Based Approaches:

Proactive (or Table-Driven):

 Traditional distributed shortest-path protocols.

 Maintain routes between every host pair at all times.

 Based on periodic updates; high routing overhead.

 Example: DSDV (Destination-Sequenced Distance Vector).

Reactive (On-Demand) Protocols:

 Determine route if and when needed.

 Source initiates route discovery.

 Example: DSR (Dynamic Source Routing).

Hybrid Protocols:

 Adaptive: Combination of proactive and reactive.

 Example: ZRP (Zone Routing Protocol).

Topology-Based:

 Depends on the information about existing links to forward packets.

Position-Based Approaches:

 Sender uses location service to determine the position of the destination node.

 Physical location of each or some nodes is determined through GPS or other positioning
techniques.

Topology-Based Routing:

Proactive (or Table-Driven):

 Node experiences minimal delay whenever a route is needed.

 May not always be appropriate for high mobility.


 Includes Distance-Vector or Link-State Routing.

Reactive (or On-Demand):

 Consumes much less bandwidth.

 Delay in determining a route can be substantially large.

Hybrid Protocols:

 Mobile Hosts (MHs) determine their own position through GPS.

 Position-based routing algorithms overcome some limitations.

1)Destination-Sequenced Distance-Vector (DSDV) Protocol:

 A proactive hop-by-hop distance vector routing protocol.

 Requires each Mobile Host (MH) to broadcast routing updates periodically.

 Every MH maintains a routing table for all possible destinations and the number of hops to
each destination.

 Sequence numbers enable MHs to distinguish stale routes from new ones.

 To alleviate large network update traffic, two types of packets are used: full dumps or small
increment packets.

 The route labeled with the most recent sequence number is always used.

 If two updates have the same sequence number, the route with the smaller metric is used
to optimize (shorten) the path.

Steps for MH X Receiving Routing Information from Y about a Route to MH Z:

1. If S(Y) > S(X), then X ignores the routing information received from Y.

2. If S(Y) = S(X), and the cost of going through Y is smaller than the route known to X, then X
sets Y as the next hop to Z.

3. If S(Y) < S(X), then X sets Y as the next hop to Z, and S(X) is updated to equal S(Y).

2) The Wireless Routing Protocol:

 A table-driven protocol with the goal of maintaining routing information among all Mobile
Hosts (MHs).

 Each MH maintains four tables: Distance, Routing, Link-Cost, and Message Retransmission
List (MRL) tables.
 Each entry in MRL contains the sequence number of the update message, a retransmission
counter, and a list of updates sent in the update message.

 MHs keep each other informed of all link changes through the use of update messages.

 MHs learn about their neighbors from acknowledgments and other messages.

 If an MH does not send any message for a specified time period, it must send a hello
message to ensure connectivity.

3) Topology Broadcast Based on Reverse Path Forwarding Protocol:

 Considers broadcasting topology information (including link costs and up/down status) to all
Mobile Hosts (MHs).

 Each link-state update is sent on every link of the network through flooding.

 Communication cost of broadcasting topology can be reduced if updates are sent along
spanning trees.

 Messages are broadcast in the reverse direction along the directed spanning tree formed by
the shortest paths from all nodes to the source.

 Messages generated by a given source are broadcast in the reverse direction along the
directed spanning tree formed by the shortest paths from all MHs (nodes) to the source.

4) The Optimized Link State Routing Protocol:

 Based on the link state algorithm.

 All links with neighboring Mobile Hosts (MHs) are declared and are flooded in the entire
network.

 Minimizes flooding of control traffic by using only selected MHs, called multipoint relays.

 Only normal periodic control messages are sent.

 Beneficial for traffic patterns where a large subset of MHs is communicating with each other.

 Suitable for large and dense networks.


 An in-order delivery of messages is not needed as each control message contains a sequence
number.

Multipoint Relays:

 Minimize the flooding of broadcast packets in the network by reducing duplicate


retransmissions in the same region.
 Each Mobile Host (MH) selects a set of neighboring MHs to retransmit its packets,
known as multipoint relays (MPRs).
 This set can change over time and is indicated by the selector nodes in their hello
messages.
 Each node selects MPRs among its one-hop bi-directional link neighbors to reach all
other nodes that are two hops away.

2)Reactive:
Dynamic Source Routing:
 When Mobile Host (MH) S wants to send a packet to MH D but does not know a route to D,
MH S initiates a route discovery.

 The source node S floods a Route Request (RREQ).

 Each MH appends its own identifier when forwarding the RREQ.


Route Discovery in DSR:

 Destination D, upon receiving the first Route Request (RREQ), sends a Route Reply (RREP).

 The RREP is sent along the route obtained by reversing the route appended to the received
RREQ.

 The RREP includes the route from S to D that was used by MH (node) D to receive the RREQ.
 Supports the use of symmetric channels.
 If a source Mobile Host (MH) moves, it reinitiates the route discovery protocol to find
a new route.
 If an MH along the route moves, its upstream neighbor detects the move and
propagates a link failure notification message to each of its active upstream neighbors.
 These MHs propagate the link failure notification to their upstream neighbors until the
source MH is reached.
 Hello messages can be used to maintain local connectivity in the form of beacon
signals.
 Designed for unicast routing only; multi-path routing is not supported.

2) Ad Hoc On-Demand Distance Vector Routing (AODV):

 AODV improves upon DSDV by minimizing the number of required broadcasts


through on-demand route creation.
 Nodes not in a selected path do not maintain routing information or participate in
routing table exchanges.
 A source node initiates a path discovery process to locate intermediate nodes and the
destination by broadcasting a Route Request (RREQ) packet to its neighbors.
3) Hybrid Routing Approaches:

Zone Routing Protocol (ZRP):

 A hybrid of reactive and proactive protocols.

 Limits the scope of proactive search to the node’s local neighborhood.

 The node needs to identify all its neighbors that are one hop away.

 The node’s local neighborhood is defined as a routing zone with a given distance.

 All nodes within a hop distance of at most ddd from node X are in the routing zone of node
X.

 All nodes at a hop distance exactly ddd are peripheral nodes of node X’s routing zone.

 Intra-zone Routing: Proactively maintains routes to all nodes within the source node’s own
zone.

 Inter-zone Routing: Uses an on-demand protocol (similar to DSR or AODV) to determine


routes to nodes outside the zone.
Position-Based Routing:

 Routing protocols that utilize location information.

 Can be classified according to how many Mobile Hosts (MHs) have the service.

 Forwarding decisions by an MH are based on the position of the packet’s destination and the
position of the MH’s immediate one-hop neighbor.

Three Main Packet Forwarding Schemes:

1. Greedy Forwarding:
o An MH forwards a packet to one of its one-hop neighbors based on the
optimization criteria of the algorithm.
2. Restricted Directional Flooding:
o An MH forwards a packet to one or more of its one-hop neighbors, also based
on the optimization criteria.
3. Hierarchical Approaches:
o Forms a hierarchy to scale to a large number of Mobile Hosts (MHs).
Location Services:

 Mobile Hosts (MHs) register their current position with this service.

 When a node does not know the position of a desired communication partner, it contacts
the location service to request that information.

 In classical one-hop cellular networks, dedicated position servers maintain position


information about all MHs.

 In MANETs, a centralized approach is viable only as an external service:

o First: It would be difficult to obtain the location of a position server if the server is
part of the MANET.

o Second: Since a MANET is dynamic, it might be challenging to ensure at least one


position server is present within the MANET.

1)Distance Routing Effect Algorithm for Mobility (DREAM):

 Within the DREAM framework, each Mobile Host (MH) maintains a position
database that stores location information about other MHs.
 An entry in the position database includes:
o MH identifier
o Direction and distance to the MH
o Time value when this information was generated
 A MH can control the accuracy of its position information available to other MHs in
two ways:
o Temporal Resolution: By changing the frequency at which it sends position
updates.
o Spatial Resolution: By indicating how far a position update may travel before
it is discarded.
Distance Effect in DREAM:

 Temporal Resolution:
o The frequency of sending updates is coupled with the mobility rate of a
Mobile Host (MH). Higher speeds result in more frequent updates.
 Spatial Resolution:
o Provides accurate position information in the direct neighborhood of a MH
and less accurate information at nodes farther away.
o Costs associated with accurate position information at remote MHs can be
reduced because the greater the distance between two MHs, the slower they
appear to move relative to each other.
 Example:
o From MH A’s perspective, the change in direction will be greater for MH B
than for MH C.

2) Quorum-Based Location Service:

 Information updates (write operations) are sent to a subset (quorum) of available nodes,
while information requests (read operations) are referred to a potentially different subset.

 By designing these subsets such that their intersection is nonempty, it is ensured that an up-
to-date version of the sought-after information can always be found.

 A set of Mobile Hosts (MHs) is chosen to host position databases.

 A virtual backbone is constructed among the MHs of the subset using a non-position-based
ad hoc routing algorithm.

 An MH sends position update messages to the nearest backbone MH, which then selects a
quorum of backbone MHs to host the position information.
3) Grid Location Service:

 Divides the area that contains the MANET into a hierarchy of squares, forming a so called
quad tree

 Each node maintains a table of all other MHs within the local first-order square

 Establishes near MH IDs, defined as the least ID greater than a MH’s own ID

 Position information of 10 is available at nodes 15, 18, 73

 Second order squares Nodes 14, 25, and 29 are selected to host the node 10’s position
2)Greedy Packet Forwarding:

 The sender includes an approximate position of the recipient in the packet.

 This information is gathered by an appropriate location service.

 The intermediate node forwards the packet to a neighbor lying in the direction of the
recipient.

 This process is repeated until the recipient is reached.

 It is a good strategy when the sender cannot adjust the transmission signal strength.

 MFR (Most Forward within Radius) and NFP (Nearest with Forward Progress) are common
strategies used in this context.

Greedy Packet Forwarding (Compass Routing):

 Packets are forwarded to the neighbor closer to the straight line between the sender and
the destination.

 The sender may randomly select one of the nodes closer to the destination.

 Greedy routing may fail to find a path between the sender and the destination, even if one
exists.

 To address this, the packet should be forwarded to the node with the least backward
(negative) progress.

 However, this approach raises the problem of looping.


Greedy Perimeter Stateless Routing (GPSR) Protocol:

 Based on planar graph traversal.

 Nodes do not need to store any additional information.

 A packet enters recovery mode when it arrives at a local maximum.

 It returns to greedy mode when it reaches a node closer to the destination.

 The graph formed by a MANET is generally not planar, as shown.

 An edge between two nodes A and B is included in the graph only if the intersection of the
two circles (with radii equal to the distance between nodes A and B) around those nodes
does not contain any other nodes.
 The edge between nodes A and C would not be included in the planar subgraph if nodes B
and D are within the intersection of the circles.

Planar Graph Traversal:

 A simple planar graph traversal is used to find a path toward the destination.
 The packet is forwarded on faces of the planar subgraph, progressively closer to the
destination.
 On each face, from node S toward node D, the packet is forwarded along the interior
of the face by moving to the next edge counterclockwise from the edge on which it
arrived.
 The algorithm guarantees that a path will be found if at least one exists.
 The packet header contains additional information such as:
o The position of the node.
o The position of the last intersection that caused a face change.
o The first edge traversed on the current face.
Restricted Directional Flooding:

 The sender node S of a packet with destination node D forwards the packet to all one-hop
neighbors that lie "in the direction of node D."

 The expected region is a circle around the position of node D as known by node S.

 "Direction towards node D" is defined by the line between nodes S and D and the angle ϕ.

Location-Aided Routing (LAR):

 LAR uses position information to enhance the route discovery phase of reactive ad
hoc routing approaches.
 This position information helps restrict flooding to a certain area called the request
zone during route discovery.
 If node S knows that node D travels with an average speed vvv, then the expected
zone is a circular region with a radius of v(t1−t0), centered at location L.
 The expected zone is an estimate made by node S to identify a region that potentially
contains D at time t1.
Request Zone in LAR:

 The request zone can be defined based on the expected zone.

 Node S defines a request zone for the route request.

 A node forwards a route request only if it belongs to the request zone.

 To increase the probability of reaching node D, the request zone should include the
expected zone.

 Additionally, the request zone may also encompass other regions around the expected zone.
UNIT-2
Data Transmission - Broadcast Storm Problem
Routing Approaches

Broadcasting

* Is a common operation in many applications, e.g., graph-related and distributed computing


problems

* It is also widely used to resolve many network layer problems

Multicasting

* Transmission of datagrams to a group of hosts identified by a single destination address

Hence is intended for group-oriented computing

Can efficiently support a variety of applications that are characterized by close collaborative efforts

Geocasting

* Aims at delivering data packets to a group of nodes located in a specified geographical area

* Can be seen as a variant of the conventional multicasting problem, and distinguishes itself by
specifying hosts as group members within a specified geographical region

* Since all these three do communication to a group of recipients, it is imperative to determine what
is the best way to provide these services in an ad hoc (MANET) environment

The Broadcast Storm


MANET consists of a set of MHs that may communicate with one another from time to time

 No base stations are present


 Each host is equipped with a CSMA/CA
 Transmission of a message to all other MHs required

The broadcast is spontaneous

 Due to MH mobility and lack of synchronization, any kind of global topology


knowledge is prohibitive
 Little or no local information may be collected in advance
The broadcast is frequently unreliable

 Acknowledgement mechanism is rarely used


 Distribute a broadcast message to as many MHs as possible without putting too much
effort
 A MH may miss a broadcast message because it is off-line, it is temporarily isolated
from the network, or it experiences repetitive collisions
Broadcast

 Acknowledgements may cause serious medium contention


 In many applications 100% reliable broadcast is unnecessary
 MH can detect duplicate broadcast messages
 If flooding is used blindly, many redundant messages will be sent and serious
contention/collision will be incurred
Redundant rebroadcasts

 When a MH decides to rebroadcast, all its neighbors may already have the message
Contention

Transmissions from neighbors may severely contend with each other


Collision

Due to absence of collision detection, collisions are more likely to occur and cause more damage

Rebroadcasting Schemes:
 Minimize number of retransmissions of a broadcast message
 Attempt to deliver a broadcast packet to each and every node in the network
Common Attributes of Broadcast Protocols

Jitter and Random Delay Timer (RDT)

 Jitter allows one neighbor to acquire the channel first while other neighbors detect
that the channel is busy
 RDT allows a node to keep track of redundant packets received over a short time
interval
Loop Prevention

 Node rebroadcasts a given packet no more than one time by caching original source
node ID of the packet and the packet ID

Categories of Broadcasting Protocols:


Simple flooding:

 A source node broadcasting a packet to all neighbors


 The neighbors, upon receiving the broadcast packet, rebroadcast the packet exactly
once
Probability-based methods:

 Similar to ordinary flooding


 Nodes only rebroadcast with a predetermined probability
 In dense networks, multiple nodes share similar transmission coverage
 Counter-Based Scheme: relationship between number of times a packet is received
and the probability of a node's transmission to cover additional area on a rebroadcast
Area-based methods

 If a sender is located only one meter away, the additional area covered by the
retransmission by a receiving node rebroadcasts is quite low
 Distance-based scheme compares the distance between itself and each of its neighbor
nodes that has previously rebroadcast a given packet
 Location-based scheme uses a more precise estimation of expected additional
coverage area
Neighbor Knowledge-based: SBA, Multipoint Relaying, AHBP

 Flooding with Self Pruning requires each node to have knowledge of its one-hop
neighbours
 Scalable Broadcast Algorithm (SBA) requires that all nodes have knowledge of their
neighbours within a two-hop radius
 Each node searches its neighbour tables for the maximum neighbour degree of any
neighbour node, say, dNmax
 Calculates a Random Time Delay (RDT)based on the ratio of where dme is the
number of current Neighbours for the node

 Dominant Pruning: Uses two-hop neighbor knowledge, but proactively choosing


some or all of its one-hop neighbors as rebroadcasting nodes
 Multipoint Relaying: Similar to Dominant Pruning, but rebroadcasting nodes,
[Multipoint Relays (MPRs)] are explicitly chosen by upstream senders
Algorithm for a node to choose its MPRs:

1. Find all two-hop neighbors that can only be reached by one one-hop neighbor and assign those
one-hop neighbors as MPRs
2. Determine the resultant cover set i.e., the set of two-hop neighbors that will receive the packet
from the current MPR set)

3. From the remaining one-hop neighbors not yet in the MPR set, find the one that would cover the
most two-hop neighbors not in the cover set

4. Repeat from step 2 until all two-hop neighbors are covered

Ad Hoc Broadcast Protocol (AHBP)


 Approach similar to Multipoint Relaying by designating nodes as a Broadcast Relay
Gateway (BRG)
 AHBP differs from Multipoint Relaying in three ways:
1. A node using ABP informs one-hop neighbors of the BRG designation by a field in the header of
each broadcast packet as opposed to done by hello packets in Multipoint Relaying

2. In AHBP, when a node receives a broadcast packet listed as a BRG, it uses two-hop neighbor
knowledge to find which neighbors also received the broadcast packet in the sahe transmission so as
to remove from the neighbor graph

3. AHBP is extended to account for high mobility networks

Multicasting: Tree-based: AMRIS, MAODV; Mesh-based: ODMRP,


CAMP; Hybrid: AMRoute, MCEDAR:
 Broadcast protocols cannot be used as multicasting requires a selected set of MHs to
receive the message
Protocols are classified into four categories based on how route to the members of the group is
created:

 Tree-Based Approaches
 Meshed-Based Approaches
 Stateless Multicast
 Hybrid Approaches

Tree-Based Approaches
 Extend tree-based approach to provide multicast in a MANET
 A packet traverses each hop and node in a tree at most
 Very simple routing decisions at each node
 Tree structure built representing shortest paths amongst nodes, and a loop-free data
distribution structure
 Even a link failure could mean reconfiguration of entire tree structure, could be a
major drawback
 Consider either a shared tree or establish a separate tree per each source
 For separate source trees, each router in multiple router groups must maintain a list of
pertinent information for each group and such management per router is inefficient
and not scalable
 For shared trees, there is a potential that packets may not only not traverse shorter
paths, but routed on paths with much longer distances
Ad hoc Multicast Routing Protocol Utilizing Increasing Id-Numbers(AMRIS):

 Utilizing Increasing id-numberS (AMRIS) is an on-demand protocol, which


constructs a shared multicast delivery tree to support multiple senders and receivers in
a multicast session
 AMRIS dynamically assigns an id-number to each node in each multicast session and
a multicast delivery tree - rooted at a special node with Sid (Smallest-ID and is
usually a source that initiates a multicast session) - is created and the id-number
increases as the tree expands from the Sid
 In case of multiple senders, a Sid is selected among the given set of senders
 Once a Sid is identified, it sends a NEW-SESSION message to its neighbors
 This message includes Sid's msm-id (multicast session member id) and the routing
metrics
 Nodes receiving the NEW-SESSION message generate their own msm-ids, which is
larger than the msm-id of the sender
 In case a node receives multiple NEW-SESSION messages from different nodes, it
keeps the message with the best routing metries and calculates its msm-ids
 To join an ongoing session,a, node checks the NEW-SESSION message,determines a
parent with smallest msm-ids,and unicast a JOIN-REQ to its potential parent node
 If parent node is already in the multicast delivery tree,it replies with a JOIN-ACK
 If a node is unable to find any potential parent node, it executes a branch
reconstruction (BR) process to rejoin the tree
Route Discovery and Join for Multicast
Multicast Adhoc On-Demand Distance Vector Protocol (MAODV)

 Follows directly from the unicast ADV


 Discovers multicast routes on-demand using a broadcast route discovery mechanism
employing the same Route Request (RREQ) and Route Reply (RREP) messages
 A MH originates a RREQ message when it wishes to join a multicast group, or when
it has data to send to a multicast group but it does not have a route to that group
 Only a member of the desired multicast group may respond to a join RREQ
 If the RREQ is not a join request, any node with a fresh enough route to the multicast
group may respond
 As the RREQ is broadcasted across the network, nodes set up pointers to establish the
reverse route in their route tables
 A node receiving a RREQ first, updates its route table to record the sequence number
 For join RREQs, an additional entry is added to the multicast route table and is not
activated unless the route is selected to be a part of the multicast tree

Multicast AODV
 Multicast Ad hoc On-Demand Distance Vector Protocol
 Follows directly from the unicast AODV


Mesh based Approach
 Mesh-based multicast protocols may have multiple paths between any source and
receiver pairs
 Mesh-based protocols seem to outperform tree-based proposals due to availability of
alternative paths
 A mesh has increased data-forwarding overhead
 The redundant forwarding consumes more bandwidth
 " The probability of collisions is higher when a larger number of packets are
generated
On-Demand Multicast Routing protocol (ODMRP)
Mesh-based protocol employing a forwarding group concept

 Only a subset of nodes forwards the multicast packets


 A soft state approach is taken in ODMRP to maintain multicast group members
 No explicit control message is required to leave the group
 The group membership and multicast routes are established and updated by the source
on demand
 If no route to the multicast group, a multicast source broadcasts a Join-Query control
packet to the entire network
 This Join-Query packet is periodically broadcasted to refresh the membership
information and updates routes
 •After establishing a forwarding group and route construction process,source can
multicast packets to receivers via selected routes and forwarding groups
 To leave the group, source simply stops sending Join-Query packets
 "If a receiver no longer wants to receive from a particular multicast group, it does not
send the Join-Reply for that group

Core-Assisted Mesh Protocol(CAMP)

 Supports multicasting by creating a shared mesh for each multicast group


 Meshes thus created, helps in maintaining the connectivity to the multicast users, even
in case of node mobility
 It borrows concepts from CBT, but the core nodes are used for control traffic needed
to join multicast groups
 " Assumes a mapping service by building and
 maintaining the multicast mesh
 Nodes are classified as: simplex, duplex and non member
 CAMP uses a receiver-initiated method for routers to join a multicast group
 CAMP ensures the mesh to contain all reverse shortest paths between a source and the
recipients
Multicast Mesh Creation:

 CAMP creates a shared mesh for each multicast group, which helps maintain
connectivity among multicast users, even when nodes move.
 The mesh is essentially a network of interconnected nodes that support multicast
communication.
- Control Traffic and Core Nodes:

 CAMP uses core nodes to handle control traffic related to joining and maintaining
multicast groups.
 Core nodes are crucial for managing group membership and facilitating
communication within the multicast group.
- Router Classification:

 Simplex Mode: A router in this mode only sends multicast traffic received from
specific nodes to the rest of the group. It does not forward multicast packets from
other nodes.
 Duplex Mode: A router in this mode forwards multicast packets for the group and
participates actively in the multicast mesh.
 Non-Member: A router that does not participate in the multicast mesh and does not
need to forward multicast traffic.
Joining and Leaving Groups:

 Receiver-Initiated Method: Routers join a multicast group by announcing their


membership.
 If a router has multiple neighbors that are already members, it updates its routing table
and announces itself to these neighbors.
 If no direct neighbors are members, the router sends a join request to a core node or
uses an expanding ring search to find a member.
 Routers can leave a multicast group if they no longer have hosts that need the group
or if they are not required for efficient packet dissemination.
Maintaining Connectivity:

 CAMP ensures that all reverse shortest paths between a source and recipients are
maintained in the mesh.
 Receiver nodes periodically check if they are receiving data packets via the shortest
path. If not, they send a HEARTBEAT message to their successor, which triggers a
PUSH JOIN (PJ) message. This process forces non-member nodes in the path to join
the mesh.
Advantages and Disadvantages:

Advantages:

 CAMP avoids flooding, which limits the spread of multicast join requests to mesh
members only.
Disadvantages:

 It depends on an underlying unicast routing protocol to ensure that distances to all


destinations are accurate and updated within a finite time frame.
Hybrid Approaches
Ad hoc Multicast Routing Protocol (AMRoute)

Creates a bi-directional, shared tree by using only group senders and receivers as tree
nodes for data distribution
 The protocol has two main components: mesh creation and tree setup
 The mesh creation identifies and designates certain nodes as logical cores and these
are responsible for initiating the signaling operation and maintaining the multicast tree
to the rest of the group members
 A non-core node only responds to messages from the core nodes and serves as a
passive agent
 The selection of logical core in AMRoute is dynamic and can migrate to any other
member node, depending on the network dynamics and the group membership
 AMRoute does not address network dynamics and assumes the underlying unicast
protocol to take care
AMRoute Protocol Overview:
1. Core Nodes and Their Role:
Non-Core Nodes:

 Serve as passive agents that only respond to messages from other core nodes.
 The selection of a logical core is dynamic and can change based on network dynamics
and group membership.
2. Mesh Creation:

Initial Process:

 Each member node starts by identifying itself as a core and broadcasts JOIN_REQ
packets.
 These packets use increasing Time-to-Live (TTL) values to discover other core nodes
in the network.
Core Response:

 When a core node receives a JOIN_REQ from another core node in a different mesh
for the same group, it replies with a JOIN ACK.
 This creates a bi-directional tunnel between the two cores and one of them is selected
as the core after the mesh merger.
3. Tree Creation:

Initiation:

 Once the mesh is established, the core node initiates the tree creation process.
 The core node sends periodic TREE_CREATE messages along all links in its mesh.
Message Forwarding:

 TREE_CREATE messages are sent using unicast tunnels only to group members.
 Group members receiving a non-duplicate TREE_CREATE message will forward it
to all mesh links except the incoming one.
 They mark the incoming and outgoing links as tree links.
Handling Unused Links:

 If a link is not going to be used as part of the tree, the TREE_CREATE message is
discarded, and a TREE_CREATE_NAK message is sent back to the incoming link.
4. Leaving a Group:

Process:

 A member node wishing to leave the group sends a JOIN NAK message to its
neighboring nodes.
5. Virtual Mesh Links:

Function:

 Virtual mesh links are used to establish and maintain the multicast tree.
 This helps keep the multicast delivery tree consistent even with changes in network
topology, as long as routes between core nodes and tree members exist via mesh links.

6. Disadvantages:

Temporary Loops and Non-Optimal Trees:

 AMRoute may experience temporary loops and create non-otimal multicast trees due
to network mobility.
MCEDAR Protocol :

The Multicast Core-Extraction Distributed Ad Hoc Routing (MCEDAR) protocol is designed to


enhance multicast routing by combining the strengths of tree-based and mesh-based forwarding
protocols. Here's a detailed breakdown of its components and operations:

MCEDAR Protocol Overview

1. Objective:

 MCEDAR aims to integrate the efficiency of tree based forwarding with the
robustness of mesh-based protocols.
2. Combining Approaches:

Tree-Based Forwarding:(data forwarding)

 Creates a source-based forwarding tree on a mesh to ensure efficient data delivery.


Mesh-Based Protocols(its robustness)

 Provides robustness by using a mesh structure that can tolerate link failures.
3. Forwarding Tree on a Mesh:

Source-Based Forwarding Tree:

 Built on top of the mesh infrastructure.


 Ensures that data forwarding occurs over the shortest paths (minimum height trees).
4. Decoupling Control and Data Forwarding:

Control Infrastructure:

 Separate from actual data forwarding to reduce control overhead.


Unicast Protocol:

 The underlying unicast protocol, CEDAR, handles core broadcasting for multicasting
5. Core Nodes and Mesh Infrastructure:

Core Nodes:

 Used for routing management and link state inspection.


Mesh Infrastructure (mgraph):

 Cores form the mesh structure (referred to as mgraph) and use join IDs to perform
join operations.
6. Mesh Tolerance:

Link Breakage Tolerance:

 MCEDAR can tolerate some link failures without needing reconfiguration, thanks to
its mesh-based approach.
7. Forwarding Mechanism:

Implicit Route-Based Forwarding Tree:

 The mesh uses this mechanism to ensure packets travel the shortest distance.
Efficiency:

 Achieved by creating a forwarding tree on the mesh.


Unit-3
Geo casting:

 Geo casting is a variant of the conventional multicasting problem.

 Group members are located within a specified geographical region.

 Whenever a node in the geo cast region receives a geo cast packet, it floods the packet to all
its neighbours.

 A geo cast protocol is considered successful if at least one node in the geo cast region
receives the geo cast packet.

 Protocols use a jitter technique to avoid packet collisions during broadcasting.

 Existing geo cast protocols are divided into two categories:

o Data-Transmission Oriented Protocols

o Routing-Creation Oriented Protocols

 The distinction between these categories is how they transmit information from a source to
one or more nodes within the geo cast region.

Data-Transmission Oriented Geo cast Routing Protocols:

 Location-Based Multicast:
o Extends the LAR (Location-Aided Routing) unicast routing algorithm for geo
casting.
o Utilizes location information to improve the performance of a unicast routing
protocol.
o Aims to decrease the delivery overhead of geo cast packets by reducing the
forwarding space, while maintaining data delivery accuracy.
o The algorithm is based on a flooding approach, where a node determines
whether to forward a geo cast packet using one of two schemes.

LBM Scheme 1:

 When a node receives a geo cast packet, it forwards the packet to its neighbours if it
is within a forwarding zone.
 The size of the forwarding zone depends on:
1. The size of the geo cast region.
2. The location of the sender.
 A parameter d provides additional control over the size of the forwarding zone.
LBM Scheme 2:

 Does not have an explicitly defined forwarding zone.

 Forwarding is based on the position of the sender node and the position of the geo cast
region.

 Node B forwards a geo cast packet from node A if Node B is "at least d closer" to the center
of the geo cast region.

 Node K will, however, discard a geo cast packet transmitted by node B.


Routing creation Oriented protocol

GeoTORA

1. GeoTORA aims to reduce the overhead of transmitting geocast packets via flooding
techniques while maintaining high accuracy.

2. Usage of TORA: GeoTORA utilizes the unicast routing protocol TORA (Temporally-Ordered
Routing Algorithm) to transmit geocast packets to a geocast region.

3. TORA Characteristics:

o TORA is a distributed routing protocol.

o It is based on a "link reversal" algorithm.

o TORA provides multiple routes to a destination.

o TORA maintains a destination-oriented directed acyclic graph (DAG) even during


dynamic link failures, ensuring each node can reach the destination.

4. GeoTORA Mechanism:

o The source node performs an anycast to any geocast group member (any node in
the geocast region) via TORA.

o Once a node in the geocast region receives the packet, it floods the packet, but the
flooding is restricted to the geocast region.

5. Accuracy:

o GeoTORA has high accuracy, though not as high as pure flooding or Location-Based
Multicast (LBM).

o The accuracy decreases if only one node in the geocast region receives the packet
and that node is partitioned from others in the region.

Mesh-based Geocast Routing (MGR)

The Mesh-based Geocast Routing (MGR) protocol is designed for geocasting in an ad hoc
environment, aiming to provide redundant paths between the source and group members.

Redundant Paths:

 MGR creates redundant paths from the source to the geocast region because the group
members in a geocast region are in close proximity.

 This proximity makes it less costly to establish redundant paths compared to multicast
groups where nodes might be spread out.

Flooding and Control Packets:

 Instead of flooding geocast packets, MGR uses control packets to create redundant routes.
 The protocol begins by flooding JOIN-DEMAND packets within a defined forwarding zone.

JOIN-DEMAND and JOIN-TABLE Packets:

 A JOIN-DEMAND packet is forwarded across the network until it reaches a node within the
geocast region.

 Upon reaching a geocast region node, the node unicasts a JOIN-TABLE packet back to the
source by following the reverse path of the JOIN-DEMAND packet.

Mesh Formation:

 Nodes on the edge of the geocast region, after receiving the JOIN-TABLE packet, become
part of the mesh.

 Once the source receives the first JOIN-TABLE packet, it can begin sending data packets to
nodes within the geocast region.

TCP over Ad Hoc TCP protocol overview:


Introduction

* TCP most widely used transport protocol

* Ad hoc networks composed exclusively of wireless links

* All nodes can move freely and unpredictably

* TCP needs to distinguish the nature of errors

Designed and Fine Tuned to Wired Network

* Design heavily influenced by "end-to-end argument"

" Excessive intelligence in physical and link layers to handle error

control, encryption or flow control

* Performance often dependant on flow control and congestion control

* Time outs and retransmission handle error control

* It is important to incorporate link layer acknowledgement and error detection/correction


functionality

High error rates, longer delays and mobility makes MANET environments extremely challenging

TCP Basics

* Byte Stream Delivery: TCP interfaces between the application layer above and the network layer
below and TCP decides whether to segment or delineate the byte stream in order to transmit data in
manageable pieces to the receiver, hence called

"byte stream delivery service"

* Connection-Oriented: Two communicating TCP entities (the sender and the receiver) must first
agree upon the willingness to communicate
* Full-Duplex: TCP almost always operates in full-duplex mode, and TCP exhibit asymmetric behavior
only during connection start and close sequences i.e., data transfer in the forward direction but not
in the reverse, or vice versa)

Reliable TCP guarantees:

A rumber of mechanisms help provide the guarantees:

* Checksums: All TCP segments carry a checksum,used by the receiver to detect errors with either
the TCP header or data

* Duplicate data detection:TCP keeps track of bytes received in order to discard duplicate copies of
data that has already been received

* Retransmissions: TCP must implement retransmission schemes for data that may be lost or
damaged and the lack of positive acknowledgements, coupled with a timeout period calls for a
retransmission

* Sequencing: It is TCP's job to properly sequence segments it receives so that it can deliver the byte
stream data to an application in order

* Timers: TCP maintains various static and dynamie timers on data sent and if the timer expires
before receiving an acknowledgement, the sender can retransmit the segment

TCP Frame Details:

 Source Port: This is a 16-bit number identifying the application where the TCP
segment originated from within the sending host
 Destination Port: A 16-bit number identifying the application theTCP segment is
destined for on a receiving host
 Sequence Number: A 32-bit number, identifying the current position of the first data
byte in the segment and after reaching 2ª -1, this number will wrap around to
 Acknowledgement Number: A 32-bit number identifying the next data byte the
sender expects from the receiver and is one greater than the most recently received
data byte
 Header Length: A 4-bit field that specifies the total TCP header length in 32-bit
words (or in multiples of 4 bytes), with the largest TCP header of 60 bytes
 Reserved: A 6-bit field currently unused and reserved for future use
 Control Bits:
 Urgent Pointer (URG) - If this bit field is set, the receiving TCP should interpret the
urgent pointer field
 Acknowledgement (ACK) - If this bit is set, the acknowledgment field is valid
 Push Function (PSH) - If this bit is set, the receiver should deliver this segment to
the receiving application as soon as possible
 Reset Connection (RST) - If this bit is present, it signals the receiver that the sender
is aborting the connection and all the associated queued data and allocated buffers can
be freely relinquished
 *Synchronize(SYN):When present,this bit field signifies that the sender is attempting
to “synchronize” sequence numbers.
 No More Data from Sender (FIN) - If set, this bit field tells the receiver that the
sender has reached the end of its byte stream for the current TCP connection
TCP Details:

 Window: This is a 16-bit integer used by TCP for flow control in the form of a data
transmission window size
 Checksum: A sender computes the checksum value of 16-bits, based on the contents
of the TCP header and data fields and is compared with the value the receiver
generates using the same computation
 Urgent Pointer: This 16-bit field tells the receiver when the last byte of urgent data
in the segment ends
 " Options: Depending on the options) used, the length of this field varies in size, but
it cannot be larger than 40 bytes due to the maximum size of the header length field (4
bits)
 Padding: It may be necessary to "pad" the TCP header with zeroes so that the
segment ends on a 32-bit word boundary as defined by the standard
 Data: This variable length field carries the application data from TCP sender to
receiver and this field coupled with the TCP header fields constitutes a TCP segment

Congestion Control:

 Slow Start: (A mechanism to control the transmission rate) Whenever a TeP


connection starts, the Slow Start algorithm at the sender initializes a congestion
window (CWND) to one segment and the congestion window increases by one
segment for each acknowledgement returned
 Congestion Avoidance: When Slow Start forces a network to drop one or more
packets due to overload or congestion, Congestion Avoidance is used to reduce the
transmission rate
 Fast Retransmit: When a duplicate ACK is received, the sender does not know if
this is because a TCP segment was lost or because a segment was delayed and
received out of order at the receiver and if more than two duplicate ACKs are
received by the sender, it does not even wait for the Retransmission Timeout to expire
and retransmits the segment (as indicated by the position of the duplicate ACK in the
byte stream)
 Fast Recovery: The sender has implicit knowledge that there is data still flowing to
the receiver since duplicate ACKs can only be generated when a segment is received
and the sender only enters Congestion Avoidance mode
Time Estimation:

Round-Trip Time Estimation: When a host transmits a TCP packet to its peer, and the reply does not
come within the expected period, the packet is assumed to have been lost and the data is
retransmitted

 Over an Ethernet, no more than a few microseconds should be needed for a reply
 This process called Round-Trip Time (RTT) estimation
 If the RTT estimate is too low, packets are retransmitted unnecessarily; if too high,
the connection can sit idle while the host waits to timeout

TCP and MANETs:


Challenges:

 As the topology changes, the path is interrupted and TCP goes into repeated,
exponentially increasing time-outs, with severe performance impact
 TCP performance in ad hoc multi-hop environment depends critically on the
congestion window in use
Significant TCP unfairness:

 TCP injects packets at an increasing rate into the network until a packet loss is
detected and then, the sender shrinks its CWND, retransmits the lost packet and
resumes transmission at a lower increasing rate
 If the losses persist at every retransmission, the sender doubles its wait timer (i.e., the
RTO) so that it can wait longer for the ACK of the current packet being transmitted
and is known as the exponential back off strategy
Issues at the MAC Layer:

Consider a linear topology in which each node can only communicate with its adjacent neighbors

* In addition, consider that in Figures 7.7(a) and 7.7 (b) there exist a single TCP connection running
between nodes 1 and 5

TCP Throughput:

Larger the number of nodes a TCP connection needs to span, lower is the end-to-end throughput, as
there will be more medium contention taking place in several regions of the network
Capture Conditions:

In Figure 7.7(c) where there are two independent connections, (connection 2-3) (connection 4-5)

* Assuming that connection 2-3 experiences collision due to the hidden node problem caused by the
active connection 4-5, node 2 will back off and retransmit the lost frame

* At every retransmission, the binary exponential backoff mechanism imposes an increasingly


backoff interval, and implicitly, this is actually decreasing the possibility of success for the connection
2-3 to send a packet as connection 4-5 will

"dominate" the medium access once it has lower backoff value

* In consequence, the connection 2-3 will hardly obtain access to the medium while connection 4-5
will capture it.
NETWORK LAYER IMPACT

DSR Protocol Overview:

 On-Demand Operation: DSR works on an on-demand basis, meaning routes are discovered
only when needed. When a node wants to send data to a destination, it broadcasts a route
request (RREQ).

 Route Reply (RREP): Once the destination or another node with route knowledge receives
the RREQ, it sends back a route reply (RREP) to the sender, specifying the route to the
destination.

 Route Caching: Each node in the network stores routes it has learned or overheard in its
route cache. This eliminates the need for keeping constant, up-to-date routing tables,
reducing the need for periodic route advertisements, which could otherwise cause network
overhead.

Problem with Stale Routes:

 Stale Routes: In highly dynamic environments where nodes are frequently moving (high
mobility) or the network conditions change (e.g., signal interference), routes can become
invalid quickly.

o For instance, a route could become outdated by the time the RREP is returned,
either because a node in the route has moved or a link is broken.

o Other nodes might overhear this outdated RREP and update their route caches with
invalid information, causing further issues.

 Impact on TCP: When invalid routes are used, TCP (Transmission Control Protocol)
experiences delays in sending data. If this delay isn't handled properly, TCP can enter a
"backoff" state, which significantly degrades its performance.

Solutions:

 Avoiding Route Cache Replies: One approach to mitigate stale route issues is to prevent
nodes from replying using their cached routes. While this can improve route accuracy, it
increases network overhead because every new route discovery requires broadcasting a
new RREQ across the network.

 Trade-off: Although this extra overhead increases network traffic, it is balanced by the
improvement in route accuracy, particularly in networks with high mobility. As a result, TCP
performance can be enhanced because the likelihood of using stale routes is reduced.

TORA Protocol

 Hybrid Nature: TORA is primarily an on-demand protocol, but it also has proactive features.
It is designed for dynamic environments, quickly establishing routes while minimizing the
control messages (overhead) to a small set of nodes around the area where a topological
change (like a node movement or failure) has occurred.

 Multiple Routes: TORA maintains multiple routes between peers, meaning that a single
topological change doesn't always trigger a route discovery process unless all routes to a
destination are lost. This is achieved using Directed Acyclic Graphs (DAGs), where every
node has a path to the destination, allowing for several alternative paths.

 Efficient Route Maintenance: A route discovery process occurs only when no more routes
are available. When invalid routes are detected (due to changes like network partition),
affected nodes send a "clear packet" to remove the stale route from their neighbors,
avoiding unnecessary network-wide reactions.

Problems with Stale Routes:

 Like the Dynamic Source Routing (DSR) protocol, TORA can suffer from stale route
problems. If TCP attempts to send data through a route that has become invalid, delays or
errors can occur.

 However, because TORA only reacts when all routes are unavailable, stale routes are less
problematic compared to DSR. The multiple paths in TORA make route discovery less
frequent, which reduces the potential negative effects on TCP.

Problem with Multiple Paths and TCP:

 Out-of-Order Packets: While TORA's multiple path approach provides redundancy and
reliability, it introduces the issue of out-of-order packet delivery. Since TORA doesn’t
prioritize shorter paths, packets can arrive at the destination in the wrong sequence, which
is problematic for TCP.

o For example, an older packet could be sent along a longer path, while a newer
packet might be sent through a shorter path, arriving first at the destination. This
forces TCP to retransmit packets due to the perceived loss of the earlier packet,
degrading overall performance.

 Potential Solution: To address this, a self-adaptive mechanism could be introduced,


ensuring that shorter paths are preferred or at least managing path selection in a way that
minimizes out-of-sequence packet arrivals.

Impact on TCP and Routing Protocol Design:

 Cross-Layer Design: The analysis of both DSR and TORA shows that the design of routing
protocols should carefully consider their impact on the upper layers, particularly the widely
used TCP protocol. Cooperation between the network layer (routing) and transport layer
(TCP) through cross-layer design could provide solutions to these challenges, improving the
overall network performance.

Solutions for TCP over Ad hoc:


* Mobility-Related

* TCP-Feedback

* TCP sender can effectively distinguish between route failure and nerwork congestion by receiving
Route Failure Notification (RFN) messages from intermediate nodes
* Upon receipt of a Route Re-establishment Notification (RRN) message from the routing
protocol,the sender leaves the frozen state and resumes transmission using the same variables
values prior to the interruption.

*A route failure timer is employed to prevent infinite wait for RRN messages, is started whenever a
RFN is received and upon expiration of this timer, the frozen timers of TCP are reset hence allowing
the TCP congestion control to be invoked normally

The ELFN Approach

*Explicit Link Failure Notification (ELFN) is a cross-layer proposal in which TCP also interacts with the
routing protocol in order to detect route failure and take appropriate actions

* ELEN messages are sent back to the TCP sender from the node detecting the failure

* ELF messages contain sender and receiver addresses and ports, as well as the TCP sequence
number

* Whenever the TCP sender receives an ELEN message, it enters a

"stand-by" mode in which its timers are disabled and probe packets are sent regularly towards the
destination in order to detect route restoration

* Upon receiving an ACK packet, the sender leaves the "stand-by" mode and resumes transmission
using its previous timer values and state variables.

Fixed Retransmission Timeout (RTO)

* Relies on the idea that routing error recovery should be accomplished in a fast fashion by the
routing algorithm

* It disables such a mechanism whenever two successive retransmissions due to timeout occur,
assuming that it actually indicates route failure

* TCP sender doubles the RTO once and if the missing packet does not arrive before the second RTO
expires, the packet is retransmitted again and again, but the RTO is no longer increased

The ATCP Protocol:

* The Ad hoc TCP (ATCP) protocol does not impose changes to the standard TCP itself and instead, it
implements an intermediate layer between the network and the transport layers in order to provide
an enhanced performance to TCP

* ATCP relies on the ICMP protocol and on the Explicit Congestion Notification (ECN) scheme to
detect / distinguish network partition and congestion, respectively

* The intermediate layer keeps track of the packets to and from the transport layer so that the TCP
congestion control is not invoked when it is not really needed

TCP-DOOR (Detection Out-Of-Order and Response )

* Mobility in MANETs is extremely frequent and the packet usually arrive out-of-order (OOO) at the
destination
* The TCP-DOOR (Detection of Out-Of-Order and Response) protocol focuses on the idea that 000
delivery of packets can happen frequently in MANETs as a result of nodes mobility

* TCP-DOOR implements a detection of such deliveries at both entities: TCP sender and TCP receiver

Main Drawbacks:

* The approaches that rely on feedback information from inside the network (TCP-F, ELFN-based,
ATCP) may fail in situations where TCP sender is unable to receive data from the next hop node

* The usage of explicit notification by the intermediate nodes, such as ECN, raises many security
concerns

* The assumption in TCP-DOOR that 000 packets are exclusive results of route disturbance may not
be true in a quite a few scenarios

* The main concern addressed by the approaches presented so far is how to avoid the TCP
exponential backoff mechanism when losses take place by factors other than congestion

Fairness-Related:

COPAS:

* A protocol called COPAS (COntention-based PAth

Selection) has been proposed to address TCP performance drop due to the capture problem and
resulting unfairness

* COPAS implements two novel routing techniques in order to contention-balance the network,
namely, the use of disjoint forward (for TCP data) and reverse (for TCP ACK) paths to reduce the
conflicts between TCP packets traveling in opposite directions.
Neighborhood RED(Randomly Early Detection)

* Two unique features of ad hoc wireless networks are the key to understand unfair TCP behaviors:
Spatial reuse constraint and the location dependency

* View a node and its interfering neighbors to form a neighborhood (the neighborhood of a node X is
formed by all nodes within communication range of X)

* Flows get different feedback in terms of packet loss rate and packet delay when congestion
happens

* The main achievement of NRED is the ability to detect early congestion and drop packets
proportionally to a flow's channel bandwidth utilization.

Node A's Neighborhood and Distributed Queue

Keep estimating the size of neighborhood queue

* Once queue size exceeds certain threshold, a drop probability is computed

* This is propogated to provide cooperative packet drop

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy