Opportunistic shortest path forwarding in disruption tolerant network전송 지연 및 끊김 허용 네트워크에서 기회적 최단 경로 포워딩 기법

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 464
  • Download : 0
In this thesis, we focus on estimating a metric to adjust optimal forwarding framework with delay minimizing objective in delay/diruption tolerant network(DTN) which is regarded as an opportunistic network. Using inter-contact time, a consideration of the multi-hop contacts path finds better path than considering only one hop contact path. In opportunistic network, since every node has intelligence to decide forwarding and scheduling and rate control, the multi-hop contacts path is not pre-determined by source node. One thing we did here is that we present a novel metric estimation algorithm called opportunistic transitivity (OTR) which can be well-adapted to opportunistic network property. Using the opportunism, we show the 12.5 percents delay gain compared to the transitivity algorithm and we call that gain a multi-contact diversity gain. Secondly, we propose more practical algorithm exploiting multi-contact diversity gain. While OTR needs to regard any topology as a complete graph including opportunistic links, Approach First Inter-Contact(AFIC) algorithm which we propose here reduces hop counts from undetermined to 2 hop and the candidate set from all nodes to one hop contact nodes. Using the property of vehicles` locality which we found on real trace, we reduce the complexity as well as keeping the OTR`s performance level. Geographic correlation of each vehicle mitigates the high complexity of OTR. In Chapter 2, we consider regularity in urban city environment using real trace 4000 taxies. In contrast to well-known [1,2] inter-contact regularity, inter-visit regularity and inter-visit time distribution is not studied well. In order to find new circumstance in urban city environment, we first plot the correlation between everyday visiting spots to know temporal regularity. We show that the visiting pattern of all vehicles is repeated daily. Second, we show spatial regularity which means that the regularly visiting spots of each vehicle are spatially div...
Advisors
Chong, Songresearcher정송researcher
Description
한국과학기술원 : 전기 및 전자공학과,
Publisher
한국과학기술원
Issue Date
2010
Identifier
419180/325007  / 020083487
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전기 및 전자공학과, 2010.2, [ vii, 41 p. ]

Keywords

routing; forwarding; Opportunistic; DTN; geographic; 위치기반; 라우팅; 포워딩; 기회적; 지연허용

URI
http://hdl.handle.net/10203/36601
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=419180&flag=dissertation
Appears in Collection
EE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0