检索结果-内蒙古大学图书馆

89th IEEE Vehicular Technology Conference (VTC Spring)

作者： Chatzigeorgiou, Ioannis Kurt, Gunes Basaran, Semiha Tedik Khan, Amjad Saeed Univ Lancaster Sch Comp & Commun Lancaster LA1 4WA England Istanbul Tech Univ Dept Elect & Commun Engn TR-34469 Istanbul Turkey Loughborough Univ Sch Mech Elect & Mfg Engn Loughborough LE11 3TU Leics England

ISBN: (纸本)9781728112176

This paper considers a network of source nodes that transmit data packets to a destination node via relay nodes over erasure channels by using random linear network coding. The probability that the destination node will fail to recover the packets of all source nodes has been bounded and approximated in the literature for the case of relay nodes that randomly assign only nonzero values to the coefficients of linear combinations of data packets. The paper argues for the necessity of giving relay nodes the choice to also assign the zero value to coefficients when arithmetic operations are over finite fields of small size, e.g. GF(2). Alternative probability mass functions for the coefficients are considered, and expressions for the decoding failure probability are re-derived.

关键词： Cooperative communication decoding probability random linear network coding random matrices

来源：评论

学校读者我要写书评

暂无评论

decoding probability in Random Linear Network Coding with Packet Losses

引用

IEEE COMMUNICATIONS LETTERS 2013年第11期17卷 2128-2131页

作者： Chiasserini, Carla-Fabiana Viterbo, Emanuele Casetti, Claudio Politecn Torino Turin Italy Monash Univ ECSE Clayton Vic 3800 Australia

We focus on a network where n sources send data to k destinations, through m >= n relay nodes employing random linear network coding. The coefficients used to encode the data packets are extracted from a Galois field of size q. Unlike previous work, we consider that the relay nodes may not receive some packets due to link failures. This implies that a destination may be unable to successfully decode the received data packets due to both missing packets at the relays and linearly dependent coefficient vectors. In this scenario, we compute the exact probability of successful decoding at a destination node and we show the impact of the system parameters on the performance. In particular, our study highlights the fact that the network coding scheme behaves as an erasure correcting code, whose erasure correcting capability is determined by the number of available relays.

关键词： Linear random network coding random matrices decoding probability

来源：评论

学校读者我要写书评

暂无评论

Maximizing throughput in RLNC-based multi-source multi-relay with guaranteed decoding

引用

DIGITAL SIGNAL PROCESSING 2021年 117卷 103164-103164页

作者： Benamira, Elias Merazka, Fatiha USTHB Univ Elect & Comp Engn Fac Dept Telecommun LISIC Lab Algiers 16111 Algeria

In this paper, an efficient and practical solution to cope with random linear network coding (RLNC) drawbacks and maximize the system throughput is proposed. No header overheads and no retransmissions are required as a result of the introduction of a unique codebook at the nodes in charge of RLNC coding and decoding. The codebook contains the seeds that allow for the pseudo-random generation of fullrank matrices of network coding elements over the finite Galois field GF(q), where q is the field size, for N generations. Each relay generates the same matrix and uses its corresponding row of N coding GF(q) coefficients. The destination, whose seeds codebook is synchronized on the same index value, generates the same full-rank matrix to decode the source nodes packets. Results show that the number of successfully transmitted packets is not generally affected by the choice of the generation size or the underlying finite field, which demonstrates the outperformance of the proposed technique over the traditional RLNC procedure. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Multi-source multi-relay Random linear network coding Seeds codebook Throughput decoding probability

来源：评论

学校读者我要写书评

暂无评论

Network-Coded NOMA With Antenna Selection for the Support of Two Heterogeneous Groups of Users

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2019年第2期18卷 1332-1345页

作者： Khan, Amjad Saeed Chatzigeorgiou, Ioannis Lambotharan, Sangarapillai Zheng, Gan Loughborough Univ Wolfson Sch Mech Elect & Mfg Engn Loughborough LE11 3TU Leics England Univ Lancaster Sch Comp & Commun Lancaster LA1 4WA England

