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

IEEE Global Communications Conference (GLOBECOM) on Advanced Technology for 5G Plus

作者： Mostafa, Salwa Sung, Chi Wan Chant, Terence H. Xu, Guangping City Univ Hong Kong Dept Elect Engn Hong Kong Peoples R China Univ South Australia Inst Telecommun Res Adelaide SA Australia Tianjin Univ Technol Sch Comp & Commun Engn Tianjin Peoples R China

ISBN: (纸本)9781728182988

In fog radio access networks, the limited capacity of the fronthaul link is the bottleneck, which renders a high quality of service for video streaming difficult. To circumvent the problem, popular files can be cached in fog access points during off-peak hours. This work points out that beamforming in the access network can be exploited to reduce fronthaul traffic load by a joint design of cache placement scheme at the fog access points and index-coded transmission scheme over the fronthaul. Simulation results show that a percentage reduction of fronthaul traffic by more than 30% can be achieved.

关键词： cooperative caching index coding beamforming fronthaul traffic

来源：评论

学校读者我要写书评

暂无评论

Network and index coding with Application to Robust and Secure Communications

Network and Index Coding with Application to Robust and Secu...

引用

作者： El Rouayheb, Salim Y. Texas A&M University

Since its introduction in the year 2000 by Ahlswede et al., the network coding paradigm has revolutionized the way we understand information flows in networks. Traditionally, information transmitted in a communication network was treated as a commodity in a transportation network, much like cars on highways or fluids in pipes. This approach, however, fails to capture the very nature of information, which in contrast to material goods, can be coded and decoded. The network coding techniques take full advantage of the inherent properties of information, and allow the nodes in a network, not only to store and forward, but also to "mix", i.e., encode, their received data. This approach was shown to result in a substantial throughput gain over the traditional routing and tree packing techniques. In this dissertation, we study applications of network coding for guarantying reliable and secure information transmission in networks with compromised edges. First, we investigate the construction of robust network codes for achieving network resilience against link failures. We focus on the practical important case of unicast networks with non-uniform edge capacities where a single link can fail at a time. We demonstrate that these networks exhibit unique structural properties when they are minimal, i.e., when they do not contain redundant edges. Based on this structure, we prove that robust linear network codes exist for these networks over GF(2), and devise an efficient algorithm to construct them. Second, we consider the problem of securing a multicast network against an eavesdropper that can intercept the packets on a limited number of network links. We recast this problem as a network generalization of the classical wiretap channel of Type II introduced by Ozarow and Wyner in 1984. In particular, we demonstrate that perfect secrecy can be achieved by using the Ozarow-Wyner scheme of coset coding at the source, on top of the implemented network code. Consequently, we tra

关键词： Network coding index coding Matroid Theory Communications Book Thesis

来源：评论

学校读者我要写书评

暂无评论

Information Leakage in index coding With Sensitive and Nonsensitive Messages

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY

引用

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2022年第4期3卷 803-814页

作者： Liu, Yucheng Ong, Lawrence Sadeghi, Parastoo Johnson, Sarah Kliewer, Joerg Yeoh, Phee Lep Univ Newcastle Sch Engn Callaghan NSW 2308 Australia Dolby Australia Adv Technol Grp McMahons Point NSW 2060 Australia Univ New South Wales Sch Engn & Informat Technol Canberra ACT 2600 Australia New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA Univ Sydney Sch Elect & Informat Engn Sydney NSW 2006 Australia

index coding can be viewed as a compression problem with multiple decoders with side information. In such a setup, an encoder compresses a number of messages into a common codeword such that every decoder can decode its requested messages with the help of knowing some other messages as side information. In this paper, we study how much information is leaked to a guessing adversary observing the codeword in index coding, where some messages in the system are sensitive and others are not. The non-sensitive messages can be used by the encoder in a manner similar to secret keys to mitigate leakage of the sensitive messages to the adversary. We first characterize the optimal information leakage rate of a given index coding problem by the optimal compression rate of a related problem, which is constructed by adding an extra decoder with certain parameters to the original problem. Both the achievability and converse of the characterization are derived from a graph-theoretic perspective based on confusion graphs (Alon et al. 2008). In particular, the achievable coding scheme is a randomized mapping exploiting certain symmetrical properties of the confusion graph. Our second main result is a practical deterministic linear coding scheme, developed from the rank minimization method based on fitting matrices (Bar-Yossef et al. 2011). The linear scheme leads to an upper bound on the optimal leakage rate, which is proved to be tight over all deterministic scalar linear codes. While it is shown through an example that simultaneously achieving optimal compression and leakage rates is not always possible, time-sharing between different schemes could be used to balance the compression and leakage rates. Finally, we show how our results can be applied to different variants of index coding.

