SHARIF UNIVERSITY OF TECHNOLOGY

ELECTRICAL ENGINEERING DEPARTMENT

Adaptive MAC for Long-Distance Multi-hop Wireless Networks

by

Maryam Eslami Rasekh

Student Term Paper in the Course

Wireless Communication Networks

Instructor: Dr. S. Jamaloddin Golestani
Spring Semester, 2009-2010

This presentation provides a summary and analysis of the following

papers
1.

Sergiu Nedevschi, Rabin K. Patra, Sonesh Surana, Sylvia

Ratnasamy, Lakshminarayanan Subramanian, Eric A. Brewer, An
Adaptive, High Performance MAC for Long-Distance Multihop
Wireless Networks, Proceedings of the 14th ACM international
conference on Mobile computing and networking, September
14-19, 2008, San Francisco, California, USA

2.

R. Patra, S. Nedevschi, S. Surana, A. Sheth, L. Subramanian, and

E. Brewer, WiLDNet: Design and Implementation of High
Performance WiFi Based Long Distance Networks. USENIX
NSDI, 2007.

Overview
Introduction to WiLD networks
Current MAC protocols and room for
improvement
The JazzyMac protocol
Bootstrapping
Evaluation of JazzyMac and comparison of
various protocols
Conclusions

Introduction of WiLD networks

WiLD: WiFi-based Long Distance Network

Highly directive long distance links
One radio for each link on a node
Interference mainly from links on the same
node

Introduction of WiLD networks Interference

Interference free transmission on same node
links: SynOp SynRx, SynTx
Interference in Mixed Tx-Rx case

|PR1 PR2| < S Thisolation

Current MAC protocols

2P and WiLDNet protocols
Equal slots for Tx and Rx (Fixed-slot TDMA, FT)
Limited to bipartite topologies

Current protocols room for improvement

Dynamically adaptive time slots
Adapt time slots to traffic, e.g. single link, fork topology

Allowing simultaneous transmission on

independent neighboring links

Current protocols room for improvement

Allowing better delay-throughput trade-off
Applicability to arbitrary topologies
K colored subgraphs with FT
FT on MaxCut

The JazzyMac protocol

One token for each link (TAB )
Token in possession of one node at any given time
Each token comes with a time out value (AB)

Network-wide value for max_slot

Every node either in Tx mode or Rx mode
(No simultaneous Tx-Rx on any node)

The JazzyMac protocol

The four rules:
Token exchange rule, once A has finished transmitting to B, it
sends the (TAB, AB) pair to B. Token becomes valid after AB

Mode transition rule, a node can go to Tx mode (from Rx

mode) only when it has the tokens of all its links and from Tx mode to
Rx mode after it has given up all its tokens.

Transmit rule, A can only transmit to B if a) it is in Tx mode, b)

it holds the AB link token (TAB), c) TAB is valid

Slot time rule, No node can transmit on any of its links for
over max_slot time units

The JazzyMac protocol

How long does a
Tx slot last?
How is AB
calculated? Remaining
time needed for completion of
all transmissions on node

Typical scenario:

Bootstrapping
Initial assignment of tokens
Effect of bootstrapping on steady state
performance three examples

Bootstrapping
Bootstrapping algorithm:
Nodes are colored using minimum number of colors
(K)
Tokens initially assigned to nodes with smallest
color number

Properties:
Deadlock free
Starvation free
Minimum achievable bandwidth on any link (1/K)
Maximum delay between consecutive transmissions
on each link (K)

The JazzyMac protocol properties

Distributed
Arbitrary topologies (efficient use of all links)
Starvation and deadlock free
Each link can use at least 1/K of network
capacity
Each link must wait at most K times max_slot
for a chance to transmit

Evaluation
Two main metrics for performance
Maximum throughput (max-point, divergence point)
Average delay

Comparison carried out between four

protocols
JZ (JazzyMac)
JZ-CUT (JazzyMac over maxcut)
FT (Fixed-slot TDMA)
FT-Cut (FT over maxcut)

Evaluation
Simulations carried out in three topologies
Random topology
Existing topology in Aravind eye hospital
Feasible Raman topology

Three traffic types used

Single source many sinks
Unidirectional flows generated randomly
Bidirectional flows generated randomly
(all flows are 500 Kbps CBR (constant bit rate) flows)

Comparison of various protocols

Random graph with
30 nodes

Effect of network size

Maximum Throughput

Divergence point

In all scenarios,
JZ > JZ-CUT FT-CUT > FT
Why?

Effect of traffic
Type A traffic (single source, multi sink)

Type B traffic (Unidirectional)

Type C traffic (bidirectional)

Delay Throughput trade-off

Conclusions
JazzyMac provides distributed MAC with
adaptation of slot sizes to local traffic
Applicable to arbitrary topologies
Outperforms current 2P and WiLDNet
protocols in all scenarios (topology, network
size, traffic type)
Improvements greater for asymmetric traffic
Better delay-throughput trade-off

References
1.

Sergiu Nedevschi, Rabin K. Patra, Sonesh Surana, Sylvia

Ratnasamy, Lakshminarayanan Subramanian, Eric A. Brewer, An
Adaptive, High Performance MAC for Long-Distance Multihop
Wireless Networks, Proceedings of the 14th ACM international
conference on Mobile computing and networking, September 1419, 2008, San Francisco, California, USA

2.

R. Patra, S. Nedevschi, S. Surana, A. Sheth, L. Subramanian, and E.

Brewer, WiLDNet: Design and Implementation of High
Performance WiFi Based Long Distance Networks. USENIX NSDI,
2007.

3.

K. Jain, J. Padhye, V. Padmanabhan, and L. Qiu. Impact of

Interference on Multi-hop Wireless Network Performance, ACM
MOBICOM, Sept. 2003.

Thank you for your attention