Scribd
Upload
86 views18 pages

Ying - Nov8Jamming-Aware Traffic Allocation

This document summarizes a research paper on jamming-aware traffic allocation for multiple-path routing using portfolio selection theory. It describes how jammers can disrupt wireless communications through various behaviors. The paper proposes using multiple frequency bands, MAC channels, and routing paths to provide diversity and anti-jamming. The goal is to efficiently allocate traffic across multiple paths to maximize overall throughput, while accounting for each path's probability of being jammed. It formulates the problem using portfolio selection theory and solves it using a quadratic program and Lagrangian dual decomposition to provide a distributed solution that is accurate, convergent, and scalable to large networks.

Uploaded by

Vikas Nagare
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
86 views18 pages

Ying - Nov8Jamming-Aware Traffic Allocation

This document summarizes a research paper on jamming-aware traffic allocation for multiple-path routing using portfolio selection theory. It describes how jammers can disrupt wireless communications through various behaviors. The paper proposes using multiple frequency bands, MAC channels, and routing paths to provide diversity and anti-jamming. The goal is to efficiently allocate traffic across multiple paths to maximize overall throughput, while accounting for each path's probability of being jammed. It formulates the problem using portfolio selection theory and solves it using a quadratic program and Lagrangian dual decomposition to provide a distributed solution that is accurate, convergent, and scalable to large networks.

Uploaded by

Vikas Nagare
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Jamming-Aware Traffic Allocation for Multiple-Path Routing Using Portfolio Selection

Authors: P. Tague et al. IEEE/ACM transactions on Networking Presented by: Ying Xuan

Jamming Behaviors
disturb wireless communications proactive / reactive constant, random, repeat, deceive single bit/packet outsider / insider static / mobile
nondeterministic and dynamic
http://khongtenmien.com/forum/showthread.php?p=8462

Multiple-Path routing

Anti-jamming techniques = diversity


Multiple frequency bands Different MAC channels Multiple Routing paths

Multi-Path Routing
Each source node chooses multiple paths Each path is allocated with different traffic amount (how to avoid congestion?)

Goal: Efficiently allocate the traffic to maximize the overall throughput.

Each path has different probabilities to be jammed (how to measure this?)

http://w3.antd.nist.gov/adhoc/Project_drouting.shtml

Roadmap

Use PDR to approximate the overall throughput


What is PDR? How to get PDR?

Use a quadratic program based on Portfolio Selection Theory to give the optimal solution
Objective Function? Constraints?

Use Lagrangian dual decomposition to get a distributed solution


Efficiency: accuracy, convergence, scalability.

Represent the throughput - I Estimate local packet success rates (LPSR)


Each node updates (LPSR), Update period T << Ts update relay period Estimated value by Packet Delivery Rate (PDR)

Variance by the variance of PDR

Represent the throughput - II End-to-End Packet Success Rate Mean

Variance/covariance

Given that there are Ls paths at source node s, what does these two above mean?

Represent the throughput III

Given that the traffic allocation vector at node s is


Expected throughput: Variance:

Formulate Optimal Solution I Portfolio Selection

Analogy of concepts

http://proteger.com.my/articles/investment/modernportfolio.html

Formulate Optimal Solution I Portfolio Selection (cont)

risk-aversion factor ks
ks = 0 means the throughput is maximized regardless of any risks Ks>0 (0.005 in the simulation)

Formulate Optimal Solution II Congestion Avoidance

Delivery rate from s to node i is

The aggregate traffic going through link (i,j) is

Formulate Optimal Solution III

Iterative and Distributed Solution

Many allocation quadratic program on large-scale networks can be solved efficiently through decomposition techniques Daniel P. Palomar and Mung Chiang, A Tutorial on Decomposition Methods for Network Utility Maximization. Lagrangian dual decomposition

Lagrangian Duality

Decomposition Topology

Decomposition Flow

lagrangian

the dual function could be solved using a gradient method

Apply to this formulation

Local update at step 3 requires mutual information exchanges at all the sources

What can we learn


Way to formulate throughput Way to solve quadratic program distributedly for large-scale networks

Q&A

Thanks!

You might also like