Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
A high-throughput path metric for multi-hop wireless routing
Proceedings of the 9th annual international conference on Mobile computing and networking
Complexity classification of network information flow problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Convex Optimization
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Multipath code casting for wireless mesh networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Cross-layer optimization for wireless multihop networks with pairwise intersession network coding
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Optimized multipath network coding in lossy wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Toward practical opportunistic routing with intra-session network coding for mesh networks
IEEE/ACM Transactions on Networking (TON)
Pruning network coding traffic by network coding: a new class of max-flow algorithms
IEEE Transactions on Information Theory
CCACK: efficient network coding based opportunistic routing through cumulative coded acknowledgments
INFOCOM'10 Proceedings of the 29th conference on Information communications
Cross-layer optimizations for intersession network coding on practical 2-hop relay networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
The κ factor: inferring protocol performance using inter-link reception correlation
Proceedings of the sixteenth annual international conference on Mobile computing and networking
Codecast: a network-coding-based ad hoc multicast protocol
IEEE Wireless Communications
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
Insufficiency of linear coding in network information flow
IEEE Transactions on Information Theory
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
Network planning in wireless ad hoc networks: a cross-Layer approach
IEEE Journal on Selected Areas in Communications
Distributed utility maximization for network coding based multicasting: a shortest path approach
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper, we tackle the network coding-based opportunistic routing problem for multicast. We present the factors that affect the performance of the multicast protocols. Then, we formulate the problem as an optimization problem. Using the duality approach, we show that a distributed solution can be used to achieve the optimal solution. The distributed solution consists of two phases. In the first phase, the most reliable broadcasting tree is formed based on the ETX metric. In the second phase, a credit assignment algorithm is run at each node to determine the number of coded packets that the node has to send. The distributed algorithm adapts to the changes in the channel conditions and does not require explicit knowledge of the properties of the network. To reduce the number of feedback messages, and to resolve the problem of delayed feedback, we also perform network coding on the feedback messages. We evaluate our algorithm using simulations which show that in some realistic cases the throughput achieved by our algorithm can be double or triple that of the state-of-the-art.