Exact capacity study for a class of MANETs

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

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

2 Citations (Scopus)

Abstract

The lacking of a thorough understanding on the capacity in mobile ad hoc networks (MANETs) has been stunting their applications in the last decade. Available capacity studies focus on exploring either the order sense capacity scaling laws, the closed-form capacity under some specific routing protocols, or the exact capacity without careful consideration of wireless interference issue in MANETs. In this paper, we explore the exact network capacity for a class of MANETs, where the group-based scheduling is adopted to schedule simultaneous link transmissions. We first determine a general closed-form capacity upper bound for the considered MANETs, which holds for any possible routing protocols in such networks. We then show that for any traffic input rate within the upper bound, there exists a corresponding two-hop relay algorithm to stabilize the network, which proves that the upper bound we determined is the exact capacity for this class of MANETs. Finally, simulation studies are presented to validate our theoretical results.

Original languageEnglish
Title of host publication2012 1st IEEE International Conference on Communications in China, ICCC 2012
Pages173-178
Number of pages6
DOIs
Publication statusPublished - 2012
Event2012 1st IEEE International Conference on Communications in China, ICCC 2012 - Beijing
Duration: 2012 Aug 152012 Aug 17

Other

Other2012 1st IEEE International Conference on Communications in China, ICCC 2012
CityBeijing
Period12/8/1512/8/17

Fingerprint

Mobile ad hoc networks
Routing protocols
Scaling laws
Scheduling
scaling
scheduling
interference
traffic
simulation
Law

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Communication

Cite this

Gao, J., Liu, J., Jiang, X., Takahashi, O., & Shiratori, N. (2012). Exact capacity study for a class of MANETs. In 2012 1st IEEE International Conference on Communications in China, ICCC 2012 (pp. 173-178). [6356873] https://doi.org/10.1109/ICCChina.2012.6356873

Exact capacity study for a class of MANETs. / Gao, Juntao; Liu, Jiajia; Jiang, Xiaohong; Takahashi, Osamu; Shiratori, Norio.

2012 1st IEEE International Conference on Communications in China, ICCC 2012. 2012. p. 173-178 6356873.

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

Gao, J, Liu, J, Jiang, X, Takahashi, O & Shiratori, N 2012, Exact capacity study for a class of MANETs. in 2012 1st IEEE International Conference on Communications in China, ICCC 2012., 6356873, pp. 173-178, 2012 1st IEEE International Conference on Communications in China, ICCC 2012, Beijing, 12/8/15. https://doi.org/10.1109/ICCChina.2012.6356873
Gao J, Liu J, Jiang X, Takahashi O, Shiratori N. Exact capacity study for a class of MANETs. In 2012 1st IEEE International Conference on Communications in China, ICCC 2012. 2012. p. 173-178. 6356873 https://doi.org/10.1109/ICCChina.2012.6356873
Gao, Juntao ; Liu, Jiajia ; Jiang, Xiaohong ; Takahashi, Osamu ; Shiratori, Norio. / Exact capacity study for a class of MANETs. 2012 1st IEEE International Conference on Communications in China, ICCC 2012. 2012. pp. 173-178
@inproceedings{98262042b3bc4bb3b06dc0b0ef04d83b,
title = "Exact capacity study for a class of MANETs",
abstract = "The lacking of a thorough understanding on the capacity in mobile ad hoc networks (MANETs) has been stunting their applications in the last decade. Available capacity studies focus on exploring either the order sense capacity scaling laws, the closed-form capacity under some specific routing protocols, or the exact capacity without careful consideration of wireless interference issue in MANETs. In this paper, we explore the exact network capacity for a class of MANETs, where the group-based scheduling is adopted to schedule simultaneous link transmissions. We first determine a general closed-form capacity upper bound for the considered MANETs, which holds for any possible routing protocols in such networks. We then show that for any traffic input rate within the upper bound, there exists a corresponding two-hop relay algorithm to stabilize the network, which proves that the upper bound we determined is the exact capacity for this class of MANETs. Finally, simulation studies are presented to validate our theoretical results.",
author = "Juntao Gao and Jiajia Liu and Xiaohong Jiang and Osamu Takahashi and Norio Shiratori",
year = "2012",
doi = "10.1109/ICCChina.2012.6356873",
language = "English",
isbn = "9781467328159",
pages = "173--178",
booktitle = "2012 1st IEEE International Conference on Communications in China, ICCC 2012",

}

TY - GEN

T1 - Exact capacity study for a class of MANETs

AU - Gao, Juntao

AU - Liu, Jiajia

AU - Jiang, Xiaohong

AU - Takahashi, Osamu

AU - Shiratori, Norio

PY - 2012

Y1 - 2012

N2 - The lacking of a thorough understanding on the capacity in mobile ad hoc networks (MANETs) has been stunting their applications in the last decade. Available capacity studies focus on exploring either the order sense capacity scaling laws, the closed-form capacity under some specific routing protocols, or the exact capacity without careful consideration of wireless interference issue in MANETs. In this paper, we explore the exact network capacity for a class of MANETs, where the group-based scheduling is adopted to schedule simultaneous link transmissions. We first determine a general closed-form capacity upper bound for the considered MANETs, which holds for any possible routing protocols in such networks. We then show that for any traffic input rate within the upper bound, there exists a corresponding two-hop relay algorithm to stabilize the network, which proves that the upper bound we determined is the exact capacity for this class of MANETs. Finally, simulation studies are presented to validate our theoretical results.

AB - The lacking of a thorough understanding on the capacity in mobile ad hoc networks (MANETs) has been stunting their applications in the last decade. Available capacity studies focus on exploring either the order sense capacity scaling laws, the closed-form capacity under some specific routing protocols, or the exact capacity without careful consideration of wireless interference issue in MANETs. In this paper, we explore the exact network capacity for a class of MANETs, where the group-based scheduling is adopted to schedule simultaneous link transmissions. We first determine a general closed-form capacity upper bound for the considered MANETs, which holds for any possible routing protocols in such networks. We then show that for any traffic input rate within the upper bound, there exists a corresponding two-hop relay algorithm to stabilize the network, which proves that the upper bound we determined is the exact capacity for this class of MANETs. Finally, simulation studies are presented to validate our theoretical results.

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

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

U2 - 10.1109/ICCChina.2012.6356873

DO - 10.1109/ICCChina.2012.6356873

M3 - Conference contribution

AN - SCOPUS:84871521660

SN - 9781467328159

SP - 173

EP - 178

BT - 2012 1st IEEE International Conference on Communications in China, ICCC 2012

ER -