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

23rd European Wireless Conference, EW 2017

作者： Cabrera, Juan A. Nguyen, Giang Lucani, Daniel E. Pedersen, Morten V. Fitzek, Frank H. P. TU Dresden SFB 912 - HAEC Deutsche Telekom Chr. of Communication Networks Germany Department of Engineering Aarhus University Aarhus8200 Denmark Department of Electronic Systems Aalborg University Denmark

ISBN: (纸本)9783800744268

Although Forward Error Correction (FEC) is key to the efficient operation of wireless communications networks, it can result in the recovery of an erroneous message. Practical systems detect it by using a CRC and discarding the packet. However, we are discarding potentially useful information, while forcing the system to re-transmit the data. network coded flows can correct these errors by exploiting the network code structure, albeit by incurring in added computational costs, e.g., using PRAC. This paper has two objectives. First, quantify the fraction of packets that the FEC recovers with errors and the rate of bits flipped in each of these packets for different data rates in 802.11g. Our measurements show that for 54 Mbps, 46% of received packets have errors after FEC, but that the amount of bit errors per packet is small. Thus, there is a potential to double the effective data rate when using network coding for error correction. Second, advocate for a new technique for error correction in coded flows that reduces the computational effort by an order of magnitude or more compared to PRAC and more than doubles the number of errors that can be corrected while maintaining an acceptable computation time. © VDE VERLAG GMBH · Berlin · Offenbach.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Improving network coding throughput in multi-hop networks through DCF adoption in 802.11 3

Improving network coding throughput in multi-hop networks th...

引用

3rd IEEE International Conference on Engineering Technologies and Social Sciences, ICETSS 2017

作者： Alferaidi, Khaled Piechocki, Robert Faculty of Engineering University of Bristol Bristol United Kingdom

ISBN: (纸本)9781538616116

Wireless Multi-Hop networks often rely on the use of IEEE 802.11 technology, Regardless of the robustness of IEEE 802.11 Distributed Coordination Function (DCF) is not optimal in various network scenarios. In this study and other have experienced the inefficacy's of DCF when network coding is applied, therefore the room of improvement is needed to consider network coding technique. DCF is fairer to nodes than the process of network coding. Since the rely nodes in multi-Hop scenario have urgent requirements to gain more access and regulated access, which accommodate the network coding process. We propose enhanced algorithm to DCF mechanism on MAC layer that favouring network coding, and guarantee to give more access to medium and better share of medium for relay nodes between bidirectional traffic flows in saturated network traffic scenario. © 2017 IEEE.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

When D2D meets network coding: A tutorial case study 17

When D2D meets network coding: A tutorial case study

引用

2017 International Conference on Research in Adaptive and Convergent Systems, RACS 2017

作者： Huang, Jun Huang, Shuai Xing, Cong-Cong CS Department Chongqing University of Posts and Telecommunications Chongqing400065 China School of SCIE Chongqing University of Posts and Telecommunications Chongqing400065 China Dept. of Math and CS Nicholls State University ThiboaduxLA70310 United States

ISBN: (纸本)9781450350273

As one of the core technologies for the future 5G communications, device-to-device (D2D) communication is known to be effective in enhancing spectrum efficiency and improving network throughput. While substantial progress has been made regarding D2D communications in various applications, most of the studies, however, focus on the single-hop D2D communication scenario, leaving the multi-hop D2D communication scenario inadequately investigated. Considering the multi-hop D2D communications are extremely useful in extending the communication range between two devices, and when D2D meets network coding, the potentials of both technologies can be fully unlocked, in this article, we present a tutorial case study on the long-distance D2D communication protocol in which multi-hop data transmissions are enhanced by network coding. We investigate four representative scenarios experimentally to demonstrate the performance gain of applying network coding to D2D communications. Our intention is to provide an in-depth study showing how network coding can be essentially beneficial to multi-hop D2D communications, and to encourage additional research in this area forthcoming. © 2017 Association for Computing Machinery.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Efficient data uploading based on network coding in LTE-Advanced heterogeneous networks 19

Efficient data uploading based on network coding in LTE-Adva...

引用

19th International Conference on Advanced Communications Technology, ICACT 2017

作者： Chau, Phuc Bui, Toan Duc Lee, Yongwoo Shin, Jitae School of Electronic Electrical Engineering Sungkyunkwan University Suwon Korea Republic of

ISBN: (纸本)9788996865094

