Packet delay estimation for ad hoc networks

Heberto Del Rio, Dilip Sarkar, Luisa D. Stelling

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

Network throughput and end-to-end delay time are two important parameters in the design and the evaluation of routing protocols for wireless ad hoc networks. Network throughput and routing protocols have been studied for some time. To be able to estimate the end-to-end delay time, the process induced by the random position of every node has to be known, that is, a mobility model for the nodes has to be specified. It has been proved that if a mobility model for the nodes is based on a Brownian motion on a flat 2-torus the expected end-to-end delay time has logarithmic growth. In this paper we propose a different, although related, mobility model for the nodes based on a discrete-time Markov chain on a flat 2-torus: a standard symmetric Random walk. We prove that under this mobility model the end-to-end delay time of a wireless ad hoc network with k user is ⊖(k log k).

Original languageEnglish (US)
Title of host publicationProceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005
Pages289-296
Number of pages8
DOIs
StatePublished - Dec 1 2005
Event14th International Conference on Computer Communications and Networks, ICCCN 2005 - San Diego, CA, United States
Duration: Oct 17 2005Oct 19 2005

Publication series

NameProceedings - International Conference on Computer Communications and Networks, ICCCN
Volume2005
ISSN (Print)1095-2055

Other

Other14th International Conference on Computer Communications and Networks, ICCCN 2005
CountryUnited States
CitySan Diego, CA
Period10/17/0510/19/05

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'Packet delay estimation for ad hoc networks'. Together they form a unique fingerprint.

Cite this