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

INDEX

INTRODUCTION

AIMS AND OBJECTIVES

LITERATURE SURVEY

Problem Statement

PROJECT REQUIREMENT

UML DIAGRAMS

PROPOSED ARCHITECTURE

PROJECT PLAN:

INTRODUCTIONMultiple-path source routing protocols allow a data source node to distribute the total traffic among available paths.The problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes.

AIMS AND OBJECTIVESWe formulate this traffic allocation as a lossy network flow optimization problem using portfolio selection theory from financial statistics. We show that in multi-source networks, this centralized optimization problem can be solved using a distributed algorithm based on decomposition in network utility maximization (NUM).

LITERATURE SURVEYTo distribute the total traffic among available paths the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. If any path to be disturbed/jammed a routing path is requested an existing routing path is not be updated, the responding nodes along the path will disconnect the routing path.

PROBLEM STATEMENTToday, the development and widespread use of information technologies is changing the way people view FIR processes and, ultimately, the way they Report at any police station. At the forefront of these new technologies is Online FIR (First Information Report) System and at the back-end, the server is maintaining the Reports.

san (s) - write points onlyProposed SystemWe propose techniques for the network nodes to estimate and characterize the impact of jamming and for a source node to incorporate these estimates into its traffic allocation. We show that in multi-source networks, this centralized optimization problem can be solved using a distributed algorithm based on decomposition in network utility maximization.

Jamming Behaviors

disturb wireless communications proactive / reactive constant, random, repeat, deceive single bit/packet outsider / insider static / mobile nondeterministic and dynamic

7

Multiple-Path routingAnti-jamming techniques = diversityMultiple frequency bandsDifferent MAC channelsMultiple Routing paths

Multi-Path RoutingEach source node chooses multiple pathsEach path is allocated with different traffic amount (how to avoid congestion?)Each path has different probabilities to be jammed (how to measure this?)

Goal: Efficiently allocate the traffic to maximize the overall throughput.http://w3.antd.nist.gov/adhoc/Project_drouting.shtml

8

Hardware Requirements:Processor: Intel Processor above than 3.0 GhzHard Disk : 20 GB.Ram: 1 GB.

Software Requirements:Operating system : Windows XP SP2 or Higher.NET Framework: 3.5 Or HigherReporting Tool: Crystal Reports XI Or HigherOther Application: Adobe Acrobat Reader, M S Excel.

System Requirements

PROJECT PLANProject planning is discipline for stating how to complete a project within a certain time frame, usually with the define stages and with designated resources. One view of project planning divides the activity into:

Setting objectives (these should be measurable).

Identifying the needs.

Planning the schedule.

Making supportive plans.

Number of pages(GUI etc).

Validations etc..

UML DIAGRAMS

san (s) - review diagramsUML DIAGRAMS

san (s) - review diagramsUML DIAGRAMS

san (s) - review diagramsUML DIAGRAMS

san (s) - review diagramsUML DIAGRAMS

san (s) - review diagramsUML DIAGRAMS

san (s) - review diagramsAdvantagesEach time a new routing path is requested or an existing routing path is updated, the responding nodes along the path will relay the necessary parameters to the source node as part of the reply message for the routing path.Efficiently allocate the traffic to maximize the overall throughput.

REFERENCESF. Akyildiz, X. Wang, and W. Wang, Wireless mesh networks: Asurvey, Comput. Netw., vol. 47, no. 4, pp. 445487 E. M. Sozer, M. Stojanovic, and J. G. Proakis, Underwater acoustic networks, IEEE J. Ocean. Eng., vol. 25, no. 1, pp. 7283 [3] R. Anderson, Security Engineering: A Guide to Building Dependable Distributed Systems. New York: Wiley

ANY QUERIES..??

Mathematical Model

22

RoadmapUse PDR to approximate the overall throughputWhat is PDR? How to get PDR? Use a quadratic program based on Portfolio Selection Theory to give the optimal solutionObjective Function? Constraints?Use Lagrangian dual decomposition to get a distributed solutionEfficiency: accuracy, convergence, scalability.

23

Represent the throughput - IEstimate local packet success rates (LPSR)Each node updates (LPSR), Update period T 0 (0.005 in the simulation)

28

Formulate Optimal Solution IICongestion AvoidanceDelivery rate from s to node i is

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

29

Formulate Optimal Solution - III

30

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

31

Lagrangian Duality

32

Decomposition Topology

33

Decomposition Flow

decouple(c)

lagrangian

dual function the dual function could be solved using a gradient method

34

Apply to this formulation

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

35

Future EnhancementAn ERP can be developed with this algorithm as illustration of impact of jamming dynamics and mobility on network throughput and to demonstrate the efficacy of our traffic allocation algorithm.

Collaboration Diagram