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

IEEE International Symposium on Power Line Communications and Its Applications (ISPLC)

作者： Josu Bilbao Aitor Calvo Igor Armendariz Pedro M. Crespo Muriel Médard Communications Department Mondragon Spain Electronics and Communications Dept Tecnun University of Navarra San Sebastian Spain MIT Research Lab. of Electronics Cambridge MA USA

Due to its wide availability narrowband powerline networks provide an interesting no-new-wires communication channel. Nevertheless, as powerline was not designed for data communication, its electrical characteristics make it a harsh environment for data transmission and prevents the deployment of services with high reliability requirements. This paper presents 3 main outcomes: (i) The characterization of the transmission error correlation among different nodes in a narrowband powerline network, which acts in favour of the cooperative schemes. (ii) Based on the conclusions obtained from real measurements campaign, we propose a new OSI-Layer2 scheme based on network coding to achieve reliable communications in narrowband powerline. (iii) We demonstrate the benefits of the proposed scheme validating its real implementation in an embedded system, and comparing the achieved performance improvement with different legacy ARQ schemes.

关键词： Narrowband Receivers Reliability Correlation Noise network coding Transmitters

来源：评论

学校读者我要写书评

暂无评论

Fountain Codes with XOR of Encoded Packets for Broadcasting and source independent backbone in Multi-hop networks using network coding

Fountain Codes with XOR of Encoded Packets for Broadcasting ...

引用

IEEE Vehicular Technology Conference

作者： Khaldoun Al Agha Nour KADI Ivan Stojmenovic LRI Paris XI University SITE University of Ottawa

ISBN: (纸本)9781424425167

We consider multiple source asynchronous broad-casting problem. That is, in each broadcast, one of the nodes is the source, and the message is to be received, unaltered, by all the other nodes in the network. We propose to exploit LT code, which is one of the fountain codes, with the source independent backbone in order to reduce the number of transmissions for broadcasting with network coding in ad hoc wireless network. We use the principle of LT code to perform network coding in a simple distributed manner where encoding can be applied with both received singletons and non-singletons, and generated candidates can be used in an optimization criteria. We show by simulation that our approach reduces the number of transmissions required for flooding.

关键词： broadcasting network coding wireless multi-hop networks Mobile ad hoc networks exclusive OR optimal criterion Codes fountain Level Trigger Spine network node Ganglia Transmissions

来源：评论

学校读者我要写书评

暂无评论

Maximizing coding Gain in Wireless networks with Decodable network coding

Maximizing Coding Gain in Wireless Networks with Decodable N...

引用

Ad-Hoc and Sensor networks Symposium

作者： Maggie Cheng Quanmin Ye Xiaochun Cheng Lin Cai Missouri University of Science and Technology Computer Science Department Nokia Networks Middlesex University Computer Science Department University of Victoria Electrical and Computer Engineering Department

ISBN: (纸本)9781479966653

network coding improves transmission efficiency by combining packets at relay nodes and thus reduces the number of packets sent to the network. It is a network layer solution to improve network throughput and transmission efficiency. However, a coded packet must be decodable by the destination, otherwise it is a waste of resource to combine them together and to deliver the coded packet. This paper addresses how to find the coding solution that guarantees decodability at the destination. We first quantify the coding gain as the number of transmissions reduced, and then provide a method for runtime check whether a coding pair can be separated at the destination. The optimal coding solution is selected as the one that provides the maximum coding gain among all the decodable pairs. The algorithms can be applied to both unicast and multicast traffic. Simulation results show the number of transmissions can be reduced significantly, especially for multicast traffic where there are rich opportunities to apply network coding.

关键词： coding gain network coding transmission efficiency Wireless networks Packet destination Unicast network throughput Runtime Transmissions transmission

来源：评论

学校读者我要写书评

暂无评论

Effective Delay Control in Online network coding

Effective Delay Control in Online Network Coding

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： J. Barros R. A. Costa D. Munaretto J. Widmer Instituto de Telecomunicações Universidade do Porto Portugal DoCoMo Conimunications Laboratories Europe GmbH Munich Germany

ISBN: (纸本)9781424435128

