Node mobility and capacity in wireless controllable ad hoc networks

Jae Young Seol, Seong-Lyun Kim

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

The performance of wireless stationary and mobile networks is known to be limited by the throughput-delay trade-off. In this paper, we exploit controlled mobility to overcome the performance limit of random networks. Although many literature on controlled mobility have studied about the optimal relay relocation algorithm to improve the throughput of individual source-destination pair, the improved throughput is limited by the capacity scale of an arbitrary network Θ(1/n). By adopting more autonomous controlled mobility, we propose a mobility control strategy achieving the constant per-node capacity scale with bounded delay. For the purpose of this, we identify the key control factors for controlled mobility by analyzing a random network. To estimate the cost-effectiveness of the proposed mobility control strategy, we provide the delay scales and the energy consumption model. Finally, we propose a heuristic mobility control algorithm to verify the applicability of our theoretic results to a practical system. Through extensive simulations, we show the proposed mobility control algorithm considerably improves the network performance.

Original languageEnglish
Pages (from-to)1345-1354
Number of pages10
JournalComputer Communications
Volume35
Issue number11
DOIs
Publication statusPublished - 2012 Jun 15

Fingerprint

Wireless ad hoc networks
Throughput
Wireless networks
Relocation
Cost effectiveness
Network performance
Energy utilization

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{9205155aae2a43dba54a6aa27fe17d12,
title = "Node mobility and capacity in wireless controllable ad hoc networks",
abstract = "The performance of wireless stationary and mobile networks is known to be limited by the throughput-delay trade-off. In this paper, we exploit controlled mobility to overcome the performance limit of random networks. Although many literature on controlled mobility have studied about the optimal relay relocation algorithm to improve the throughput of individual source-destination pair, the improved throughput is limited by the capacity scale of an arbitrary network Θ(1/n). By adopting more autonomous controlled mobility, we propose a mobility control strategy achieving the constant per-node capacity scale with bounded delay. For the purpose of this, we identify the key control factors for controlled mobility by analyzing a random network. To estimate the cost-effectiveness of the proposed mobility control strategy, we provide the delay scales and the energy consumption model. Finally, we propose a heuristic mobility control algorithm to verify the applicability of our theoretic results to a practical system. Through extensive simulations, we show the proposed mobility control algorithm considerably improves the network performance.",
author = "Seol, {Jae Young} and Seong-Lyun Kim",
year = "2012",
month = "6",
day = "15",
doi = "10.1016/j.comcom.2012.03.012",
language = "English",
volume = "35",
pages = "1345--1354",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "11",

}

Node mobility and capacity in wireless controllable ad hoc networks. / Seol, Jae Young; Kim, Seong-Lyun.

In: Computer Communications, Vol. 35, No. 11, 15.06.2012, p. 1345-1354.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Node mobility and capacity in wireless controllable ad hoc networks

AU - Seol, Jae Young

AU - Kim, Seong-Lyun

PY - 2012/6/15

Y1 - 2012/6/15

N2 - The performance of wireless stationary and mobile networks is known to be limited by the throughput-delay trade-off. In this paper, we exploit controlled mobility to overcome the performance limit of random networks. Although many literature on controlled mobility have studied about the optimal relay relocation algorithm to improve the throughput of individual source-destination pair, the improved throughput is limited by the capacity scale of an arbitrary network Θ(1/n). By adopting more autonomous controlled mobility, we propose a mobility control strategy achieving the constant per-node capacity scale with bounded delay. For the purpose of this, we identify the key control factors for controlled mobility by analyzing a random network. To estimate the cost-effectiveness of the proposed mobility control strategy, we provide the delay scales and the energy consumption model. Finally, we propose a heuristic mobility control algorithm to verify the applicability of our theoretic results to a practical system. Through extensive simulations, we show the proposed mobility control algorithm considerably improves the network performance.

AB - The performance of wireless stationary and mobile networks is known to be limited by the throughput-delay trade-off. In this paper, we exploit controlled mobility to overcome the performance limit of random networks. Although many literature on controlled mobility have studied about the optimal relay relocation algorithm to improve the throughput of individual source-destination pair, the improved throughput is limited by the capacity scale of an arbitrary network Θ(1/n). By adopting more autonomous controlled mobility, we propose a mobility control strategy achieving the constant per-node capacity scale with bounded delay. For the purpose of this, we identify the key control factors for controlled mobility by analyzing a random network. To estimate the cost-effectiveness of the proposed mobility control strategy, we provide the delay scales and the energy consumption model. Finally, we propose a heuristic mobility control algorithm to verify the applicability of our theoretic results to a practical system. Through extensive simulations, we show the proposed mobility control algorithm considerably improves the network performance.

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

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

U2 - 10.1016/j.comcom.2012.03.012

DO - 10.1016/j.comcom.2012.03.012

M3 - Article

VL - 35

SP - 1345

EP - 1354

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 11

ER -