LTE-Advanced heterogeneous networks enable a uniform broadband experience to users flexibly anywhere in the network by using a mix of large and small cells - i.e., macro, pico, femto and relay stations. In this paper, we propose a novel network coding-based for mobile content uploading, where multiple user equipments upload their own content toward the eNodeB in LTE-Advanced relay networks. network coding has been considered as a promising solution in next generation networks because of the significant improvement in the transmission rate and reliability. The network coding enables an intermediate node having the capability of encoding incoming packets rather than simply forwarding. However, the advantages come at the cost of high computational, storage costs and coding vector overhead. The two former drawbacks can be solved easily by the fast development of current smart users and relay with high capability on computation and storage. The last issue of coding vector overhead still remains as many packets are encoded together using a linear combination since each packet needs to carry a large size of the header to store the information of the coding vector. We propose random overlapped chunked code for enhancing the transmission rate and reliability under the constraint of coding vector overhead. Furthermore, the encoding and decoding processes can be operated with low complexity. The complete transmission consists of two phases: users upload the content to the relay;the relay performs the proposed random overlapped chunked code of different coming streams from users and forwards the network-coded packets to the eNodeB. For performance evaluation, we run various simulations along with analysis to show that our proposal outperforms current schemes in terms of decoding probability. © 2017 Global IT Research Institute - GiRI.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Joint delay and energy minimization for Wireless Sensor networks using instantly decodable network coding

Joint delay and energy minimization for Wireless Sensor Netw...

引用

2017 International Conference on Internet of Things, Embedded Systems and Communications, IINTEC 2017

作者： Zayene, Mariem Habachi, Oussama Meghdadi, Vahid Ezzeddine, Tahar Cances, Jean-Pierre Tunisia University of Limoges XLIM Limoges France

ISBN: (纸本)9781538621134

Most of Wireless Sensor networks (WSNs) are usually deployed in hostile environments where the communications conditions are not stable and not reliable. Hence, there is a need to design an effective distributed schemes to enable the sensors cooperating in order to recover the sensed data. In this paper, we establish a novel cooperative data exchange (CDE) scheme using instantly decodable network coding (IDNC) across the sensor nodes. We model the problem using the cooperative game theory in partition form. We develop also a distributed merge-and-split algorithm in order to form dynamically coalitions that maximize their utilities in terms of both energy consumption and IDNC delay experienced by all sensors. Indeed, the proposed algorithm enables these sensors to self-organize into stable clustered network structure where all sensors do not have incentives to change the cluster he is part of. Simulation results show that our cooperative scheme allows nodes not only to reduce the energy consumption, but also the IDNC completion time. © 2017 IEEE.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Role of intermediate nodes in Sparse network coding: Characterization and practical recoding 23

Role of intermediate nodes in Sparse Network Coding: Charact...

引用

23rd European Wireless Conference, EW 2017

作者： Garrido, Pablo Lucani, Daniel E. Agüero, Ramón Dept. of Communications Engineering University of Cantabria Santander39005 Spain Dept. of Engineering Aarhus University Aarhus8200 Denmark

ISBN: (纸本)9783800744268

Random Linear network coding (RLNC) has been proved to deliver improved performance in multicast sessions and robustness against packet losses over error-prone networks. One of its most relevant characteristics is that it allows intermediate nodes to recombine incoming data packets, the so-called recoding. Nevertheless, the computational resources required to decode the information has been questioned as one potential drawback of RLNC. Tunable Sparse network coding (TSNC) is a promising concept, which yields a trade-off between computational complexity and network performance. Although a limited TSNC recoding approach was proposed for smart grid applications, delivering a universal, practical and efficient algorithm for TSNC recoding remains elusive. This is critical to maintain the level of sparsity of the code end-to-end, which is crucial to attain the reduction in computational complexity promised by TSNC. In this paper we start by thoroughly characterizing the status at intermediate nodes, in order to better understand the possibilities of generating recoded packets of a given density. Based on this characterization and on the reduced echelon form of the decoding matrix, we propose an algorithm that provides a good trade-off between performance and computational complexity. A simulation-based study is carried out to assess the behavior of the proposed scheme, comparing it with other alternative solutions. © VDE VERLAG GMBH · Berlin · Offenbach.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

network Orchestrated coding: A Practical Way to Excavate the network Transmission Capability 18

Network Orchestrated Coding: A Practical Way to Excavate the...

引用

18th IEEE International Conference on Communication Technology (IEEE ICCT)

作者： Wei, Yunkai Tao, Yue Liu, Daogui Univ Elect Sci & Technol China Sch Informat & Commun Engn Chengdu Sichuan Peoples R China

ISBN: (纸本)9781538676356

The tremendous developing of network applications brings increasingly greater data transmission pressure to current networks. To address this problem and fully utilize the network transmission capability, this paper puts forward a new scheme named network Orchestrated coding (NOC), which combines and extends the advantages of network coding (NC), Software Defined networking (SDN) and network Function Virtualization (NFV). Taking the whole network as an integrated information transferring space, NOC can realize the joint optimal orchestration among traffic, topology, and coding schemes, and therefore achieve much more efficient utilization of the network capacity than current schemes. To demonstrate this idea in practice, we simply apply NOC in a multicast environment, where a network Orchestrated coding Node Selection (NOCNS) algorithm is put forward to achieve better multicast data rate with minimum coding nodes. Comparing with traditional NC network and noneNC network, the simulations verify that NOC could effectively reduce coding nodes, promote the throughput of network, and decrease the computing overhead.

