http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Trung-Dinh Han (검색결과 6 건)
- 무료
- 기관 내 무료
- 유료
-
A Looping Problem in the Tree-Based Mobility Management for Mobile IP Supported Ad Hoc Networks
Han, Trung-Dinh,Oh, Hoon The Korea Institute of Information and Commucation 2011 Journal of communications and networks Vol.13 No.4
A loop can take place in the process of managing tree topology for mobility management of mobile nodes in infrastructure-based mobile ad hoc networks. The formation of a loop degrades an effective bandwidth of the wireless network by passing an identical message repeatedly within the same loop. Therefore, the loop should be resolved to revert the system back to the normal state. In this paper, we propose a simple and novel mechanism that detects and resolves a loop quickly by tracking the depth of trees. The mobility management approach that employs the loop resolution method is evaluated comparatively with the original tree-based one and the hybrid one. It is shown that the proposed approach far outperforms the other approaches, and it is robust against the rapid changes in network topology.
-
An Efficient Mobility Management for Infrastructure-Based MANETs
Trung-Dinh Han,Firoz Ahmed,Hoon Oh 한국공학안전보건예술학회 2010 한국공학예술학회 논문지 Vol.2 No.-
Mobile nodes must be managed efficiently for the Internet connectivity of mobile ad hoc networks. The tree-based mobility management approach is highly dependable in that mobile nodes register with Internet gateway along tree paths from itself up to a gateway without using flooding. However, it is costly to resume on-going communication if a node belonging to an active path loses its connectivity to its parent. In this paper, we introduce a new approach in which a node maintains multiple parents whenever possible. A mobile node can still retain its upstream path to a gateway even though it loses connectivity to one of its parents. The new approach is evaluated against the tree-based method by resorting to simulation. The result shows that the new method outperforms the tree-based approach and also is very robust against the change of topology.
-
A Looping Problem in the Tree-Based Mobility Management for Mobile IP Supported Ad Hoc Networks
Trung-Dinh Han,Hoon Oh 한국통신학회 2011 Journal of communications and networks Vol.13 No.4
A loop can take place in the process of managing tree to-pology for mobility management of mobile nodes in infrastructure-based mobile ad hoc networks. The formation of a loop degrades an effective bandwidth of the wireless network by passing an iden-tical message repeatedly within the same loop. Therefore, the loop should be resolved to revert the system back to the normal state. In this paper, we propose a simple and novel mechanism that de-tects and resolves a loop quickly by tracking the depth of trees. The mobility management approach that employs the loop resolu-tionmethod is evaluated comparatively with the original tree-based one and the hybrid one. It is shown that the proposed approach far outperforms the other approaches, and it is robust against the rapid changes in network topology.
-
-
Khalil Ur Rahman,Trung-Dinh Han,Hoon Oh 한국통신학회 2009 한국통신학회 학술대회논문집 Vol.2009 No.6
Mobility management of mobile nodes in the integrated network of infrastructure networks and wireless ad hoc networks is required to provide them with Internet connectivity. Tree topology has been proven to be highly dependable for mobility management where a mobile node registers with a gateway along tree paths. In this paper, we present an efficient tree-based mobility management method by building trees. The approach is evaluated against the other traditional methods - proactive, reactive, and hybrid by resorting to simulation. The results show that the new approach outperforms the other ones and also is very robust against the rapid change of topology.
-
인프라구조 기반의 이동 애드혹 네트워크를 위한 인터넷 게이트웨이 중심의 링크상태 라우팅 프로토콜
이성욱(Sung Uk Lee),오지충(Chi-Trung Ngo),한충진(Trung-Dinh Han),김제욱(Je-Wook Kim),오훈(Hoon Oh) 한국통신학회 2012 韓國通信學會論文誌 Vol.37 No.10B
인프라구조 기반의 이동 애드혹 네트워크를 위한 기존의 프로토콜들은 이동성 관리와 라우팅 프로토콜을 분리하여 설계되었을 뿐만 아니라 플러딩을 사용하기 때문에 높은 제어 오버헤드를 발생시킨다. 본 논문에서는 트리기반의 이동성관리 방식을 사용하며 이 과정에서 부수적으로 구축되는 토폴로지 정보를 활용하는 단순하고 효율적인 라우팅 프로토콜을 제시한다. 제안하는 라우팅 프로토콜은 패킷 전송 과정에서 트리를 구성하는 중요 링크에 대한 파손을 발견하는 경우에 토폴로지 정보를 신속히 갱신한다. 이러한 방식으로 이동성 관리와 라우팅 프로토콜은 서로 협력한다. 또한 IG 주위에 트래픽 혼잡을 줄이기 위하여 점진적 경로탐색 방식을 사용하였으며, 제어메시지 전송 신뢰성을 높이고 링크 유효성을 신속히 판단할 수 있도록 유니케스트 기반의 브로드케스트 방식을 사용하였다. 그리고 플러딩을 배제하고 제어메시지 전송의 최적화를 통하여 오버헤드를 크게 줄임으로써 노드의 수가 증가하고 이동성이 높은 경우에도 안정적으로 작동할 수 있도록 하였다. 시뮬레이션을 통해서 제안하는 프로토콜이 Hybrid 이동성 관리 방식을 사용하는 AODV에 비하여 우수한 성능과 확장성을 갖는다는 것을 입증하였다. Since the existing protocols separated mobility management part and routing protocol part in their design and used a flooding, they suffer from the high control overhead, thereby limiting performance. In this paper, we use a tree-based mobility management method and present a simple and efficient routing protocol that exploits the topology information which is built additionally through mobility management. Thus, the mobility management and the routing protocol closely cooperate to optimize control overhead. Furthermore, we use a progressive path discovery method to alleviate traffic congestion around IG and a unicast-based broadcast method to increase the reliability of message delivery and to judge link validity promptly. The proposed protocol reduces control overhead greatly and works in a stable manner even with the large number of nodes and high mobility. This was proven by comparing with the AODV protocol that employs the hybrid mobility management protocol.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
