Efficient routing in intermittently connected mobile network

Abstract:

Intermittently connected mobile networks are wirelessnetworks where most of the time there does not exist a completepath from the source to the destination. There are many real networksthat follow this model, for example, wildlife tracking sensornetworks, military networks, vehicular ad hoc networks, etc. Inthis context, conventional routing schemes fail, because they try toestablish complete end-to-end paths, before any data is sent.To deal with such networks researchers have suggested to useflooding-based routing schemes. While flooding-based schemeshave a high probability of delivery, they waste a lot of energyand suffer from severe contention which can significantly degradetheir performance. Furthermore, proposed efforts to reduce theoverhead of flooding-based schemes have often been plaguedby large delays. With this in mind, we introduce a new familyof routing schemes that spray a few message copies into thenetwork, and then route each copy independently towards thedestination. We show that, if carefully designed, spray routing not only performs significantly fewer transmissions per message,but also has

lower average delivery delays than existing schemes;furthermore, it is highly scalable and retains good performanceunder a large range of scenarios.Finally, we use our theoretical framework proposed in our 2004paper to analyze the performance of spray routing.We also use thistheory to show how to choose the number of copies to be sprayedand how to optimally distribute these copies to relays. Existing System:

Epidemic routing extends the concept of flooding in intermittently connected mobile networks.

It is one of the first schemes proposed to enable message delivery in such networks. Each node maintains a list of all messages it carries, whose delivery is pending.

Whenever it encounters another node, the two nodes exchange all messages that they dont have in common.

. The nodes, which received the message copy, now acts as source and distributes message copies to all nodes with in its transmission, range.

 Single-copy schemes generate and route only one copy per message (in contrast to flooding schemes that essentially send a copy to every node), in order to significantly reduce the number of transmissions.

Although they might be useful in some situations, single-copy schemes do not present desirable solutions for applications that require high probabilities of delivery and low delays.

Proposed System :

 Spray and Wait bounds the total number of copies and transmissions per message without compromising performance. Under low load, Spray and Wait results in much fewer transmissions and comparable or smaller delays than floodingbased schemes. Under high load, it yields significantly better delays and fewer transmissions than flooding-based schemes.

Software Requirements

Operating system Front End Coding Language

:- Windows XP Professional :- Microsoft Visual Studio .Net 2005 :- Visual C# .Net

Hardware Requirements

SYSTEM HARD DISK RAM

: Pentium III 700 MHz : 10 GB : 128 MB