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

TCPJGNC: A transport control protocol based on network coding for multi-hop cognitive radio networks

COMPUTER COMMUNICATIONS 2016年 79卷 9-21页

作者： Qin, Yang Zhong, Xiaoxiong Yang, Yuanyuan Li, Li Wu, Fangshan Harbin Inst Technol Shenzhen Grad Sch Key Lab Network Oriented Intelligent Computat Shenzhen 518055 Peoples R China Guilin Univ Elect Technol Sch Comp Sci & Engn Guilin 541004 Peoples R China SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

Cognitive radio (CR) has emerged as a promising solution to enhance spectrum utilization. In cognitive radio networks (CRNs), the secondary users (SUs) can opportunistically exploit frequency bands when the primary users (PUs) do not occupy the bands. However, TCP performance in CRNs may suffer from significant degradation due to this feature. In this paper, we investigate the limitations of TCP in multi-channel multi-radio multi-hop CRNs, and propose a novel transmission control protocol called TCPJGNC (TCP Joint Generation network coding, JGNC) based on network coding. In TCPJGNC, we dynamically adjust the number of packets involved in network coding according to the wireless communication environment to achieve better decoding probability. In the meantime, a coding scheme based on JGNC is provided which can reduce the number of retransmissions in TCPJGNC. In addition, we modify the TCP mechanism to fit into CRNs by considering the features of CRNs. An analysis of approximate expected throughput in TCPJGNC is provided and the simulation results indicate that TCPJGNC can significantly improve the network performance in terms of throughput, bandwidth efficiency and average end-to-end delay. To the best of our knowledge, TCPJGNC is the first transmission control protocol for multi-hop CRNs from a network coding perspective. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Cognitive radio networks TCP network coding

来源：评论

学校读者我要写书评

暂无评论

When are network coding based dynamic multi-homing techniques beneficial?

引用

COMPUTER networkS 2016年 108卷 55-65页

作者： Pereira, Carlos Aguiar, Ana Lucani, Daniel E. Univ Porto Inst Telecomunicacoes Oporto Portugal Aalborg Univ Dept Elect Syst Aalborg Denmark

Mechanisms that can cope with unreliable wireless channels in an efficient manner are required due to the increasing number of resource constrained devices. Concurrent use of multiple communications technologies can be instrumental towards improving services to mobile devices in heterogeneous networks. In our previous work, we developed an optimization framework to generate channel-aware transmission policies for multi-homed devices under different cost criteria. Our formulation considers network coding as a key technique that simplifies load allocation across multiple channels and provides high resiliency under time-varying channel conditions. This paper seeks to explore the parameter space and identify the operating regions where dynamic coded policies offer most improvement over static ones in terms of energy consumption and channel utilization. We leverage meta-heuristics to find different local optima, while also tracking the intermediate solutions to map operating regions above 3 dB and 5 dB. Our results show a large set of relevant configurations where high resource efficiency can be obtained with the proposed transmission mechanisms. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Multi-homing network coding Wireless networks Time-varying channels Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-Efficient Packet Scheduling for Live Streaming With network coding

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2016年第4期18卷 752-763页

作者： Huang, Shenglan Izquierdo, Ebroul Hao, Pengwei Univ London Elect Engn & Comp Sci London E1 4NS England

network coding (NC) brings substantial improvements in terms of throughput and delay in collaborative media streaming applications. A key aspect of NC-driven live peer-to-peer streaming is the packet scheduling policy. Indeed, lack of synchronization among peers usually results in significantly redundant packet transmission, which in turn leads to severe bandwidth inefficiencies. In this paper, we address the problem of finding a suitable asynchronous packet scheduling policy that greatly helps to overcome this critical redundant transmission problem. We propose a bandwidth cost minimization technique under a full video packet recovery constraint. In order to add scalability and improved performance, we also further derive a distributed packet scheduling algorithm. Both implementation and analytical considerations of the proposed approaches are described in this paper. Experimental results confirm that the proposed algorithms deliver higher bandwidth efficiency with reduced redundancy and communication overhead rate and, consequently, better quality-of-service in terms of improved video quality and delivery ratio.

关键词： Distributed scheduling live broadcasting network coding peer-to-peer TV systems

来源：评论

学校读者我要写书评

暂无评论

Power saving mechanism with network coding in the bottleneck zone of multimedia sensor networks

引用

COMPUTER networkS 2016年 96卷 58-68页

作者： Lee, Kyu-Hwan Kim, Jae-Hyun Cho, Sunghyun Ajou Univ Dept Elect & Comp Engn Suwon 441749 South Korea Hanyang Univ Dept Comp Sci & Engn Ansan South Korea

