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

第17届工业工程与工程管理国际学术会议(IE&EM2010)

作者： Shuo-Yen Robert Li Department of Information Engineering and Institute of Network Coding The Chinese University of Hong Kong

network coding is a new paradigm in data transport and promises to change many aspects of *** paper briefly reviews the basic concept,fundamental theorem,and applications to optimization of linear network *** optimize... 详细信息

关键词： network coding Optimizatin Butterfly network linear network coding Avalanche network Tomography network Security

来源：评论

学校读者我要写书评

暂无评论

Loss-Aware linear network coding for Wireless networks

Loss-Aware Linear Network Coding for Wireless Networks

引用

第三十届中国控制会议

作者： TAN Xiaobin,QIN Guihong,CHENG Wenfei Automation Department,University of Science and Technology of China,Hefei 230027,Anhui,P.R.China

Recently,there has been a growing interest in employing network coding to improve the performance of wireless *** authors adopt XOR network coding methods,*** and BEND in multi-hop wireless networks,which can increases the network throughput obviously in loss-free or light lossy *** we argue that in heavily lossy wireless environments,a better use of network coding is to provide higher *** of XOR network coding,we adopt linear coding method to adapt the lossy wireless *** this paper,we present a detailed exploration of the linear network coding and propose our linear coding algorithms that can lead to higher throughput gains in wireless scenarios,and we employ double-decoding method to decode the transmitted *** means of accurate analysis,rigorous simulations,and detailed implementation on a simulation platform,the simulation result demonstrates that our algorithms can obtain higher throughput gain in lossy wireless networks.

关键词： linear network coding Loss-Aware Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Optimal Transmission Topology Construction and Secure linear network coding Design for Multicast with Integral Link Rates

Optimal Transmission Topology Construction and Secure Linear...

引用

IEEE International Conference on High Performance Computing and Communications

作者： Ruimin Zhao Jin Wang Kejie Lu Xiangmao Chang Lingzhi Li Yanqin Zhu Department of Computer Science and Technology Soochow University Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez School of Computing Science and Technology Nanjing University of Aeronautics and Astronautics

ISBN: (纸本)9781509042982

linear network coding (LNC) is a promising technology that can increase network throughput, improve transmission robustness and provide data confidentiality. In this paper, we investigate the optimal transmission topology construction and LNC design for secure multicast, i.e., the Integer Secure Multicast (ISM) problem. The ISM problem aims to find the transmission topology with integral link rates and design the secure LNC to (1) meet the requirements of weak security, (2) achieve the maximum secure transmission rate (STR) and (3) minimize transmission cost (TC) under the maximum STR guarantee. Specifically, in this paper, we firstly give theoretical analysis to show a sufficient and necessary condition that there exists a transmission topology with integral link rates and a secure LNC with STR R. Based on the sufficient and necessary condition, we then formulate the ISM problem into an integer linear programming (ILP) and also design an efficient transmission topology construction (TTC) algorithm to obtain a near-optimal solution of the problem. Based on Lagrangian relaxation and subgradient algorithm, the TTC algorithm is designed within polynomial computational complexity. Finally, we evaluate the performance of the proposed TTC algorithm together with a lower bound and an upper bound of the ISM problem through extensive experiments. Simulation results validate the effectiveness of the proposed TTC algorithm.

关键词： integral rate linear network coding multicast weakly secure throughput

来源：评论

学校读者我要写书评

暂无评论

A Joint linear-Analog network coding Based Protocol for Data Transfer in Underwater Acoustic networks

A Joint Linear-Analog Network Coding Based Protocol for Data...

引用

OCEANS MTS/IEEE Conference

作者： Zhao, Xiaobo Shen, Xiaohong Wang, Haiyan Bai, Weigang Zhao, Ruiqin Northwest Polytech Univ Sch Marine Sci & Technol Xian 710072 Peoples R China

ISBN: (纸本)9780933957435

In underwater acoustic networks, the objective that researchers are pursuing is establishing a network with high reliability, high throughput and low energy consumption. network coding can enhance reliability and throughput of network. Moreover, the throughput of network will be significantly improved by analog network coding. Accordingly, with higher reliability and higher throughput, the energy consumption will be lower. In this paper, the linear network coding and analog network coding are combined creatively. Besides, a SNR estimation algorithm is used to choose packets instead of choosing packets randomly for decoding. Afterwards, for taking advantage of the redundant packets better, packets are refreshed via bit-by-bit comparison. At last, we present nmuerical experiments to evaluate the performance of this scheme.

关键词： underwater acoustic networks linear network coding analog network coding transport protocol

来源：评论

学校读者我要写书评

暂无评论

A Joint linear-Analog network coding Based Protocol for Data Transfer in Underwater Acoustic networks

A Joint Linear-Analog Network Coding Based Protocol for Data...

引用

Oceans MTS/IEEE Washington (Conference)

作者： Xiaobo Zhao Xiaohong Shen Haiyan Wang Weigang Bai Ruiqin Zhao School of Marine Science and Technology Northwest Polytechnical University

ISBN: (纸本)9781467393744

In underwater acoustic networks, the objective that researchers are pursuing is establishing a network with high reliability, high throughput and low energy consumption. network coding can enhance reliability and throughput of network. Moreover, the throughput of network will be significantly improved by analog network coding. Accordingly, with higher reliability and higher throughput, the energy consumption will be lower. In this paper, the linear network coding and analog network coding are combined creatively. Besides, a SNR estimation algorithm is used to choose packets instead of choosing packets randomly for decoding. Afterwards, for taking advantage of the redundant packets better, packets are refreshed via bit-by-bit comparison. At last, we present numerical experiments to evaluate the performance of this scheme.

关键词： Underwater acoustic networks linear network coding Analog network coding Transport protocol

来源：评论

学校读者我要写书评

暂无评论

Optimized Reception Sensitivity of WBAN Sensors Exploiting network coding and Modulation Techniques in an Advanced NB-IoT

引用

IEEE ACCESS 2022年 10卷 35784-35794页

作者： Ar-Reyouchi, El Miloud Ghoumid, Kamal Yahiaoui, Reda Elmazria, Omar ETS Dept Telecommun & Comp Sci Madrid 28014 Spain Mohammed First Univ ENSAO Dept Elect Informat & Telecommun Oujda 60000 Morocco Franche Comte Univ NanoMed Lab Imagery Therapeut F-25000 Besancon France Univ Lorraine Inst Jean Lamour CNRS F-54000 Nancy France

The sensitivity of the maximum useable data is the most significant characteristic that describes the quality of the Narrowband Internet of Things (NB-IoT) of Medical sensors (MS) receivers. It becomes the most important performance factor in mobile wireless communication networks, particularly wireless body area networks (WBAN). Our interest is in level sensitivity using modulation techniques and subcarrier spacing(SS) to achieve good Bit Error Rate (BER) performance, throughput, and power efficiencies for WBAN communication Systems in an advanced NB-IoT. We propose an efficient coding technique using linear network coding (LNC) to improve sensitivity by considering several factors without affecting the human body. We also present an experimentally analyzed overview of the reception sensibility. Our research has revealed that the receiver sensitivity (minimum detectable signal level) and throughput of the proposed approach (PA) are much better than the conventional approach (CA), achieving more than 14.3% and 55%, respectively, compared to the CA. Also, the PA has improved the modulation types by approximately 45% to provide more throughput and reliability.

关键词： Sensitivity Receivers Wireless communication Wireless sensor networks Modulation Body area networks Throughput Sensibility narrowband Internet of Things modulation techniques wireless medical sensor networks linear network coding

来源：评论

学校读者我要写书评

暂无评论

Initialization Algorithms for Convolutional network coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第7期64卷 5277-5295页

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

We present algorithms for initializing a convolutional network coding (CNC) scheme in networks that may contain cycles. An initialization process for finding global encoding kernels (GEK) is needed if the network is unknown or if local encoding kernels are chosen randomly. During the initialization process every source node transmits basis vectors and every sink node gets the impulse response of the network. The impulse response is then used to find the GEK, which are needed for a decoding algorithm and to find the set of all achievable rates. We present two initialization algorithms that find the GEK and one algorithm that finds achievable rates from the GEK. In the first initialization algorithm it is assumed that we can perform a reset operation on the network at some fixed times, while the second algorithm does not operate under this assumption. Unlike acyclic networks, for which it is sufficient to transmit basis vectors one after another, the initialization of cyclic networks is more involved, as test symbols from different times interfere with each other and the impulse response is of infinite duration. Our algorithms use only a finite number of the initial values of the impulse response to find the full GEK. This is possible because a CNC scheme can be described by a state space representation and, using the Cayley-Hamilton theorem, it is possible to find its full impulse response from its initial values.

关键词： Cayley-Hamilton theorem convolutional network coding cyclic networks linear network coding system identification

