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

IEEE 75th Vehicular Technology Conference (VTC Spring)

作者： Xi, Hongkun Wang, Xiaoxiang Zhao, Yuan Zhang, Hongtao Beijing Univ Posts & Telecommun Minist Educ Key Lab Universal Wireless Commun Beijing 100876 Peoples R China

ISBN: (纸本)9781467309905;9781467309882

Recently, XOR-based network coding has been demonstrated as an effective approach to improve the network performance for wireless broadcast. In this way, the source XOR multiple lost packets from different receivers into one packet and retransmits it, then multiple receivers are able to recover their lost packets, which can effectively reduce the number of retransmissions and utilize wireless bandwidth. However, to find the optimal XOR coding set that minimizes the total number of transmissions has been proved as NP-hard and of high complexity. In this paper, we proposed a new wireless broadcast retransmission scheme based on linear random network coding, in which the source code combines all lost packets to a single one by linear network coding for retransmission, and receivers are able to decode the original packets by method of Gaussian elimination when they receive enough coded-packets. Simulation results are given to demonstrate superior performance of our algorithm over previously proposed works.

关键词： wireless broadcasting retransmission linear network coding network coding

来源：评论

学校读者我要写书评

暂无评论

Multicast triangular semilattice network

引用

Involve 2019年第8期12卷 1307-1328页

作者： Grosso, Angelina Manganiello, Felice Varal, Shiwani Zhu, Emily Division of Applied Mathematics Brown University Providence RI United States School of Mathematical and Statistical Sciences Clemson University Clemson SC United States Faculty of Business Law and Politics University of Hull Hull United Kingdom Department of Mathematics University of California at San Diego La Jolla CA United States

We investigate the structure of the code graph of a multicast network that has a characteristic shape of an inverted equilateral triangle. We provide a criterion that determines the validity of a receiver placement within the code graph, present invariance properties of the determinants corresponding to receiver placements under symmetries, and provide a complete study of these networks’ receivers and required field sizes up to a network of four sources. We also improve on various definitions related to code graphs. © 2019 Mathematical Sciences Publishers.

关键词： code graph determinantal condition finite field linear network coding multicast communication multicast network multivariate polynomial triangular semilattice

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal network coding of physiological mossy fiber inputs by the cerebellar granular layer

引用

PLOS COMPUTATIONAL BIOLOGY 2017年第9期13卷 e1005754-e1005754页

作者： Sudhakar, Shyam Kumar Hong, Sungho Raikov, Ivan Publio, Rodrigo Lang, Claus Close, Thomas Guo, Daqing Negrello, Mario De Schutter, Erik Okinawa Inst Sci & Technol Computat Neurosci Unit Onna Son Okinawa Japan Univ Antwerp Lab Theoret Neurobiol & Neuroengn Antwerp Belgium Univ Michigan Dept Psychol Ann Arbor MI USA Bernstein Ctr Computat Neurosci Berlin Berlin Germany Erasmus MC Dept Neurosci Rotterdam Netherlands

The granular layer, which mainly consists of granule and Golgi cells, is the first stage of the cerebellar cortex and processes spatiotemporal information transmitted by mossy fiber inputs with a wide variety of firing patterns. To study its dynamics at multiple time scales in response to inputs approximating real spatiotemporal patterns, we constructed a largescale 3D network model of the granular layer. Patterned mossy fiber activity induces rhythmic Golgi cell activity that is synchronized by shared parallel fiber input and by gap junctions. This leads to long distance synchrony of Golgi cells along the transverse axis, powerfully regulating granule cell firing by imposing inhibition during a specific time window. The essential network mechanisms, including tunable Golgi cell oscillations, on-beam inhibition and NMDA receptors causing first winner keeps winning of granule cells, illustrate how fundamental properties of the granule layer operate in tandem to produce (1) well timed and spatially bound output, (2) a wide dynamic range of granule cell firing and (3) transient and coherent gating oscillations. These results substantially enrich our understanding of granule cell layer processing, which seems to promote spatial group selection of granule cell activity as a function of timing of mossy fiber input.

关键词： SPATIOTEMPORAL processes linear network coding GOLGI apparatus GRANULE cells CEREBELLAR cortex

来源：评论

