首页> 外文学位 >A Time-Efficient Strategy For Relay Selection and Link Scheduling In Wireless Communication Networks.
【24h】

A Time-Efficient Strategy For Relay Selection and Link Scheduling In Wireless Communication Networks.

机译:无线通信网络中中继选择和链路调度的省时策略。

获取原文
获取原文并翻译 | 示例

摘要

Despite the unprecedented success and proliferation of wireless communication, sustainable reliability and stability among wireless users are still considered important issues in the underlying link protocols. Existing link-layer protocols, like ARQ [44] or HARQ [57,67] approaches are designed to achieve this goal by discarding a corrupted packet at the receiver and performing one or more retransmissions until the packet is successfully decoded or a maximum number of retransmission attempts is reached. These strategies suffer from degradation of throughput and overall system instability since packets need to be en/decode in every hop, leading to high burden for relay nodes especially when the traffic load is high. On the other hand, due to the broadcast nature of wireless communication, when a relay transmits a packet to a specific receiver, it could become interference to other receivers. Thus, rather than activating all the relays simultaneously, we can only schedule a subset of relays in each time slot such that the interference among the links will not cause some transmissions to fail. Accordingly, in this dissertation, we mainly address the following two problems: 1) Relay selection: given a route (i.e., a sequence of relays), how to select the relays to en/decode packets to minimize the latency to reach the destination? 2) Link scheduling: how to schedule relays such that the interference among the relays will not cause transmission failure and the throughput is maximized? (Abstract shortened by UMI.).
机译:尽管无线通信取得了空前的成功和迅猛发展,但无线用户之间的可持续可靠性和稳定性仍被视为基础链路协议中的重要问题。现有的链路层协议,例如ARQ [44]或HARQ [57,67]方法,旨在通过在接收器处丢弃损坏的数据包并执行一次或多次重传直到成功解码该数据包或最大数量的数据包来实现此目标。达到重传尝试。由于需要在每一跳中对数据包进行编码/解码,因此这些策略遭受了吞吐量降低和整体系统不稳定的困扰,这给中继节点带来了沉重负担,尤其是在业务负载较高时。另一方面,由于无线通信的广播性质,当中继将数据包发送到特定接收器时,它可能成为对其他接收器的干扰。因此,除了同时激活所有中继之外,我们只能在每个时隙中调度一个中继子集,以使链路之间的干扰不会导致某些传输失败。因此,在本文中,我们主要解决以下两个问题:1)中继选择:给定路由(即,一系列中继),如何选择中继以对分组进行编码/解码以最小化到达目的地的等待时间? 2)链路调度:如何对中继进行调度,以使中继之间的干扰不会导致传输失败并最大化吞吐量? (摘要由UMI缩短。)。

著录项

  • 作者

    Qiu, Chenxi.;

  • 作者单位

    Clemson University.;

  • 授予单位 Clemson University.;
  • 学科 Computer engineering.
  • 学位 Ph.D.
  • 年度 2015
  • 页码 114 p.
  • 总页数 114
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

  • 入库时间 2022-08-17 11:52:17

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号