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

Lossless coding of Correlated Sources With Actions

IEEE TRANSACTIONS ON INFORMATION THEORY 2017年第2期63卷 1237-1252页

作者： Sabag, Oron Permuter, Haim H. Cohen, Asaf Ben Gurion Univ Negev Dept Elect & Comp Engn IL-8410501 Beer Sheva Israel Ben Gurion Univ Negev Dept Commun Syst Engn IL-8410501 Beer Sheva Israel

This paper studies the problem of the distributed compression of correlated sources with an action-dependent joint distribution. This class of problems is, in fact, an extension of the Slepian-Wolf model, but where cost-constrained actions taken by the encoder or the decoder affect the generation of one of the sources. The purpose of this paper is to study the impact of actions on the achievable rates. In particular, two cases where transmission occurs over a rate-limited link are studied;case A for actions taken at the decoder and case B where actions are taken at the encoder. A complete single-letter characterization of the set of achievable rates is given in both cases. Furthermore, a network coding setup for the case where actions are taken at the encoder is investigated. The sources are generated at different nodes of the network and are required at a set of terminal nodes, yet transmission occurs over a general, acyclic, directed network. For this setup, generalized cut-set bounds are derived, and a full characterization of the set of achievable rates using single-letter expressions is provided. For this scenario, random linear network coding is proved to be optimal, even though this is not a classical multicast problem. In addition, two binary examples are investigated and demonstrate how actions taken at different nodes of the system have a significant effect on the achievable rate region, when compared with a naive time-sharing strategy.

关键词： Actions correlated sources distributed compression network coding random linear network coding Slepian-wolf source coding

来源：评论

学校读者我要写书评

暂无评论

Modifying network coding with TCP for Media Streaming in Multi-Hop Wireless networks

Modifying Network Coding with TCP for Media Streaming in Mul...

引用

21st International Conference on Telecommunications (ICT)

作者： Bhat, Gokul McNair, Janise Univ Florida Gainesville FL 32611 USA

ISBN: (纸本)9781479951413

The paper focuses on using network coding (NC) with TCP for multi-hop wireless networks to provide fault-tolerant and timely delivery of streaming data. The paper shows that there is an inherent latency in video playback when TCP with random linear NC is employed. With the objective of reducing latency and jitter at the receiver, the paper proposes a Variable Bucket size based network coding (VBNC) technique that modifies the TCP congestion control to adapt to the arriving traffic and dynamic network conditions. Simulation results demonstrate that on an average the proposed algorithm reduces observed latency at playback by 80% and jitter by more than 50% over standard TCP. More importantly, a significant reduction in the initial start-up delay is observed which enhances the performance of streaming services.

关键词： Bucket size congestion control finite field intra-session network coding latency random linear network coding ns-3 round trip time streaming media video aware network coding

来源：评论

学校读者我要写书评

暂无评论

Effect of network coding on Buffer Management in Wireless Sensor network

Effect of Network Coding on Buffer Management in Wireless Se...

引用

International Conference on Intelligent Sensors, Sensor networks and Information Processing

作者： Jardosh, Sunil Zunnun, Narmawala Ranjan, Prabhat Srivastava, Sanjay DA IICT ICT Gandhinagar India

ISBN: (纸本)9781424438228

In resource constrained wireless sensor networks (WSN), it is highly desirable to make efficient use of available buffer. Hence for the WSN designed for the monitoring applications, buffer management is a key requirement at sensor nodes. We have proposed an efficient buffer management scheme based on random linear network coding as the in-network processing on data packets. With buffer allocation from source to sink path, our scheme distributes the buffer requirement among the nodes on the path. Further in the case of a packet loss, the proposed scheme recovers packet from available information distributed on the path from source to sink. We have compared our scheme with conventional buffer management scheme. Results show that network coding based buffer management scheme has better buffer availability with less redundancy and reduced loss recovery cost.

关键词： Wireless Sensor network random linear network coding Buffer Management

来源：评论

学校读者我要写书评

暂无评论

Simulated Annealing for Maximizing the Lifetime of Sensor networks under Opportunistic routing

Simulated Annealing for Maximizing the Lifetime of Sensor Ne...

引用

7th International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)

作者： Chelloug, Samia Benmohammed, Mohammed Mentouri Univ Dept Comp Sci Constantine Algeria

