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

Attack Detection Using network coding in IoT Environment

SENSORS 2020年第4期20卷 1180-1180页

作者： Lee, Yong Lee, Goo Yeon Kangwon Natl Univ Dept Comp & Commun Engn Chunchon 24341 South Korea

network coding is a reasonable way to increase network efficiency in response to an increase of sensed data in the Internet of Things (IoT). In network coding, intermediate nodes combine packets received from neighboring nodes, transform, and transmit encoded packets that can be decoded at the destination. This scheme is based on trust among nodes. If any malicious node joins the network, it can act as an intermediate node that could fabricate encoded packets. It might be more difficult to identify the authenticity of such encoded packets since packets that are received at the destination might not originate from a single source, but be combined with several other packets originating from multiple sources. In this paper, we propose a scheme on how to detect attacked packets among the received packets at a destination and how to recover the original message from the packets including the attacked "look-like-valid" packets. This scheme shows that a destination could recover the valid message with just the received packets including some attacked packets and will result in a quite efficient performance in network coding.

关键词： Internet of Things network coding attack detection recovery

来源：评论

学校读者我要写书评

暂无评论

Random Linear network coding on Programmable Switches

Random Linear Network Coding on Programmable Switches

引用

ACM/IEEE Symposium on Architectures for networking and Communications Systems (ANCS)

作者： Goncalves, Diogo Signorello, Salvatore Ramos, Fernando M. V. Medard, Muriel Univ Lisbon Fac Ciencias LASIGE Lisbon Portugal MIT Res Lab Elect 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781728143873

By extending the traditional store-and-forward mechanism, network coding has the capability to improve a network's throughput, robustness, and security. Given the fundamentally different packet processing required by this new paradigm and the inflexibility of hardware, existing solutions are based on software. As a result, they have limited performance and scalability, creating a barrier to its wide-spread adoption. By leveraging the recent advances in programmable networking hardware, in this paper we propose a random linear network coding data plane written in P4, as a first step towards a production-level platform. Our solution includes the ability to combine the payload of multiple packets and of executing the required Galois field operations, and shows promise to be practical even under the strict memory and processing constraints of switching hardware.

关键词： network coding Random Linear network coding Programmable Switches P4

来源：评论

学校读者我要写书评

暂无评论

A network coding Based Schedule Template Construction Technique for Duty-Cycled networks 19

A Network Coding Based Schedule Template Construction Techni...

引用

19th International Symposium on Communications and Information Technologies (ISCIT)

作者： Van Ho Hoa Sen Univ Dept Comp Engn Ho Chi Minh City Vietnam

ISBN: (纸本)9781728150093

For energy conservation in a wireless sensor network (WSN), in our previous work [V. Ho, I. Nikolaidis, ADHOC-NOW 2015: p. 48-61], we introduce a TDMA schedule construction technique for arbitrary topology networks whose nodes duty cycle (DC) in a periodic fashion. In our other work [V. Ho, I. Nikolaidis, ACOMP 2017: p. 28-35], we present the modeling of XOR-pairwise network coding (NC) for duty-cycled WSNs to figure out per-flow rates by the optimization step resulted from the max-min fairness formulation used with the max-min programming algorithm. With the values of optimized per-flow rates used by the original TDMA schedule construction technique, in this paper, we propose the NC-based TDMA schedule construction technique to produce an improved TDMA schedule of all the nodes in the network. Numerous simulation studies show the new technique can greatly improve the total throughput that are reduced by switching nodes (transceivers) OFF.

关键词： TDMA scheduling time varying graphs wireless sensor networks duty cycling network coding max-min fairness

来源：评论

学校读者我要写书评

暂无评论

A Unified Adaptive Recoding Framework for Batched network coding

A Unified Adaptive Recoding Framework for Batched Network Co...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Yin, Hoover H. F. Tang, Bin Ng, Ka Hei Yang, Shenghao Wang, Xishi Zhou, Qiaoqiao Chinese Univ Hong Kong Dept Informat Engn Hong Kong Peoples R China Nanjing Univ Natl Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China Chinese Univ Hong Kong Dept Phys Hong Kong Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen Peoples R China Chinese Univ Hong Kong Shenzhen Key Lab IoT Intelligent Syst & Wireless Shenzhen Peoples R China Shenzhen Res Inst Big Data Shenzhen Peoples R China

ISBN: (纸本)9781538692912

