End-to-end throughput capacity in multi-hop wireless networks

Jalaa Hoblos, Hassan Peyravi

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A fundamental issue in MWNs is that the end-to-end performance degrades quickly with hop counts and the degree of traffic aggregation at each hop. This disparity problem in MWNs worsens further when client traffic is forwarded via a series of relay nodes towards the destination through a series of tandem contention domains. Owing to the broadcast nature of the wireless medium, the end-to-end throughput is not only limited by the data rate of the individual links along the path, but also inversely affected by the hearing range and level of activity of the participating nodes. In this paper, we approximate node throughputs in MWNs by examining the underlying hop contention graph, along with hop counts and traffic aggregates. We show that node throughputs depend greatly on the location of nodes in relation to their hops away from the gateway and on the number of nodes in its sensing and transmission range.

Original languageEnglish (US)
Pages (from-to)213-220
Number of pages8
JournalInternational Journal of Wireless and Mobile Computing
Volume8
Issue number3
DOIs
StatePublished - Jan 1 2015

Fingerprint

Wireless networks
Throughput
Audition
Agglomeration

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

@article{41207969ae8e407291d94a5d6104e9ab,
title = "End-to-end throughput capacity in multi-hop wireless networks",
abstract = "A fundamental issue in MWNs is that the end-to-end performance degrades quickly with hop counts and the degree of traffic aggregation at each hop. This disparity problem in MWNs worsens further when client traffic is forwarded via a series of relay nodes towards the destination through a series of tandem contention domains. Owing to the broadcast nature of the wireless medium, the end-to-end throughput is not only limited by the data rate of the individual links along the path, but also inversely affected by the hearing range and level of activity of the participating nodes. In this paper, we approximate node throughputs in MWNs by examining the underlying hop contention graph, along with hop counts and traffic aggregates. We show that node throughputs depend greatly on the location of nodes in relation to their hops away from the gateway and on the number of nodes in its sensing and transmission range.",
author = "Jalaa Hoblos and Hassan Peyravi",
year = "2015",
month = "1",
day = "1",
doi = "10.1504/IJWMC.2015.069386",
language = "English (US)",
volume = "8",
pages = "213--220",
journal = "International Journal of Wireless and Mobile Computing",
issn = "1741-1084",
publisher = "Inderscience Enterprises Ltd",
number = "3",

}

End-to-end throughput capacity in multi-hop wireless networks. / Hoblos, Jalaa; Peyravi, Hassan.

In: International Journal of Wireless and Mobile Computing, Vol. 8, No. 3, 01.01.2015, p. 213-220.

Research output: Contribution to journalArticle

TY - JOUR

T1 - End-to-end throughput capacity in multi-hop wireless networks

AU - Hoblos, Jalaa

AU - Peyravi, Hassan

PY - 2015/1/1

Y1 - 2015/1/1

N2 - A fundamental issue in MWNs is that the end-to-end performance degrades quickly with hop counts and the degree of traffic aggregation at each hop. This disparity problem in MWNs worsens further when client traffic is forwarded via a series of relay nodes towards the destination through a series of tandem contention domains. Owing to the broadcast nature of the wireless medium, the end-to-end throughput is not only limited by the data rate of the individual links along the path, but also inversely affected by the hearing range and level of activity of the participating nodes. In this paper, we approximate node throughputs in MWNs by examining the underlying hop contention graph, along with hop counts and traffic aggregates. We show that node throughputs depend greatly on the location of nodes in relation to their hops away from the gateway and on the number of nodes in its sensing and transmission range.

AB - A fundamental issue in MWNs is that the end-to-end performance degrades quickly with hop counts and the degree of traffic aggregation at each hop. This disparity problem in MWNs worsens further when client traffic is forwarded via a series of relay nodes towards the destination through a series of tandem contention domains. Owing to the broadcast nature of the wireless medium, the end-to-end throughput is not only limited by the data rate of the individual links along the path, but also inversely affected by the hearing range and level of activity of the participating nodes. In this paper, we approximate node throughputs in MWNs by examining the underlying hop contention graph, along with hop counts and traffic aggregates. We show that node throughputs depend greatly on the location of nodes in relation to their hops away from the gateway and on the number of nodes in its sensing and transmission range.

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

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

U2 - 10.1504/IJWMC.2015.069386

DO - 10.1504/IJWMC.2015.069386

M3 - Article

AN - SCOPUS:84929618360

VL - 8

SP - 213

EP - 220

JO - International Journal of Wireless and Mobile Computing

JF - International Journal of Wireless and Mobile Computing

SN - 1741-1084

IS - 3

ER -