Escolar Documentos
Profissional Documentos
Cultura Documentos
Virendra S Shekhawat
Department of Computer Science and Information Systems
BITS Pilani
Pilani Campus
Agenda
VANET Networks: A Case Study of DTN
[CH-29]
Reference
Slides
[CH-30]
Reading
Kurose James F and Keith W. Ross: Computer Networking: A
Top-Down Approach Featuring the Internet, Pearson
Education, 5th Edition, 2012 {Topic 6.6 and 6.8}
3
First Sem 2015-16
VANET Applications
Safety
Infotainment
4
First Sem 2015-16
VANET Characteristics
VANET Characterization
Simulation
Effects of topology changes, network partitions
VNS, CORSIM, VISSIM, SUMO, VEINS etc
Field experiments
Effect of interference
Mobility Models
Microscopic
Individual movement of each vehicular node
Driving constraints are neighboring cars, drivers behavior,
braking, acceleration/de-acceleration etc..
Macroscopic
Street, buildings and traffic lights are principle driving
constraints
First Sem 2015-16
Network Characteristics
Microscopic simulators are used to investigate
the effects of free-flow traffic on connectivity in
a VANET
Key factors which influence the connectivity
Vehicle density, relative velocity and number of lanes
Physical Characteristics of
VANET (1/2)
Roadside Infrastructure
Fixed access points with storage can increase the capacity of
the network
Predictable Mobility
Motion of a vehicle is quite predictable
e.g. Public transport, Human behavior
Vehicle Density
Partition and congestion are common due to uneven
distribution of vehicles
Rapid topology change and frequent fragmentation
Transmission Range
7
First Sem 2015-16
Physical Characteristics of
VANET (2/2)
Connection Life time
Contact Duration and Interconnection lifetime
Driving direction and transmission range directly affect
connection lifetime
Path Length
Connectivity decreases with an increase in path length
Even 3-4 hops path suffer from route errors using MANET
protocols
Unbounded Network
Node Availability
VANET nodes can frequently join or leave the network
First Sem 2015-16
Innovative Applications
Application Category
Transportation/Safety Related
Convenience Related
9
First Sem 2015-16
Automotive Diagnostics
Obtaining information from vehicles onboard sensors.
(Driving tendencies can be captured)
Geo Imaging
Location tagged images can be captured and can be used for
application like Landmark based route finding
Data Muling
Using vehicular network as data transport system to send data
to Internet servers
11
First Sem 2015-16
Cooperative Downloading
Cooperative Downloading: Good alternate for CDNs
File is downloaded in parallel from a number of cooperating peers (aka
Swarming)
SPAWN Protocol(A Swarming Protocol For Vehicular Ad-Hoc Wireless Networks, S Das 2004)
Uses a gossip mechanism to advertise the piece list each node
possesses
Takes proximity into account to select content among peers
Leverage Broadcasting (wireless media) to reduce redundant
transmissions
First Sem 2015-16
12
Message Dissemination
Key performance Parameters for routing protocols
Delivery Ratio (Key parameter for DTN)
Delivery Delay
Message Overhead: Data overhead and Control overhead
Categorized as
Topological Routing
Energy aware Routing
Position based Routing
Trajectory based Routing
Opportunistic Routing
13
Opportunistic Forwarding
No assumption about the complete end to end
path between source to destination
Routes are built dynamically
Each node decides the next hop based on local
information and may carry messages until a suitable
next-hop is found
Further categorized as
Infrastructure-Based Forwarding
Infrastructure-Less Forwarding
15
First Sem 2015-16
Infrastructure-Less Forwarding
Predictive Forwarding
Cluster-Based Forwarding
Topology-Based Forwarding
History-Based Forwarding
Priority/Content-Based Forwarding
Coding-Based Forwarding
16
First Sem 2015-16
Next
Wireless Background
Wireless MAC
MACAW
802.11
17
First Sem 2015-16
Wireless Challenges
Force us to rethink many assumptions
Need to share airwaves rather than wire
Dont know what hosts are involved
Host may not be using same link technology
Mobility
Other characteristics of wireless
Noisy lots of losses
Slow
Interaction of multiple transmitters at receiver
Collisions, interference
Multipath interference
18
First Sem 2015-16
19
First Sem 2015-16
Transmission Channel
Considerations
Every medium supports
transmission in a certain frequency
range.
Good
Bad
Frequency
20
BITS Pilani, Pilani Campus
21
First Sem 2015-16
22
First Sem 2015-16
Shannons theorem:
C = B x log(1 + S/N)
C: maximum capacity (bps)
B: channel bandwidth (Hz)
S/N: signal to noise ratio of the channel
Often expressed in decibels (db).
23
First Sem 2015-16
Characteristics of selected
wireless link standards
Reference: Chapter 6 from Kurose & Ross 5th Ed
200
802.11n
54
802.11a,g
5-11
802.11b
4
1
802.11a,g point-to-point
data
802.16 (WiMAX)
3G cellular
enhanced
UMTS/WCDMA-HSPDA, CDMA2000-1xEVDO
802.15
.384
UMTS/WCDMA, CDMA2000
.056
3G
2G
Indoor
Outdoor
10-30m
50-200m
Mid-range
outdoor
Long-range
outdoor
200m 4 Km
5Km 20 Km
24
First Sem 2015-16
No
Infrastructure
Host connects to
base station (WiFi,
WiMAX, cellular)
which connects to
larger Internet
No base station, no
connection to larger
Internet (Bluetooth,
ad hoc nets)
Multiple hops
Host may have to
relay through several
wireless nodes to
connect to larger
Internet: mesh net
No base station, no
connection to larger
Internet. May have to
relay to reach other
a given wireless node
MANET, VANET
25
26
First Sem 2015-16
27
Spread Spectrum-1
Frequency Hopping Spread Spectrum (FHSS)
Transmission switches across multiple narrow-band
frequencies in a pseudo-random manner
Switching from one channel to the other is termed
frequency hopping
Limited by the total number of frequencies are
available
29
First Sem 2015-16
Spread Spectrum-2
Direct Sequence Spread Spectrum (DSSS)
Spread the bandwidth needed to transmit data
Provides resistance against narrow band interference
Each bit is represented by multiple bits in transmitted
signal
Example
30
First Sem 2015-16
DSSS Example
31
First Sem 2015-16
32
First Sem 2015-16
Slotted ALOHA
34
First Sem 2015-16
Solution
Hidden sender C needs to defer
35
First Sem 2015-16
Exposed Terminal
A node is prevented from sending packets to other
nodes due to a neighboring transmitter
A
Example:
B to A transmission is going on
C cant initiate transmission to D as per
CSMA, Why?
B
C
36
First Sem 2015-16
RTS/CTS (MACA)
When A wants to send a packet to B, A first sends a
Request-to-Send (RTS) to B
On receiving RTS, B responds by sending Clear-to
Send (CTS), provided that A is able to receive the
packet
When C overhears a CTS, it keeps quiet for the
duration of the transfer
Transfer duration is included in both RTS and CTS
C
37
MACAW Protocol
Problem: With many contending nodes, RTS
packets will frequently collide
Solution: When transmitting a packet, choose a
back-off interval in the range [0, CW]
CW is contention window
39
First Sem 2015-16
802.11 Particulars
802.11b (WiFi)
Frequency: 2.4 - 2.4835 Ghz DSSS
Modulation: DBPSK (1Mbps) / DQPSK (faster)
Orthogonal channels: 3
There are others, but they interfere. (!)
802.11 Details
Fragmentation
802.11 can fragment large packets (this is separate from IP
fragmentation).
Preamble
72 bits @ 1Mbps, 48 bits @ 2Mbps
Note the relatively high per-packet overhead.
Control frames
RTS/CTS/ACK/etc.
Management frames
Association request, beacons, authentication, etc.
41
First Sem 2015-16
802.11 modes
Infrastructure mode
All packets go through a base station
Cards associate with a BSS (basic service set)
Multiple BSSs can be linked into an Extended Service Set (ESS)
Handoff to new BSS in ESS is pretty quick
Moving to new ESS is slower, may require re-addressing
Ad Hoc mode
Cards communicate directly.
Perform some, but not all, of the AP functions
42
First Sem 2015-16
frame
address address address
duration
control
1
2
3
seq address
4
control
0 - 2312
payload
CRC
43
First Sem 2015-16
Thank You !
44
First Sem 2015-16