Batched network coding is a variation of random linear network coding which has low computational and storage costs. In order to adapt random fluctuations in the number of erasures in individual batches, it is not optimal to recode and transmit the same number of packets for all batches. Different distributed optimization problems, which are called adaptive recoding, were formulated for this purpose. The key component of these optimization problems is the expected value of the rank distribution of a batch at the next network node, which also known as the expected rank. In this paper, we put forth a unified adaptive recoding framework. We show that the expected rank functions are concave when the packet loss pattern follows a stationary stochastic process regardless of the field size, which covers but not limited to independent packet loss and burst packet loss. Under this concavity property, we show that there always exists a preferred solution which not only can make the number of recoded packets almost deterministic but can also tolerate rank distribution errors due to inaccurate measurements or limited precision of the machine. To obtain such an optimal solution, we propose tuning schemes that can turn any feasible solution into one with the above desired properties.

关键词： Packet loss Optimization network coding Stochastic processes Decoding Adaptation models

来源：评论

学校读者我要写书评

暂无评论

Multisource Rumor Spreading with network coding

Multisource Rumor Spreading with Network Coding

引用

IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Bromberg, Yerom-David Dufour, Quentin Frey, Davide Univ Rennes CNRS INRIA IRISA Rennes France

ISBN: (纸本)9781728105154

The last decade has witnessed a rising interest in Gossip protocols in distributed systems. In particular, as soon as there is a need to disseminate events, they become a key functional building block due to their scalability, robustness and fault tolerance under high churn. However, Gossip protocols are known to be bandwidth intensive. A huge amount of algorithms has been studied to limit the number of exchanged messages using different combinations of push/pull approaches. We are revisiting the state of the art by applying Random Linear network coding to further increase performance. In particular, the originality of our approach is to combine sparse-vector encoding to send our network-coding coefficients and Lamport timestamps to split messages in generations in order to provide an efficient gossiping. Our results demonstrate that we are able to drastically reduce bandwidth overhead and dissemination delay compared to the state of the art.

关键词： network coding gossip dissemination peer-to-peer network epidemic algorithm rumor spreading

来源：评论

学校读者我要写书评

暂无评论

The Performance Characteristics of TCP with network coding in Power Line Communication network

The Performance Characteristics of TCP with Network Coding i...

引用

International Conference on System Science and Engineering (ICSSE)

作者： Nguyen Viet Ha Le Van Hau Tran Thi Thao Nguyen Tsuru, Masato Univ Sci VNU HCM HCMC Ho Chi Minh City Vietnam Kyushu Inst Technol Fukuoka Japan

ISBN: (纸本)9781728105253

Transmission Control Protocol with network coding (TCP/NC) has been a potential proposal to improve the transmission performance of TCP in lossy networks while it still takes advantage of congestion and retransmission control of TCP for reliable end-to-end data transfer. TCP/NC uses additional sub-layer called network coding layer below the TCP layer to handle packet losses without sensed by the TCP layer. In our previous work, we introduced some variants of TCP/NC such as TCP/NCwLRLBE (TCP/NC with Loss Rate and Loss Burstiness Estimation) which can improve the retransmission and adapt to the changing of the channel. However, it is just evaluated on the simple packet loss conditions, e.g., random loss or Gilbert loss. On the other hand, reliable end-to-end data transfer in diverse IoT (Internet of Things) environments (e.g., Power Line Communication - PLC) in a cost-efficient manner is an emerging challenge. Therefore, in this paper, we investigate the characteristics of the TCP/NC on PLC networks, to have a more in-depth evaluation of its performance and applicability in a practical PLC environment with many conditions causing packet loss such as noise variants, distance, etc. The result of our simulation on ns-3 (network Simulation 3) shows that TCP/NC can work well on PLC environment compared to the traditional protocols such as TCP NewReno with Selective Acknowledgment (SACK) and TCP Westwood+.

关键词： TCP/NC PLC network coding IoT Packet Loss

来源：评论

学校读者我要写书评

暂无评论

Bidirectional network coding in Wireless networks

Bidirectional Network Coding in Wireless Networks

引用

International Conference on networked Systems (NetSys)

作者： Guenther, Stephan M. Leclaire, Maurice Riemensberger, Maximilian Carle, Georg Utschick, Wolfgang Tech Univ Munich Dept Informat Chair Network Architectures & Serv Munich Germany Tech Univ Munich Dept Elect & Comp Engn Methods Signal Proc Munich Germany Cadami GmbH Munich Germany

ISBN: (纸本)9781728105680

In this paper we introduce our network coding Module (NCM) for bidirectional random linear network coding in wireless networks. It is based on our low-level frame injection library libmoep, which allows to easily implement custom link-layer protocols. Originally intended for IEEE 802.11 only, it meanwhile also supports wired Ethernet-based networks. We evaluate the NCM in a wireless testbed with and without relay. For both cases we derive optimal packet injection rates and perform tests with TCP. The source code of this paper is made available for download under the GPLv2 at [1].

