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

IEEE Statistical Signal Processing Workshop (SSP)

作者： Nabaee, Mandy Labeau, Fabrice McGill Univ Dept Elect & Comp Engn Montreal PQ Canada

ISBN: (纸本)9781467301831

In this paper, we study the data gathering problem in the context of power grids by using a network of sensors, where the sensed data have inter-node redundancy. Specifically, we propose a new transmission method, called quantized network coding, which performs linear network coding in the infinite field of real numbers, and quantization to accommodate the finite capacity of edges. By using the concepts in compressed sensing literature, we propose to use l(1)-minimization to decode the quantized network coded packets, especially when the number of received packets at the decoder is less than the size of sensed data (i.e. number of nodes). We also propose an appropriate design for network coding coefficients, based on restricted isometry property, which results in robust l(1)-min decoding. Our numerical analysis show that the proposed quantized network coding scheme with l(1)-min decoding can achieve significant improvements, in terms of compression ratio and delivery delay, compared to conventional packet forwarding.

关键词： Compressed sensing linear network coding restricted isometry property l(1)-min decoding

来源：评论

学校读者我要写书评

暂无评论

Rotate-and-Add coding: A Novel Algebraic network coding Scheme

Rotate-and-Add Coding: A Novel Algebraic Network Coding Sche...

引用

IEEE Information Theory Workshop (ITW)

作者： Keshavarz-Haddad, Alireza Khojastepour, Mohammad A. (Amir) Shiraz Univ Sch Elect & Comp Engn Zand Ave Shiraz Iran NEC Labs America Princeton NJ 08540 USA

ISBN: (纸本)9781424482641

In this paper we introduce a novel linear network coding scheme, namely "rotate-and-add coding", that possesses low encoding complexity and operates fundamentally different from the traditional network codes. This scheme can operate on a small field (e.g. F-2), thereby, it alleviates the computational complexities due to multiplication and addition operations in large finite fields. The key idea is to function on a vector of symbols instead of working with a single symbol of a large field. Each node encodes its received vectors by simply rotationally shifting the vectors and then adding them, i.e., here the addition is done in vector form and the multiplication is replaced by rotation. We verify that the new scheme requires lower computation and overhead than the existing schemes. However, as the cost of reducing the complexity, it provides slightly smaller throughput.

关键词： algebraic codes algebraic network coding linear codes linear network coding network coding rotate-and-add coding vectors vectors

来源：评论

学校读者我要写书评

暂无评论

network coding /

引用

2012年

作者： edited by Khaldoun Al Agha.

来源：内蒙古大学图书馆图书评论

学校读者我要写书评

暂无评论

Restricted Isometry Property in Quantized network coding of Sparse Messages

Restricted Isometry Property in Quantized Network Coding of ...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Nabaee, Mahdy Labeau, Fabrice McGill Univ Elect & Comp Engn Dept Montreal PQ Canada

ISBN: (纸本)9781467309219;9781467309202

In this paper, we study joint network coding and distributed source coding of inter-node dependent messages, with the perspective of compressed sensing. Specifically, the theoretical guarantees for robust l(1)-min recovery of an under-determined set of linear network coded sparse messages are investigated. We discuss the guarantees for l(1)-min decoding of quantized network coded messages, based on Restricted Isometry Property (RIP) of the resulting measurement matrix. This is done by deriving the relation between tail probability of l(2)-norms and satisfaction of RIP. The obtained relation is then used to compare our designed measurement matrix, with i.i.d. Gaussian measurement matrix, in terms of RIP satisfaction. Finally, we present our numerical evaluations, which shows that the proposed design of network coding coefficients results in a measurement matrix with an RIP behavior, similar to that of i.i.d. Gaussian matrix.

关键词： Compressed sensing linear network coding restricted isometry property l(1)-min decoding Gaussian ensembles

来源：评论

学校读者我要写书评

暂无评论

Initialization Of Convolutional network coding For Unknown networks

Initialization Of Convolutional Network Coding For Unknown N...

引用

International Symposium on network coding (NetCod)

作者： Lvov, Maxim Permuter, Haim H. Ben Gurion Univ Negev IL-84105 Beer Sheva Israel

ISBN: (纸本)9781479962174

