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

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Communications Vol.E89-B No.6 pp.1888-1891

Publication Date: 2006/06/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1093/ietcom/e89-b.6.1888

Type of Manuscript: LETTER

Category: Network

Cite this

Copy

Han NAMGOONG, Dongman LEE, Dukyun NAM, "A Message-Efficient Mobility Management Scheme for Mobile Ad Hoc Networks" in IEICE TRANSACTIONS on Communications, vol. E89-B, no. 6, pp. 1888-1891, June 2006, doi: 10.1093/ietcom/e89-b.6.1888.
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.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.6.1888/_p

Copy

@ARTICLE{e89-b_6_1888,
author={Han NAMGOONG, Dongman LEE, Dukyun NAM, },
journal={IEICE TRANSACTIONS on Communications},
title={A Message-Efficient Mobility Management Scheme for Mobile Ad Hoc Networks},
year={2006},
volume={E89-B},
number={6},
pages={1888-1891},
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={},
doi={10.1093/ietcom/e89-b.6.1888},
ISSN={1745-1345},
month={June},}

Copy

TY - JOUR
TI - A Message-Efficient Mobility Management Scheme for Mobile Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1888
EP - 1891
AU - Han NAMGOONG
AU - Dongman LEE
AU - Dukyun NAM
PY - 2006
DO - 10.1093/ietcom/e89-b.6.1888
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 2006
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.
ER -