Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!