On ad hoc routing with guaranteed delivery

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We point out a simple poly-time log-space routing algorithm in ad hoc networks with guaranteed delivery using universal exploration sequences.

Keywords

Distributed, Parallel, and Cluster Computing, Computational Complexity, C.2.2; F.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/158204

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0804.0862
 http://arxiv.org/abs/0804.0862

Collections

arXiv