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

Jiajia Liu, Xiaohong Jiang, Hiroki Nishiyama, Nei Kato

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

6 Citations (Scopus)

Abstract

The 2-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 the 2-hop relay with f-cast (2HR-f) under i.i.d. mobility model, a general 2-hop relay algorithm that allows one packet to be delivered to at most f distinct relay nodes. The 2HR-f algorithm covers the available 2-hop relay algorithms (f=1,√n) as special cases. Closed-form analytical models rather than order sense ones are developed for the 2HR-f algorithm with a careful consideration of important medium contention and queuing delay issues, which enable an accurate delay and capacity analysis to be performed for ad hoc mobile networks employing 2HR-f. Based on our models and some typical settings of f (say, f=1,√n), one can easily derive the corresponding order sense results.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Communications, ICC 2011
DOIs
Publication statusPublished - 2011
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: 2011 Jun 52011 Jun 9

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

Other2011 IEEE International Conference on Communications, ICC 2011
CountryJapan
CityKyoto
Period11/6/511/6/9

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

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