We present algorithms for initializing networks that use a convolutional network coding scheme and that may contain cycles. During the initialization process every source node transmits basis vectors and every sink node measures the impulse response of the network. The impulse response is then used to find a relation between the transmitted and the received symbols, which is needed for a decoding algorithm and to find the set of all achievable rates. An initialization process is needed if the network is unknown or if local encoding kernels are chosen randomly. Unlike acyclic networks, for which it is enough to transmit basis vectors one after another, the initialization of cyclic networks is more complicated, as pilot symbols interfere with each other and the impulse response is of infinite duration.

关键词： linear network coding cyclic networks convolutional network coding system identification

来源：评论

学校读者我要写书评

暂无评论

On the optimal flow allocation and information theoretically secure network coding design for multiple multicasts

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2018年第6期31卷

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

With linear network coding (LNC), the data packets transmitted in a communication network are coded packets, which are linear combinations of original data packets. Since the coded packets can be useful for multiple destinations in multicast, LNC has been shown as a promising technology to improve the network throughput. On the other hand, the original data packets can be encoded with random symbols and transmitted in the network to make sure that a passive attacker cannot obtain the information of these original data packets when the passive attacker cannot obtain enough coded packets. Therefore, LNC also provides secure transmission without using the traditional encryption and decryption. In this paper, we will study an Information Theoretically Secure Multiple Multicasts (ITSMM) problem with the following objectives: (1) maximizing the secure transmission rate (STR), (2) minimizing the random symbol rate (RSR), and (3) minimizing the bandwidth cost (BC), when the data transmission is information theoretically secure. We firstly theoretically analyze the ITSMM problem, which shows that it is equivalent to a problem of network flow with constraints on each intermediate node. We then formulate the ITSMM problem by 3 linear programmings to get the maximum STR, the minimum RSR, and the minimum BC. After that, we prove the sufficient condition for the size of finite field over which the information theoretically secure linear multicast code (ITSLMC) can be designed. At last, we give extensive simulations, which show that the proposed algorithms are effective and efficient.

关键词： flow allocation information theoretically secure multicast linear network coding transmission rate

来源：评论

学校读者我要写书评

暂无评论

Output Forms of Packets in a Multicast Session Using network coding With R Flow

引用

IEEE ACCESS 2019年 7卷 152064-152075页

作者： Marquez, Jose D. Salcedo, Carolina A. Univ Norte Syst & Comp Engn Dept Barranquilla 081007 Colombia

A one-session multicast network, on which a coding scheme with network coding is defined, was implemented with a maximum common flow of $r$ -packets arriving simultaneously at $\vert T\vert $ sink nodes. Determining how to order the $r$ -packets that emerge from the source node $s$ through their output $n$ -links, constitutes a combinatorial problem. In this work, the set of all the possible output configurations is constructed, where each configuration is a vector of packets tags of length equal to $n$ . Each tag has a length equal to $r$ . Through a combinatorial algorithm on the set of possible output configurations, a path is carried out on the graph representing the one-session multicast network. The path is based on a topological ordering of the multicast graph that allowed us finding all possible ways to order the output of the $r$ -packets from $s$ to the sink nodes in $T$ . An ordering configuration based on network coding is valid, if the coding of packets is achieved through a linear combination in the coding nodes and the decoding of packets in the sink nodes. This validation verifies, then, a one-session multicast solution. The proposal of this work is independent of the network topology, the maximum flow value, and the size of the packets.

关键词： Encoding Routing network coding Multicast algorithms Decoding Galois fields Proposals Combinatorial algorithm linear network coding maximum flow network coding solution one-session multicast network

来源：评论

学校读者我要写书评

暂无评论

Packet Output and Input Configuration in a Multicasting Session Using network coding

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2019年第2期13卷 686-710页

作者： Marquez, Jose Gutierrez, Ismael Valle, Sebastian Falco, Melanis Univ Norte Syst & Comp Dept Km 5 Puerto Colombia Highway Barranquilla Colombia Univ Norte Math Dept Km 5 Puerto Colombia Highway Barranquilla Colombia

