Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Adaptive network coding and scheduling for maximizing throughput in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
ER: efficient retransmission scheme for wireless LANs
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Near-optimal co-ordinated coding in wireless multihop networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling with limited information in wireless systems
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Dynamic algorithms for multicast with intra-session network coding
IEEE Transactions on Information Theory
Lower bounds on the maximum energy benefit of network coding for wireless multiple unicast
EURASIP Journal on Wireless Communications and Networking - Special issue on network coding for wireless networks
Optimal transmission scheduling over a fading channel with energy and deadline constraints
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
Energy optimal control for time-varying wireless networks
IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We study the problem of scheduling packets from several flows traversing a given node which can mix packets belonging to different flows. Practical wireless network coding solutions depend on knowledge of overhearing events which is obtained either by acknowledgments or statistically. In the latter case, the knowledge about each packet improves progressively with feedback from the transmissions. We propose a virtual network mechanism in order to characterize the throughput region of such a system for the case where we allow only pairwise XORing. We also provide the policy which achieves the stability region and compare it to simple heuristics. The derived policy is a modification of the standard backpressure policy, designed to take into account the fact that in the proposed virtual network the destination of a transmitted packet is known only probabilistically. We demonstrate simulation results according to which scheduling with statistical information can provide significant throughput benefits even for overhearing probabilities as small as 0.6.