Stability of bi-directional cooperative relay networks

Ciftcioglu, Ertugrul Necdet; Yener, Aylin; Berry, Randall A.

doi:10.1109/itw.2008.4578639

Cited by 8 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In fact, it is also seen that the hop-by-hop policy exceeds the maximum attainable utility (the OICC) achieved with immediate forwarding. Hence, similar to our results regarding stability regions [7], deploying queues at relay nodes also improves QoI utility via opportunistic scheduling. We also observe that the extent of improvement by hop-by-hop scheduling increases with greater variations in the channel states.…”

Section: Numerical Resultssupporting

confidence: 86%

“…In Hop-by-Hop Scheduling (HHS), relay nodes possess buffers and in each slot only one of the two transmission phases is scheduled for transmission [7]. That is, either the source node transmits to the relay (a phase I transmission) or the relay forward previously received information to the destination (a phase II transmission) in a time slot.…”

Section: A Transmission Policies 1) Hop-by-hop Schedulingmentioning

confidence: 99%

“…In [7], we have demonstrated that deploying queues at relay nodes significantly improves stability regions for stochastic traffic and time-varying channels. The underlying reason was that queueing at the relay(s) allows for opportunistically exploiting the channel variations.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Quality-of-information aware transmission policies with time-varying links

Ciftcioglu

Yener

2011

2011 - MILCOM 2011 Military Communications Conference

Self Cite

View full text Add to dashboard Cite

Abstract-We consider Quality-of-Information (QoI) aware transmission policies in the presence of time-varying links in a mobile ad hoc network. QoI, tailored for military tactical networks, is defined by a set of attributes relevant to the application. Time-varying nature of links in practical networks leads to uncertainty in evaluating QoI utility to be delivered to end users. This delivered-QoI utility is a function of both attributes provided by the source input, as a result of observing certain events, and the channel induced attributes that impact the QoI obtained at the destination. The goal of this paper is to attain the maximum QoI output utility, termed as Operational Information Content Capacity (OICC) of a network. First, for a single link, we demonstrate that the optimal decision structure for transmission is threshold-based. Next, we consider multihop relay networks. For the basic model of a two-hop relay network, we propose transmission scheduling and link activation schemes based on approximate dynamic programming methods. Furthermore, we exploit time-variations of links by opportunistic scheduling by employing buffers at the relay node. We demonstrate that significant gains in QoI output utility are gained by opportunistic scheduling algorithms.

show abstract

Section: Numerical Resultssupporting

confidence: 86%

Section: A Transmission Policies 1) Hop-by-hop Schedulingmentioning

confidence: 99%

See 1 more Smart Citation

Quality-of-information aware transmission policies with time-varying links

Ciftcioglu

Yener

2011

2011 - MILCOM 2011 Military Communications Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…Backpressure algorithms have been formulated for intra-session NC of packets from the same source [24] and for the special case of pairwise NC of unicast flows [25], [26]. The queue stability with multi-source NC has been studied for other network models, including exchange channels with one relay [27] or two relays [28], line networks [6], and butterfly network structures [29].…”

mentioning

confidence: 99%

Throughput and Stability for Relay-Assisted Wireless Broadcast with Network Coding

Sagduyu

Berry

Guo

2013

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-The throughput and stability properties of wireless network coding are evaluated for an arbitrary number of terminals exchanging broadcast traffic with the aid of a relay. First, coding and scheduling schemes are derived that minimize the number of transmissions needed for each node to broadcast one packet. For stochastically varying traffic, the stable throughput is then compared under both digital and analog network coding schemes. The initial analysis focuses on a network with a single relay. Extensions to arbitrary terminal-relay configurations are then outlined for a general multihop network. Backpressure-like algorithms for jointly achieving throughput optimal scheduling and network coding are given for each network coding scheme.

show abstract

“…There have been a number of works studying the interaction of network coding with stochastically varying traffic in both two-way relay networks [9]- [11] and other network topologies [12]- [14]. In all these works, the main focus is on queue stability and the maximum stable throughput without considering transmission costs.…”

mentioning

confidence: 99%

Cost-Delay Tradeoffs for Two-Way Relay Networks

Ciftcioglu

Sagduyu

Berry

et al. 2011

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

Abstract-We consider two sources in a wireless network exchanging stochastically varying traffic using an intermediate relay. Each relay use incurs some cost, which, for example, could be transmission energy. This cost is shared between the sources when packets from both are transmitted simultaneously by the relay using network coding. If the relay transmits a packet originating from one source only, the cost is incurred by that source only. In this setting, we study transmission policies that tradeoff the average cost with the average packet delay. We first present the cost-delay tradeoff for a centralized scheme using Lyapunov stability arguments. Next, we consider a distributed policy, where each source aims to optimize its own cost-delay tradeoff. We determine the Nash equilibrium of the resulting non-cooperative game and show that it performs worse than the centralized algorithm. To overcome this limitation, we introduce a pricing mechanism at the relay, which is shown to achieve the centralized performance. These algorithms, though oblivious to the arrival statistics, do require global knowledge of queue backlogs. Lastly, we consider distributed algorithms that overcome this requirement. Among those, we observe that simple queue-length threshold algorithms perform remarkably well.

show abstract

Stability of bi-directional cooperative relay networks

Cited by 8 publications

References 12 publications

Quality-of-information aware transmission policies with time-varying links

Quality-of-information aware transmission policies with time-varying links

Throughput and Stability for Relay-Assisted Wireless Broadcast with Network Coding

Cost-Delay Tradeoffs for Two-Way Relay Networks

Contact Info

Product

Resources

About