Real-time Communication in Vehicular Ad Hoc Networks (VANETs)

More documents

Recommendations

Info

There are two widely used types of protocols in network routing: table-driven protocols and source-driven protocols. Table-driven protocols use proactive methods to maintain network topology. 3.3.1 Table-driven Routing Protocol Table-driven routing protocols attempt to maintain consistent, up-to-date routing information by broadcasting transmission that requires each node to maintain one or more tables to store routing information. Once there are changes in network topology, propagating update information throughout the whole network has to be performed in order to maintain a consistent network view. For instance, the Destination Sequenced Distance Vector Routing protocol (DSDV) described is a famous table-driven algorithm based on the classical Bellman-Ford routing mechanism. The Cluster-head Gateway Switch Routing (CGSR) protocol defines several heuristic routing schemes in a clustered multi-hop mobile wireless network. The Wireless Routing Protocol (WRP) is another table-based protocol with the goal of keeping routing information consistent among all nodes in the network. Each node in the network is responsible for maintaining four tables: distance table, routing table link-cost table, message retransmission list (MRL) table. Optimized Link State Routing Protocol (OLSR) is also a kind of proactive protocol. This algorithm floods broadcast message just through the nodes selected by Multipoint Relays (MPRs) 20
3.3.2 Source-driven Routing Protocol Different from table-driven routing, source-driven routing protocols, also called on-demand routing, use a reactive way to find a route if it is desired by source node. The Ad Hoc On-Demand Distance Vector (AODV) routing protocol [52] develops on top of DSDV algorithm previously. Basically, it minimizes the number of required broadcasts by creating routes on a demand basis, as opposed to maintaining a complete list of routes as in the DSDV algorithm [53]. AODV broadcasts a route request (RREQ) packet from the initiator and then the requests are forwarded until the destination is found. AODV utilizes destination sequence numbers to ensure all routes are loop-free and contain the most recent route information. The Dynamic Source Routing (DSR) protocol provides a mechanism to make each node maintain route caches which contain newly updated information. The Temporally Ordered Routing Algorithm (TORA) is a highly adaptive loop-free distributed routing algorithm based on the concept of link reversal. TORA is proposed to operate in a highly dynamic mobile networking environment. The key design concept of TORA is the localization of control messages to a very small set of nodes near the occurrence of a topological change. The Associativity-Based Routing (ABR) protocol defines a routing metric named as degree of association stability. That is free from loops, deadlock, and packet duplicates. Signal Stability-Based Adaptive Routing protocol (SSR) employs route selection criteria to choose the routes that have “stronger” connectivity. SSR can be divided into two cooperative protocols: the Dynamic Routing Protocol (DRP) and the Static Routing Protocol (SRP). 21
Page 1 and 2: Real-time Communication in Vehicula
Page 3 and 4: PERMISSION TO LEND AND/OR COPY I ag
Page 5 and 6: ABSTRACT Ad hoc networks in which n
Page 7 and 8: 3.4.1.1 Ns-2 . . . . . . . . . . .
Page 9 and 10: 5.3.3.1 Dynamic object . . . . . .
Page 11 and 12: LIST OF FIGURES Figure 2.1: Time Re
Page 13 and 14: Chapter 1 Introduction In this chap
Page 15 and 16: 1.3 Objective For this dissertation
Page 17 and 18: Chapter 2 Background In this chapte
Page 19 and 20: Figure 2.2 Backoff Process 2.2 MANE
Page 21 and 22: In VANETs scenarios there are three
Page 23 and 24: number of stations in the network [
Page 25 and 26: Clock synchronisation is necessary
Page 27 and 28: Chapter 3 Related Works In this cha
Page 29 and 30: 3.2 MAC Protocol The MAC layer is t
Page 31: Figure 3.1 Classification of MAC Pr
Page 35 and 36: In VANETs, limited resource (e.g. b
Page 37 and 38: 3.4.1.3 TOSSIM / TOSSF TOSSIM [54]
Page 39 and 40: Chapter 4 DESIGN After covering muc
Page 41 and 42: 4.2.2 Individual Behaviour Differen
Page 43 and 44: learning about the system. In [34],
Page 45 and 46: is specified as an entity. An entit
Page 47 and 48: Object Oriented Programming differs
Page 49 and 50: 4.5.2 Roadway Layout As mentioned a
Page 51 and 52: 4.5.4.1 Intra-cell communication Ac
Page 53 and 54: 4.6 TBMAC Application Programming I
Page 55 and 56: 4.7.1.1 Clock synchronisation First
Page 57 and 58: When a vehicle is going to leave a
Page 59 and 60: 4.8 Summary In this chapter we firs
Page 61 and 62: To avoid the confusion from the den
Page 63 and 64: 5.3 Components 5.3.1 Roadway We app
Page 65 and 66: Through above steps, we can get a r
Page 67 and 68: 5.3.3 Vehicle 5.3.3.1 Dynamic objec
Page 69 and 70: For a driving vehicle A, if there i
Page 71 and 72: Thread to implement the enter() met
Page 73 and 74: In the end, we join the above appro
Page 75 and 76: Chapter 6 Evaluation This Chapter i
Page 77 and 78: many classes were put in the packet
Page 79 and 80: 6.3.1 Vehicular Mobility Model Rand
Page 81 and 82: 6.3.5 Software Usability The TBMAC
Page 83 and 84:
Chapter 7 Conclusion 7.1 Summary In
Page 85 and 86:
7.3 Lessons Learned In this project
Page 87 and 88:
[7] Y.-B. Ko and N. H. Vaidya, “G
Page 89 and 90:
[19] M. Ergen, et al., “Wireless
Page 91 and 92:
[36] J. Misra, “Distributed discr
Page 93 and 94:
[51] “DSRC—Dedicated Short Rang
show all

Real-time Communication in Vehicular Ad Hoc Networks (VANETs)

Create successful ePaper yourself

Delete template?

Save as template?