Computao

Instituto de

Outline Introduction Results Conclusion

Coding-Aware Routing in Multihop Wireless Networks

Diego Passos and Clio Albuquerque {dpassos,celio}@ic.uff.br
Universidade Federal Fluminense

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 1/19

Computao

Instituto de

Outline

Introduction
Outline Introduction Results Conclusion

Preliminary Results

Conclusion

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 2/19

Computao

Instituto de

Outline

Introduction
Outline Introduction Results Conclusion

Preliminary Results

Conclusion

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 3/19

Computao

Instituto de

Forwarding vs. Coding

Traditional Routing
Traditional paradigm used in networks. Nodes receive packets through input links. Packets are replicated through one or mode links.
Payload, usually, is not modied.

Outline Introduction Results Conclusion

Network Coding
New paradigm introduced in 2000. Nodes can transform packets.
Native Packets are combined into one Coded Packet.

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 4/19

Computao

Instituto de

Network Coding: Example

Traditional Paradigm A
Time t0 t1 t2 t3 t4

Outline Introduction Results Conclusion

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 5/19

Computao

Instituto de

Network Coding: Example

Traditional Paradigm P0 A
Time t0 t1 t2 t3 t4

Outline Introduction Results Conclusion

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 5/19

Computao

Instituto de

Network Coding: Example

Traditional Paradigm P0 P1 B C A
Time t0 t1 t2 t3 t4

Outline Introduction Results Conclusion

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 5/19

Computao

Instituto de

Network Coding: Example

Traditional Paradigm P0 P1 B P0
Time t0 t1 t2 t3 t4

Outline Introduction Results Conclusion

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 5/19

Computao

Instituto de

Network Coding: Example

Traditional Paradigm P0 P1 B P1
Time t0 t1 t2 t3 t4

Outline Introduction Results Conclusion

C P0

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 5/19

Computao

Instituto de

Network Coding: Example

Traditional Paradigm P0 P1 B P1
Time t0 t1 t2 t3 t4

Outline Introduction Results Conclusion

C P0

Network Coding A
Time
912 October 2011

t0

t1

t2
GBR 2011

t3

t4
5/19

Diego Passos and Clio Albuquerque

Computao

Instituto de

Network Coding: Example

Traditional Paradigm P0 P1 B P1
Time t0 t1 t2 t3 t4

Outline Introduction Results Conclusion

C P0

Network Coding P0 A
Time
912 October 2011

t0

t1

t2
GBR 2011

t3

t4
5/19

Diego Passos and Clio Albuquerque

Computao

Instituto de

Network Coding: Example

Traditional Paradigm P0 P1 B P1
Time t0 t1 t2 t3 t4

Outline Introduction Results Conclusion

C P0

Network Coding P0 A
Time
912 October 2011

P1 B C

t0

t1

t2
GBR 2011

t3

t4
5/19

Diego Passos and Clio Albuquerque

Computao

Instituto de

Network Coding: Example

Traditional Paradigm P0 P1 B P1
Time t0 t1 t2 t3 t4

Outline Introduction Results Conclusion

C P0

Network Coding P0 A P0 P1
Time
912 October 2011

P1 B P0 P1
t2
GBR 2011

t0

t1

t3

t4
5/19

Diego Passos and Clio Albuquerque

Computao

Instituto de

Network Coding: Evolution

History
First efforts were mainly theoretical.

Outline Introduction Results Conclusion

Researchers discussed properties and mathematical limits.

Recent research has been more practical.

E.g., Strategies for dynamic detection of Coding Opportunities. Opportunistic Network Coding.

More recently, a new research topic: Coding-Aware Routing.

How to provoke opportunities through routing?

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 6/19

Computao

Instituto de

Coding-Aware Routing
Goal
Magnify coding gains using routing.

Outline Introduction Results Conclusion

Provoke opportunities, instead of waiting for them.

Idea
Opportunities happen when ows cross. The path for a ow is chosen by the routing protocol. Coding-aware protocols may redirect ows for coding.

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 7/19

Computao

Instituto de

Coding-Aware Routing (More)

Challenges

Outline Introduction Results Conclusion

Balance two distinct goals.

Traditional routing metrics.
Delay, packet loss,

Coding gains.

Measure link quality considering many receivers.

Coded packets have many destinations. How to compute the joint reception probability?

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 8/19

Computao

Instituto de

Our Research Goals

Outline Introduction Results Conclusion

Design a complete coding-aware routing protocol. However, there are fundamental issues that need to be addressed.
In terms of implementation, modeling, etc.

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 9/19

Computao

Instituto de

Outline

Introduction
Outline Introduction Results Conclusion

Preliminary Results

Conclusion

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 10/19

Computao

Instituto de

Reception (In)Dependence
The literature on coding
Usually considers reception events independent. Simplies computation of metrics.

Outline Introduction Results Conclusion

