Mobility-based topology control forwireless Ad Hoc networks

Jae Young Seol, Seong-Lyun Kim

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The mobility control of mobile nodes can be an alternative to the transmitting power adjustment in case that fixed transmitting power is just used in the topology control. Assuming the controllable mobility of nodes, we propose four distributed mobility control algorithms assuring the network connectivity and the capacity improvement. We compare the throughput of each algorithm with the widely accepted capacity scale law considering the energy consumption. The proposed mobilitybased topology control algorithms are named according to its operational characteristics; RP (Rendezvous Point), NNT (Nearest Neighbor Tracking), DM (Diffusion Model), and GP (Grid Packing). Through extensive simulations, we show that all the proposed algorithms successfully change a partitioned random network topology into a connected network topology without the power control. Furthermore, the topology reconfigured by the mobility control has the improved network capacity beyond that of the initial network. In the newly defined performance metric, effective capacity, the simulation results show that GP provides more improved and stable performance over various node densities with the short completion time.

Original languageEnglish
Pages (from-to)1443-1450
Number of pages8
JournalIEICE Transactions on Communications
VolumeE93-B
Issue number6
DOIs
Publication statusPublished - 2010 Jan 1

Fingerprint

Ad hoc networks
Topology
Power control
Energy utilization
Throughput

All Science Journal Classification (ASJC) codes

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

Cite this

@article{66ecaf73c5534c99a796dd1c25be7803,
title = "Mobility-based topology control forwireless Ad Hoc networks",
abstract = "The mobility control of mobile nodes can be an alternative to the transmitting power adjustment in case that fixed transmitting power is just used in the topology control. Assuming the controllable mobility of nodes, we propose four distributed mobility control algorithms assuring the network connectivity and the capacity improvement. We compare the throughput of each algorithm with the widely accepted capacity scale law considering the energy consumption. The proposed mobilitybased topology control algorithms are named according to its operational characteristics; RP (Rendezvous Point), NNT (Nearest Neighbor Tracking), DM (Diffusion Model), and GP (Grid Packing). Through extensive simulations, we show that all the proposed algorithms successfully change a partitioned random network topology into a connected network topology without the power control. Furthermore, the topology reconfigured by the mobility control has the improved network capacity beyond that of the initial network. In the newly defined performance metric, effective capacity, the simulation results show that GP provides more improved and stable performance over various node densities with the short completion time.",
author = "Seol, {Jae Young} and Seong-Lyun Kim",
year = "2010",
month = "1",
day = "1",
doi = "10.1587/transcom.E93.B.1443",
language = "English",
volume = "E93-B",
pages = "1443--1450",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "6",

}

Mobility-based topology control forwireless Ad Hoc networks. / Seol, Jae Young; Kim, Seong-Lyun.

In: IEICE Transactions on Communications, Vol. E93-B, No. 6, 01.01.2010, p. 1443-1450.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Mobility-based topology control forwireless Ad Hoc networks

AU - Seol, Jae Young

AU - Kim, Seong-Lyun

PY - 2010/1/1

Y1 - 2010/1/1

N2 - The mobility control of mobile nodes can be an alternative to the transmitting power adjustment in case that fixed transmitting power is just used in the topology control. Assuming the controllable mobility of nodes, we propose four distributed mobility control algorithms assuring the network connectivity and the capacity improvement. We compare the throughput of each algorithm with the widely accepted capacity scale law considering the energy consumption. The proposed mobilitybased topology control algorithms are named according to its operational characteristics; RP (Rendezvous Point), NNT (Nearest Neighbor Tracking), DM (Diffusion Model), and GP (Grid Packing). Through extensive simulations, we show that all the proposed algorithms successfully change a partitioned random network topology into a connected network topology without the power control. Furthermore, the topology reconfigured by the mobility control has the improved network capacity beyond that of the initial network. In the newly defined performance metric, effective capacity, the simulation results show that GP provides more improved and stable performance over various node densities with the short completion time.

AB - The mobility control of mobile nodes can be an alternative to the transmitting power adjustment in case that fixed transmitting power is just used in the topology control. Assuming the controllable mobility of nodes, we propose four distributed mobility control algorithms assuring the network connectivity and the capacity improvement. We compare the throughput of each algorithm with the widely accepted capacity scale law considering the energy consumption. The proposed mobilitybased topology control algorithms are named according to its operational characteristics; RP (Rendezvous Point), NNT (Nearest Neighbor Tracking), DM (Diffusion Model), and GP (Grid Packing). Through extensive simulations, we show that all the proposed algorithms successfully change a partitioned random network topology into a connected network topology without the power control. Furthermore, the topology reconfigured by the mobility control has the improved network capacity beyond that of the initial network. In the newly defined performance metric, effective capacity, the simulation results show that GP provides more improved and stable performance over various node densities with the short completion time.

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

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

U2 - 10.1587/transcom.E93.B.1443

DO - 10.1587/transcom.E93.B.1443

M3 - Article

AN - SCOPUS:77952974753

VL - E93-B

SP - 1443

EP - 1450

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 6

ER -