Multipath Wireless Network Coding: A Population Game Perspective

We consider wireless networks in which multiple paths are available between each source and destination. We allow each source to split traffic among all of its available paths, and ask the question: how do we attain the lowest possible number of transmissions per unit time to support a given traffic matrix? Traffic bound in opposite directions over two wireless hops can utilize the "reverse carpooling" advantage of network coding in order to decrease the number of transmissions used. We call such coded hops as "hyper-links". With the reverse carpooling technique longer paths might be cheaper than shorter ones. However, there is a prisoners dilemma type situation among sources

• Type: Journal
• Year: 2010
• Where: INFOCOM
• Authors: Vinith Reddy, Srinivas Shakkottai, Alexander Sprintson, Natarajan Gautam
• Keywords: Communications, Hyper-link Capacity, INFOCOM 2010, Lowest Possible Number, Reverse Carpooling