Publications
Detailed Information
Routing Schemes in Community-Based Vehicular Ad Hoc Networks : 지역 공동체 기반의 차량간 애드혹 네트워크를 위한 라우팅 기법
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 최양희 | - |
dc.contributor.author | 이호진 | - |
dc.date.accessioned | 2017-07-13T06:53:54Z | - |
dc.date.available | 2017-07-13T06:53:54Z | - |
dc.date.issued | 2012-08 | - |
dc.identifier.other | 000000003918 | - |
dc.identifier.uri | https://hdl.handle.net/10371/118854 | - |
dc.description | 학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2012. 8. 최양희. | - |
dc.description.abstract | As wireless communication technologies have become commodities, it is expected that more and more vehicles will be equipped with wireless communication interfaces. The wireless communication module in vehicles will be used not only for in-vehicle communications, but also for (inter-)vehicular communications. We focus on the latter, which can form a vehicular ad hoc network.
Vehicular ad hoc networks (VANETs) open an opportunity for new applications. For instance, the message dissemination of traffic congestion, accident notification across vehicles may be needed and helpful for safe and efficient driving. VANETs with some fixed roadside infrastructure (e.g. static WiFi access points) also allows the geography-based advertisement like local events, free parking spots, and so on. In this dissertation, we focus on routing schemes in VANETs, where i) vehicles move within a specific area, and ii) belong to a specific community. We call this type of networks community-based VANETs. The representative examples are buses and taxis belonging to local transportation service companies. In community-based VANETs, we first propose a single-copy forwarding scheme enhanced by exploiting mobility information, and then extend the scheme to a multicopy version. To do so, we maintains the mobility information in a distributed manner. Second, we present the analysis of the expected delivery delay for single-copy schemes, using a simple model: the expected time to absorption in a continuous-time Markov chain. Third, we propose a novel geographic routing protocol in high vehicle density environments. The proposed scheme models a road topology by a graph in which the intersections of roads and road segments between adjacent intersections correspond to the sets of vertices and edges, respectively. Then, routing is performed vertex by vertex at the macro level and node by node at the micro level. | - |
dc.description.tableofcontents | Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . i
I. Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 II. Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1 Vehicular Ad Hoc Networks (VANETs) . . . . . . . . . . . . . . . 5 2.1.1 Overview of VANETs . . . . . . . . . . . . . . . . . . . . 5 2.1.2 Community-Based VANETs . . . . . . . . . . . . . . . . . 7 2.2 Delay Tolerant Networks (DTNs) . . . . . . . . . . . . . . . . . . . 8 2.2.1 Overview of DTNs . . . . . . . . . . . . . . . . . . . . . . 8 2.2.2 Carry-and-Forward Schemes . . . . . . . . . . . . . . . . . 9 III. Practical Routing in Community-Based VANETs . . . . . . . . . . . 13 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2 Problem Statement . . . . . . . . . . . . . . . . . . . . . . . . . . 14 3.3 Maintaining Mobility Information . . . . . . . . . . . . . . . . . . 15 3.3.1 Direct Contact Information . . . . . . . . . . . . . . . . . . 16 3.3.2 Mobility Information Matrix . . . . . . . . . . . . . . . . . 16 3.3.3 Mobility Information Reduction . . . . . . . . . . . . . . . 18 3.4 Forwarding Decision . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.4.1 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.4.2 Indirect Delivery . . . . . . . . . . . . . . . . . . . . . . . 21 3.4.3 Candidate Set . . . . . . . . . . . . . . . . . . . . . . . . . 21 3.5 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . 24 3.5.1 Environment Setup . . . . . . . . . . . . . . . . . . . . . . 24 3.5.2 Simulation Results . . . . . . . . . . . . . . . . . . . . . . 25 3.6 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31 3.7 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 IV. Optimal Forwarding in Community-Based VANETs: A Stochastic Control Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35 4.2 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38 4.3 Expected Delivery Delay . . . . . . . . . . . . . . . . . . . . . . . 40 4.4 Optimal Forwarding Problem . . . . . . . . . . . . . . . . . . . . . 42 4.4.1 Markov Decision Process . . . . . . . . . . . . . . . . . . 42 4.4.2 MDP Formulation . . . . . . . . . . . . . . . . . . . . . . 43 4.4.3 Converting a Binary Rule into a Subset Rule . . . . . . . . 48 4.5 Greedy Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.5.1 Local Algorithm . . . . . . . . . . . . . . . . . . . . . . . 52 4.5.2 Global Algorithm . . . . . . . . . . . . . . . . . . . . . . . 58 4.5.3 Analysis of Time Complexity . . . . . . . . . . . . . . . . 62 4.6 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . 63 4.6.1 Environment Setup . . . . . . . . . . . . . . . . . . . . . . 63 4.6.2 Numerical Results . . . . . . . . . . . . . . . . . . . . . . 64 4.7 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 iv 4.8 Conclusion and Future Work . . . . . . . . . . . . . . . . . . . . . 68 V. Geographic Overlay Routing for Road-Based Vehicular Ad Hoc Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69 5.2 Preliminaries and Motivations . . . . . . . . . . . . . . . . . . . . 71 5.2.1 Greedy Forwarding and Routing Hole . . . . . . . . . . . . 71 5.2.2 Effect of Node Placement on Routing Holes . . . . . . . . . 72 5.3 Geographic Overlay Routing Framework . . . . . . . . . . . . . . . 75 5.3.1 Models and Assumptions . . . . . . . . . . . . . . . . . . . 75 5.3.2 GORF Overview . . . . . . . . . . . . . . . . . . . . . . . 76 5.3.3 Operations without Disconnectivity . . . . . . . . . . . . . 76 5.3.4 Operations with Disconnectivity . . . . . . . . . . . . . . . 80 5.4 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . 86 5.4.1 Simulation Environment . . . . . . . . . . . . . . . . . . . 87 5.4.2 Performance Comparison in New York City . . . . . . . . . 89 5.4.3 Performance Comparison in Anderson County . . . . . . . 91 5.4.4 Performance Comparison between GORF Variants . . . . . 93 5.5 Related work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 96 5.6 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 98 VI. Summary and Future Work . . . . . . . . . . . . . . . . . . . . . . . 100 Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 102 | - |
dc.format | application/pdf | - |
dc.format.extent | 2070456 bytes | - |
dc.format.medium | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | 서울대학교 대학원 | - |
dc.subject | vehicular ad hoc networks | - |
dc.subject.ddc | 621 | - |
dc.title | Routing Schemes in Community-Based Vehicular Ad Hoc Networks | - |
dc.title.alternative | 지역 공동체 기반의 차량간 애드혹 네트워크를 위한 라우팅 기법 | - |
dc.type | Thesis | - |
dc.contributor.AlternativeAuthor | Hojin Lee | - |
dc.description.degree | Doctor | - |
dc.citation.pages | viii, 111 | - |
dc.contributor.affiliation | 공과대학 전기·컴퓨터공학부 | - |
dc.date.awarded | 2012-08 | - |
- Appears in Collections:
- Files in This Item:
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.