Document Open Access Logo

Algorithms for Message Ferrying on Mobile ad hoc Networks

Authors Mostafa Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, Richard J. Lipton



PDF
Thumbnail PDF

File

LIPIcs.FSTTCS.2009.2303.pdf
  • Filesize: 206 kB
  • 12 pages

Document Identifiers

Author Details

Mostafa Ammar
Deeparnab Chakrabarty
Atish Das Sarma
Subrahmanyam Kalyanasundaram
Richard J. Lipton

Cite AsGet BibTex

Mostafa Ammar, Deeparnab Chakrabarty, Atish Das Sarma, Subrahmanyam Kalyanasundaram, and Richard J. Lipton. Algorithms for Message Ferrying on Mobile ad hoc Networks. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 4, pp. 13-24, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2303

Abstract

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.
Keywords
  • Algorithms
  • Network Algorithms
  • Routing
  • TSP
  • Buffer Optimization

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail