An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Context-based routing: techniques, applications and experience
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Network coding-aware rate control and scheduling in wireless networks
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Cross-Layer Optimization of MAC and Network Coding in Wireless Queueing Tandem Networks
IEEE Transactions on Information Theory
Optimal gateway selection in multi-domain wireless networks: a potential game perspective
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Multipath Wireless Network Coding: An Augmented Potential Game Perspective
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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 - the network coding advantage is realized only if there is traffic in both directions of a shared path. We develop a twolevel distributed control scheme that decouples user choices from each other by declaring a hyper-link capacity, allowing sources to split their traffic selfishly in a distributed fashion, and then changing the hyper-link capacity based on user actions. We show that such a controller is stable, and verify our analytical insights by simulation.