Hierarchical cooperation in ultra-wide band Ad Hoc networks

Won Yong Shin, Koji Ishibashi

Research output: Contribution to journalArticle

Abstract

We show an improved throughput scaling law for an ultrawide band (UWB) ad hoc network by using a modified hierarchical cooperation (HC) strategy; the n wireless nodes are assumed to be randomly sited. In a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent α for certain operating regimes due to the power-limited characteristics. It also turns out that the use of HC is helpful in improving the throughput scaling of our UWB network in some conditions. More specifically, assuming that the bandwidth scales faster than n α+1 (log n) α/2 , it is shown that the HC protocol outperforms nearest multi-hop routing for 2 < α < 3 while using nearest multi-hop routing leads to higher throughput for α ≥ 3.

Original languageEnglish
Pages (from-to)887-890
Number of pages4
JournalIEICE Transactions on Communications
VolumeE96-B
Issue number3
DOIs
Publication statusPublished - 2013 Mar

Fingerprint

Ad hoc networks
Throughput
Scaling laws
Bandwidth
Network protocols

All Science Journal Classification (ASJC) codes

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

Cite this

@article{ed5e1d0f6e514568b05b02b698934726,
title = "Hierarchical cooperation in ultra-wide band Ad Hoc networks",
abstract = "We show an improved throughput scaling law for an ultrawide band (UWB) ad hoc network by using a modified hierarchical cooperation (HC) strategy; the n wireless nodes are assumed to be randomly sited. In a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent α for certain operating regimes due to the power-limited characteristics. It also turns out that the use of HC is helpful in improving the throughput scaling of our UWB network in some conditions. More specifically, assuming that the bandwidth scales faster than n α+1 (log n) α/2 , it is shown that the HC protocol outperforms nearest multi-hop routing for 2 < α < 3 while using nearest multi-hop routing leads to higher throughput for α ≥ 3.",
author = "Shin, {Won Yong} and Koji Ishibashi",
year = "2013",
month = "3",
doi = "10.1587/transcom.E96.B.887",
language = "English",
volume = "E96-B",
pages = "887--890",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "3",

}

Hierarchical cooperation in ultra-wide band Ad Hoc networks. / Shin, Won Yong; Ishibashi, Koji.

In: IEICE Transactions on Communications, Vol. E96-B, No. 3, 03.2013, p. 887-890.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Hierarchical cooperation in ultra-wide band Ad Hoc networks

AU - Shin, Won Yong

AU - Ishibashi, Koji

PY - 2013/3

Y1 - 2013/3

N2 - We show an improved throughput scaling law for an ultrawide band (UWB) ad hoc network by using a modified hierarchical cooperation (HC) strategy; the n wireless nodes are assumed to be randomly sited. In a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent α for certain operating regimes due to the power-limited characteristics. It also turns out that the use of HC is helpful in improving the throughput scaling of our UWB network in some conditions. More specifically, assuming that the bandwidth scales faster than n α+1 (log n) α/2 , it is shown that the HC protocol outperforms nearest multi-hop routing for 2 < α < 3 while using nearest multi-hop routing leads to higher throughput for α ≥ 3.

AB - We show an improved throughput scaling law for an ultrawide band (UWB) ad hoc network by using a modified hierarchical cooperation (HC) strategy; the n wireless nodes are assumed to be randomly sited. In a dense network of unit area, our result indicates that the derived throughput scaling depends on the path-loss exponent α for certain operating regimes due to the power-limited characteristics. It also turns out that the use of HC is helpful in improving the throughput scaling of our UWB network in some conditions. More specifically, assuming that the bandwidth scales faster than n α+1 (log n) α/2 , it is shown that the HC protocol outperforms nearest multi-hop routing for 2 < α < 3 while using nearest multi-hop routing leads to higher throughput for α ≥ 3.

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

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

U2 - 10.1587/transcom.E96.B.887

DO - 10.1587/transcom.E96.B.887

M3 - Article

AN - SCOPUS:84878131034

VL - E96-B

SP - 887

EP - 890

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 3

ER -