Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH...
-
Upload
jasmin-willis -
Category
Documents
-
view
214 -
download
0
Transcript of Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH...
![Page 1: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/1.jpg)
Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks
Valery Naumov & Thomas R. GrossETH Zurich, Switzerland
IEEE INFOCOM 2007
![Page 2: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/2.jpg)
Outline
• Introduction• Related Works• Connection-Aware Routing (CAR)• Simulation• Conclusion
![Page 3: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/3.jpg)
Introduction
• Vehicular ad hoc networks (VANETs) using 802.11-based WLAN technology have recently received considerable attention in many projects
• However, many geographic routing (GR) protocols are designed assuming a random and uniform distribution of nodes
![Page 4: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/4.jpg)
Introduction
• For this study of VANETs, it use realistic mobility traces (from the simulator)
• Several GR protocols use an idealized mechanism such that for every originated data packet the true position of the destination is known– e.g. based on the simulator’s global view
![Page 5: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/5.jpg)
Introduction
• Another problem is that, all of the GR protocols do not take into account if a path between source and destination is populated.
• This paper presents a novel position-based routing scheme called Connectivity-Aware Routing (CAR) to adress these problems
![Page 6: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/6.jpg)
Outline
• Introduction• Related Works• Connection-Aware Routing (CAR)• Simulation• Conclusion
![Page 7: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/7.jpg)
Related Works
• AODV (Ad-hoc On-demand Distance Vector)– A non-geographic routing protocol.– Broadcast path request on demand.
• GPSR (Greedy Perimeter Stateless Routing)– A geographic routing protocol– Packets are marked with their destinations’locations.– Relay nodes make a local greedy routing.
![Page 8: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/8.jpg)
Related Works
![Page 9: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/9.jpg)
Related Works
![Page 10: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/10.jpg)
Outline
• Introduction• Related Works• Connection-Aware Routing (CAR)• Simulation• Conclusion
![Page 11: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/11.jpg)
Connection-Aware Routing (CAR)
• The CAR protocol consists of four main parts: – (1) destination location and path discovery– (2) data packet forwarding along the found path – (3) path maintenance with the help of guards – (4) error recovery
![Page 12: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/12.jpg)
Connection-Aware Routing (CAR)
• The HELLO beacon includes location, velocity vector (moving direction and speed)
• Every node maintain a neighbor table– set expiration time • separated by more than 80% of range• after two HELLO intervals
• Drawbacks: waste bandwidth, delay data packet, increase network congestion
![Page 13: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/13.jpg)
Connection-Aware Routing (CAR)
• Adaptive beaconing mechanism:– Beacon interval is changed according to the
number of nearby neighbors.
• Beacons can be appended in the data packets.
![Page 14: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/14.jpg)
Connection-Aware Routing (CAR)
• Guard ()
![Page 15: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/15.jpg)
Connection-Aware Routing (CAR)
• Destination location discovery• A source broadcast a path discovery (PD) • Each node forwarding the PD updates some
entries of PD
• If two velocity vectors’angle > 18°, anchor is set.
![Page 16: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/16.jpg)
Connection-Aware Routing (CAR)
• If two velocity vectors’angle > 18°, anchor is set.– Anchor contains coordinates and velocity vector of
current node and previous node.
![Page 17: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/17.jpg)
Connection-Aware Routing (CAR)
• A route reply will send to the source with unicast
• Advantages– Finds the path that exist in reality– Takes connectivity into account– No try-and-error route test– Only source-destination pares keep anchor path to
each other
![Page 18: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/18.jpg)
Connection-Aware Routing (CAR)
• Greedy forwarding over the anchored path– A neighbor that is closer to the next anchor point
is chosen, instead of destination.– Each forwarding node relays to anchor if the
distance is less than half coverage
![Page 19: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/19.jpg)
Connection-Aware Routing (CAR)
• Path maintenance
• If an end node (source or destination) changes position or direction, standing guard will be activated to maintain the path.
![Page 20: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/20.jpg)
Connection-Aware Routing (CAR)
![Page 21: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/21.jpg)
Connection-Aware Routing (CAR)
![Page 22: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/22.jpg)
Connection-Aware Routing (CAR)
• Path maintenance
• If end node changes direction against the direction of communication, traveling guard will be activated.– A traveling guard runs as end node’s old direction
and speed, and reroute the packets to the destination.
– End node will send a notification to source
![Page 23: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/23.jpg)
Connection-Aware Routing (CAR)
![Page 24: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/24.jpg)
Connection-Aware Routing (CAR)
![Page 25: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/25.jpg)
Connection-Aware Routing (CAR)
• Routing error recovery
• The reason for routing error– A temporary gap between vehicles– Long-term disconnection a suddenly closed road or big gap in traffic.– The destination could not activate a guard due to lack of neighbors.
• Timeout algorithm with active waiting cycle• Walk-around error recovery
![Page 26: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/26.jpg)
Connection-Aware Routing (CAR)
• Timeout algorithm• When a node detects a gap
– It tells other nodes and starts buffering packets.– It tries to detest a next hop node, sends requests.
• A node receives the request will reply with a HELLO beacon.
![Page 27: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/27.jpg)
Connection-Aware Routing (CAR)
![Page 28: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/28.jpg)
Connection-Aware Routing (CAR)
• Walk-around error recovery
• When fail to find the destination at its estimate position– Start a location discovery limited half the number
of anchors in the old path• When Timeout algorithm fail– Limit to the number of anchors from the node to
the destination plus 50%.
![Page 29: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/29.jpg)
Connection-Aware Routing (CAR)
• If location discovery is unsuccessful– Start a new path discovery.
• If successful, the new path will send to source– Source analyzes the new path and current position,
Start a new path discovery if the source is closer then the node to the destination.
![Page 30: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/30.jpg)
Outline
• Introduction• Related Works• Connection-Aware Routing (CAR)• Simulation• Conclusion
![Page 31: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/31.jpg)
Simulation
• Scenarios– City – Highway
• Traffic density– Low – less than 15 vehicles/km– Medium – 30-40 vehicles/km– High – more then 50 vehicles/km
![Page 32: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/32.jpg)
Simulation-Packet Delivery Ratio
![Page 33: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/33.jpg)
Simulation-Average data packet delay
![Page 34: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/34.jpg)
Simulation-Routing overhead
![Page 35: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/35.jpg)
Outline
• Introduction• Related Works• Connection-Aware Routing (CAR)• Simulation• Conclusion
![Page 36: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/36.jpg)
Conclusion
• Adaptive beaconing• PGB, AGF, and velocity vectors• Anchor points• Path maintenance with guards • Error recovery• Higher performance and lower routing
overhead than GPSR
![Page 37: Connectivity-Aware Routing (CAR) in Vehicular Ad Hoc Networks Valery Naumov & Thomas R. Gross ETH Zurich, Switzerland IEEE INFOCOM 2007.](https://reader035.fdocuments.in/reader035/viewer/2022062720/56649f0c5503460f94c1f4a3/html5/thumbnails/37.jpg)
Conclusion
• Advantages– Don’t need a digital map.– No local maximum problem.– Take path situation into account.– Guard concept
• weakness– Selection some needless node as anchors