Abstract

Abstract This article considers the cooperation between base station and relay stations to increase system throughput in time-slotted relaying wireless networks, such as dynamic time division multiple access systems. We focus on optimal throughput scheduling policies for the cooperative relaying at the network layer level. It is shown that the resulting policy for this cooperative protocol obtains the optimal throughput region. Random packet queueing at the relay stations may cause a packet-reordering effect, which may be an obstacle for real-time applications. We alter the design for throughput-optimal scheduling to remove this effect and guarantee a near optimal throughput region.

Highlights

  • Cooperative communications that take advantage of the broadcasting nature of wireless environments have shown excellent performance in both theoretical aspects and implementations, e.g., per-node throughput of the cooperative network is a constant factor while per-node throughput of the conventional wireless network decreases when increasing node density [1]

  • The relay station (RS) overhears all packets transmitted from the base station (BS) to the subordinate mobile station (MS) and retransmits only the packets that could not be decoded at the MS

  • It has been shown that the Backpressure policy [4], which makes scheduling decision basing on difference of queue length between source and destination on each link, is throughput-optimal in multi-hop wireless networks

Read more

Summary

Introduction

Cooperative communications that take advantage of the broadcasting nature of wireless environments have shown excellent performance in both theoretical aspects and implementations, e.g., per-node throughput of the cooperative network is a constant factor while per-node throughput of the conventional wireless network decreases when increasing node density [1]. It has been shown that the Backpressure policy [4], which makes scheduling decision basing on difference of queue length between source and destination on each link, is throughput-optimal in multi-hop wireless networks. To fully exploit the available resource, the unutilized time slots in TDMA scheduling are used by the relay nodes to retransmit the packets to the destination [3] These works use a similar protocol with CPR for cooperation at network layer, the objectives of these studies are different from our research. The seminal studies in [4] have shown that Backpressure scheduling policy, which bases on the difference of queue length between source and destination nodes of links, can achieve the maximum throughput region. This article focuses on finding an optimal scheduling policy for cooperation at network layer

CPR in wireless networks
Throughput region of the CPR protocol
TOSC modeling
Complexity analysis
Performance evaluation
Conclusion
A Proof of Theorem 1
C Proof of Theorem 3 Consider the following Lyaponov function
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call