Description

This Paper consider the problem of jamming aware source routing. Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths.Here source node perform traffic allocation based on jamming statistics at individual network nodes.Formulate this traffic using Portfolio Selection Theory. Formulate the problem of allocating traffic across multiple routing paths in the presence of jamming as a lossy network flow optimization problem.Formulate the centralized traffic allocation problem for multiple source nodes as a convex optimization problem.Multisource multiple-path optimal traffic allocation can be computed at the source nodes using a distributed algorithm based on decomposition in NUM.Propose methods that allow individual network nodes to locally characterize the jamming impact and aggregate this information for the source nodes. Demonstrate that the use of portfolio selection theory allows the data sources to balance the expected data throughput with the uncertainty in achievable traffic rate.In multisource network, distributed algorithm is used to solve centralized optimization problem based on Network utility maximization.When jamming occur while transferring the packets that will be stored.Before Sending the packets , analyze the route.if any jamming occurred already.In existing , Route having any jamming it will be send through another route.Here,achievable throughput using our proposed traffic allocation method in several scenarios.