This work proposes a model to solve the problem of network coding over a one-session multicast network. The model is based on a system of restrictions that defines the packet flows received in the sink nodes as functions of the outgoing flows from the source node. A multicast network graph is used to derive a directed labeled line graph (DLLG). The successive powers of the DLLG adjacency matrix to the convergence in the null matrix permits the construction of the jump matrix Source-Sinks. In its reduced form, this shows the dependency of the incoming flows in the sink nodes as a function of the outgoing flows in the source node. The emerging packets for each outgoing link from the source node are marked with a tag that is a linear combination of variables that corresponds to powers of two. Restrictions are built based on the dependence of the outgoing and incoming flows and the packet tags as variables. The linear independence of the incoming flows to the sink nodes is mandatory. The method is novel because the solution is independent of the Galois field size where the packet contents are defined.

关键词： Multicast network linear network coding linear Constraint System network coding Solution Directed Labeled Line Graph

来源：评论

学校读者我要写书评

暂无评论

NetCoDer: A Retransmission Mechanism for WSNs Based on Cooperative Relays and network coding

引用

SENSORS 2016年第6期16卷 799-799页

作者： Valle, Odilson T. Montez, Carlos de Araujo, Gustavo Medeiros Vasques, Francisco Moraes, Ricardo IFSC Fed Inst Santa Catarina BR-88130310 Sao Jose Brazil UFSC Fed Univ Santa Catarina Dept Automat & Syst BR-88040900 Florianopolis SC Brazil UFSC Fed Univ Santa Catarina Dept Comp BR-88905120 Ararangua Brazil Univ Porto INEGI Fac Engn P-4200465 Oporto Portugal

Some of the most difficult problems to deal with when using Wireless Sensor networks (WSNs) are related to the unreliable nature of communication channels. In this context, the use of cooperative diversity techniques and the application of network coding concepts may be promising solutions to improve the communication reliability. In this paper, we propose the NetCoDer scheme to address this problem. Its design is based on merging cooperative diversity techniques and network coding concepts. We evaluate the effectiveness of the NetCoDer scheme through both an experimental setup with real WSN nodes and a simulation assessment, comparing NetCoDer performance against state-of-the-art TDMA-based (Time Division Multiple Access) retransmission techniques: BlockACK, Master/Slave and Redundant TDMA. The obtained results highlight that the proposed NetCoDer scheme clearly improves the network performance when compared with other retransmission techniques.

关键词： wireless sensor networks network coding linear network coding reliability retransmission techniques cooperative communication

来源：评论

学校读者我要写书评

暂无评论

A Numerical Study on the Wiretap network With a Simple network Topology

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第5期62卷 2481-2492页

作者： Cheng, Fan Tan, Vincent Y. F. Natl Univ Singapore Dept Elect & Comp Engn Singapore 117583 Singapore Natl Univ Singapore Dept Elect & Comp Engn Singapore 119077 Singapore Natl Univ Singapore Dept Math Singapore 119077 Singapore

In this paper, we study a security problem on a simple wiretap network, consisting of a source node S, a destination node D, and an intermediate node R. The intermediate node connects the source and the destination nodes via a set of noiseless parallel channels, with sizes n(1) and n(2), respectively. A message M is to be sent from S to D. The information in the network may be eavesdropped by a set of wiretappers. The wiretappers cannot communicate with one another. Each wiretapper can access a subset of channels, called a wiretap set. All the chosen wiretap sets form a wiretap pattern. A random key K is generated at S, and a coding scheme on (M, K) is employed to protect M. We define two decoding classes at D. In Class-I, only M is required to be recovered, and in Class-II, both M and K are required to be recovered. The objective is to minimize H(K)/H(M) for a given wiretap pattern under the perfect secrecy constraint. The first question we address is whether routing is optimal on this simple network. By enumerating all the wiretap patterns on the Class-I/II (3, 3) networks and harnessing the power of Shannon-type inequalities, we find that gaps exist between the bounds implied by routing and the bounds implied by Shannon-type inequalities for a small fraction (<2%) of all the wiretap patterns. The second question we investigate is the following: What is minimize H(K)/H(M) for the remaining wiretap patterns where gaps exist? We study some simple wiretap patterns and find that their Shannon bounds (i.e., the lower bound induced by Shannon-type inequalities) can be achieved by linear codes, which means routing is not sufficient even for the (3, 3) network. For some complicated wiretap patterns, we study the structures of linear coding schemes under the assumption that they can achieve the corresponding Shannon bounds. This paper indicates that the determination of the entropic region of six linear vector spaces cannot be sidestepped. Some subtle issues on the network

关键词： network coding linear network coding entropic region cut-set bound routing bound Shannon bound wiretap network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：