【24h】

All-to-all throughput maximization in wireless relay networks with multiple packet reception

机译:具有多个数据包接收的无线中继网络中的全部到全部吞吐量最大化

获取原文

摘要

Network Coding (NC) has shown the promise of significant throughput improvement to wireless networks. Meanwhile, Multiple Packet Reception (MPR) has been proved as an efficient way to combat the Multiple Access Interference (MAI) problem and to make wireless networks truly scalable. Their outstanding advantages to wireless network performance have attracted considerable research interests. In this paper, we find that the greedy use of MPR may take side effect to NC and degrade the overall network throughput for All-to-All (A2A) communication in two-way relay networks. To fully explore the potential of both MPR and NC, the transmission should be carefully scheduled. The optimal scheduling to achieve the maximum A2A throughput is then formulated as an Integer Programming (IP) problem. A heuristic transmission scheduling algorithm with low computational complexity is also proposed. Simulation results show that our heuristic algorithm performs very closely to the optimal solution obtained by solving the IP problem, and achieves a significantly improved performance over the greedy scheduling that always exhausts the MPR capacity. Furthermore, a non-strict monotonic relationship between the MPR capacity and the maximum A2A throughput has been also discovered from our experimental results.
机译:网络编码(NC)已显示出显着提高无线网络吞吐量的希望。同时,多数据包接收(MPR)已被证明是解决多址干扰(MAI)问题并使无线网络真正可扩展的有效方法。它们在无线网络性能方面的突出优势吸引了相当多的研究兴趣。在本文中,我们发现对MPR的贪婪使用可能会对NC产生副作用,并降低双向中继网络中All-to-All(A2A)通信的整体网络吞吐量。为了充分挖掘MPR和NC的潜力,应仔细安排传输时间。然后将实现最大A2A吞吐量的最佳计划表述为整数编程(IP)问题。还提出了一种计算复杂度低的启发式传输调度算法。仿真结果表明,我们的启发式算法与通过解决IP问题获得的最佳解决方案的性能非常接近,并且在贪婪调度中始终显着提高了性能,而贪婪调度始终耗尽了MPR容量。此外,从我们的实验结果中也发现了MPR容量和最大A2A吞吐量之间的非严格单调关系。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号