ISBN: (纸本)9780769548425

A key challenge in wireless sensor networks (WSNs) is to design protocols maximizing the lifetime of a set of devices based on small and non-rechargeable batteries. This work focus on maximizing the lifetime of a WSN in which opportunistic routing is used together with random linear network coding. The idea of such technique is double: improving wireless performances by exploiting transmission opportunities and avoiding coordination between nodes of the network. It has been shown that this problem is non-convex. So, our contribution consists in exploiting the simulated annealing (SA) as a simple metaheuristic in order to find the optimal solution for the reception probabilities. The convergence of the SA is shown and the performance in term of energy consumption is illustrated.

关键词： WSN lifetime opportunistic routing random linear network coding SA

来源：评论

学校读者我要写书评

暂无评论

Sliding Window RLNC on Multi-Hop Communication for Low Latency 93

Sliding Window RLNC on Multi-Hop Communication for Low Laten...

引用

IEEE 93rd Vehicular Technology Conference (VTC-Spring)

作者： Tasdemir, Elif Cabrera, Juan A. Gabriel, Frank You, Dongho Fitzek, Frank H. P. Tech Univ Dresden Deutsch Telekom Chair Commun Networks D-01062 Dresden Germany Tech Univ Dresden Ctr Tactile Internet Human Loop CeTI D-01062 Dresden Germany

ISBN: (纸本)9781728189642

random linear network coding (RLNC) has been proven to improve the performances of Internet of Things (IoT) devices, such as throughput and resilience. However, for latency-sensitive applications, sliding window RLNC (SWNC) outperforms the block-based RLNC because it allows instantaneous packet decodeability and reduces the in-order delay. However, most conventional SWNC approaches have been applied to single-hop communication networks since recoding at intermediate nodes destroy the properties of the coding windows. In this work, we consider multi-hop communication networks and propose SWNC-based recoding algorithms that can be applied at intermediate nodes. The simulation results show that the proposed recoding algorithms outperform block-based RLNC by 53% in terms of the per-packet delay performance.

关键词： sliding window multi-hop wireless communication random linear network coding packet in order delay

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Caterpillar RLNC for Multi-Hop Communication 32

Performance Analysis of Caterpillar RLNC for Multi-Hop Commu...

引用

32nd IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE PIMRC)

作者： Schwenteck, Paul Tasdemir, Elif Radeke, Rico Fitzek, Frank H. P. Tech Univ Dresden Commun Networks D-01062 Dresden Germany

ISBN: (纸本)9781728175867

Vehicle Platooning combines lower fuel consumption with safe and efficient transportation in a cooperative driving application. To ensure this, vehicles must communicate quickly and reliably. The sliding window protocol Caterpillar random linear network coding (CRLNC) is used as it does not rely on acknowledgements and uses network coding to reduce losses. However, the protocol was intentionally designed for single hop scenarios. Therefore, three contributions to the CRLNC protocol are presented in this paper to optimize it for multi hop/single path transmissions. The contributions are idle-slot-management, adaptive-window, and queue-management. By effectively combining these contributions, a large gain in throughput of up to 40% is achieved. Furthermore, it was investigated what are the optimal protocol parameters for CRLNC in single path scenarios are. It is shown that the best transmission in terms of throughput and delay is achieved, when the code rate is less than one minus the error probability and a large window size is used. Even if the error probability is unknown, a large window size will bring more benefits to the transmission.

关键词： sliding window multi hop wireless communication random linear network coding high resilience delay

来源：评论

学校读者我要写书评

暂无评论

New constructions of orbit codes based on imprimitive wreath products and wreathed tensor products

引用

RENDICONTI DEL CIRCOLO MATEMATICO DI PALERMO 2024年第1期73卷 85-98页

作者： Askary, Soleyman Biranvand, Nader Shirjian, Farrokh Imam Ali Univ Fac Sci Tehran Iran

Orbit codes, as special constant dimension codes, have attracted much attention due to their applications for error correction in random network coding. They arise as orbits of a subspace of F-q(n) under the action of some subgroup of the finite general linear group GL(n)(q). The aim of this paper is to present constructions of large non-Abelian orbit codes having the maximum possible distance. The properties of imprimitive wreath products and wreathed tensor products of groups are employed to select certain types of subspaces and their stabilizers, thereby providing a systematic way of constructing orbit codes with optimum parameters. We also present explicit examples of such constructions which improve the parameters of the construction already obtained in Climent et al. (Cryptogr Commun 11:839-852, 2019).

