On the throughput capacity study for aloha mobile ad hoc networks

Yin Chen, Yulong Shen, Jinxiao Zhu, Xiaohong Jiang, Hideyuki Tokuda

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Despite extensive efforts on exploring the asymptotic capacity bounds for mobile ad hoc networks (MANETs), the general exact capacity study of such networks remains a challenge. As one step to go further in this direction, this paper considers two classes of Aloha MANETs (A-MANETs) NA and NC that adopt an aggressive traffic-independent Aloha and the conventional traffic-dependent Aloha, respectively. We first define a notation of successful transmission probability (STP) in NA, and apply queuing theory analysis to derive a general formula for the capacity evaluation of NA. We also prove that NC actually leads to the same throughput capacity as NA, indicating that the throughput capacity of NC can be evaluated based on the STP of NA as well. With the help of the capacity formula and stochastic geometry analysis on STP, we then derive closed-form expressions for the throughput capacity of an infinite A-MANET under the nearest neighbor/receiver transmission policies. Our further analysis reveals that although it is highly cumbersome to determine the exact throughput capacity expression for a finite A-MANET, it is possible to have an efficient and closed-form approximation to its throughput capacity. Finally, we explore the capacity maximization and provide extensive simulation/numerical results.

Original languageEnglish
Article number7401026
Pages (from-to)1646-1659
Number of pages14
JournalIEEE Transactions on Communications
Volume64
Issue number4
DOIs
Publication statusPublished - 2016 Apr 1

Fingerprint

Mobile ad hoc networks
Throughput
Geometry
Computer simulation

Keywords

  • Aloha
  • Mobile ad hoc networks
  • Queuing theory
  • Stochastic geometry
  • Throughput capacity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

On the throughput capacity study for aloha mobile ad hoc networks. / Chen, Yin; Shen, Yulong; Zhu, Jinxiao; Jiang, Xiaohong; Tokuda, Hideyuki.

In: IEEE Transactions on Communications, Vol. 64, No. 4, 7401026, 01.04.2016, p. 1646-1659.

Research output: Contribution to journalArticle

Chen, Y, Shen, Y, Zhu, J, Jiang, X & Tokuda, H 2016, 'On the throughput capacity study for aloha mobile ad hoc networks', IEEE Transactions on Communications, vol. 64, no. 4, 7401026, pp. 1646-1659. https://doi.org/10.1109/TCOMM.2016.2527658
Chen, Yin ; Shen, Yulong ; Zhu, Jinxiao ; Jiang, Xiaohong ; Tokuda, Hideyuki. / On the throughput capacity study for aloha mobile ad hoc networks. In: IEEE Transactions on Communications. 2016 ; Vol. 64, No. 4. pp. 1646-1659.
@article{0270c44463f7441dae2989b92da1dfe7,
title = "On the throughput capacity study for aloha mobile ad hoc networks",
abstract = "Despite extensive efforts on exploring the asymptotic capacity bounds for mobile ad hoc networks (MANETs), the general exact capacity study of such networks remains a challenge. As one step to go further in this direction, this paper considers two classes of Aloha MANETs (A-MANETs) NA and NC that adopt an aggressive traffic-independent Aloha and the conventional traffic-dependent Aloha, respectively. We first define a notation of successful transmission probability (STP) in NA, and apply queuing theory analysis to derive a general formula for the capacity evaluation of NA. We also prove that NC actually leads to the same throughput capacity as NA, indicating that the throughput capacity of NC can be evaluated based on the STP of NA as well. With the help of the capacity formula and stochastic geometry analysis on STP, we then derive closed-form expressions for the throughput capacity of an infinite A-MANET under the nearest neighbor/receiver transmission policies. Our further analysis reveals that although it is highly cumbersome to determine the exact throughput capacity expression for a finite A-MANET, it is possible to have an efficient and closed-form approximation to its throughput capacity. Finally, we explore the capacity maximization and provide extensive simulation/numerical results.",
keywords = "Aloha, Mobile ad hoc networks, Queuing theory, Stochastic geometry, Throughput capacity",
author = "Yin Chen and Yulong Shen and Jinxiao Zhu and Xiaohong Jiang and Hideyuki Tokuda",
year = "2016",
month = "4",
day = "1",
doi = "10.1109/TCOMM.2016.2527658",
language = "English",
volume = "64",
pages = "1646--1659",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - On the throughput capacity study for aloha mobile ad hoc networks

AU - Chen, Yin

AU - Shen, Yulong

AU - Zhu, Jinxiao

AU - Jiang, Xiaohong

AU - Tokuda, Hideyuki

PY - 2016/4/1

Y1 - 2016/4/1

N2 - Despite extensive efforts on exploring the asymptotic capacity bounds for mobile ad hoc networks (MANETs), the general exact capacity study of such networks remains a challenge. As one step to go further in this direction, this paper considers two classes of Aloha MANETs (A-MANETs) NA and NC that adopt an aggressive traffic-independent Aloha and the conventional traffic-dependent Aloha, respectively. We first define a notation of successful transmission probability (STP) in NA, and apply queuing theory analysis to derive a general formula for the capacity evaluation of NA. We also prove that NC actually leads to the same throughput capacity as NA, indicating that the throughput capacity of NC can be evaluated based on the STP of NA as well. With the help of the capacity formula and stochastic geometry analysis on STP, we then derive closed-form expressions for the throughput capacity of an infinite A-MANET under the nearest neighbor/receiver transmission policies. Our further analysis reveals that although it is highly cumbersome to determine the exact throughput capacity expression for a finite A-MANET, it is possible to have an efficient and closed-form approximation to its throughput capacity. Finally, we explore the capacity maximization and provide extensive simulation/numerical results.

AB - Despite extensive efforts on exploring the asymptotic capacity bounds for mobile ad hoc networks (MANETs), the general exact capacity study of such networks remains a challenge. As one step to go further in this direction, this paper considers two classes of Aloha MANETs (A-MANETs) NA and NC that adopt an aggressive traffic-independent Aloha and the conventional traffic-dependent Aloha, respectively. We first define a notation of successful transmission probability (STP) in NA, and apply queuing theory analysis to derive a general formula for the capacity evaluation of NA. We also prove that NC actually leads to the same throughput capacity as NA, indicating that the throughput capacity of NC can be evaluated based on the STP of NA as well. With the help of the capacity formula and stochastic geometry analysis on STP, we then derive closed-form expressions for the throughput capacity of an infinite A-MANET under the nearest neighbor/receiver transmission policies. Our further analysis reveals that although it is highly cumbersome to determine the exact throughput capacity expression for a finite A-MANET, it is possible to have an efficient and closed-form approximation to its throughput capacity. Finally, we explore the capacity maximization and provide extensive simulation/numerical results.

KW - Aloha

KW - Mobile ad hoc networks

KW - Queuing theory

KW - Stochastic geometry

KW - Throughput capacity

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

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

U2 - 10.1109/TCOMM.2016.2527658

DO - 10.1109/TCOMM.2016.2527658

M3 - Article

AN - SCOPUS:84964319385

VL - 64

SP - 1646

EP - 1659

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 4

M1 - 7401026

ER -