A message-efficient mobility management scheme for mobile ad hoc networks

Han Namgoong; Dongman Lee; Dukyun Nam

doi:10.1093/ietcom/e89-b.6.1888

A message-efficient mobility management scheme for mobile ad hoc networks

Han Namgoong, Dongman Lee, Dukyun Nam

School of Computer Science & Engineering

Research output: Contribution to journal › Article › peer-review

Abstract

The Minimum Connected Dominating Set (MCDS) reduces the number of messages to destinations and the finding MCDS is considered as a NP-hard problem. Alzoubi's approximation algorithm is known as the best in terms of message-optimal CDS construction, but not for mobility management. We present a message-efficient mobility management scheme based on distributed spanning trees. The proposed method may generate more messages than Alzoubi's for message delivery, but it consumes significantly fewer messages for mobility management (to the ratio of 2.5). Thus, when highly mobile networks are assumed, the proposed scheme outperforms Alzoubi's in terms of total number of messages.

Original language	English
Pages (from-to)	1888-1891
Number of pages	4
Journal	IEICE Transactions on Communications
Volume	E89-B
Issue number	6
DOIs	https://doi.org/10.1093/ietcom/e89-b.6.1888
State	Published - Jun 2006

Keywords

CDS
Mobile ad hoc networks
Mobility management

Access to Document

10.1093/ietcom/e89-b.6.1888

Cite this

@article{45f634591b164792b5483230309b0bb4,

title = "A message-efficient mobility management scheme for mobile ad hoc networks",

abstract = "The Minimum Connected Dominating Set (MCDS) reduces the number of messages to destinations and the finding MCDS is considered as a NP-hard problem. Alzoubi's approximation algorithm is known as the best in terms of message-optimal CDS construction, but not for mobility management. We present a message-efficient mobility management scheme based on distributed spanning trees. The proposed method may generate more messages than Alzoubi's for message delivery, but it consumes significantly fewer messages for mobility management (to the ratio of 2.5). Thus, when highly mobile networks are assumed, the proposed scheme outperforms Alzoubi's in terms of total number of messages.",

keywords = "CDS, Mobile ad hoc networks, Mobility management",

author = "Han Namgoong and Dongman Lee and Dukyun Nam",

year = "2006",

month = jun,

doi = "10.1093/ietcom/e89-b.6.1888",

language = "English",

volume = "E89-B",

pages = "1888--1891",

journal = "IEICE Transactions on Communications",

issn = "0916-8516",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "6",

}

TY - JOUR

T1 - A message-efficient mobility management scheme for mobile ad hoc networks

AU - Namgoong, Han

AU - Lee, Dongman

AU - Nam, Dukyun

PY - 2006/6

Y1 - 2006/6

N2 - The Minimum Connected Dominating Set (MCDS) reduces the number of messages to destinations and the finding MCDS is considered as a NP-hard problem. Alzoubi's approximation algorithm is known as the best in terms of message-optimal CDS construction, but not for mobility management. We present a message-efficient mobility management scheme based on distributed spanning trees. The proposed method may generate more messages than Alzoubi's for message delivery, but it consumes significantly fewer messages for mobility management (to the ratio of 2.5). Thus, when highly mobile networks are assumed, the proposed scheme outperforms Alzoubi's in terms of total number of messages.

AB - The Minimum Connected Dominating Set (MCDS) reduces the number of messages to destinations and the finding MCDS is considered as a NP-hard problem. Alzoubi's approximation algorithm is known as the best in terms of message-optimal CDS construction, but not for mobility management. We present a message-efficient mobility management scheme based on distributed spanning trees. The proposed method may generate more messages than Alzoubi's for message delivery, but it consumes significantly fewer messages for mobility management (to the ratio of 2.5). Thus, when highly mobile networks are assumed, the proposed scheme outperforms Alzoubi's in terms of total number of messages.

KW - CDS

KW - Mobile ad hoc networks

KW - Mobility management

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

U2 - 10.1093/ietcom/e89-b.6.1888

DO - 10.1093/ietcom/e89-b.6.1888

M3 - Article

AN - SCOPUS:33745440978

SN - 0916-8516

VL - E89-B

SP - 1888

EP - 1891

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

IS - 6

ER -

A message-efficient mobility management scheme for mobile ad hoc networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this