Papers
Topics
Authors
Recent
Search
2000 character limit reached

Throughput Improvement and Its Tradeoff with The Queuing Delay in the Diamond Relay Networks

Published 10 Jul 2009 in cs.IT and math.IT | (0907.1737v1)

Abstract: Diamond relay channel model, as a basic transmission model, has recently been attracting considerable attention in wireless Ad Hoc networks. Node cooperation and opportunistic scheduling scheme are two important techniques to improve the performance in wireless scenarios. In the paper we consider such a problem how to efficiently combine opportunistic scheduling and cooperative modes in the Rayleigh fading scenarios. To do so, we first compare the throughput of SRP (Spatial Reused Pattern) and AFP (Amplify Forwarding Pattern) in the half-duplex case with the assumption that channel side information is known to all and then come up with a new scheduling scheme. It will that that only switching between SRP and AFP simply does little help to obtain an expected improvement because SRP is always superior to AFP on average due to its efficient spatial reuse. To improve the throughput further, we put forward a new processing strategy in which buffers are employed at both relays in SRP mode. By efficiently utilizing the links with relatively higher gains, the throughput can be greatly improved at a cost of queuing delay. Furthermore, we shall quantitatively evaluate the queuing delay and the tradeoff between the throughput and the additional queuing delay. Finally, to realize our developed strategy and make sure it always run at stable status, we present two criteria and an algorithm on the selection and adjustment of the switching thresholds.

Citations (7)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.