Power consumption is one of the most important issues for the lifetime of a wireless sensor network (WSN). Specifically, the lifetime of a WSN depends on the power consumption of the nodes in the bottleneck zone near each sink node, where all sensing data is collected via the nodes in the bottleneck. However, these nodes' energy is depleted very quickly because of the heavy traffic imposed on them. Therefore, in this paper, we propose a power saving mechanism using network coding and duty cycling in the bottleneck zone of WSNs to prolong the lifetime of WSNs. We propose duty cycling, packet forwarding, and role switching schemes for nodes in the bottleneck zone. In our proposed approach, the packet forwarding in the coder nodes employs random linear network coding to enhance energy efficiency and reliability in the bottleneck zone. We evaluate the performance to show that the proposed protocol outperforms the conventional system in terms of the lifetime of WSNs, without reducing the reliability of packet delivery in the bottleneck zone. In a grid topology network, the lifetime achieved with the proposed protocol is doubled or tripled compared with the conventional system. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks network coding Duty cycling Bottleneck zone

来源：评论

学校读者我要写书评

暂无评论

Rate-distortion-optimized multi-view streaming in wireless environment using network coding

引用

EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING 2016年第1期2016卷 1-20页

作者： Greco, Claudio Nemoianu, Irina D. Cagnazzo, Marco Pesquet-Popescu, Beatrice DxO Paris France I3S CNRS UNSA Sophia Antipolis France Univ Paris Saclay Telecom ParisTech CNRS LTCI F-75013 Paris France

Multi-view video streaming is an emerging video paradigm that enables new interactive services, such as 3D video, free viewpoint television, and immersive teleconferencing. Because of the high bandwidth cost they come with, multi-view streaming applications can greatly benefit from the use of network coding, in particular in transmission scenarios such as wireless network, where the channels have limited capacity and are affected by losses. In this paper, we address the topic of cooperative streaming of multi-view video content, wherein users who recently acquired the content can contribute parts of it to their neighbors by providing linear combinations of the video packets. We propose a novel method for selection and network encoding of the transmitted frames based on the users' preferences for the different views and the rate-distortion properties of the stream. Using network coding enables the users to retrieve the content in a faster and more reliable manner and without the need for coordination among the senders. Our experimental results prove that our preference-based approach provides a high-quality decoding even when the uplink capacity of each node is only a small fraction of the rate of the stream.

关键词： Multi-view video coding network coding Video streaming

来源：评论

学校读者我要写书评

暂无评论

Differential space-time network coding in MIMO two-way relay channel network

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2016年第3期29卷 553-566页

作者： Jin, Xiaoping Han, Xinqiang Jin, Ning Li, Youming Li, Zhengquan Wang, Xiuming Ningbo Univ Inst Commun Technol Ningbo 315211 Zhejiang Peoples R China Southeast Univ Sch Informat Sci & Engn Nanjing 210096 Jiangsu Peoples R China China Jiliang Univ Dept Informat Engn Hangzhou 310018 Zhejiang Peoples R China

This paper focuses on noncoherent detection scheme for multiple-input multiple-output two-way relay channel network with two two-antennas source nodes and one single-antenna relay node. An orthogonal differential space-time network coding (ODSTNC) scheme based on relay detection and forward protocol is proposed. The proposed scheme combines space-time coding with network coding, and the differential modulation and detection are used in both multiple access stage and broadcast stage. The multiplesymbol differential detection is employed at the relay. The maximum likelihood decision and its low-complexity sphere decoding decision are given. The upper and lower bounds on the average symbol error probability for this system under differential binary phase shift keying (DBPSK) are derived, and a diversity order of 2 is confirmed to be achieved. The simulation results show that the ODSTNC scheme has good performance, and it is available for the applications of far distance signal transmission between two terminals where channel state information is unknown. Copyright (c) 2014 John Wiley & Sons, Ltd.

关键词： differential detection space-time coding network coding two-way relay channel network symbol error probability

来源：评论

学校读者我要写书评

暂无评论

Using network coding to achieve the capacity of deterministic relay networks with relay messages

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2016年第15期16卷 2390-2405页

作者： Zewail, Ahmed A. Mohasseb, Yahya Nafie, Mohammed El Gamal, Hesham Nile Univ WINC Giza Egypt Penn State Univ Dept Elect Engn University Pk PA 16802 USA Mil Tech Coll Dept Commun Cairo 11331 Egypt Cairo Univ Dept Elect & Commun Giza Egypt Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA

In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network that consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a relay as it may exchange private messages with the other network nodes. First, we develop an upper bound on the capacity region based on the notion of a single-sided genie. In the course of the achievability proof, we also derive the deterministic capacity of a four-user relay network (without private messages at the relay). The capacity achieving schemes use a combination of two network coding techniques: the simple ordering scheme and detour scheme. In the simple ordering scheme, we order the transmitted bits at each user such that the bi-directional messages will be received at the same channel level at the relay, while the basic idea behind the detour scheme is that some parts of the message follow an indirect paths to their respective destinations. This paper, therefore, serves to show that user cooperation and network coding can enhance throughput, even when the users are not directly connected to each other. Finally, we make a conjecture about the capacity region of the general K-node relay network with relay messages. Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： network coding deterministic relay networks capacity of relay networks bi-directional relay networks

