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 Citations (Scopus)

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
Volume2005
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

Other

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

Fingerprint

Ad hoc networks
Time delay
Wireless ad hoc networks
Routing protocols
Throughput
Brownian movement
Markov processes

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Del Rio, H., Sarkar, D., & Stelling, L. D. (2005). Packet delay estimation for ad hoc networks. In Proceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005 (Vol. 2005, pp. 289-296). [1523870] https://doi.org/10.1109/ICCCN.2005.1523870

Packet delay estimation for ad hoc networks. / Del Rio, Heberto; Sarkar, Dilip; Stelling, Luisa D.

Proceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005. Vol. 2005 2005. p. 289-296 1523870.

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

Del Rio, H, Sarkar, D & Stelling, LD 2005, Packet delay estimation for ad hoc networks. in Proceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005. vol. 2005, 1523870, pp. 289-296, 14th International Conference on Computer Communications and Networks, ICCCN 2005, San Diego, CA, United States, 10/17/05. https://doi.org/10.1109/ICCCN.2005.1523870
Del Rio H, Sarkar D, Stelling LD. Packet delay estimation for ad hoc networks. In Proceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005. Vol. 2005. 2005. p. 289-296. 1523870 https://doi.org/10.1109/ICCCN.2005.1523870
Del Rio, Heberto ; Sarkar, Dilip ; Stelling, Luisa D. / Packet delay estimation for ad hoc networks. Proceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005. Vol. 2005 2005. pp. 289-296
@inproceedings{380fd0ec5b28442398ff57ef571dc7ec,
title = "Packet delay estimation for ad hoc networks",
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).",
author = "{Del Rio}, Heberto and Dilip Sarkar and Stelling, {Luisa D.}",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/ICCCN.2005.1523870",
language = "English (US)",
isbn = "0780394283",
volume = "2005",
pages = "289--296",
booktitle = "Proceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005",

}

TY - GEN

T1 - Packet delay estimation for ad hoc networks

AU - Del Rio, Heberto

AU - Sarkar, Dilip

AU - Stelling, Luisa D.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=33748362005&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33748362005&partnerID=8YFLogxK

U2 - 10.1109/ICCCN.2005.1523870

DO - 10.1109/ICCCN.2005.1523870

M3 - Conference contribution

SN - 0780394283

SN - 9780780394285

VL - 2005

SP - 289

EP - 296

BT - Proceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005

ER -