2026-07-20T14:49:49Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2303 2024-03-06T10:33:15Z ddc:004 open_access

Algorithms for Message Ferrying on Mobile ad hoc Networks Ammar, Mostafa Chakrabarty, Deeparnab Sarma, Atish Das Kalyanasundaram, Subrahmanyam Lipton, Richard J. Algorithms Network Algorithms Routing TSP Buffer Optimization Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the importantquestions which arise in this context is to determine the routing of the ferry,so as to minimize the buffers used to store data at the nodes in thenetwork. We introduce a simple model to capture the ferry routingproblem. We characterize {\em stable} solutions of the system andprovide efficient approximation algorithms for the {\sc Min-Max Buffer Problem} for the case when the nodes are onhierarchically separated metric spaces. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mostafa Ammar and Deeparnab Chakrabarty and Atish Das Sarma and Subrahmanyam Kalyanasundaram and Richard J. Lipton 2009 Is Part Of LIPIcs, Volume 4, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2009.2303 urn:nbn:de:0030-drops-23031 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2009.2303 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode