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

Impact of Neuronal Properties on network coding: Roles of Spike Initiation Dynamics and Robust Synchrony Transfer

NEURON 2013年第5期78卷 758-772页

作者： Ratte, Stephanie Hong, Sungho De Schutter, Erik Prescott, Steven A. Univ Toronto Hosp Sick Children Toronto ON M5G 1X8 Canada Univ Toronto Dept Physiol Toronto ON M5G 1X8 Canada Okinawa Inst Sci & Technol Computat Neurosci Unit Okinawa 9040495 Japan

Neural networks are more than the sum of their parts, but the properties of those parts are nonetheless important. For instance, neuronal properties affect the degree to which neurons receiving common input will spike synchronously, and whether that synchrony will propagate through the network. Stimulus-evoked synchrony can help or hinder network coding depending on the type of code. In this Perspective, we describe how spike initiation dynamics influence neuronal input-output properties, how those properties affect synchronization, and how synchronization affects network coding. We propose that synchronous and asynchronous spiking can be used to multiplex temporal (synchrony) and rate coding and discuss how pyramidal neurons would be well suited for that task.

关键词： NEURAL networks (Neurobiology) ROBUST control NEURAL physiology PYRAMIDAL tract linear network coding NEURAL stimulation

来源：评论

学校读者我要写书评

暂无评论

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 Novel Energy-Efficient Reception Method Based on Random network coding in Cooperative Wireless Sensor networks

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR networkS 2015年第6期2015卷 13-13页

作者： Cheng, Yulun Yang, Longxiang Nanjing Univ Posts & Telecommun Jiangsu Key Lab Wireless Commun Nanjing 210003 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Key Lab Broadband Wireless Commun & Sensor Networ Minist Educ Nanjing 210003 Jiangsu Peoples R China

This paper presents an opportunistic reception (OR) algorithm for energy-efficient transmission in cooperative wireless sensor networks (WSNs), where the characteristics of random linear network coding and the energy consumption property of WSNs are jointly considered. In OR, the sensor nodes in intermediate cluster generate the independent coding vector through simple forwarding or decoding-recoding manners opportunistically, so that the number of received packets can be reduced. To evaluate the algorithm, we derive the average number of received packets, the transmitting nodes, and decoding failure probability under specific assumption. The obtained theoretical and simulation results verify the effectiveness offered by the proposed approach.

关键词： WIRELESS sensor networks linear network coding ENERGY consumption ALGORITHMS DATA packets & packeting COMPUTER simulation

来源：评论

学校读者我要写书评

暂无评论

Improved Data Transmission Scheme of network coding Based on Access Point Optimization in VANET

引用

JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING 2014年第1期2014卷 1-5页

作者： Yang, Zhe Li, Lingzhi Yao, Wenqiang Xu, Kaisheng Tang, Dongxin Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Peoples R China Soochow Univ Prov Key Lab Comp Informat Proc Technol Suzhou 215006 Peoples R China

VANET is a hot spot of intelligent transportation researches. For vehicle users, the file sharing and content distribution through roadside access points (AP) as well as the vehicular ad hoc networks (VANET) have been an important complement to that cellular network. So the AP deployment is one of the key issues to improve the communication performance of VANET. In this paper, an access point optimization method is proposed based on particle swarm optimization algorithm. The transmission performances of the routing protocol with random linear network coding before and after the access point optimization are analyzed. The simulation results show the optimization model greatly affects the VANET transmission performances based on network coding, and it can enhance the delivery rate by 25% and 14% and reduce the average delay of transmission by 38% and 33%.

关键词： VEHICULAR ad hoc networks (Computer networks) linear network coding DATA transmission systems PARTICLE swarm optimization ALGORITHMS network performance (Telecommunication)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Precoding-Based network Alignment Using Transform Approach for Acyclic networks With Delay

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第10期60卷 6276-6302页

作者： Bavirisetti, Teja Damodaram Ganesan, Abhinav Prasad, Krishnan Rajan, B. Sundar Cambridge Silicon Radio Bangalore 560103 Karnataka India Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China Int Inst Informat Technol Hyderabad 500032 Andhra Pradesh India Indian Inst Sci Dept Elect Commun Engn Bangalore 560012 Karnataka India

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3

关键词： Acyclic network delays interference linear network coding network alignment transform approach

来源：评论

学校读者我要写书评

暂无评论

The Capacity Region of Two-Receiver Multiple-Input Broadcast Packet Erasure Channels With Channel Output Feedback

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第9期60卷 5597-5626页

作者： Wang, Chih-Chun Han, Jaemin Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47906 USA

This paper studies the capacity of the two-receiver multiple-input broadcast packet erasure channels (PECs) with channel output feedback, which is in contrast with the single-input setting of the existing works. Motivated by the immense success of linear network coding (LNC) in theory and in practice, this paper first focuses on LNC schemes and characterizes the LNC feedback capacity region of two-receiver multiple-input broadcast PECs. A new linear-space-based approach is proposed, which unifies the problems of finding a capacity outer bound and devising the achievability scheme into a single linear programming problem. In particular, an LP solver is used to exhaustively search for the LNC scheme(s) with the best possible throughput, the result of which is thus guaranteed to attain the LNC feedback capacity. It is then proven by pure algebraic arguments that the LNC capacity region matches a simple capacity region outer bound, which proves that the derived LNC capacity region is indeed the true capacity. A byproduct of the above results is a complete LNC capacity region characterization for two-receiver partially Markovian and partially controllable broadcast PECs.

关键词： Broadcast capacity broadcast channels channel output feedback linear network coding multiple-input/multiple-output (MIMO) channels packet erasure channels

来源：评论

学校读者我要写书评

暂无评论

On decoding of DVR-based linear network codes

引用

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING 2015年第6期26卷 527-542页

作者： Sun, Qifu Tyler Li, Shuo-Yen Robert Univ Sci & Technol Beijing Sch Comp & Commun Engn Beijing 100083 Peoples R China Univ Elect Sci & Technol China Chengdu 610054 Peoples R China

The conventional theory of linear network coding (LNC) is only over acyclic networks. Convolutional network coding (CNC) applies to all networks. It is also a form of LNC, but the linearity is w.r.t. the ring of rational power series rather than the field of data symbols. CNC has been generalized to LNC w.r.t. any discrete valuation ring (DVR) in order for flexibility in applications. For a causal DVR-based code, all possible source-generated messages form a free module, while incoming coding vectors to a receiver span the received submodule. An existing time-invariant decoding algorithm is at a delay equal to the largest valuation among all invariant factors of the received submodule. This intrinsic algebraic attribute is herein proved to be the optimal decoding delay. Meanwhile, time-variant decoding is formulated. The meaning of time-invariant decoding delay gets a new interpretation through being a special case of the time-variant counterpart. The optimal delay turns out to be the same for time-variant decoding, but the decoding algorithm is more flexible in terms of decodability check and decoding matrix design. All results apply, in particular, to CNC.

关键词： linear network coding Discrete valuation ring Cyclic networks Decoding delay Time-variant decoding

来源：评论

学校读者我要写书评

暂无评论

Uplink outage performance of linear cellular networks with non-uniform user distribution

引用

ELECTRONICS LETTERS 2014年第23期50卷 1772-1773页

作者： Khan, A. Fanaei, M. Jamalipour, A. Univ Sydney Sydney NSW 2006 Australia W Virginia Univ Morgantown WV 26506 USA

The Wyner model has been extensively used in the literature for analysing cellular networks. Recent studies show that when compared with a grid-based model, this simple model fails to capture key features of a cellular network under different scenarios. Without increasing complexity, a linear network model which uses an average user distance and considers a non-uniform user distribution scenario within cells is proposed. Simulation results show that despite the simplicity, the proposed model can provide a close insight when compared with a grid-based model.

关键词： Simulation methods & models Telecommunication systems linear network coding Cellular neural networks (Computer science) Cellular mappings (Mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：