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

Peer-assisted video streaming based on network coding and Beer-Quiche game

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2017年 73卷 34-45页

作者： Mahini, Hamidreza Dehghan, Mehdi Navidi, Hamidreza Rahmani, Amir Masoud Islamic Azad Univ Dept Comp Engn Sci & Res Branch Tehran Iran Amirkabir Univ Technol Dept Comp Engn & Informat Technol Tehran Iran Shahed Univ Dept Math & Comp Sci Tehran Iran

This paper presents a novel peer-assisted video streaming based on game theory and network coding. Interactions between peers are modeled by a famous signaling game called Beer-Quiche. The Nash equilibrium analysis of the proposed game provides a reward and punishment mechanism which guarantees the free-riders failure and participation motivation. Due to using the game theory at design time, there is no additional complexity in the proposed method in contrast with many recent similar studies. Furthermore, it has avoided many inherent p2p system overheads such as frequent buffer mapping exchange between peers to obtain the necessary information about available chunks to other. The proposed scheme guarantees watching the video with minimum quality and eliminates the ability of peers to deny their own data. In order to create fairness, fine peers classification based on their action rating and request dispatch balancing are other achieved principles. The experimental results indicate that cooperative peers can receive 100% of base layer video chunks and get more than 99% of other high quality layers. Free-riders can not achieve more than 16% of video chunks even in the best case. Also, the sequel of low synergy is low received chunks in the proposed mechanism. (C) 2016 Elsevier GmbH. All rights reserved.

关键词： Peer-to-peer Video streaming Scalable video codec (SVC) network coding Game theory Beer-Quiche game

来源：评论

学校读者我要写书评

暂无评论

An Opportunistic network coding Routing for Opportunistic networks

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2017年第1期45卷 157-171页

作者： Yao, Jiansheng Ma, Chunguang Wu, Peng Du, Gang Yuan, Qi Harbin Engn Univ Coll Comp Sci & Technol Harbin 150001 Peoples R China Jilin Normal Univ Coll Comp Sci Siping 136000 Peoples R China

In opportunistic networks (OppNets), instead of assuming a complete path, messages are exchanged opportunistically when two nodes encounter. To support efficient and reliable end-to-end messaging in OppNets, a number of routing protocols based on network coding have been proposed. However, few efforts in the studies focus on opportunistic network coding (ONC). It is because the coding opportunities do not probably exist in OppNets due to nodal mobility, low density, lossy link, etc. In this paper, an ONC routing model for OppNets based on a new hybrid communication scheme was proposed. The communication scheme combines contact-based communication mode used by most routing protocols in OppNets and contact duration-based communication mode employed by few routing protocols in OppNets. We also designed an ONC routing protocol based on the ONC routing model in OppNets. Simulated results show that compared with Epidemic routing, the ONC routing can achieve higher delivery ratio and lower delay but consume fewer network cost.

关键词： Opportunistic networks Delay-tolerant networks network coding Opportunistic network coding

来源：评论

学校读者我要写书评

暂无评论

Feedback-Based Online network coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2017年第10期63卷 6628-6649页

作者： Sundararajan, Jay Kumar Shah, Devavrat Medard, Muriel Sadeghi, Parastoo MIT 77 Massachusetts Ave Cambridge MA 02139 USA Qualcomm Res San Diego CA 92121 USA MIT Dept Elect Engn & Comp Sci Cambridge MA 02139 USA Australian Natl Univ Canberra ACT 2601 Australia

Current approaches to the practical implementation of network coding are batch-based, and often do not use feedback, except possibly to signal completion of a file download. In this paper, the various benefits of using feedback in a network coded system are studied. It is shown that network coding can be performed in a completely online manner, without the need for batches or generations, and that such online operation does not affect the throughput. Although these ideas are presented in a single-hop packet erasure broadcast setting, they naturally extend to more general lossy networks, which employ network coding in the presence of feedback. The impact of feedback on sender-side queue size and receiver-side decoding delay is studied in an asymptotic sense as the traffic load approaches capacity. Different notions of decoding delay are considered, including an order-sensitive notion, which assumes that packets are useful only when delivered in order. Strategies for adaptive coding based on feedback are presented. Our scheme achieves throughput optimality and asymptotically optimal sender queue size and is conjectured to achieve asymptotically optimal in-order delivery delay for any number of receivers. This paper may be viewed as a natural extension of Automatic Repeat reQuest to coded networks.

关键词： ARQ decoding delay network coding

来源：评论

学校读者我要写书评

暂无评论

A Two-Level Game Theory Approach for Joint Relay Selection and Resource Allocation in network coding Assisted D2D Communications

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2017年第10期16卷 2697-2711页

作者： Gao, Chuhan Li, Yong Zhao, Yulei Chen, Sheng Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Univ Wisconsin Dept Elect & Comp Engn Madison WI 53706 USA Univ Southampton Dept Elect & Comp Sci Southampton SO17 1BJ Hants England King Abdulaziz Univ Jeddah 21589 Saudi Arabia