来源：评论

学校读者我要写书评

暂无评论

Multipath network coding and multicasting for content sharing in wireless P2P networks: A potential game approach

引用

COMPUTER COMMUNICATIONS 2016年 96卷 17-28页

作者： Li, Dapeng Zhao, Haitao Tian, Feng Bo, Huang Xu, Youyun Zhang, Guanglin Nanjing Univ Posts & Telecommun Coll Telecommun & Informat Engn Nanjing Jiangsu Peoples R China Donghua Univ Dept Commun & Elect Engn Shanghai Peoples R China

Motivated by the popularity of the peer to peer (P2P) content sharing over internet and the development of wireless device to device (D2D) communications, this paper considers the problem of delivering K different contents to D destinations from N sources in wireless networks. Traffic in opposite directions over two wireless hops can utilize the advantage of network coding (NC) in order to decrease the number of transmissions used. We call such coded hops as "NC-links". On the other hand, the multicast (MC) links can transmit data to several nodes at the same time, also yielding the improvement of the transmissions efficiency. However, there exists a certain level of ambiguity regarding how to coordinate NC and MC to improve the file sharing performance in wireless P2P content distribution systems. Considering both NC and MC gains, we investigate the content traffic splitting using a potential game model. Subsequently, we identify the equilibrium solution to this game and develop a two-level distributed control algorithm that allows each destination to select the source and split the traffic so as to adjust the content traffic based on the potential function in a distributed way. Through theoretical analysis and simulation results, we show that the proposed scheme is stable and effective. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Wireless P2P networks D2D communications Content sharing network coding Multicasting Potential game Dynamic control

来源：评论

学校读者我要写书评

暂无评论

A reliable data transmission scheme based on compressed sensing and network coding for multi-hop-relay wireless sensor networks

引用

COMPUTERS & ELECTRICAL ENGINEERING 2016年 56卷 366-384页

作者： Yin, Jun Yang, Yuwang Wang, Lei Yan, Xiaoyong Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China Nangjing Univ Posts & Telecommun Sch Comp Sci & Technol Sch Software Nanjing Jiangsu Peoples R China Southeast Univ Sch Instrument Sci & Engn Nanjing Jiangsu Peoples R China

The joint multipath routing, and network coding (NC) method has been shown to improve the reliability and energy efficiency of multi-hop-relay wireless sensor networks (WSNs). However, NC is a kind of "all-or-nothing" code: the destination node cannot decode any information unless it successfully receives as many NC coded packets as the raw ones. Observed that WSNs often measure physical signals which show a high degree of correlation, in this paper, we propose a more deliberated scheme combined with Compressed Sensing (CS). Depending on the proposed measurement and recovery method, we prove that the original data can be recovered progressively while preserving the advantage of NC-based scheme. Detailed mathematical analysis of the performance of our proposed scheme along with other existing schemes is given. The experimental results also show the efficiency and robustness of the proposed scheme. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Compressed sensing Multipath routing network coding Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

I2CC: Interleaving two-level cache with network coding in peer-to-peer VoD system

引用

JOURNAL OF network AND COMPUTER APPLICATIONS 2016年 60卷 180-191页

作者： Kao, Hui-Hsiang Lee, Chung-Nan Kao, Yung-Cheng Wu, Peng-Jung Natl Sun Yat Sen Univ Dept Comp Sci & Engn Kaohsiung 80424 Taiwan Ind Technol Res Inst Informat & Commun Res Labs Hsinchu Taiwan Iveda Solut Inc Mesa AZ USA

As video technologies have advanced, peer-to-peer video-on-demand services have increasingly proliferated. In this paper, an interleaving two-level cache with network coding (I2CC) scheme is proposed to provide rapid content searching and efficiently support random seeking with the dynamic nature of peers. In I2CC, a video segment is composed of chunks, and each chunk is divided into blocks. These blocks are encoded by a network coding technique and distributed to different peers for storage in a local two-level cache, which includes a prefix cache and suffix cache. The prefix cache helps achieve rapid parent peer searching, low startup delays, and quick responses for jump operations. The suffix cache primarily provides a scalable cache size adjustment based on the limited storage space of peers. Additionally, enhancement and compensation mechanisms are provided to reduce playback delay and more efficiently utilize limited uploading bandwidth. We also present an analytical model for determining appropriate system parameters to reduce the chunk loss probability. Experimental results show that the proposed I2CC scheme outperforms competing schemes in terms of startup delay, jump delay, and server stress under different peer arrival times and video bitrates. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Caching strategy network coding Peer-to-peer Video-on-demand

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：