However
Interference Sources Network Nodes

A B

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 11/19

Computao

Instituto de

Reception (In)Dependence (More)

Experimental results

Outline Introduction Results Conclusion Source 2 3 7 5 8 2 3 3 5 5 5 6 6 Dest. A 3 7 5 7 5 5 6 7 7 7 8 8 8 Dest. B 5 6 3 8 6 4 2 2 4 3 2 4 3 P(A) 0,391 0,595 0,537 0,610 0,380 0,391 0,648 0,595 0,610 0,610 0,079 0,361 0,361 P(B) 0,370 0,648 0,555 0,079 0,760 0,281 0,369 0,369 0,976 0,722 0,123 0,065 0,456 P(A B) 0,197 0,473 0,406 0,074 0,367 0,126 0,245 0,212 0,594 0,441 0,011 0,022 0,141 P(A|B) 0,533 0,730 0,732 0,937 0,482 0,450 0,663 0,575 0,609 0,611 0,087 0,333 0,309 P(B|A) 0,504 0,795 0,756 0,122 0,964 0,323 0,378 0,357 0,974 0,722 0,134 0,060 0,391

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 12/19

Computao

Instituto de

Reception (In)Dependence (More)

Experimental results

Outline Introduction Results Conclusion Source 2 3 7 5 8 2 3 3 5 5 5 6 6 Dest. A 3 7 5 7 5 5 6 7 7 7 8 8 8 Dest. B 5 6 3 8 6 4 2 2 4 3 2 4 3 P(A) 0,391 0,595 0,537 0,610 0,380 0,391 0,648 0,595 0,610 0,610 0,079 0,361 0,361 P(B) 0,370 0,648 0,555 0,079 0,760 0,281 0,369 0,369 0,976 0,722 0,123 0,065 0,456 P(A B) 0,197 0,473 0,406 0,074 0,367 0,126 0,245 0,212 0,594 0,441 0,011 0,022 0,141 P(A|B) 0,533 0,730 0,732 0,937 0,482 0,450 0,663 0,575 0,609 0,611 0,087 0,333 0,309 P(B|A) 0,504 0,795 0,756 0,122 0,964 0,323 0,378 0,357 0,974 0,722 0,134 0,060 0,391

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 12/19

Computao

Instituto de

How to Compute Joint Probabilities?

How it is done in the literature
Nodes broadcast periodical probes. Neighbors estimate their (individual) reception probability.
Value is sent back to the source of the probes.

Outline Introduction Results Conclusion

Joint probability is computed as the product of individual probabilities.

Not always accurate.

Our proposal
Neighbors send back a bitmap of the last n probes.
912 October 2011

Using shifts and bitwise AND, node can compute intersection for any set of neighbors.
Diego Passos and Clio Albuquerque GBR 2011 13/19

Computao

Instituto de

Transmitting Coded Packets

Methods found on the literature
Simple Broadcast.
Coded packets are mapped to broadcast frames. Lacks reliability.

Outline Introduction Results Conclusion

Pseudo-Broadcast.
Coded packets are mapped to unicast frames. Next hop is chosen randomly among destinations. Lacks a well dened objective.

Our solution: Deterministic Pseudo-Broadcast

Coded packet is mapped to unicast frame. Next hop is destination with worst individual link quality.
Maximizes joint reception probability.
912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 14/19

Computao

Instituto de

Transmitting Coded Packets (More)

Experimental results
1 Packet Percentual 0.8 0.6 0.4 0.2 0 0 1 2 3 4 Number of Receivers 5 6 7 Deterministic Random Simple Broadcast

Outline Introduction Results Conclusion

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 15/19

Computao

Instituto de

Outline

Introduction
Outline Introduction Results Conclusion

Preliminary Results

Conclusion

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 16/19

Computao

Instituto de

Summary and Final Remarks

Network Coding
Great potential to increase capacity of Multihop Wireless Networks. Gains can be magnied by coding-aware routing.
However, many fundamental points need further modeling.

Outline Introduction Results Conclusion

Our work
Intends to develop a coding-aware routing protocol. Tries to model accurately processes involved in Coding.
In order to correctly balance coding gains and traditional performance metrics.
912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 17/19

Computao

Instituto de

Open Issues
Joint probability and multiple rates
How does the joint reception probability change with the different rates? Is it possible to possible to estimate it based only on probes at 1Mb/s?

Outline Introduction Results Conclusion

Routing metric
How to assign a cost to a metric?
Considering coding opportunities, intra and inter-ow interference, etc?

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 18/19

Computao

Instituto de

Open Issues
Algorithm for path selection

Outline Introduction Results Conclusion

Coding-aware route selection is a global problem. Classic minimum cost path selection algorithms are not sufcient.

Implementation issues
What information is relevant? How to propagate it in a optimum way?

912 October 2011 Diego Passos and Clio Albuquerque GBR 2011 19/19