Device-to-device (D2D) communication, which enables direct transmissions between mobile devices to improve spectrum efficiency, is one of the preferable candidate technologies for the next generation cellular network. network coding, on the other hand, is widely used to improve throughput in ad hoc networks. Thus, the performance of D2D communications in cellular networks can potentially benefit from network coding. Aiming to improve the achievable capacity of D2D communications, we propose a system with inter-session network coding enabled to assist D2D transmissions. We formulate the joint problem of relay selection and resource allocation in network coding assisted D2D communications, and obtain the overall capacity of the network under complex interference conditions as a function of the relay selection and resource allocation. To solve the formulated problem, we propose a two-level decentralized approach termed NC-D2D, which solves the relay selection and resource allocation problems alternatively to obtain stable solutions for these two problems. Specifically, a coalition formation game associates relays with D2D pairs to enable network coding aided transmissions, and a greedy algorithm based game allocates limited cellular resources to D2D pairs and relays in NC-D2D, respectively. The performances of the proposed scheme is evaluated through extensive simulations to prove its superiority.

关键词： Device-to-device communication network coding relay selection resource allocation game theory

来源：评论

学校读者我要写书评

暂无评论

A hybrid EDA for load balancing in multicast with network coding

引用

APPLIED SOFT COMPUTING 2017年 59卷 363-377页

作者： Xing, Huanlai Li, Saifei Cui, Yunhe Yan, Lianshan Pan, Wei Qu, Rong Southwest Jiaotong Univ Sch Informat Sci & Technol Room 9439Teaching Bldg 9Xipu Campus Chengdu 611756 Sichuan Peoples R China Univ Nottingham Sch Comp Sci ASAP Grp Nottingham England

Load balancing is one of the most important issues in the practical deployment of multicast with network coding. However, this issue has received little research attention. This paper studies how traffic load of network coding based multicast (NCM) is disseminated in a communications network, with load balancing considered as an important factor. To this end, a hybridized estimation of distribution algorithm (EDA) is proposed, where two novel schemes are integrated into the population based incremental learning (PBIL) framework to strike a balance between exploration and exploitation, thus enhance the efficiency of the stochastic search. The first scheme is a bi-probability-vector coevolution scheme, where two probability vectors (PVs) evolve independently with periodical individual migration. This scheme can diversify the population and improve the global exploration in the search. The second scheme is a local search heuristic. It is based on the problem-specific domain knowledge and improves the NCM transmission plan at the expense of additional computational time. The heuristic can be utilized either as a local search operator to enhance the local exploitation during the evolutionary process, or as a follow-up operator to improve the best-so-far solutions found after the evolution. Experimental results show the effectiveness of the proposed algorithms against a number of existing evolutionary algorithms. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Estimation of distribution algorithm Load balancing Multicast network coding Population based incremental learning

来源：评论

学校读者我要写书评

暂无评论

Energy Saving With network coding Design Over Rayleigh Fading Channel

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2017年第7期16卷 4503-4518页

作者： Lin, Shijun Fu, Liqun Li, Yong Xiamen Univ Dept Commun Engn Xiamen 361000 Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China

In this paper, we investigate the energy minimization problem with and without network coding (NC) while satisfying the transmission rate requirements in a bidirectional cellular relay network, where a group of mobile users communicate with a base station across a relay node. In particular, we consider the Rayleigh fading channel model and adopt a comprehensive power consumption model in the radio frequency transmission. We show that the problem of minimizing the energy consumption of the bidirectional cellular relay network in NC and non-NC (NNC) schemes can be formulated as a unified sum of fractional programming problem, which is of high complexity to solve in general. Fortunately, we derive the sufficient condition under which the problem is a convex optimization problem, and thus can be solved quite efficiently. In the case that the energy minimizing problem is not convex, we decompose it into two subproblems, and propose an iterative algorithm to solve it. Simulation results show that in NNC and NC schemes, under all configurations of power parameters, the performance of the iterative algorithm is close to the exhaustive search method;but its running time is much shorter than the exhaustive search method. Furthermore, compared with the maximum power transmission policy, the iterative algorithm achieves a maximum energy reduction of 75%-82%. Last but not least, we compare the energy performance of NNC and NC schemes and discuss the effect of the iteration number and the relay node placement.

关键词： Energy conservation cellular relay network Rayleigh fading channel network coding

来源：评论

学校读者我要写书评

暂无评论

Active intersession network coding-aware routing

引用

WIRELESS networkS 2017年第4期23卷 1161-1168页

作者： Mei, Zhonghui Yang, Zhen Nanjing Univ Posts & Telecommun Coll Telecommun & Informat Engn Nanjing Jiangsu Peoples R China

coding-aware routing can create more coding opportunities by selecting the proper routing path. The main challenge in exploiting network coding is how to develop an effective network coding conditions. In this paper, we develop the active intersession network coding (AINC) which can create more intersession network coding opportunities than the general intersession network coding (GINC) by actively exploiting the redundancy information in the network with the deliberately built bridge links. With the aim to find multiple candidate parallel paths for each unicast, the conventional Bellman-Ford algorithm is enhanced. Built on AINC and the enhanced Bellman-Ford algorithm, we propose the active intersession network coding-aware routing (AINC-AR) scheme for the wireless network which supports multiple unicasts. The basic idea of AINC-AR is to select the path from all available candidate ones by jointly considering the effects of network coding gains and path costs on the overall network costs, so as to minimize the total network costs. Simulations are conducted to demonstrate the advantages of AINC-AR over GINC-AR and the conventional routing scheme without considering network coding.

关键词： network coding coding-aware routing Intersession network coding Unicast

来源：评论

学校读者我要写书评

暂无评论

QoS enhancement in space data communication: a network coding approach

引用

INTERNATIONAL JOURNAL OF ELECTRONICS 2017年第1期104卷 34-46页

作者： Liao, Yong Li, Yu-feng Shen, Xuan-fan Zhang, Shu-min Zhao, Ming Tan, Xiao-heng Chongqing Univ Key Lab Aerocraft Tracking Telemetering & Command Minist Educ Chongqing Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian Shaanxi Peoples R China Chongqing Univ Coll Commun Engn Chongqing Peoples R China

With the rapid increase of space applications, the amount of information to be transmitted between spacecrafts and ground stations increases exponentially and space-sky-ground Transport Control Protocol (TCP) network is highly demanded. However, the traditional TCP cannot be directly applied to space data communication. This article deeply studies the TCP/network coding (NC), which can effectively improve terrestrial wireless communication system throughput. Combined with characteristics of Space Communication Protocol Specification-Transport Protocol (SCPS-TP) and advantages of terrestrial TCP/NC, an improved protocol referred to as SCPS-TP/NC, is proposed for space data communication. This article provides detailed process of protocol design, mathematical modelling and throughput analysis of the proposed SCPS-TP/NC. Finally, we implement the SCPS-TP/NC protocol and evaluate its performance by network Simulator (Version 2). Simulation results show that SCPS-TP/NC can effectively increase the end-to-end system throughput, reduce the packet loss rate, shorten the transmission delay and improve the Quality of Service (QoS) of space data communication to a certain degree.

关键词： Integrated information network space communication protocol specification transport control protocol network coding quality of service

来源：评论

学校读者我要写书评

暂无评论

Reliable Physical-Layer network coding Supporting Real Applications

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2017年第8期16卷 2334-2350页

作者： You, Lizhao Liew, Soung Chang Lu, Lu Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China

This paper presents the first reliable physical-layer network coding (PNC) system that supports real TCP/IP applications for the two-way relay network (TWRN). Theoretically, PNC could boost the throughput of TWRN by a factor of 2 compared with traditional scheduling (TS) in the high signal-to-noise (SNR) regime. Although there have been many theoretical studies on PNC performance, there have been relatively few experimental and implementation efforts. Our earlier PNC prototype, built in 2012, was an offline system that processed signals offline. For a system that supports real applications, signals must be processed online in real-time. Our real-time reliable PNC prototype, referred to as RPNC, solves a number of key challenges to enable the support of real TCP/IP applications. The enabling components include: 1) a time-slotted system that achieves mu s-level synchronization for the PNC system;2) reduction of PNC signal processing complexity to meet real-time constraints;3) an ARQ design tailored for PNC to ensure reliable packet delivery;and 4) an interface to the application layer. We took on the challenge to implement all of the above with general-purpose processors in PC through an SDR platform rather than ASIC or FPGA. With all of these components, we have successfully demonstrated image exchange with TCP and two-party video conferencing with UDP over RPNC. Experimental results show that the achieved throughput approaches the PHY-layer data rate at high SNR, demonstrating the high efficiency of the RPNC system.

关键词： network coding physical-layer network coding two-way relay network implementation ARQ TCP/IP

来源：评论

学校读者我要写书评

暂无评论

FlexONC: Joint Cooperative Forwarding and network coding With Precise Encoding Conditions

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2017年第8期66卷 7262-7277页

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

In recent years, network coding has emerged as an innovative method that helps a wireless network approach its maximum capacity by combining multiple unicasts in one broadcast. However, the majority of research conducted in this area is yet to fully utilize the broadcasting nature of wireless networks and still assumes a fixed route between the source and destination that every packet should travel through. This assumption not only limits coding opportunities but can also cause buffer overflow in some specific intermediate nodes. Although some studies considered scattering of the flows dynamically in the network, they still face some limitations. This paper explains pros and cons of some prominent research in network coding and proposes a Flexible and Opportunistic network coding Scheme (FlexONC) as a solution to such issues. Furthermore, this research discovers that the conditions used in previous studies to combine packets of different flows are overly optimistic and would affect the network performance adversely. Therefore, we provide a more accurate set of rules for packet encoding. The experimental results show that FlexONC outperforms previous methods especially in networks with high bit error rate, by better utilizing redundant packets spread in the network.

关键词： coding conditions network coding opportunistic forwarding wireless mesh networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：