Delay and capacity in ad hoc mobile networks with f-cast relay algorithms

Jiajia Liu, Xiaohong Jiang, Hiroki Nishiyama, Nei Kato

Research output: Contribution to journalArticlepeer-review

73 Citations (Scopus)

Abstract

The two-hop relay algorithm and its variants have been attractive for ad hoc mobile networks, because they are simple yet efficient, and more importantly, they enable the capacity and delay to be studied analytically. This paper considers a general two-hop relay with f-cast (2HR-f), where each packet is delivered to at most f distinct relay nodes and should be received in order at its destination. We derive the closed-form theoretical models rather than order sense ones for the 2HR-f algorithm with a careful consideration of the important interference, medium contention, traffic contention and queuing delay issues, which enable an accurate delay and capacity analysis to be performed for an ad hoc mobile network employing the 2HR-f. Based on our models, one can directly get the corresponding order sense results. Extensive simulation studies are also conducted to demonstrate the efficiency of these new models.

Original languageEnglish
Article number5934686
Pages (from-to)2738-2751
Number of pages14
JournalIEEE Transactions on Wireless Communications
Volume10
Issue number8
DOIs
Publication statusPublished - 2011 Aug 1

Keywords

  • Ad hoc mobile networks
  • capacity
  • delay
  • packet redundancy
  • two-hop relay

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Delay and capacity in ad hoc mobile networks with f-cast relay algorithms'. Together they form a unique fingerprint.

Cite this