The combination of non-orthogonal multiple access (NOMA) and transmit antenna selection (TAS) techniques has recently attracted significant attention due to the low cost, low complexity, and high diversity gains. Meanwhile, random linear coding (RLC) is considered to be a promising technique for achieving high reliability and low latency in multicast communications. In this paper, we consider a downlink system with a multi-antenna base station and two multicast groups of single-antenna users, where one group can afford to be served opportunistically, while the other group consists of comparatively low-power devices with limited processing capabilities that have strict quality of service (QoS) requirements. In order to boost reliability and satisfy the QoS requirements of the multicast groups, we propose a cross-layer framework, including NOMA-based TAS at the physical layer and RLC at the application layer. In particular, two low-complexity TAS protocols for NOMA are studied in order to exploit the diversity gain and meet the QoS requirements. In addition, RLC analysis aims to facilitate heterogeneous users, such that sliding window-based sparse RLC is employed for computational restricted users, and conventional RLC is considered for others. Theoretical expressions that characterize the performance of the proposed framework are derived and verified through simulation results.

关键词： Antenna selection non-orthogonal multiple access network coding random block matrices outage probability decoding probability throughput

来源：评论

学校读者我要写书评

暂无评论

Notes on "Exact decoding probability Under Random Linear Network Coding"

引用

IEEE COMMUNICATIONS LETTERS 2012年第5期16卷 720-721页

作者： Zhao, Xubo Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China China Univ Petr Coll Sci Qingdao Peoples R China

In a recent letter, Trullols-Cruces et al. derived the exact decoding probability P-ns(K, N) that a receiver node obtained N linearly independent coded packets among K (K >= N) received coded packets, when the source node uses a random linear coding scheme over a Galois Field GF(q). They discussed P-ns(K, N) both in the case of the source node sending the random linear combination of the original packets, including all-zero combinations, as well as the case of excluding all-zero combinations. However, their derivations are a bit complicated. In this note, we demonstrate simple derivations of the exact decoding probability P-ns(K, N) in both cases. Furthermore, we point out that there is a more succinct expression of P-ns(K, N) for the latter case.

关键词： Random linear coding wireless networks decoding probability

来源：评论

学校读者我要写书评

暂无评论

Fulcrum: Flexible Network Coding for Heterogeneous Devices

引用

IEEE ACCESS 2018年 6卷 77890-77910页

作者： Lucani, Daniel E. Pedersen, Morten Videbaek Ruano, Diego Sorensen, Chres W. Fitzek, Frank H. P. Heide, Janus Geil, Olav Nguyen, Vu Reisslein, Martin Aarhus Univ DIGIT Ctr Dept Engn DK-8200 Aarhus Denmark Steinwurf ApS DK-9220 Aalborg Denmark Univ Valladolid Math Res Inst IMUVA E-47011 Valladolid Spain Aalborg Univ Dept Math Sci DK-9200 Aalborg Denmark Chocolate Cloud ApS DK-9220 Aalborg Denmark Tech Univ Dresden Deutsch Telekom Chair Commun Networks 5G Lab Germany D-01069 Dresden Germany Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA

We introduce Fulcrum, a network coding framework that achieves three seemingly conflicting objectives: 1) to reduce the coding coefficient overhead down to nearly n bits per packet in a generation of n packets;2) to conduct the network coding using only Galois field GF (2) operations at intermediate nodes if necessary, dramatically reducing computing complexity in the network;and 3) to deliver an end-to-end performance that is close to that of a high-field network coding system for high-end receivers, while simultaneously catering to low-end receivers that decode in GF (2). As a consequence of 1) and 3), Fulcrum has a unique trait missing so far in the network coding literature: providing the network with the flexibility to distribute computational complexity over different devices depending on their current load, network conditions, or energy constraints. At the core of our framework lies the idea of precoding at the sources using an expansion field GF(2(h));h > 1, to increase the number of dimensions seen by the network. Fulcrum can use any high-field linear code for precoding, e.g., Reed-Solomon or Random Linear Network Coding (RLNC). Our analysis shows that the number of additional dimensions created during precoding controls the trade-off between delay, overhead, and computing complexity. Our implementation and measurements show that Fulcrum achieves similar decoding probabilities as high field RLNC but with encoders and decoders that are an order of magnitude faster.

关键词： decoding probability random linear network coding (RLNC) resource-constrained devices throughput

来源：评论

学校读者我要写书评

暂无评论

Hierarchical secret image sharing scheme in compressed sensing

引用

SIGNAL PROCESSING-IMAGE COMMUNICATION 2018年 61卷 21-32页

作者： Bhattacharjee, Tapasi Maity, Santi P. Islam, Sheikh Rafiul Indian Inst Engn Sci & Technol Dept Informat Technol PO Bot Garden Sibpur 711103 Howrah India

