Skip navigation
Skip navigation

Joint power allocation and relay selection in network-coded multi-unicast systems

Mobini, Zahra; Sadeghi, Parastoo; Zokaei, Saadan

Description

Physical-layer network coding (PNC) promises a significant gain In overall network throughput for multi-user cooperative communications. In a multi-unicast scenario, one drawback associated with PNC is an additional noise term, coined as network coding (NC) noise, which severely degrades the system data rate. In this paper, our contribution to address this challenging problem is source and relay power control with the objective of maximization of the minimum average achievable rate among all...[Show more]

dc.contributor.authorMobini, Zahra
dc.contributor.authorSadeghi, Parastoo
dc.contributor.authorZokaei, Saadan
dc.coverage.spatialParis France
dc.date.accessioned2015-12-10T23:32:39Z
dc.date.createdApril 1-4 2012
dc.identifier.isbn9781467304375
dc.identifier.urihttp://hdl.handle.net/1885/68930
dc.description.abstractPhysical-layer network coding (PNC) promises a significant gain In overall network throughput for multi-user cooperative communications. In a multi-unicast scenario, one drawback associated with PNC is an additional noise term, coined as network coding (NC) noise, which severely degrades the system data rate. In this paper, our contribution to address this challenging problem is source and relay power control with the objective of maximization of the minimum average achievable rate among all the source-destination pairs subject to a given total power constraint. We further develop a joint power allocation and relay selection scheme, which only rely on long-term channel statistics, to extend our results to general network topologies. We show that the joint optimization problem can be divided into two problems: optimal power allocation and optimal relay selection where the former is scalable and leads to a power assignment algorithm that exhibits the same optimization complexity for any number of sources in the network and the latter can be performed in a decentralized manner. By means of simulations, we validate our theoretical developments and verify the efficiency of our algorithm in improving the average achievable rate compared to a multi-unicast system with no power control or relay selection. We conclude that the proposed algorithm largely combats the adverse effects of NC noise while achieving near optimal fairness.
dc.publisherConference Organising Committee
dc.relation.ispartofseriesIEEE Wireless Communications and Networking Conference (WCNC 2012)
dc.sourceIEEE Wireless Communications and Networking Conference, WCNC
dc.subjectKeywords: Adverse effect; Channel statistics; Data rates; General networks; Joint optimization; Joint power; Multi-user; Network throughput; Noise terms; Optimal power allocation; Physical-layer network coding; Power assignment; Relay selection; Source-destination
dc.titleJoint power allocation and relay selection in network-coded multi-unicast systems
dc.typeConference paper
local.description.notesImported from ARIES
local.description.refereedYes
dc.date.issued2012
local.identifier.absfor090609 - Signal Processing
local.identifier.absfor100510 - Wireless Communications
local.identifier.absfor080401 - Coding and Information Theory
local.identifier.ariespublicationf5625xPUB1870
local.type.statusPublished Version
local.contributor.affiliationMobini, Zahra, K.N. Toosi University of Technology
local.contributor.affiliationSadeghi, Parastoo, College of Engineering and Computer Science, ANU
local.contributor.affiliationZokaei, Saadan, K.N. Toosi University of Technology
local.description.embargo2037-12-31
local.bibliographicCitation.startpage1113
local.bibliographicCitation.lastpage1118
local.identifier.doi10.1109/WCNC.2012.6213942
local.identifier.absseo970109 - Expanding Knowledge in Engineering
dc.date.updated2016-02-24T08:51:28Z
local.identifier.scopusID2-s2.0-84864334814
CollectionsANU Research Publications

Download

File Description SizeFormat Image
01_Mobini_Joint_power_allocation_and_2012.pdf574.87 kBAdobe PDF    Request a copy


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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator