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

Multi-way relay system with network coding in multi-spot beam satellite networks

WIRELESS networkS 2017年第1期23卷 205-217页

作者： Lee, Kyu-Hwan Kim, Jae-Hyun Ajou Univ Dept Elect & Comp Engn Suwon South Korea

In this paper, we consider a multi-way relay system with network coding (NC) in multi-spot beam satellite networks. In particular, we focus on multiparty video conferencing via a satellite. Our proposed protocol uses the multicasting routing information and number of video frame packets to generate coded packets. The proposed protocol ensures the reliable transmission of multicasting data for mobile users using the decoding error rate for the random linear network coding batch. To minimize the delay in the link layer, we propose a resource allocation scheme for multiparty video conferencing with NC in satellite communications. For the resource allocation, we use application information acquired by a performance enhancing proxy. The simulation results show that the achievable rate can be increased by the proposed protocol. The proposed protocol can also reduce the number of packet transmissions, resulting in the efficient usage of satellite radio resources. Furthermore, it is shown that the proposed protocol ensures the reliable transmission of multicasting data for mobile users by using resources saved by NC. The average peak signal-to-noise of the video streaming for mobile users is better than that of the conventional system. As a result, the visual quality of video streaming services is improved.

关键词： Multi-way relay Multiparty video conferencing network coding Satellite communication IP router in space

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds for External Memory Integer Sorting via network coding

引用

COMMUNICATIONS OF THE ACM 2020年第10期63卷 97-105页

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

Sorting extremely large datasets is a frequently occurring 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, 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, 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. 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 limitation, 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 (nonoblivious) Radix Sort algorithm. Indeed, going beyond obliviousness is highly nontrivial;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.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Cooperative network coding With MIMO Transmission in Wireless Decode-and-Forward Relay networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2010年第7期59卷 3577-3588页

作者： Peng, Mugen Liu, Hongmei Wang, Wenbo Chen, Hsiao-Hwa Beijing Univ Posts & Telecommun Key Lab Universal Wireless Commun Minist Educ Beijing 100876 Peoples R China Natl Cheng Kung Univ Dept Engn Sci Tainan 701 Taiwan

This paper proposes a cooperative network-coding (CNC) scheme for a dual-hop decode-and-forward (DF) multiple-input-multiple-output (MIMO) system, which consists of multiple source stations (SSs), one relay station (RS), and one base station (BS). Both the RS and the BS use multiple antennas, whereas the SS has only one antenna. Through a MIMO configuration between the RS and the BS, a cooperative network coded DF (CNC-DF) relay protocol is proposed to transmit the composite data flows from multiple SSs via the RS to the BS simultaneously to reduce delay and to provide network-coded cooperation gain. To demonstrate its effectiveness, CNC-DF is compared with time-division multiple-access (TDMA) DF and orthogonal space-time coded (OSTC) DF protocols. The ergodic capacity and outage probability for these three protocols are explicitly derived, showing that the proposed CNC-DF scheme can significantly improve the performance, which is closely related to the minimum of the numbers of SSs and the numbers of antennas used by the RS and the BS.

关键词： Cooperative relay ergodic capacity network coding outage probability

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of network coding with IEEE 802.11 DCF in Multi-Hop Wireless networks

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2018年第5期17卷 1148-1161页

作者： Kafaie, Somayeh Ahmed, Mohamed Hossam Chen, Yuanzhu Dobre, Octavia A. Mem Univ Fac Engn & Appl Sci Dept Elect & Comp Engn St John NF A1B 3X5 Canada Mem Univ Dept Comp Sci St John NF A1B 3X5 Canada

network coding is an effective idea to boost the capacity of wireless networks, and a variety of studies have explored its advantages in different scenarios. However, there is not much analytical study on throughput and end-to-end delay of network coding in multi-hop wireless networks considering the specifications of IEEE 802.11 Distributed Coordination Function. In this paper, we utilize queuing theory to propose an analytical framework for bidirectional unicast flows in multi-hop wireless mesh networks. We study the throughput and end-to-end delay of inter-flow network coding under the IEEE 802.11 standard with CSMA/CA random access and exponential back-off time considering clock freezing and virtual carrier sensing, and formulate several parameters such as the probability of successful transmission in terms of bit error rate and collision probability, waiting time of packets at nodes, and retransmission mechanism. Our model uses a multi-class queuing network with stable queues, where coded packets have a non-preemptive higher priority over native packets, and forwarding of native packets is not delayed if no coding opportunities are available. Finally, we use computer simulations to verify the accuracy of our analytical model.

关键词： Performance analysis network coding queuing networks IEEE 802.11 DCF multi-hop wireless networks

来源：评论

学校读者我要写书评

暂无评论

Prioritized Flow Optimization with Multi-Path and network coding Based Routing for Scalable Multirate Multicasting

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2011年第3期21卷 259-273页

作者： Zou, Junni Xiong, Hongkai Li, Chenglin Song, Li He, Zhihai Chen, Tsuhan Shanghai Univ Key Lab Special Fiber Opt & Opt Access Networks Sch Commun & Informat Engn Shanghai 200072 Peoples R China Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200030 Peoples R China Univ Missouri Dept Elect & Comp Engn Columbia MO 65211 USA Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

In this paper, we study performance optimization for scalable video coding and multicast over networks. Multi-path video streaming, network coding based routing, and network flow control are jointly optimized to maximize a network utility function defined over heterogeneous receivers. Content priority of video coding layers is considered during the flow routing to determine the optimal multicast paths and associated data rates for each layer. Our optimization scheme attempts to find content distribution meshes with minimum path costs for each video coding layer while satisfying the inter-layer dependency during scalable video coding. Based on primal decomposition and primal-dual analysis, we develop a decentralized algorithm with two optimization levels to solve the performance optimization problem. We also prove the stability and convergence of the proposed iterative algorithm using Lyapunov theories. Extensive experimental results demonstrate that the proposed algorithm not only achieves the max-flow throughput using network coding, but also provides better video quality with balanced layered access for heterogeneous receivers.

关键词： Multicast network coding resource allocation scalable video coding

来源：评论

学校读者我要写书评

暂无评论

On the capacity of network coding for random networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2005年第8期51卷 2878-2885页

作者： Ramamoorthy, A Shi, J Wesel, RD Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

We study the maximum flow possible between a single-source and multiple terminals in a weighted random graph (modeling a wired network) and a weighted random geometric graph (modeling an ad-hoc wireless network) using network coding. For the weighted random graph model, we show that the network coding capacity concentrates around the expected number of nearest neighbors of the source and the terminals. Specifically, for a network with a single source, l terminals, and n relay nodes such that the link capacities between any two nodes is independent and identically distributed (i.i.d.) similar to X, the maximum flow between the source and the terminals is approximately nE[X] with high probability. For the weighted random geometric graph model where two nodes are connected if they are within a certain distance of each other we show that with high probability the network coding capacity is greater than or equal to the expected number of nearest neighbors of the node with the least coverage area.

关键词： minimum cut multicast network coding random geometric graphs random graphs

来源：评论

学校读者我要写书评

暂无评论

Channel Assignment for Throughput Optimization in Multichannel Multiradio Wireless Mesh networks Using network coding

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2013年第1期12卷 118-135页

作者： Chieochan, Surachai Hossain, Ekram Univ Manitoba Dept Elect & Comp Engn Winnipeg MB R3T 5V6 Canada TRLabs Winnipeg MB R3T 6A8 Canada

Compared to single-hop networks such as WiFi, multihop infrastructure wireless mesh networks (WMNs) can potentially embrace the broadcast benefits of a wireless medium in a more flexible manner. Rather than being point-to-point, links in the WMNs may originate from a single node and reach more than one other node. Nodes located farther than a one-hop distance and overhearing such transmissions may opportunistically help relay packets for previous hops. This phenomenon is called opportunistic overhearing/listening. With multiple radios, a node can also improve its capacity by transmitting over multiple radios simultaneously using orthogonal channels. Capitalizing on these potential advantages requires effective routing and efficient mapping of channels to radios (channel assignment (CA)). While efficient channel assignment can greatly reduce interference from nearby transmitters, effective routing can potentially relieve congestion on paths to the infrastructure. Routing, however, requires that only packets pertaining to a particular connection be routed on a predetermined route. Random network coding (RNC) breaks this constraint by allowing nodes to randomly mix packets overheard so far before forwarding. A relay node thus only needs to know how many packets, and not which packets, it should send. We mathematically formulate the joint problem of random network coding, channel assignment, and broadcast link scheduling, taking into account opportunistic overhearing, the interference constraints, the coding constraints, the number of orthogonal channels, the number of radios per node, and fairness among unicast connections. Based on this formulation, we develop a suboptimal, auction-based solution for overall network throughput optimization. Performance evaluation results show that our algorithm can effectively exploit multiple radios and channels and can cope with fairness issues arising from auctions. Our algorithm also shows promising gains over traditional routing

关键词： Channel assignment multiradio multichannel wireless mesh networks network coding throughput optimization fairness

来源：评论

学校读者我要写书评

暂无评论

Anti-eavesdropping network coding Algorithm Based on T-N Threshold

引用

Chinese Journal of Electronics 2017年第2期26卷 372-376页

作者： LIU Jun YANG Jingyu CHENG Zijing WANG Mengyuan School of Information Science & Engineering Northeastern University The Department of Information Operation & Command Training NDU of PLA Beijing Institute of Satellite Information Engineering

Catering to the public nature of Ad hoc network in open channel and data communication being easily eavesdropped,this paper proposed an antieavesdropping algorithm which is based on network *** algorithm is based on the RSA signature algorithm introducing the timestamp and homomorphic mechanism to detect tampering and replay attacks,as the basis for calculating safety,being used as one of measurement indicators in router by node safety to establish t pieces of routing *** generates encoding vectors by introducing the random number when the source node is encoded and the random number will be divided into n *** long as the sink node receives t pieces of fragments,we can restore the original encoding vector and decode *** the eavesdropper wiretaps are less than t,they can not get any meaningful *** is designed for increasing the number of linearly independent coded *** can improve the decoding efficiency by adopting generational grouping strategy while being *** and theoretical analysis shows that the anti-eavesdropping algorithm based on network coding improves network performance and security by coding gain.

关键词： Ad hoc networks network coding Security Anti-eavesdropping forma ange

来源：评论

学校读者我要写书评

暂无评论

network coding Assisted Mobile-To-Mobile File Transfer

Network Coding Assisted Mobile-To-Mobile File Transfer

引用

Australasian Telecommunication networks and Applications Conference

作者： Popova, Larissa Schmidt, Armin Gerstacker, Wolfgang Koch, Wolfgang Univ Erlangen Nurnberg Erlangen Germany

ISBN: (纸本)9781424415571

This paper is a sequel of previous work, in which we have studied the problem of congestions on the typically overloaded downlink channels in UMTS (Universal Mobile Telecommunication System) networks. Our concept is based on the uplink/downlink traffic imbalance in 3G wireless networks and is realized by organizing seamless cooperation between peer-to-peer and cellular networks using a unified radio interface for both systems. The primary goal is to improve the spectral efficiency of cellular networks by enabling direct mobile-to-mobile (m2m) communication on temporarily unused uplink channels for the distribution of a large popular content in a non-real time multicast manner. The aim of this work is to further improve the interaction between cellular and peer-to-peer networks by generalizing the traditional scheduling paradigm. A network coding technique is embedded as a solution to the scheduling problem in the distributed dynamic environment of wireless large-scale networks. We investigate the performance of the system in terms of dependability of information distribution among m2m users. Simulations demonstrate the enhanced performance of the Me distribution in terms of Me download time. Furthermore, the obtained results highlight that network coding based m2m data transfer allows distribution of popular files to a large number of users while placing minimal bandwidth requirements on the central server.

关键词： file transfers network coding Cellular networks Cellular communications radio interface Wireless networks spectral efficiency up link peer to peer Enabling

来源：评论

学校读者我要写书评

暂无评论

network coding in Military Wireless Ad Hoc and Sensor networks: Experimentation with GardiNet

Network Coding in Military Wireless Ad Hoc and Sensor Networ...

引用

International Conference on Military Communications and Information Systems (ICMCIS)

作者： Amdouni, Ichrak Adjih, Cedric Plesset, Thierry Inria Rocquencourt France DGA Bruz France

ISBN: (纸本)9788393484850

network coding is a communication paradigm that allows intermediate nodes to mix packets instead of simply relaying them. Motivated by applications in military tactical networks, this paper explores the use of the network coding. It has been proved that network coding has many benefits in wireless communications such as optimal capacity achievement and packet loss recovery. In this paper, we present a generic architecture for network coding for broadcast in wireless networks called GardiNet. GardiNet is generic;its design is divided into building blocks in order to enable it to adapt to different application scenarios. In this paper, we start by describing GardiNet for wireless ad hoc networks and in particular for wireless sensor networks (WSNs). Then, we present experiment results of GardiNet in FIT IoT-LAB, a real testbed of WSNs. Results show that network coding performs well under real wireless conditions. In addition, we highlight the benefit of the Sliding Encoding Window scheme of GardiNet (SEW) to allow sensors to decode packets in real time.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：