学校读者我要写书评

暂无评论

A Reliable Broadcast Transmission Approach Based on Random linear network coding

A Reliable Broadcast Transmission Approach Based on Random L...

引用

IEEE Vehicular Technology Conference

作者： Hongkun Xi Xiaoxiang Wang Yuan Zhao Hongtao Zhang Key Laboratory of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications 100876 Beijing P.R.China

ISBN: (纸本)9781467309899

关键词： wireless broadcasting retransmission linear network coding network coding linear networks RETRANSMISSION network coding Packet Source code Transmission of broadcasts wireless Multiple Receiver Gaussian elimination Receivers exclusive OR Nondeterministic polynomial-time hard

来源：评论

学校读者我要写书评

暂无评论

Weakly Secure Coded Distributed Computing 4

Weakly Secure Coded Distributed Computing

引用

IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI)

作者： Zhao, Ruimin Wang, Jin Lu, Kejie Wang, Jianping Wang, Xiumin Zhou, Jingya Cao, Chunming Soochow Univ Dept Comp Sci & Technol Suzhou Peoples R China Univ Puerto Rico Dept Elect & Comp Engn Mayaguez PR USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China South China Univ Technol Sch Comp Sci & Engn Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538693803

In recent years, edge computing has become a hot topic because it can significantly reduce the latency of network services by utilizing the computation resources at the edge of the network. To further improve the latency performance, several coded distributed computing (CDC) schemes have been proposed, in which computation and communication resources can be used to trade off the delay. To design CDC scheme, data shuffling among computing nodes has been studied but the security issue in data shuffling has not been fully investigated. Therefore, in this paper, we investigate secure data shuffling in edge computing. Specifically, we first formulate a weakly secure edge computing problem, namely, the secure coded distributed computing (SCDC) problem. We then theoretically analyze the existence of weakly secure data shuffling. Based on the analysis, we propose a redundancy reduction (RR) algorithm to assign computing tasks to distributed nodes to minimize the latency with security guarantee, where we prove the correctness of the algorithm and the reduction ratio when RR is compared to existing CDC schemes. Finally, we conduct extensive simulation experiments that confirm the efficiency of the proposed RR scheme.

关键词： edge computing linear network coding weakly secure computation redundancy data shuffling

来源：评论

学校读者我要写书评

暂无评论

Optimal Cache Management and Routing for Secure Content Delivery in Information-Centric networks with network coding 15

Optimal Cache Management and Routing for Secure Content Deli...

引用

15th IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA) / 16th IEEE International Conference on Ubiquitous Computing and Communications (IUCC)

作者： Ding, Weiwei Wang, Jin Lu, Kejie Zhao, Ruimin Wang, Xiumin Zhu, Yanqin Soochow Univ Dept Comp Sci & Technol Suzhou Peoples R China Shanghai Key Lab Intelligent Informat Proc Shanghai Peoples R China Univ Puerto Rico Dept Elect & Comp Engn Mayaguez PR USA South China Univ Technol Sch Comp Sci & Engn Guangzhou Guangdong Peoples R China

ISBN: (纸本)9781538637906

Information-Centric network (ICN) is one of the most promising network architecture to handle the problem of rapid increase of data traffic because it allows in-network cache. ICNs with linear network coding (LNC) can greatly improve the performance of content caching and delivery. In this paper, we propose a Secure Content Caching and Routing (SCCR) framework based on Software Defined network (SDN) to find the optimal cache management and routing for secure content delivery, which aims to firstly minimize the total cost of cache and bandwidth consumption and then minimize the usage of random chunks to guarantee information theoretical security (ITS). Specifically, we firstly propose the SCCR problem and then introduce the main ideas of the SCCR framework. Next, we formulate the SCCR problem to two linear Programming (LP) formulations and design the SCCR algorithm based on them to optimally solve the SCCR problem. Finally, extensive simulations are conducted to evaluate the proposed SCCR framework and algorithms.

关键词： infiirmation-centric network linear network coding security cache management routing

来源：评论

学校读者我要写书评

暂无评论

The Average Failure Probabilities of Random linear network coding

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2011年第10期E94A卷 1991-2001页

