Bottleneck throughput maximization for correlated data routing: a game theoretic approach

In this paper, we propose an efficient bottleneck throughput maximizing routing framework for correlated data gathering in wireless sensor networks. Our proposed routing metric exploits the the data correlation present in sensor networks. For throughput-maximizing correlation aware routing, a game theoretic framework is developed for a local solution of the NP-complete optimization problem. The proposed throughput maximization algorithm selects the best routes to increase the bottleneck throughput of each source in the network using best response dynamics. Numerical results corroborates predicted throughput gains.