Throughput capacity of manets with group-based scheduling and general transmission range

Juntao Gao, Jiajia Liu, Xiaohong Jiang, Osamu Takahashi, Norio Shiratori

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

The capacity of general mobile ad hoc networks (MANETs) remains largely unknown up to now, which significantly hinders the development and commercialization of such networks. Available throughput capacity studies of MANETs mainly focus on either the order sense capacity scaling laws, the exact throughput capacity under a specific algorithm, or the exact throughput capacity without a careful consideration of critical wireless interference and transmission range issues. In this paper, we explore the exact throughput capacity for a class ofMANETs, where we adopt group-based scheduling to schedule simultaneous link transmissions for interference avoidance and allow the transmission range of each node to be adjusted. We first determine a general throughput capacity upper bound for the concerned MANETs, which holds for any feasible packet delivery algorithm in such networks. We then prove that the upper bound we determined is just the exact throughput capacity for this class of MANETs by showing that for any traffic input rate within the throughput capacity upper bound, there exists a corresponding two-hop relay algorithm to stabilize such networks. A closed-form upper bound for packet delay is further derived under any traffic input rate within the throughput capacity. Finally, based on the network capacity result, we examine the impacts of transmission range and node density upon network capacity.

Original languageEnglish
Pages (from-to)1791-1802
Number of pages12
JournalIEICE Transactions on Communications
VolumeE96-B
Issue number7
DOIs
Publication statusPublished - 2013 Jul

Fingerprint

Scheduling
Throughput
Mobile ad hoc networks
Scaling laws

Keywords

  • Group-based scheduling
  • Mobile ad hoc networks
  • Packet delay
  • Throughput capacity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Software

Cite this

Throughput capacity of manets with group-based scheduling and general transmission range. / Gao, Juntao; Liu, Jiajia; Jiang, Xiaohong; Takahashi, Osamu; Shiratori, Norio.

In: IEICE Transactions on Communications, Vol. E96-B, No. 7, 07.2013, p. 1791-1802.

Research output: Contribution to journalArticle

Gao, Juntao ; Liu, Jiajia ; Jiang, Xiaohong ; Takahashi, Osamu ; Shiratori, Norio. / Throughput capacity of manets with group-based scheduling and general transmission range. In: IEICE Transactions on Communications. 2013 ; Vol. E96-B, No. 7. pp. 1791-1802.
@article{3b5728bc39464ea2831fc1cd97490267,
title = "Throughput capacity of manets with group-based scheduling and general transmission range",
abstract = "The capacity of general mobile ad hoc networks (MANETs) remains largely unknown up to now, which significantly hinders the development and commercialization of such networks. Available throughput capacity studies of MANETs mainly focus on either the order sense capacity scaling laws, the exact throughput capacity under a specific algorithm, or the exact throughput capacity without a careful consideration of critical wireless interference and transmission range issues. In this paper, we explore the exact throughput capacity for a class ofMANETs, where we adopt group-based scheduling to schedule simultaneous link transmissions for interference avoidance and allow the transmission range of each node to be adjusted. We first determine a general throughput capacity upper bound for the concerned MANETs, which holds for any feasible packet delivery algorithm in such networks. We then prove that the upper bound we determined is just the exact throughput capacity for this class of MANETs by showing that for any traffic input rate within the throughput capacity upper bound, there exists a corresponding two-hop relay algorithm to stabilize such networks. A closed-form upper bound for packet delay is further derived under any traffic input rate within the throughput capacity. Finally, based on the network capacity result, we examine the impacts of transmission range and node density upon network capacity.",
keywords = "Group-based scheduling, Mobile ad hoc networks, Packet delay, Throughput capacity",
author = "Juntao Gao and Jiajia Liu and Xiaohong Jiang and Osamu Takahashi and Norio Shiratori",
year = "2013",
month = "7",
doi = "10.1587/transcom.E96.B.1791",
language = "English",
volume = "E96-B",
pages = "1791--1802",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "7",

}

TY - JOUR

T1 - Throughput capacity of manets with group-based scheduling and general transmission range

AU - Gao, Juntao

AU - Liu, Jiajia

AU - Jiang, Xiaohong

AU - Takahashi, Osamu

AU - Shiratori, Norio

PY - 2013/7

Y1 - 2013/7

N2 - The capacity of general mobile ad hoc networks (MANETs) remains largely unknown up to now, which significantly hinders the development and commercialization of such networks. Available throughput capacity studies of MANETs mainly focus on either the order sense capacity scaling laws, the exact throughput capacity under a specific algorithm, or the exact throughput capacity without a careful consideration of critical wireless interference and transmission range issues. In this paper, we explore the exact throughput capacity for a class ofMANETs, where we adopt group-based scheduling to schedule simultaneous link transmissions for interference avoidance and allow the transmission range of each node to be adjusted. We first determine a general throughput capacity upper bound for the concerned MANETs, which holds for any feasible packet delivery algorithm in such networks. We then prove that the upper bound we determined is just the exact throughput capacity for this class of MANETs by showing that for any traffic input rate within the throughput capacity upper bound, there exists a corresponding two-hop relay algorithm to stabilize such networks. A closed-form upper bound for packet delay is further derived under any traffic input rate within the throughput capacity. Finally, based on the network capacity result, we examine the impacts of transmission range and node density upon network capacity.

AB - The capacity of general mobile ad hoc networks (MANETs) remains largely unknown up to now, which significantly hinders the development and commercialization of such networks. Available throughput capacity studies of MANETs mainly focus on either the order sense capacity scaling laws, the exact throughput capacity under a specific algorithm, or the exact throughput capacity without a careful consideration of critical wireless interference and transmission range issues. In this paper, we explore the exact throughput capacity for a class ofMANETs, where we adopt group-based scheduling to schedule simultaneous link transmissions for interference avoidance and allow the transmission range of each node to be adjusted. We first determine a general throughput capacity upper bound for the concerned MANETs, which holds for any feasible packet delivery algorithm in such networks. We then prove that the upper bound we determined is just the exact throughput capacity for this class of MANETs by showing that for any traffic input rate within the throughput capacity upper bound, there exists a corresponding two-hop relay algorithm to stabilize such networks. A closed-form upper bound for packet delay is further derived under any traffic input rate within the throughput capacity. Finally, based on the network capacity result, we examine the impacts of transmission range and node density upon network capacity.

KW - Group-based scheduling

KW - Mobile ad hoc networks

KW - Packet delay

KW - Throughput capacity

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

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

U2 - 10.1587/transcom.E96.B.1791

DO - 10.1587/transcom.E96.B.1791

M3 - Article

AN - SCOPUS:84879864237

VL - E96-B

SP - 1791

EP - 1802

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 7

ER -