Motivated by streaming applications with stringent delay constraints, we consider the design of online network coding algorithms with timely delivery guarantees. Assuming that the sender is providing the same data to multiple receivers over independent packet erasure channels, we focus on the case of perfect feedback and heterogeneous erasure probabilities. Based on a general analytical framework for evaluating the decoding delay, we show that existing ARQ schemes fail to ensure that receivers with weak channels are able to recover from packet losses within reasonable time. To overcome this problem, we re-define the encoding rules in order to break the chains of linear combinations that cannot be decoded after one of the packets is lost. Our results show that sending uncoded packets at key times ensures that all the receivers are able to meet specific delay requirements with very high probability.

关键词： Delay effects network coding Feedback Decoding Throughput Algorithm design and analysis Transport protocols Performance analysis Communications Society Communication system control

来源：评论

学校读者我要写书评

暂无评论

Random network coding Based on Adaptive Sliding Window in Wireless Multicast networks

Random Network Coding Based on Adaptive Sliding Window in Wi...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Bin Li Siying Bi Ruonan Zhang Yi Jiang Quan Li Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9781509016990

network coding offers a promising platform for multicast transmission to improve the throughput. However, the users may not collect a full set of the encoded packets to recover the useful information because of its block processing property, leading to the low throughput under wireless fading channel. While the schemes that using feedback from all the receivers to cover the problem above always causes the huge feedback overhead in large network. Accordingly, in this paper we proposed an adaptive sliding window random network coding(ASWRNC) that introduce RNC with lower triangular coefficient matrix and sliding window to achieve higher network throughput and lower feedback overhead. Particularly, we introduce an adaptive encoding scheme that can let the user decode out partial original packets without collecting the full set of encoded packets. On the other hand, the window sliding scheduling helps the user with better channel decode out more original packets. Further, we discuss in detail the feedback-compete mechanism to decline the feedback overhead.

关键词： Encoding Throughput network coding Transmitters Adaptive systems Wireless communication Receivers

来源：评论

学校读者我要写书评

暂无评论

Random network coding based solution for resource efficient data dissemination

Random Network Coding based solution for resource efficient ...

引用

IEEE International Conference on Intelligent Computer Communication and Processing (ICCP)

作者： Zsuzsanna Ilona Kiss Zsolt Alfred Polgar Communications Department Technical University of Cluj Napoca Cluj-Napoca Romania

The paper proposes a Random network coding based solution for data dissemination applications involving multiple unicast or multicast transmissions between a source and several destinations. The solution proposed is based on a mathematical framework derived from the theory of Random network coding employed in multicast transmissions. This framework specifies the conditions allowing to each destination to decode only the flows of interest, when the total rate of the source flows is larger than the capacity of the network. A testbed, shortly described in the paper, was implemented for proof of concept and the performances of the coded transmissions were compared to that of uncoded transmissions. The results show the improvement brought by our solution in what concerns the packet loss rate obtained for different ratios between the source flows rates and the transfer rates of the test topology's bottleneck links.

关键词： Encoding network coding Unicast Decoding network topology Topology Computers

来源：评论

学校读者我要写书评

暂无评论

Transmit Antenna Selection for Physical-Layer network coding Based on Euclidean Distance

arXiv

引用

arXiv 2017年

作者： Kumar, Vaibhav Cardiff, Barry Flanagan, Mark F. School of Electrical and Electronic Engineering University College Dublin Belfield Dublin 4 Ireland

Physical-layer network coding (PNC) is now well-known as a potential candidate for delay-sensitive and spectrally efficient communication applications, especially in two-way relay channels (TWRCs). In this paper, we present the error performance analysis of a multiple-input single-output (MISO) fixed network coding (FNC) system with two different transmit antenna selection (TAS) schemes. For the first scheme, where the antenna selection is performed based on the strongest channel, we derive a tight closed-form upper bound on the average symbol error rate (SER) with M-ary modulation and show that the system achieves a diversity order of 1 for M > 2. Next, we propose a Euclidean distance (ED) based antenna selection scheme which outperforms the first scheme in terms of error performance and is shown to achieve a diversity order lower bounded by the minimum of the number of antennas at the two users. Copyright © 2017, The Authors. All rights reserved.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Constellations Maximizing Minimal Distance for Physical-Layer network coding Multiway Relaying

