2015/06/15 by Shohreh Shaghaghian, Mark Coates, Shaghaghian, Shohreh +1
Computer Science · #Age of Information Optimization #Caching and Content Delivery #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks
paper · pdf · doi:10.48550/arxiv.1506.04729
openalex publication_date 2015/06/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Data transfer in opportunistic Delay Tolerant Networks (DTNs) must rely on\nunscheduled sporadic meetings between nodes. The main challenge in these\nnetworks is to develop a mechanism based on which nodes can learn to make\nnearly optimal forwarding decision rules despite having no a-priori knowledge\nof the network topology. The forwarding mechanism should ideally result in a\nhigh delivery probability, low average latency and efficient usage of the\nnetwork resources. In this paper, we propose both centralized and decentralized\nsingle-copy message forwarding algorithms that, under relatively strong\nassumptions about the networks behaviour, minimize the expected latencies from\nany node in the network to a particular destination. After proving the\noptimality of our proposed algorithms, we develop a decentralized algorithm\nthat involves a recursive maximum likelihood procedure to estimate the meeting\nrates. We confirm the improvement that our proposed algorithms make in the\nsystem performance through numerical simulations on datasets from synthetic and\nreal-world opportunistic networks.\n