ETRI-Knowledge Sharing Plaform



논문 검색
구분 SCI
연도 ~ 키워드


학술대회 A Probabilistic Approach of Mobile Router Selection Algorithm in Dynamic Moving Networks
Cited 1 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
박제만, 김원태, 박용진
TENCON 2007, pp.1-4
07MW1400, 모바일 컨버전스 컴퓨팅을 위한 단말적응형 임베디드 운영체제 기술개발, 김흥남
A dynamic moving network with unspecified multiple mobile routers or dynamic mobile routers may causes difficult problems in terms of stability and reliability in the moving networks. We assume that a user terminal such as cellular phone can be a mobile router in a dynamic moving network. The selection and maintenance of mobile routers should be very important issue like in this scenario in order to support reliable communication channels to internal nodes. In the selection of representative mobile routers, the staying time of a mobile router should be one of essential factors, e.g. battery power and network capacity. It, however, is not easy to estimate the staying time of each mobile router and candidate to be selected. We propose the staying time prediction algorithm of a dynamic mobile router according to the variable status of dynamic moving network. In this approach, the proposed algorithm is based on gathered statistical data as a probabilistic approach in order to estimate the staying time of a mobile router. Finally simulation results will show the accuracy of the probability. ©2007 IEEE.
KSP 제안 키워드
Mobile Routers(MRs), Moving networks, Multiple mobile routers, Probabilistic approach, Reliable Communication, Statistical data, Time prediction, battery power, cellular phone, communication channel, network capacity