상세정보
학술지
A Message-Efficient Mobility Management Scheme for Mobile Ad-Hoc Networks
- 저자
- 남궁한, 이동만, 남덕윤
- 발행일
- 200606
- 출처
- IEICE Transactions on Communications, v.E89-B no.6, pp.1888-1891
- ISSN
- 0916-8516
- 출판사
- 일본, 전자정보통신학회 (IEICE)
- 협약과제
- 06MI1400, 능동형 서비스를 위한 URC 서버 프레임웍 개발, 조영조
- 초록
- 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. Copyright © 2006 The Institute of Electronics, Information and Communication Engineers.
- KSP 제안 키워드
- Information and communication, Message Delivery, Minimum connected dominating set, Mobile Ad-Hoc Networks(MANET), Mobile networks, Mobility management, NP-Hard problem, Spanning tree, approximation algorithms, management scheme