De-triangulation optimal solutions for mobility scenarios with asymmetric links

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In the field of mobility support, several mobility protocols resort to the use of triangulation mechanisms as a means of supporting fast handovers or basic connectivity. In order to reduce the maximum end-to-end delay of the packets, such triangulations can be later removed to enable direct routing of the data packets. However, using a simple update of this routing entry can cause the reception of out-of-order packets at the mobile node receiver, as the direct packets can arrive earlier than the triangulated packets. This paper proposes a generic optimal de-triangulation mechanism that neither causes out-of-order packets nor increases the packet delay, for any combination of asymmetric links delays. After an analytic framework analysis contribution, the efficiency of the proposed algorithm is evaluated using simulation studies, in which the packet losses, packet delay, handover latency and control/data load metrics are measured. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Estrela, P. V., Vazão, T. M., & Nunes, M. S. (2008). De-triangulation optimal solutions for mobility scenarios with asymmetric links. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5200 LNCS, pp. 90–102). Springer Verlag. https://doi.org/10.1007/978-3-540-89524-4_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free