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

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 社団法人電子情報通信学会の論文
• 2006-06-01

著者

• Lee Dongman

  Korea Advanced Inst. Sci. Technol. (kaist) Daejeon Kor

• NAM Dukyun

  Korea Institute of Science and Technology Information (KISTI)

• NAMGOONG Han

  Electronics and Telecommunications Research Institute (ETRI)

• NAMGOONG Han

  ETRI

• LEE Dongman

  ICU

• NAM Dukyun

  ICU

関連論文

• A Reachability Estimation Scheme for Group Membership Services in MANETs
• A Message-Efficient Mobility Management Scheme for Mobile Ad Hoc Networks(Network)
• Fame-Based Probabilistic Routing for Delay-Tolerant Networks

スポンサーリンク