关键词： random linear network coding Algebraic coding theory Non-Abelian orbit code linear groups

来源：评论

学校读者我要写书评

暂无评论

In-Packet network coding for Effective Packet Wash and Packet Enrichment

In-Packet Network Coding for Effective Packet Wash and Packe...

引用

IEEE Global Communications Conference (IEEE GLOBECOM)

作者： Dong, Lijun Li, Richard Futurewei Technol Inc 2330 Cent Expressway Santa Clara CA 95050 USA

ISBN: (纸本)9781728109602

Packets could be dropped completely in the current Internet if there is not enough buffer in the routers due to network congestion or packet error happens during the transmission. This practice causes re-transmissions of the packets under the reliable transmission protocols, which in-turn produces unwanted delay , reduces throughput, and wastes network resources. Recently, a new network service called Qualitative Communication suggests to avoid entire packet dropping. instead breaking the packet into smaller logical units (chunks). The network nodes (e.g. routers) could perform packet scrubbing on the packet with the granularity of chunks, such operation is named as Packet Wash. In this paper, we propose to apply random linear network coding on the chunks of the packet payload to enable the packet wash and packet enrichment in the network. The benefits of utilizing such packetization are discussed in the paper.

关键词： Qualitative Communication Service partial packet dropping packet wash packet scrubbing packet enrichment Big IP Protocol BPP in-network intelligence random linear network coding

来源：评论

学校读者我要写书评

暂无评论

Segmented network coding for Stream-like Applications in Delay Tolerant networks

Segmented Network Coding for Stream-like Applications in Del...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Zeng, Deze Guo, Song Jin, Hai Leung, Victor Univ Aizu Sch Comp Sci & Engn Aizu Wakamatsu Japan Huazhong Univ Sci & Technol Sch Comp Sci Technol Huazhong Peoples R China Univ British Columbia Dept Elect & Comp Engn Vancouver BC V5Z 1M9 Canada

ISBN: (纸本)9781424492688

Delay/Disruption Tolerant network (DTN) differs from the conventional networks in that it has no continuous or contemporaneous connections among wireless nodes. Its inherent characteristic of intermittent connections makes existing routing solutions hardly to be applied directly. Epidemic routing using random linear network coding has been studied and proved as an efficient way for light data delivery. In this paper, we propose a pipelined segmented network coding approach using double buffer to provide best-effort services for bulk or stream-like data dissemination in DTNs. Simulations were conducted to verify its performance in terms of packet delivery ratio and throughput. Several other interesting findings are also observed.

关键词： DTN Delay network coding Peer to peer computing Protocols Relays Routing Throughput bulk data dissemination delay tolerant network delay tolerant networks disruption tolerant network double buffer epidemic routing light data delivery linear codes network coding packet delivery ratio pipelined segmented network coding random codes random linear network coding stream-like application stream-like data dissemination telecommunication network routing

来源：评论

学校读者我要写书评

暂无评论

Product network Codes for Reliable Communications in Diamond networks 1

引用

8th International Wireless Internet Conference (WICON)

作者： Bassoli, Riccardo Talooki, Vahid N. Marques, Hugo Rodriguez, Jonathan Tafazolli, Rahim Inst Telecomunicacoes Aveiro Portugal Ctr Commun Syst Res Surrey England

ISBN: (数字)9783319188027

ISBN: (纸本)9783319188027;9783319188010

In wireless networks, mobile users connect either with other devices or with base stations. They can experience high errors caused by losses, low levels of signals or disconnections. Due to these aspects, it is important to find ways to make the communication reliable. Product network codes represent a way to improve error-correction capability. The main idea is to use a powerful error correction code in time with random linear network coding in space domain. This paper analyses the error-correcting capabilities of product network codes composed by either Luby transform (LT) codes or Reed-Solomon (RS) codes, and RLNC. The kind of errors are burst errors. The results quantify how product network codes improve reliability in case of high burst error probability.

关键词： random linear network coding Reed-Solomon codes LT codes Burst errors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：