Logarithmic expected packet delivery delay in mobile ad hoc wireless networks

Heberto Del Rio, Dilip Sarkar

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

It has been shown that in a mobile ad hoc wireless network per node throughput remains constant as the number of nodes approaches infinity, when the nodes lie in a disk of unit area. However, this requires that some packets are delivered indirectly by a relay node. In this paper, we prove, in the same setup, that D(k) ∈ Θ (log k), where D(k) is the expected delay time of a mobile ad hoc wireless network with k nodes. As consequence, we have concluded that mobile ad hoc wireless networks are not scalable for real-time applications.

Original languageEnglish (US)
Pages (from-to)281-287
Number of pages7
JournalWireless Communications and Mobile Computing
Volume4
Issue number3
DOIs
StatePublished - May 1 2004

Keywords

  • Ad hoc wireless networks
  • Brownian motion
  • Delivery delay
  • Packet delivery
  • Throughput

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Logarithmic expected packet delivery delay in mobile ad hoc wireless networks'. Together they form a unique fingerprint.

Cite this