Secret image sharing (SIS) is a technique of protecting the secret images from an unauthorized access through the generation of few shares or shadow images and serves various purposes such as multi-party computation, threshold cryptography, access control etc. Some of these applications demand hierarchical access based SIS scheme with flexible shadow size adaptive to the available transmission bandwidth. To this aim, share/shadow image generation (with reduced size) is considered here as a sparse signal (secret) reconstruction problem as is done in compressed sensing or compressive sampling (CS). A prediction error (PE) matrix is formed for the secret image which then undergoes sub-sampling followed by its partitioning into two sets of shares: one mandatory share (MS) and 'n' number of general shares (GSs) thus form an integrated framework of CS and Shamir's (k, n) threshold secret sharing scheme. The contribution of the MS and at least 'k' number of GSs are essential to reconstruct the secret image. The change in the number of CS measurements leads to the flexibility in share size adaptive to transmission bandwidth and offers a progressive quality access control along with relative changes in unauthorized decoding probability. A large set of simulation results show the average decoding quality of the secret images with PSNR values of 31.4 dB and 35.7 dB for 10% and 30% measurements, respectively. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Secret image sharing Prediction error Compressed sensing Access control Kullback-Leibler divergence decoding probability

来源：评论

学校读者我要写书评

暂无评论

Packet Dropping and decoding Statistics for Linear Network Coded Broadcast with Feedback 43

Packet Dropping and Decoding Statistics for Linear Network C...

引用

43rd IEEE Conference on Local Computer Networks (LCN)

作者： Giri, Sovanjyoti Roy, Rajarshi Indian Inst Technol Kharagpur W Bengal India

ISBN: (纸本)9781538650974

Exploitation of the benefit of feedback in network coded multicast or broadcast is a well-investigated technique, whose purpose is to make the system more robust to loss. In such scenario, the drop when seen algorithm reduces the expected queue length at sender while maintaining throughput optimality of encoding scheme. In this work, we study a broadcasting system where the transmitter is sending data packets of a generation, using drop when seen strategy, to a set of receivers of finite buffer length over packet erasure channels with full feedback. We develop an n-dimensional Markov chain-based model that enables us to compute the probability of dropping a packet (which is currently being transmitted) from sender queue at the end of a particular time slot. Further, by proposing the idea of first time dropping, we map the n-dimensional dynamics to a simple one-dimensional model. This simplified framework is used to find expected time to drop a packet from the sender queue. It also provides an opportunity to study decoding statistics of stored packets in receivers' buffer. We analyze three different decoding options namely, arbitrary single receiver decoding, leader decoding, worst follower decoding, and compare them.

关键词： Broadcast decoding probability Drop when seen Dropping probability Network coding Sender queue

来源：评论

学校读者我要写书评

暂无评论

Non-Orthogonal Multiple Access Combined With Random Linear Network Coded Cooperation

引用

IEEE SIGNAL PROCESSING LETTERS 2017年第9期24卷 1298-1302页

作者： Khan, Amjad Saeed Chatzigeorgiou, Ioannis Univ Lancaster Sch Comp & Communcat Lancaster LA1 4WA England

This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed, whereby packets at the relay nodes are combined using two methods;packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using random linear network coding. An analytical framework that characterizes the performance of the proposed scheme is developed, compared to simulation results, and benchmarked against a counterpart scheme that is based on orthogonal multiple access.

关键词： decoding probability network coding nonorthogonal multiple access (NOMA) sparse random matrices throughput

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Random Linear Network Coding in Two-Source Single-Relay Networks

Performance Analysis of Random Linear Network Coding in Two-...

引用

IEEE International Conference on Communications (ICC)

作者： Khan, Amjad Saeed Chatzigeorgiou, Ioannis Univ Lancaster Sch Comp & Commun Lancaster LA1 4YW England

ISBN: (纸本)9781467363051

This paper considers the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node, over packet erasure channels. Intra-session network coding is used at the source nodes and inter-session network coding is employed at the relay node to combine the recovered source packets of both source nodes. In this work, we investigate the performance of the network-coded system in terms of the probability that the destination node will successfully recover the source packets of the two source nodes. We build our analysis on fundamental probability expressions for random matrices over finite fields and we derive upper bounds on the system performance for the case of systematic and non-systematic network coding. Simulation results show that the upper bounds are very tight and accurately predict the decoding probability at the destination node. Our analysis also exposes the clear benefits of systematic network coding at the source nodes compared to non-systematic transmission.

关键词： Network coding fountain coding multiple access relay channel decoding probability block angular matrix

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：