S2006-IPI: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
(22 intermediate revisions by 5 users not shown) | |||
Line 1: | Line 1: | ||
==6. DTN Routing (2): Probabilistic / Un-Planned / Unknown Connectivity Pattern== |
==[[6-DTN-Routing | 6. DTN Routing (2): Probabilistic / Un-Planned / Unknown Connectivity Pattern]]== |
||
==[[8-DTN-Multicasting | 8. DTN Multicasting]]== |
|||
==9. Smart Routing Algorithms == |
|||
'''Topics''' |
'''Topics''' |
||
* [[Erasure-Coding Based Routing for Opportunistic Networks]] |
|||
* CAR - Context-aware Adaptive Routing |
|||
* [[Network Coding for Efficient Communication in Extreme Networks]] |
|||
* MEED - Minimum estimated expected delay |
|||
* SWIM |
|||
* PROPHET |
|||
[[Media:dtn2slides.pdf| Presentation slides]] |
|||
<br> |
|||
==10. Data Retrieval in Intermittedly Connected Networks== |
==10. Data Retrieval in Intermittedly Connected Networks== |
||
'''Topics''' |
|||
⚫ | |||
* [[ |
* [[DIR | Distributed Information Retrieval]] |
||
* [[EDIFY | Enhanced Disruption and Fault Tolerant Network]] |
|||
⚫ | |||
==[[15-Security-DTN | 15. Security in DTN]]== |
Latest revision as of 23:05, 23 October 2007
6. DTN Routing (2): Probabilistic / Un-Planned / Unknown Connectivity Pattern
8. DTN Multicasting
9. Smart Routing Algorithms
Topics
- Erasure-Coding Based Routing for Opportunistic Networks
- Network Coding for Efficient Communication in Extreme Networks
10. Data Retrieval in Intermittedly Connected Networks
Topics
Introductory Speech Slides (PDF)