A Message-Efficient Mobility Management Scheme for Mobile Ad Hoc Networks

Han NAMGOONG
Dongman LEE
Dukyun NAM

Publication
IEICE TRANSACTIONS on Communications   Vol.E89-B    No.6    pp.1888-1891
Publication Date: 2006/06/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e89-b.6.1888
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
Keyword: 
mobile ad hoc networks,  mobility management,  CDS,  

Full Text: PDF(1.3MB)>>
Buy this Article


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.