Efficient routing for correlated data in wireless sensor networks

In this paper, we propose an efficient routing solution for correlated data collection in wireless sensor networks. Our proposed routing metric considers both the interference distribution as well as the data correlation when establishing routes. An iterative, distributed solution based on local information is proposed using a game theoretic framework. Routes are chosen to minimize both the interference impact of nodes in their neighborhood and the joint entropy of multiple sources relayed through common nodes.