Abstract
In order to improve the transfer efficiency while at the same time reduce the network delay and network cost in delay tolerant network (DTN), a DTN routing algorithm based on probabilistic delay, namely PD, is proposed. The link state algorithm is referenced in PD. Transfer delay, connectivity between nodes and historical factors are fully taken into consideration. Through simulative analysis, PD is found to be able to achieve better performance than CAR and epidemic routing in network environment with relatively long network transfer delay.
| Original language | English |
|---|---|
| Pages (from-to) | 687-691 |
| Number of pages | 5 |
| Journal | Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology |
| Volume | 28 |
| Issue number | 8 |
| Publication status | Published - Aug 2008 |
Keywords
- Delay tolerant network (DTN)
- Prediction
- Probabilistic delay
- Routing algorithm