Loading...
Please wait, while we are loading the content...
Similar Documents
Probabilistic Routing in Intermittently Connected Networks
| Content Provider | CiteSeerX |
|---|---|
| Abstract | Abstract—In this paper we consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There do however exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through such networks. We propose PROPHET, a probabilistic routing protocol for such networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PROPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead. I. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Intermittently Connected Network Probabilistic Routing Presented Epidemic Routing Protocol Communication Overhead Probabilistic Routing Protocol Destination Exists Traditional Routing Protocol |
| Content Type | Text |
| Resource Type | Article |
