Please use this identifier to cite or link to this item: https://doi.org/10.1109/WCNC.2013.6554621
Title: Energy optimization for stable two-way relaying with a multi-access uplink
Authors: Chen, Z.
Lim, T.J. 
Motani, M. 
Keywords: energy efficiency
multi-access
network coding
queue stability
Two-way relays
Issue Date: 2013
Source: Chen, Z.,Lim, T.J.,Motani, M. (2013). Energy optimization for stable two-way relaying with a multi-access uplink. IEEE Wireless Communications and Networking Conference, WCNC : 539-544. ScholarBank@NUS Repository. https://doi.org/10.1109/WCNC.2013.6554621
Abstract: In this paper, we consider a three-node, two-way relay system with digital network coding over static channels. For a given pair of random packet arrival rates, we aim to minimize total energy consumption while ensuring queue stability at all nodes. A set of transmission modes is considered and we solve for the optimal fraction of resources allocated to each mode, including a multi-access uplink transmission mode and a network coded broadcasting mode. For the downlink, we further consider whether it is more energy-efficient, to superimpose the excess bits of the larger message for one user with the network coded message for both users. We formulate and solve the corresponding optimization problem, deriving conditions under which it is better to use superposition coding. Finally, we present a detailed analysis of the queues at each node using a random scheduling method that closely approximates the theoretical design, through a Markov chain model. © 2013 IEEE.
Source Title: IEEE Wireless Communications and Networking Conference, WCNC
URI: http://scholarbank.nus.edu.sg/handle/10635/70171
ISBN: 9781467359399
ISSN: 15253511
DOI: 10.1109/WCNC.2013.6554621
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Dec 13, 2017

Page view(s)

20
checked on Dec 16, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.