Advanced Computer

Networks (CS ZG525)

BITS Pilani
Pilani Campus

Virendra S Shekhawat
Department of Computer Science and Information Systems

BITS Pilani
Pilani Campus

First Semester 2015-2016

Lecture-16 [24th Oct 2015]

Agenda
VANET Networks: A Case Study of DTN

[CH-29]

Reference
Slides

Wireless Networks Fundamentals

[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

Advanced Computer Networks CS ZG525

BITS Pilani, Pilani Campus

 VANET Networks: A Case Study of DTN

Characteristics
Mobility Models

VANET Applications
Safety
Infotainment

Data/Message Dissemination Protocols

4
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Traditional MANET routing protocols are not

suitable for VANET
e.g. DSR, AODV
6
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Innovative Applications
Application Category
Transportation/Safety Related
Convenience Related

Low cost Digital Connectivity in Rural Areas

The Daknet project uses wireless technology to provide
asynchronous digital connectivity in rural areas

9
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Data Collection from Sensor

Nodes
Monitor road traffic using sensor networks
Monitor traffic delays on road in a distributed
manner
Example:
CarTel is a distributed mobile sensor computing
system
Uses this information for traffic monitoring and route
planning applications
10
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Other Applications of CarTel

Environmental monitoring
Mobile chemical and pollution sensors

Civil Infrastructure Monitoring

Vibration sensors to monitor the state of the road

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Cooperative Downloading
Cooperative Downloading: Good alternate for CDNs
File is downloaded in parallel from a number of cooperating peers (aka
Swarming)

Vehicular network is suitable for such content sharing system..

How??
High speed, frequent change in topology
Challenging task (Neighbor discovery, Peer selection, Content selection
strategies)

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

Advanced Computer Networks CS G525

12

BITS Pilani, Pilani Campus

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

First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

VANET Suitable Forwarding

Position based Forwarding
Routing decision is based on the physical location of
the source, routing node and destination

Trajectory Based Forwarding

The source calculates the approximate trajectory
and each intermediate node makes a greedy routing
decision along the trajectory based on local position
information
14
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Next
Wireless Background
Wireless MAC
MACAW
802.11

17
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Different Wireless Networks

and Their Frequency Range
Why so many?

19
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Transmission Channel
Considerations
Every medium supports
transmission in a certain frequency
range.

Good

Bad

Outside this range, effects such as

attenuation, .. degrade the signal too
much

Transmit and receive hardware will

try to maximize the useful
bandwidth in this frequency band.
Tradeoffs between cost, distance, bit
rate

Frequency

As technology improves, these

parameters change, even for the
same wire
Signal
Advanced Computer Networks CS G525

20
BITS Pilani, Pilani Campus

The Nyquist Limit

A noiseless channel of width B can at most
transmit a binary signal at a rate 2 x B.
C = 2B x log2 L
E.g. a 3000 Hz channel can transmit data at a rate of
at most 6000 bits/second
Assumes binary amplitude encoding (ASK)

21
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Past the Nyquist Limit

More aggressive encoding can increase the
channel bandwidth.
Example: modems
Same frequency - number of symbols per second
Symbols have more possible values

22
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Capacity of a Noisy Channel

Cant add infinite symbols - you have to be able to keep
them apart. This is where noise comes in

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Characteristics of selected
wireless link standards
Reference: Chapter 6 from Kurose & Ross 5th Ed

Data rate (Mbps)

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

IS-95, CDMA, GSM

Indoor

Outdoor

10-30m

50-200m

Mid-range
outdoor

Long-range
outdoor

200m 4 Km

5Km 20 Km

24
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Wireless Network Taxonomy

Single hop
Infrastructure
(e.g., APs)

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

First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Medium Access Control

Think back to Ethernet MAC:
Wireless is a shared medium
Transmitters interfere
Need a way to ensure that (usually) only one
person talks at a time.
Goals: Efficiency, possibly fairness

26
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Multiple Access Techniques-1

Transmission medium in Wireless is broadcast in nature
Access needs to be control

Frequency Division Multiple Access (FDMA)

Available bandwidth is divided into multiple frequency
channels/bands
Frequency bands are separated from each other by guard
frequency bands to eliminate interference

Orthogonal Frequency Division Multiplexing (OFDM)

Multicarrier transmission mechanism
Spreads the data to be transmitted over multiple carriers,
modulated at lower rates
Data signals is split into multiple smaller sub-signals
Reduces the signal distortion at the receiver due to multipath
propagation of transmitted signal

27

First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Multiple Access Techniques-2

Time Division Multiple Access (TDMA)
Sharing of available bandwidth in time domain
Each node is assigned one or more time slots in each
time frame

Code Division Multiple Access (CDMA)

There is no fixed frequency channel allocation
Signals are encoded with a pseudo random digital
sequence
Narrow band transmission frequency is spread over the
entire wideband spectrum (known as spread spectrum)
Orthogonality of the codes enables simultaneous data
transmissions from multiple users
28
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Combine input with spreading code using XOR

Input bit 1 inverts spreading code bit
Input bit zero doesnt alter spreading code bit
Data rate equal to original spreading code

30
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

DSSS Example

31
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Space Division Multiple Access

Uses directional transmitter to cover angular
regions
Different area/regions can be served using the same
frequency channel
Good for satellite systems

32
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Example MAC Protocols

Pure ALOHA
Transmit whenever a message is ready
Retransmit when ACK is not received

Slotted ALOHA

Time is divided into equal time slots

Transmit only at the beginning of a time slot
Avoid partial collisions
Increase delay, and require synchronization

Carrier Sense Multiple Access (CSMA)

Listen before transmit
Transmit only when no carrier is detected
Persistent CSMA and Non Persistent CSMA
33
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

CSMA/CD Does Not Work!

Carrier sense problems
Relevant contention is at the receiver, not at sender
Hidden terminal
Exposed terminal

Collision detection problems

Hard to build a radio that can transmit and receive at same
time
Note: Full Duplex Radios, Dinesh Bharadias et al., 2013

34
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Hidden Terminal Problem

B can communicate with both A and C
A and C cannot hear each other
Problem
When A transmits to B, C cannot detect the
transmission using the carrier sense mechanism
If C transmits, collision will occur at node B

Solution
Hidden sender C needs to defer

35
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Wait the length of the interval when medium is

idle
Count-down is suspended if medium becomes busy
Transmit when back-off interval reaches 0

Need to adjust CW as contention varies

38
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

IEEE 802.11 Overview

Adopted in 1997
Defines:
MAC sublayer
MAC management protocols and services
Physical (PHY) layers
FHSS (Frequency Hooping Spread Spectrum)
DSSS (Direct Sequence Spread Spectrum)

39
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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.11a: Faster, 5Ghz OFDM. Up to 54Mbps

802.11g: Faster, 2.4Ghz, up to 54Mbps
802.11n: multiple antennae
2.4-5 GHz range
Speed up to 200 Mbps
40
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

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

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

802.11 Frame: Addressing

2

frame
address address address
duration
control
1
2
3

seq address
4
control

0 - 2312

payload

CRC

Address 4: used only in

ad hoc mode

Address 1: MAC address

of wireless host or AP
to receive this frame

Address 3: MAC address

of router interface to which AP
is attached

Address 2: MAC address

of wireless host or AP
transmitting this frame

43
First Sem 2015-16

Advanced Computer Networks CS G525

BITS Pilani, Pilani Campus

Thank You !

44
First Sem 2015-16

Advanced Computer Networks CS ZG525

BITS Pilani, Pilani Campus