关键词： wireless link quality network coding

来源：评论

学校读者我要写书评

暂无评论

Weight Enumerating Function, Number of Full Rank Sub-matrices and network coding

Weight Enumerating Function, Number of Full Rank Sub-matrice...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Vaddi, Mahesh Babu Rajan, B. Sundar Indian Inst Sci Dept Elect Commun Engn Bengaluru 560012 KA India

ISBN: (纸本)9781538692912

In most of the network coding problems with k messages, the existence of binary network coding solution over F-2 depends on the existence of adequate sets of k-dimensional binary vectors such that each set comprises of linearly independent vectors. In a given k x n (n >= k) binary matrix, there exist ((n))(k) binary sub-matrices of size k x k. Every possible k x k sub-matrix may be of full rank or singular depending on the columns present in the matrix. In this work, for full rank binary matrix G of size k x n satisfying certain condition on minimum Hamming weight, we establish a relation between the number of full rank sub-matrices of size k x k and the weight enumerating function of the error correcting code with G as the generator matrix. We give an algorithm to compute the number of full rank k x k submatrices.

关键词： network coding Receivers Encoding Error correction codes Hamming weight Generators Kernel

来源：评论

学校读者我要写书评

暂无评论

Optimization of Spin Protocol Combined with network coding 4

Optimization of Spin Protocol Combined with Network Coding

引用

4th International Conference on Communication and Information Systems (ICCIS)

作者： Bi, Daren Zhang, Linghua Nanjing Univ Posts & Telecommun 66 XinMoFan St Nanjing Peoples R China Jiangsu Prov Engn Res Ctr Telecommun & Network Te Nanjing Peoples R China

ISBN: (纸本)9781728162973

For classic wireless sensor networks (WSN), the received data is only stored and forwarded by nodes [1]. Existing research has shown that network coding can make the nodes form a store-encode-forward mode, which is a great improvement on the performance of wireless sensor networks. According to the above analysis, this paper chooses the SPIN protocol as our research object and looks for opportunities to use the network coding in the SPIN protocol when the intermediate node broadcasts the ADV message [2]. On this basis, this paper proposes a new improved routing protocol NC-SPIN based on network coding. Through simulation experiments, it can be found that the NC-SPIN routing protocol has improved throughput and communication performance and decreased energy consumption at intermediate nodes compared to the SPIN protocol.

关键词： wireless sensor network SPIN XOR network coding communication performance

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds for External Memory Integer Sorting via network coding 2019

Lower Bounds for External Memory Integer Sorting via Network...

引用

51st Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Farhadi, Alireza Hajiaghayi, MohammadTaghi Larsen, Kasper Green Shi, Elaine Univ Maryland College Pk MD 20742 USA Aarhus Univ Aarhus Denmark Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450367059

Sorting extremely large datasets is a frequently occuring task in practice. These datasets are usually much larger than the computer's main memory;thus external memory sorting algorithms, first introduced by Aggarwal and Vitter (1988), are often used. The complexity of comparison based external memory sorting has been understood for decades by now, however the situation remains elusive if we assume the keys to be sorted are integers. In internal memory, one can sort a set of n integer keys of Theta(lg n) bits each in O(n) time using the classic Radix Sort algorithm, however in external memory, there are no faster integer sorting algorithms known than the simple comparison based ones. Whether such algorithms exist has remained a central open problem in external memory algorithms for more than three decades. In this paper, we present a tight conditional lower bound on the complexity of external memory sorting of integers. Our lower bound is based on a famous conjecture in network coding by Li and Li (2004), who conjectured that network coding cannot help anything beyond the standard multicommodity flow rate in undirected graphs. The only previous work connecting the Li and Li conjecture to lower bounds for algorithms is due to Adler et al. (2006). Adler et al. indeed obtain relatively simple lower bounds for oblivious algorithms (the memory access pattern is fixed and independent of the input data). Unfortunately obliviousness is a strong limitations, especially for integer sorting: we show that the Li and Li conjecture implies an Omega(n lg n) lower bound for internal memory oblivious sorting when the keys are Theta(lg n) bits. This is in sharp contrast to the classic (non-oblivious) Radix Sort algorithm. Indeed going beyond obliviousness is highly non-trivial;we need to introduce several new methods and involved techniques, which are of their own interest, to obtain our tight lower bound for external memory integer sorting.

关键词： Integer Sorting network coding Lower Bounds Reductions External Memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：