关键词： network coding software defined networking network function virtualization network orchestrated coding

来源：评论

学校读者我要写书评

暂无评论

network-coding solutions for minimal combination networks and their sub-networks

arXiv

引用

arXiv 2019年

作者： Cai, Han Chrisnata, Johan Etzion, Tuvi Schwartz, Moshe Wachter-Zeh, Antonia School of Electrical and Computer Engineering Ben-Gurion University of the Negev Beer Sheva8410501 Israel School of Physical and Mathematical Sciences Nanyang Technological University Singapore Department of Computer Science Technion - Israel Institute of Technology Haifa3200003 Israel Institute for Communications Engineering Technical University of Munich Munich80333 Germany

Minimal multicast networks are fascinating and efficient combinatorial objects, where the removal of a single link makes it impossible for all receivers to obtain all messages. We study the structure of such networks, and prove some constraints on their possible solutions. We then focus on the combination network, which is one of the simplest and most insightful network in network-coding theory. Of particular interest are minimal combination networks. We study the gap in alphabet size between vector-linear and scalarlinear network-coding solutions for such minimal combination networks and some of their sub-networks. For minimal multicast networks with two source messages we find the maximum possible gap. We define and study subnetworks of the combination network, which we call Kneser networks, and prove that they attain the upper bound on the gap with equality. We also prove that the study of this gap may be limited to the study of sub-networks of minimal combination networks, by using graph homomorphisms connected with the q-analog of Kneser graphs. Additionally, we prove a gap for minimal multicast networks with three or more source messages by studying Kneser networks. Finally, an upper bound on the gap for full minimal combination networks shows nearly no gap, or none in some cases. This is obtained using an MDS-like bound for subspaces over a finite field. Copyright © 2019, The Authors. All rights reserved.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

network coding for Distributed Quantum Computation Over Cluster and Butterfly networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第11期62卷 6620-6637页

作者： Akibue, Seiseki Murao, Mio Univ Tokyo Grad Sch Sci Tokyo 1130033 Japan NTT Corp NTT Commun Sci Labs Atsugi Kanagawa 2430198 Japan Univ Tokyo NanoQuine Tokyo 1130033 Japan

To apply network coding for quantum computation, we study the distributed implementation of unitary operations over all separated input and output nodes of quantum networks. We consider networks where quantum communication between nodes is restricted to sending a qubit, but classical communication is unrestricted. We analyze which N-qubit unitary operations are implementable over cluster networks by investigating transformations of a given cluster network into quantum circuits. We show that any two-qubit unitary operation is implementable over the butterfly network and the grail network, which are fundamental primitive networks for classical network coding. We also analyze probabilistic implementations of unitary operations over cluster networks.

关键词： Quantum computing network coding quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

network coding-Based Reliable IPv6 Packet Delivery Over IEEE 802.15.4 Wireless Personal Area networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2016年第4期65卷 2219-2230页

作者： Zhu, Yi-Hua Chi, Kaikai Tian, Xianzhong Leung, Victor C. M. Zhejiang Univ Technol Sch Comp Sci & Technol Hangzhou 310023 Zhejiang Peoples R China Univ British Columbia Dept Elect & Comp Engn Vancouver BC V6T 1Z4 Canada

Wireless personal area networks (WPANs) based on the IEEE 802.15.4 standard have been increasingly applied in vehicular and transportation-related applications. The 6LoWPAN protocol is used in delivering Internet Protocol version 6 (IPv6) packets over WPANs using the mesh-under routing (MUR) or route-over routing (ROR) mechanisms. When delivering an IPv6 packet over a multihop route consisting of unreliable links in a WPAN, the probability that the packet is successfully delivered at the destination, i.e., the packet delivery ratio (PDR), via MUR or ROR can be very small. This paper proposes the Reliable IPv6 Packet Delivery Scheme (RIPDS), which overcomes the aforementioned problem and considerably improves the PDR. RIPDS achieves a high PDR by use of network coding to encode the fragments of an IPv6 packet into multiple encoded packets, such that, regardless of the loss of some encoded packets, the original fragments and the original IPv6 packet can be still recovered by the node that receives some other encoded packets. The PDR and end-to-end packet latency under RIPDS, MUR, the controlled MUR (CtrMUR), and ROR are derived. Simulation results show that the proposed RIPDS outperforms the existing routing schemes such as ROR, MUR, and the CtrMUR, both in PDR and packet latency.

关键词： Internet Protocol version 6 (IPv6) network coding reliable packet delivery vehicle ad hoc network wireless personal area network (WPAN) 6LoWPAN

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：