SEMINER ON

EFFICIENT ROUTING IN INTERMITTENTLY CONNECTED MOBILE NETWORK

THE MULTIPLE COPY CASE

PRESENTED BY
ANIRBIT BANERJEE
6TH SEMESTER, 2010-11, University Roll No. 08158003100

Department of Electronics &Communication Engineering

MALLABHUM INSTITUTE OF TECHNOLOGY
BISHNUPUR, BANKURA
Under
WEST BENGAL UNIVERSITY OF TECHNOLOGY
Intermittently Connected Mobile Networks

S
D

A wireless network that is very sparse and partitioned

disconnected clusters of nodes
Nodes are (highly) mobile making the clusters change
often over time
o

No fixed end-to-end path!

 ROUTING TECHNIQUES AND PROTOCOLS

ROUTING TECHNIQUES AND PROTOCOLS

PROACTIVE ROUTING On-demand Routing Location-based Routing

ROUTING TECHNIQUES AND PROTOCOLS
On-demand Routing
The main idea of on-demand routing is to finds and
maintain only needed routes. The obvious advantage
with discovering routes on-demand is to avoid incurring
the cost of maintaining routes that are not used.

Protocols used
 Dynamic Source Routing (DSR)

 Ad hoc On-demand Distance Vector (AODV)

ROUTING TECHNIQUES AND PROTOCOLS
Location-based Routing
It utilizes geographic location of nodes. Location-based (also
called geographic) routing assumes that each node knows its own
location by using the global positioning system (GPS) or some
other indirect, localization technique. Besides, every node learns
locations of its immediate neighbours by exchanging hello
messages.

Protocols used
 Location-Aided Routing (LAR)
 Distance Routing Effect Algorithm for Mobility (DREAM)

Greedy Perimeter Stateless Routing (GPSR)

 Ad-Hoc NETWORK
An ad hoc network is a collection of wireless mobile nodes (or
routers) dynamically forming a temporary network without the use
of any existing network infrastructure or centralized administration.

The routers are free to move randomly and organize themselves

arbitrarily; thus, the network’s wireless topology may change rapidly
and unpredictably.

Such a network may operate in a stand-alone fashion, or may be

connected to the Internet.

A mobile ad hoc network (MANET) group has been formed. The

primary focus of this working group is to develop and evolve
MANET specifications.
 Ad-Hoc Network Structure

Figure :- Simplified structure of Ad-Hoc

Network
Difference Between Ad-Hoc And Cellular network
 Flooding Mechanism of Ad-Hoc
network & Its Limitations
Flooding (or network-wide broadcasting) is the simplest way to
deliver data from a node to any other node in the network.
In flooding, the source simply broadcasts the data packet to its
neighbouring nodes via a MAC layer broadcast mechanism.
The rule “every node transmits only once” guarantees termination of
the procedure and also avoids looping.
The flooding technique delivers the data to every node in the
connected component of the network.
LIMITATIONS

Superfluous flooding increases link overhead and wireless medium

congestion. This is called” flood dying out” problem.
Wastage of energy is also a major disadvantage.
MULTIPLE CPOY ROUTING STRATEGIES

comparison to single-copy

existing flooding and utility-based schemes

Spray and Wait

performance analysis
ROUTING MECHANISM IN MULTIPLE COPY CASE
STRATEGY
 Advantages & Limitations of
Multiple Copy Routing
Advantages

Lower delivery delay.
Higher robustness

Limitation

Low efficiency
Single-Copy vs. Multiple-Copy Routing Strategies
Single-Copy Case Multiple-Copy Case

Only a single copy of each message

exists in the network at any time. Multiple copies of a message may
exist concurrently in the network.
Lower number of transmission.
Lower delivery delay.
Lower contention for shared
resources
Higher robustness
 Conclusion
From the above all we conclude that the multiple copy

case is introduce to solve the disadvantages of the

single copy case .In single copy case one message is
transmitted at any time but in multiple copy case we
can transmitted one or multiple copy of a message.
THANK YOU