Minimum‐costs of multiple unicasts wireless networks with inter‐session network coding. Issue 4 (1st July 2015)

• Record Type: Journal Article
• Authors: Mei, Zhonghui; Yang, Zhen
• Is Part Of: IET networks. Volume 4:Issue 4(2015)
• Page Start: 229
• Page End: 234
• Publication Date: 2015-07-01
• Subjects: cost reduction -- radio networks -- network coding -- data flow analysis -- telecommunication traffic -- game theory -- gradient methods; multiple paths -- project gradient algorithm -- potential game theory -- source traffic splitting -- native flows -- AGNC -- active general network coding -- GNC -- data flows -- total network cost minimization -- intersession network coding traffic -- multiple unicasts wireless networks; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2014.0032
• Languages: English
• ISSNs: 2047-4954

Abstract

Abstract : A multiple unicasts wireless network where multiple paths are available for each unicast is considered. To minimise the total network cost which is defined as the number of transmissions to support the given data flows of the network, general network coding (GNC) and active general network coding (AGNC) are employed. AGNC can exploit more network coding opportunities than GNC by allowing some additional information which is transmitted to recover the native flows from the network coded ones. The overall network cost minimisation problem can be decomposed into two sub‐problems: source traffic splitting which can be resolved by potential game theory and network coding traffic adjusting which can be resolved by project gradient algorithm. Simulation results demonstrate that both of AGNC and GNC outperform the conventional scheme which does not adopt network coding. In addition, Better performance can be achieved by AGNC in contrast with GNC.