来源：评论

学校读者我要写书评

暂无评论

Multicast network coding and Field Sizes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2015年第11期61卷 6182-6191页

作者： Sun, Qifu Tyler Yin, Xunrui Li, Zongpeng Long, Keping Univ Sci & Technol Beijing Sch Comp & Commun Engn Beijing 100083 Peoples R China Univ Calgary Dept Comp Sci Calgary AB T2N 1N4 Canada Wuhan Univ Dept Comp Wuhan 430072 Peoples R China

In an acyclic multicast network, it is well known that a linear network coding solution over GF(q) exists when q is sufficiently large. In particular, for each prime power q no smaller than the number of receivers, a linear solution over GF(q) can be efficiently constructed. In this paper, we reveal that a linear solution over a given finite field does not necessarily imply the existence of a linear solution over all larger finite fields. In particular, we prove by construction that: 1) for every omega >= 3, there is a multicast network with source outdegree omega linearly solvable over GF(7) but not over GF(8), and another multicast network linearly solvable over GF(16) but not over GF(17);2) there is a multicast network linearly solvable over GF(5) but not over such GF(q) that q > 5 is a Mersenne prime plus 1, which can be extremely large;3) a multicast network linearly solvable over GF(q(m1)) and over GF(q(m2)) is not necessarily linearly solvable over GF(q(m1+m2));and 4) there exists a class of multicast networks with a set T of receivers such that the minimum field size q(min) for a linear solution over GF(q(min)) is lower bounded by Theta(root vertical bar T vertical bar), but not every larger field than GF(q(min)) suffices to yield a linear solution. The insight brought from this paper is that not only the field size but also the order of subgroups in the multiplicative group of a finite field affects the linear solvability of a multicast network.

关键词： linear network coding multicast network field size lower bound Mersenne prime

来源：评论

学校读者我要写书评

暂无评论

Quantized network coding for correlated sources

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND networkING 2014年第1期2014卷 1-17页

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

In this paper, we present a data gathering technique for sensor networks that exploits correlation between sensor data at different locations in the network. Contrary to distributed source coding, our method does not rely on knowledge of the source correlation model in each node although this knowledge is required at the decoder node. Similar to network coding, our proposed method (which we call Quantized network coding) propagates mixtures of packets through the network. The main conceptual difference between our technique and other existing methods is that Quantized network coding operates on the field of real numbers and not on a finite field. By exploiting principles borrowed from compressed sensing, we show that the proposed technique can achieve a good approximation of the network data at the sink node with only a few packets received and that this approximation gets progressively better as the number of received packets increases. We explain in the paper the theoretical foundation for the algorithm based on an analysis of the restricted isometry property of the corresponding measurement matrices. Extensive simulations comparing the proposed Quantized network coding to classic network coding and packet forwarding scenarios demonstrate its delay/distortion advantage.

关键词： linear network coding Distributed source coding Compressed sensing Restricted isometry property l(1) minimization

来源：评论

学校读者我要写书评

暂无评论

Space-Time network coding

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2011年第4期59卷 1706-1718页

作者： Lai, Hung-Quoc Liu, K. J. Ray USA RDECOM CERDEC RDER STA DS Aberdeen Proving Ground MD 21005 USA Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA

Traditional cooperative communications can improve communication reliability. However, transmissions from multiple relay nodes are challenging in practice. Single transmissions in time-division multiple-access (TDMA) manner cause large transmission delay, but simultaneous transmissions from two or more nodes using frequency-division multiple access (FDMA) and code-division multiple access (CDMA) are associated with the issue of imperfect frequency and timing synchronization. In this work, a novel framework for cooperative communications is proposed to achieve full spatial diversity with low transmission delay and eliminate the issue of imperfect synchronization. This is realized by the use of space-time network codes (STNCs) associated with a novel concept of wireless network cocast. For a network of N client nodes, R relay nodes and a base node, the STNCs provide a diversity order of (R + 1) for each symbol with (N + R) time slots, a reduction from 2N time slots in traditional FDMA and CDMA cooperative communications for N being usually greater than R and from N(R + 1) time slots in traditional TDMA cooperative communications. The STNCs are also applied in networks, where the client nodes located in a cluster act as relays to help one another to improve their transmission performance. The performance in clustering setting is studied to show the improvement in power saving, range extension, and transmission rate.

关键词： Cooperative communications frequency synchronization linear network coding space-time network codes timing synchronization wireless network cocast

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：