关键词： index coding compression guessing information leakage graph theory

来源：评论

学校读者我要写书评

暂无评论

index compression for vector quantization using principal index-pattern coding algorithm

引用

JOURNAL OF ELECTRONIC IMAGING 2014年第4期23卷 43015.1-43015.10页

作者： Liu, Yung-Chih Lee, Gwo-Her Liao, Jan-Ray Chi, Li-Pin Taur, Jinshiuh Natl Chung Hsing Univ Dept Elect Engn Taichung 402 Taiwan Natl Chung Shan Inst Sci & Technol Aeronaut Syst Res Div Taichung 407 Taiwan

This paper presents an efficient lossless compression algorithm, the coding tree assignment scheme with principal index-pattern coding algorithm (CTAS-PIPCA), to encode image vector quantization (VQ). The coding model is designed on the basis of the schemes proposed in the previous works to further improve the coding performance of coding tree assignment scheme with improved search-order coding algorithm (CTAS-ISOC) by PIPCA. The PIPCA technique exploits the correlation of neighboring index pairs not in the original vector-quantized index map but in the principal index-pattern table which is generated from the two-dimensional histogram of index patterns in the training stage. The CTAS-PIPCA method is evaluated via extensive experiments. The searching matched index in the principal index-pattern table results in lower time complexity than CTAS-ISOC. The results also show that the proposed technique apparently reduces the bit rate as compared to the conventional VQ and other existing popular lossless index coding schemes, such as SOC and CTAS-ISOC. (C) 2014 SPIE and IS&T

关键词： vector quantization index coding image compression

来源：评论

学校读者我要写书评

暂无评论

ZInC: index-coding for Many-to-One Communications in ZigBee Sensor Networks

ZInC: Index-Coding for Many-to-One Communications in ZigBee ...

引用

IEEE International Conference on Communications (ICC)

作者： Salhi, Ismail Livolant, Erwan Ghamri-Doudane, Yacine Lohier, Stephane Univ Paris E LIGM Paris France

ISBN: (纸本)9781457720536

The main goal in wireless sensor networking remains the reduction of the network lifecycle and the enhancement of its reliability, keeping decent performances in terms of throughput and latency. Given the increasing interest of the research community on wireless network coding (NC), we think such challenges can be tackled using its innovative concepts, especially in the case of many-to-one communications where network coding has shown promising theoretical results. Yet, without a thoughtful adaptation to WSNs, the benefits of NC for sensor networking prove to be too "greedy" and impractical. In this paper, we propose index-coding, a simple and effective packet coding scheme that enhances significantly many-to-one communications in ZigBee sensor networks. index-coding uses smart bit-shifting operations in order to encode short messages from a set of sensors to a sink using fewer transmissions. Our implementation in a real ZigBee testbed shows substantial enhancement of network performances and resiliency.

关键词： Wireless Sensor Networks ZigBee index coding IEEE 802.15.4 Many-to-One communications

来源：评论

学校读者我要写书评

暂无评论

ZInC: index-coding for Many-to-One Communications in ZigBee Sensor Networks

ZInC: Index-Coding for Many-to-One Communications in ZigBee ...

引用

IEEE International Conference on Communications

作者： Ismail Salhi Erwan Livolant Yacine Ghamri-Doudane Stephane Lohier Universite Paris-Est-Laboratoire d'Informatique Gaspard Monge (LIGM)

ISBN: (纸本)9781457720529

关键词： Wireless Sensor Networks ZigBee index coding IEEE 802.15.4 Many-to-One communications Sensor networks ZigBee Wireless sensor networks Communication Research Interest Research Wireless networks Sensors Network coding Numerical controls Sinks

来源：评论

学校读者我要写书评

暂无评论

Optimal index Code With Rate 4 Over F2

引用

IEEE ACCESS 2025年 13卷 19484-19522页

作者： Neelakandan, Rajesh Kaliyaperumal, Ganesan Vellore Inst Technol Sch Elect Engn Dept Commun Engn Vellore 632014 India Vellore Inst Technol Sch Comp Sci Engn & Informat Syst Dept Software & Syst Engn Vellore 632014 India

