首页> 外文OA文献 >Topology-Transparent Scheduling in Mobile Ad Hoc Networks Supporting Heterogeneous Quality of Service Guarantees
【2h】

Topology-Transparent Scheduling in Mobile Ad Hoc Networks Supporting Heterogeneous Quality of Service Guarantees

机译:支持异构服务质量保证的移动ad Hoc网络中的拓扑透明调度

摘要

Transmission scheduling plays a critical role in mobile ad hoc networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length. Most algorithms require information on the network topology and cannot adapt to the dynamic topology in mobile scenarios. To overcome this limitation, topology-transparent scheduling algorithms have been proposed. Most of them, based on Galois field theory, Latin square, and block design theory, assign time slots to users and guarantee that there is at least one collision-free slot in each frame for each user. To the best of our knowledge, none of these topology-transparent algorithms support multiple quality of service (QoS) requirements. In this paper, we exploit the variable-weight optical orthogonal codes (VW-OOC) to design a topology-transparent scheduling algorithm in wireless ad hoc networks with multiple QoS levels. We study the performance, in terms of minimum guaranteed throughput and average throughput, of our proposed algorithm analytically and by extensive simulations.
机译:传输调度在移动自组织网络中起着至关重要的作用。已经提出了许多传输调度算法以最大化空间复用并最小化时分多址(TDMA)帧长度。大多数算法需要有关网络拓扑的信息,并且无法适应移动方案中的动态拓扑。为了克服该限制,提出了拓扑透明的调度算法。它们中的大多数根据Galois场论,拉丁方和块设计理论为用户分配时隙,并确保每个用户在每个帧中至少有一个无冲突的时隙。据我们所知,这些透明拓扑算法均不支持多种服务质量(QoS)要求。在本文中,我们利用可变权重光学正交码(VW-OOC)设计具有多个QoS级别的无线ad hoc网络中的拓扑透明调度算法。我们通过分析和广泛的仿真研究了我们提出的算法的最低保证吞吐量和平均吞吐量方面的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号