作者： Guang, Xuan Fu, Fang-Wei Nankai Univ Chem Inst Math Tianjin 300071 Peoples R China Nankai Univ LPMC Tianjin 300071 Peoples R China

In network coding, for the case that the network topology is unknown completely, random linear network coding has been proposed as an acceptable coding technique. In this paper, we define average failure probability of random linear network coding in order to characterize the performance of random network coding, and then analyze this failure probability for different known topological information of network. We obtain several upper bounds on the failure probabilities, and further show that, for some networks, these upper bounds are tight or asymptotically tight. Moreover, if the more topological information of the network is utilized, the better upper bounds are acquired.

关键词： network coding linear network coding random network coding performance analysis average failure probability upper bounds

来源：评论

学校读者我要写书评

暂无评论

Capacity Region of Two-User Interference network With Permission to Utilize Past Receptions

引用

IEEE ACCESS 2017年 5卷 11927-11940页

作者： Pan, Hao Li, Jiandong Wang, Kan Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Shaanxi Peoples R China Xian Univ Technol Fac Comp Sci & Engn Xian 710048 Shaanxi Peoples R China

With the delayed channel state information at transmitters, an effective interference management approach, realized in the packet interference network and with a specific physical layer model (i.e., destinations have the flexibility to utilize past receptions), began to emerge. Meanwhile, the capacity region of this packet interference network can provide best interference management approach. Thus, in this paper, we concentrate on the capacity region of the two-user interference network with the past reception based physical layer model. To this end, we first derive the capacity outer bound, by exhibiting that the bound for the binary fading interference channel is exactly the desired one for the packet interference network. We then examine its linear network coding (LNC) capacity, by exploiting a linear-space-based approach, which unifies the problem of finding a capacity outer bound and devising the achievability scheme into a single linear programming problem. Finally, by analyzing the properties of linear spaces of coding vectors and some pure algebraic arguments, we prove that the LNC capacity region matches the derived outer bound, implying that the derived LNC capacity region is indeed the true capacity of the studied network.

关键词： Capacity region interference networks packet collision delayed channel state knowledge physical layer network coding linear network coding

来源：评论

学校读者我要写书评

暂无评论

ACHIEVABLE RATE REGIONS IN MULTIPLE-ANTENNA networkS WITH linear network coding

ACHIEVABLE RATE REGIONS IN MULTIPLE-ANTENNA NETWORKS WITH LI...

引用

12th IEEE International Workshop on Signal Processing Advances in Wireless Communications

作者： Richter, Johannes Wolf, Anne Jorswieck, Eduard A. Tech Univ Dresden Dept Elect Engn & Informat Technol Commun Lab Dresden Germany

ISBN: (纸本)9781424493326

In this paper, the combination of linear network coding over a finite field and beamforming for a multiple-antenna network is studied. Assuming a multicast transmission scheme and a decode-and-forward protocol, optimal beamforming strategies for the network nodes are derived for a certain class of interference networks. An efficient algorithm is presented to calculate the achievable rate region of these networks. The sum power for the transmission of the multicast information is minimized under rate requirements. The proposed approach is illustrated by one important scenario.

关键词： Multiple-antenna network multicast transmission beamforming optimization linear network coding achievable rate region sum power minimization

来源：评论

学校读者我要写书评

暂无评论

On BATS Codes With Variable Batch Sizes

引用

IEEE COMMUNICATIONS LETTERS 2017年第9期21卷 1917-1920页

作者： Zhou, Qiaoqiao Yang, Shenghao Yin, Hoover H. F. Tang, Bin Chinese Univ Hong Kong Inst Network Coding Shatin Hong Kong Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518172 Peoples R China Nanjing Univ Natl Key Lab Novel Software Technol Nanjing 210023 Jiangsu Peoples R China

BATS codes are a class of low complexity random linear network codes with high throughput. In a previous work, BATS codes were generalized to incorporate batches of different sizes, and a sufficient condition was obtained such that the belief propagation decoding can recover a given fraction of the input packets with high probability. In this letter, by investigating an optimization problem induced by the sufficient condition, we derive a condition such that it is optimal to use a constant batch size. This condition gives us a guideline for designing practical network protocol based on BATS codes. Moreover, we prove that this condition is always satisfied in line networks.

关键词： linear network coding BATS codes batch size line networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：