Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. In this article, we consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We 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). We demonstrate the network’s ability to estimate the impact of jamming and incorporate these estimates into the traffic allocation problem. Finally, we simulate the achievable throughput using our proposed traffic allocation method in several scenarios.
Patrick Tague, Sidharth Nabar, James Ritcey and Radha Poovendran. "Jamming-Aware Traffic Allocation for Multiple-Path Routing Using Portfolio Selection" IEEE/ACM Transactions on Networking
Vol. 19 Iss. 1 (2011)
Available at: http://works.bepress.com/patrick_tague/5/