High throughput broadcasting systems requires efficient broadcasting that can broadcast the information source symbols with optimal rate (i.e., maximizing the usage of broadcast channel which exploits the broadcast nature of the wireless medium through index coding). index coding is the elegant and beautiful idea, which is used to transform the information source symbols for efficient broadcasting. Efficient broadcasting means minimizing the number of transmissions, which facilitate to achieve high throughput in broadcasting systems is the main goal for index coding. In index coding, determining the optimal rate of an index code for the class of index coding problem is the central open problem. In this paper, we present class IV index coding problems, a new class of index coding problems with the size of maximum acyclic induced subgraph is 4. The main goal of this work is to characterize the optimal rate of class IV index coding problems over finite field with 2 elements ( F-2). We present that optimal linear index code of the class IV index coding problem over F(2)achieves the rate 4 on the broadcast rate. To present this new result, results of index coding network coding duality are used. We also present that there exists index coding problems with size of maximum acyclic induced subgraph is 4 and optimal broadcast rate greater than 4. We use the technique interference alignment using alignment graph and the conflict hyper graph to present this contrast.

关键词： index coding network coding network coding multiple unicast multiple unicast duality duality optimal rate optimal rate optimal rate

来源：评论

学校读者我要写书评

暂无评论

index Coded PSK Modulation in Vehicle to Vehicle Communication

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2021年第5期70卷 4753-4766页

作者： Pachat, Jesy Karat, Nujoom Sageer Mahesh, Anjana A. P. P., Deepthi Rajan, B. Sundar Natl Inst Technol Dept Elect & Commun Engn Calicut 673601 Kerala India Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

Vehicle to vehicle (V2V) communication has gained its importance in recent years. In this work we consider the index coding problem (ICP) over noisy channel in V2V communication phase of message dissemination. The ICP in V2V communication is considered as device to device ICP with transmitting nodes as receiving nodes also. An achievable solution for index coding problem in V2V communication is proposed considering vehicles with same download capability. This solution is used in noisy broadcast scenario over AWGN channel and the broadcast vectors are mapped to suitable M-PSK signal constellations to save bandwidth, thus increasing the bandwidth efficiency. An algorithm is proposed to derive suitable mapping of the broadcast vectors to M-PSK signal constellation for improving the error performance. Performance improvement in terms of PSK index coding gain is discussed. While one vehicle transmits, the proposed algorithm provides performance improvement for at least one of the remaining vehicles, in most of the scenarios, while not penalizing the other vehicles.

关键词： indexes Encoding Receivers Collaboration Noise measurement Vehicular ad hoc networks Phase shift keying index coding Vehicle to vehicle communication Coded modulation

来源：评论

学校读者我要写书评

暂无评论

Improved Converses and Gap Results for Coded Caching

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第11期64卷 7051-7062页

作者： Wang, Chien-Yi Bidokhti, Shirin Saeedi Wigger, Michele Telecom ParisTech LTCI F-75013 Paris France MediaTek Inc Hsinchu 30078 Taiwan Univ Penn Dept Elect & Syst Engn Philadelphia PA 19104 USA

Improved lower bounds are derived on the average and worst case rate-memory tradeoffs of the Maddah-Ali and Niesen-coded caching scenario. For any number of users and files and for arbitrary cache sizes, the multiplicative gap between the exact rate-memory tradeoff and the new lower bound is shown to be less than 2.315 in the worst case scenario and 2.507 in the average-case scenario.

关键词： Caching rate-memory tradeoff source coding index coding

来源：评论

学校读者我要写书评

暂无评论

A Novel Centralized Coded Caching Scheme With Coded Prefetching

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2018年第6期36卷 1165-1175页

作者： Gomez-Vilardebo, Jesus Ctr Tecnol Telecomunicac Catalunya Barcelona 08860 Spain

For the caching problem, when the number of files is no larger than that of users, the best known rate-memory region is achieved by memory sharing between the rate-memory pairs obtained by three schemes: the scheme proposed by Yu et al., the scheme proposed by Gomez-Vilardebo, and the scheme proposed by Tian and Chen. While the first two schemes operate on the binary field, the Tian-Chen scheme makes use of a finite field of order 2(m) with, in some situations, m >= K log(2) (N) for a caching systems with K users and N files. The practical implications of this increase in the size of the field are equivalent to an increase, by a factor of in, in the number of suhfile partitions required. We propose a novel caching scheme that approaches the rate-memory region achieved by the Tian-Chen scheme as the number of users in the system increases, which only requires a field of order 2(2).

关键词： Centralized coded caching network coding index coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：