Constellations Maximizing Minimal Distance for Physical-Laye...

引用

IEEE Vehicular Technology Conference

作者： Miroslav Hekrdla Jan Sykora Czech Technical University in Prague

This paper objects a design of constellations suitable for Physical-Layer network coding (PLNC) in a Multi-Way Relay Channel (M-WRC). We formulate the constellation design as a general constrained optimization problem maximizing minimal distance of network coding function decoding. The numerically obtained constellations are recognized to possess some regular structure. The optimal constellations for 2-WRC are power-balanced hexagonal constellations with particular type of indexing. As far as the optimization problem is numerically tractable, we declare optimality of power-scaled pre-rotated amplitude shift keying constellations for M-WRC with number of terminals > 2. All optimums decode non-linear modulo-sum network coding function and offer considerable performance gains in comparison to canonical schemes. This work also demonstrates that PLNC strategy tailored to M-WRC overcome PLNC 2-WRC approach.

关键词： network coding Decoding Amplitude shift keying Lattices Constellation diagram Optimization Relays

来源：评论

学校读者我要写书评

暂无评论

Joint inter-flow network coding and opportunistic routing in multi-hop wireless mesh networks: A comprehensive survey

arXiv

引用

arXiv 2018年

作者： Kafaie, Somayeh Chen, Yuanzhu Dobre, Octavia A. Ahmed, Mohamed Hossam Department of Computer Science Memorial University of Newfoundland St. John'sNLA1B 3X5 Canada Faculty of Engineering and Applied Science Memorial University of Newfoundland St. John'sNLA1B 3X5 Canada

network coding and opportunistic routing are two recognized innovative ideas to improve the performance of wireless networks by utilizing the broadcast nature of the wireless medium. In the last decade, there has been considerable research on how to synergize inter-flow network coding and opportunistic routing in a single joint protocol outperforming each in any scenario. This paper explains the motivation behind the integration of these two techniques, and highlights certain scenarios in which the joint approach may even degrade the performance, emphasizing the fact that their synergistic effect cannot be accomplished with a naive and perfunctory combination. This survey paper also provides a comprehensive taxonomy of the joint protocols in terms of their fundamental components and associated challenges, and compares existing joint protocols. We also present concluding remarks along with an outline of future research directions. Copyright © 2018, The Authors. All rights reserved.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

ALBPS: An Adaptive Approach on Reduction Redundancy in Latency-Aware Peer-to-Peer Content Delivery System with network coding

ALBPS: An Adaptive Approach on Reduction Redundancy in Laten...

引用

Computer Science and Information Engineering, CSIE, WRI World Congress on FLAGGED

作者： Yao Yu Yu Zhou Sidan Du Department of Electronics Science and Engineering Nanjing University Nanjing China

In recent research on the Peer-To-Peer (P2P) content delivery system, network coding has been applied as a promising approach to improve the performance of P2P content delivery. Many studies have shown that the live P2P streaming system can take great advantage of network coding. It has also been shown that this technology can also resolves the "last block" problem. Accordingly, P2P seed peers can just simply upload the coded data to the downstream peer without being applied a complicated schedule algorithm. This results in a very high utilization of bandwidth as well as the throughput since the seed peers can contribute their bandwidth as much as they ***, it has been found that in a network coding delivery procedure for requested segment, the seed peers (serving peers) cannot decide wether they should stop pushing coded block to the downstream peer or not. The difficulty is that the seed peers cannot get the decoded state instantly from the downstream peer. It cause a significant redundancy, named redundancy caused by late stoping signal (RLSS), especially when the upload bandwidth is high. We propose an approach to reduce such RLSS and preserve the property of high utilization and throughput though. Such approach is named as adaptive learning-based predictable stoping (ALBPS). In this approach, seed peers predict their uploading bandwidth allocation for each segment peer by learning from the history and allocate the bandwidth via assigning priority to each segment uploading session. We also demonstrate that the RLSS can be reduced via applying the ALBPS by both simulation and reality.

关键词： Peer to peer computing network coding Bandwidth Throughput Videoconference Scheduling algorithm Decoding Computer science Channel allocation History

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：