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

Energy Minimization With network coding via Latin Hypercubes

IEEE SYSTEMS JOURNAL 2017年第2期11卷 696-705页

作者： Kocaoglu, Murat Akan, Ozgur B. Koc Univ Dept Elect & Elect Engn Next Generat & Wireless Commun Lab TR-34450 Istanbul Turkey Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

network coding is mostly used to achieve the capacity of communication networks. In this paper, motivated by the nanoscale communications where the energy cost for the channel symbols is asymmetric due to the widely employed on-off keying modulation, we design energy-minimizing network codes. We develop the best mapping between the input and output symbols at the network coding node that minimizes the average codeword energy using Latin squares, which we call the minimum energy network code (MENC). We define the class of networks composed of coding nodes with N incoming and 1 outgoing symbols as in-N networks. First, we derive the condition on the network code to minimize the average energy in in-two networks and propose two linear MENCs. Later, we investigate the MENCs for in-N networks using the Latin hypercubes and propose a low-energy network code (LENC) to reduce the average energy with network coding. We compare MENC with the classical XOR and random network codes for in-two networks. The performance comparison between LENC and random network codes for in-N networks shows that the proposed network codes provide significant energy gains.

关键词： Energy-efficient network codes green communications Latin squares minimum energy coding (MEC) network coding

来源：评论

学校读者我要写书评

暂无评论

Outage performance of a network coding aided multi-user cooperative secondary network

引用

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2017年第2期28卷 1-11页

作者： Mafra, S. B. Souza, R. D. Rebelatto, J. L. Brante, G. Rayel, O. K. UTFPR CPGEI BR-80230901 Curitiba Parana Brazil

We evaluate the performance of a network-coded cooperative secondary network in a cognitive radio system under spectrum sharing constraints. The secondary network is composed of multiple sources that cooperate to transmit their own information to a common secondary destination. The outage probability is analysed under a given maximum interference constraint set by the primary network as well as to the maximum transmit power limit of the secondary sources. Moreover, we also obtain a closed-form equation for the epsilon-outage capacity, that is, the maximum information rate achieved by the secondary sources given a target outage probability. Also, we resort to the Dinkelbach algorithm in order to find the optimum number of parity packets that maximises the epsilon-outage capacity. The influence of the number of source nodes and another system parameters in the secondary's performance is also evaluated, and we show through theoretical and numerical results that cooperative communication with network coding can provide significant gains in terms of outage probability and diversity order when compared with non-cooperative or traditional cooperative. Copyright (C) 2015 John Wiley & Sons, Ltd.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

network coding based Secure and Efficient Traffic Flow in Heterogeneous Cloud Radio Access network 2

Network Coding based Secure and Efficient Traffic Flow in He...

引用

2nd IEEE International Conference on Wireless Communications, Signal Processing and networking (WiSPNET)

作者： Dong, Dhawa Sang Khatri, Karishma Gachhadar, Anand Kathmandu Univ Sch Engn Dept Elect & Elect Engn Dhulikhel Nepal

ISBN: (纸本)9781509044429

Multipath data transmission using network coding scheme in heterogeneous wireless environment enhances information flows with optimal radio resource utility which addresses high traffic demands by end users in next generation wireless and secured traffic flows over the channels. Opportunistic channel allocation and scheduling technique in heterogeneous environment optimizes the traffic flows and network coding before forwarding towards destination significantly enhances the security level of traffics over the networks. This introduces optimal network throughput and minimizes the probability of data theft over multipath data flow architecture. With the availability of micro base stations (MBSs) and remote radio heads (RRHs), multipath traffic flows through MBSs and RRHs over high frequency channels or unlicensed channels increase network throughputs while network coded multicast over the available channels within Heterogeneous Cloud Radio Access networks (H-CRAN) ensures data security over the network. In this paper, network coding scheme was implemented in H-CRAN environment for multipath traffic flow and data security measures were enhanced using network coded transmission resulting increased network throughput, reduced congestion at input buffer of nodes and secured transmission.

关键词： network coding multipath traffic flows H-CRAN network information data security opportunistic channel allocation security constraints

来源：评论

学校读者我要写书评

暂无评论

Two-Way Incremental Relaying With Symbol-Based network coding: Performance Analysis and Optimal Thresholds

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第2期65卷 564-578页

作者： Bastami, Ali H. KN Toosi Univ Technol Dept Elect Engn Tehran *** Iran

In this paper, we investigate the signal-to-noise ratio-based incremental relaying scheme for a two-way relay channel (TWRC) with symbol-based network coding. Under the assumption of error propagation from the relay to the destination, we analyze the performance of the system in terms of the end-to-end symbol error rate (SER), the average spectral efficiency (ASE), the outage probability, the asymptotic behavior, and the diversity order for M-ary phase-shift keying modulation. All of these performance measures depend on a single threshold employed by the destination. By optimizing this threshold with respect to two different performance measures, we attain two different incremental relaying schemes: 1) the SER-optimal scheme that minimizes the end-to-end SER and 2) the ASE-constrained scheme that minimizes the end-to-end SER under an ASE constraint for the TWRC. In all cases, we derive closed-form expressions for the performance measures and the optimal thresholds. The asymptotic analysis of the system shows that both the SER-optimal and ASE-constrained schemes achieve the full diversity gain at both transceivers. Moreover, both of the schemes are optimal in the sense of the asymptotic ASE. We also propose a class of thresholds that are independent of the network geometry and asymptotically perform the same as the optimal thresholds.

关键词： Bidirectional relaying cooperative diversity error propagation incremental relaying network coding spectral efficiency two-way relay channel

来源：评论

学校读者我要写书评

暂无评论

To-send-or-not-to-send: An optimal stopping approach to network coding in multi-hop wireless networks

引用

INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS 2018年第2期31卷 1-1页

作者： Javan, Nastooh Taheri Sabaei, Masoud Dehghan, Mehdi Amirkabir Univ Technol Comp Engn & Informat Technol Dept Tehran Polytech Tehran Iran

network coding is all about combining a variety of packets and forwarding as much packets as possible in each transmission operation. The network coding technique improves the throughput efficiency of multi-hop wireless networks by taking advantage of the broadcast nature of wireless channels. However, there are some scenarios where the coding cannot be exploited due to the stochastic nature of the packet arrival process in the network. In these cases, the coding node faces 2 critical choices: forwarding the packet towards the destination without coding, thereby sacrificing the advantage of network coding, or waiting for a while until a coding opportunity arises for the packets. Current research works have addressed this challenge for the case of a simple and restricted scheme called reverse carpooling where it is assumed that 2 flows with opposite directions arrive at the coding node. In this paper, the issue is explored in a general sense based on the COPE architecture requiring no assumption about flows in multi-hop wireless networks. In particular, we address this sequential decision making problem by using the solid framework of optimal stopping theory and derive the optimal stopping rule for the coding node to choose the optimal action to take, ie, to wait for more coding opportunity or to stop immediately (and send packet). Our simulation results validate the effectiveness of the derived optimal stopping rule and show that the proposed scheme outperforms existing methods in terms of network throughput and energy consumption.

关键词： coding opportunity multi-hop wireless networks network coding optimal stopping theory

来源：评论

学校读者我要写书评

暂无评论

network coding Resources Optimization of coding-Link Cost Based on the Modified ant Colony Algorithm 3

Network Coding Resources Optimization of Coding-Link Cost Ba...

引用

3rd IEEE International Conference on Computer and Communications (ICCC)

作者： Zhuo, Xinjian Gao, Yuan Beijing Univ Posts & Telecommun Sch Sci Beijing Peoples R China

ISBN: (纸本)9781509063529

The network coding always brings additional resource consumption while it can make the network to achieve the required rate. It is necessary to minimize the resource consumption in the network while achieving the desired throughput. Most of the other papers consider the minimum number of encoding nodes or the minimum number of encoding links separately. Of course some papers consider trade-offs between coding and link cost, but the optimal choice for different trade-offs is not clear. This paper provides a heuristic judgment method to derive the optimal result on the selection. In this paper, the total value of the link cost and coding cost is treated as the only objective function, and the objective function is minimized based on the improved ant colony algorithm. The consideration of multi-source situation and the different value of different links is a new attempt.

关键词： multi-source network coding resources optimization ant colony algorithm

来源：评论

学校读者我要写书评

暂无评论

Adaptive packet scheduling for scalable video streaming with network coding

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2017年第Feb.期43卷 10-20页

作者： Huang, Shenglan Izquierdo, Ebroul Hao, Pengwei Queen Mary Univ London London England

Over the last decade, the emergence of new multimedia devices has motivated the research on efficient media streaming mechanisms that adapt to dynamic network conditions and heterogeneous devices' capabilities. network coding as a rateless code has been applied to collaborative media streaming applications and brings substantial improvements regarding throughput and delay. However, little attention has been given to the recoverability of encoded data, especially for the streaming with a strict deadline. This in turn leads to severe quality of experience. In this paper, we solve the unrecoverable transmission by proposing a multi-generation packet scheduling problem, which is treated as a video quality maximization problem and solved using dynamic programming algorithm. Experimental results confirm that the proposed algorithm brings better data recoverability and better quality of service in terms of video quality, delivery ratio, lower redundancy rate under different network sizes. Crown Copyright (C) 2016 Published by Elsevier Inc. All rights reserved.

关键词： network coding Scalable video streaming Live streaming P2P network

来源：评论

学校读者我要写书评

暂无评论

A Joint network coding and Device Association Design for Optimal Local Data Exchange in Fiber-Wireless Access network

引用

JOURNAL OF LIGHTWAVE TECHNOLOGY 2017年第11期35卷 2046-2062页

作者： Wang, Jin Lu, Kejie Wang, Jianping Qiao, Chunming Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Peoples R China Shanghai Univ Elect Power Coll Comp Sci & Technol Shanghai 200090 Peoples R China Univ Puerto Rico Dept Elect & Comp Engn Mayaguez PR 00682 USA City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14228 USA

For many emerging mobile broadband services and applications, the source and destination are located in the same local region. Consequently, it is very important to design access networks to facilitate efficient local data exchange. In the past few years, most existing studies focus on either the wired or wireless domains. In this paper, we aim to exploit both the wired and wireless domains. Specifically, we consider a fiber-wireless access network in which a passive optical network (PON), consisting of one optical line terminal and multiple optical network units (ONUs), connects densely deployed base stations. In such a scenario, we propose two novel access schemes to utilize both network coding and device association in the following two cases: each device can be associated with one ONU for uploading and downloading its data packets;and each device can be associated with two different ONUs for uploading and downloading its data packets, which are referred to as, the network coding design and symmetric device association (NCsDA) problem and the network coding design and asymmetric device association (NCaDA) problem, respectively. To understand the potentials of NCsDA, we first formulate a mixed integer non-linear programming to minimize the weighted number of packet transmissions (WNT), which is related to both the energy consumption and system capacity. We then theoretically analyze the tight upper bounds of the minimal WNT in the PON, which helps us to approximate the NCsDA problem by mixed integer linear programming. We also give theoretical analysis on the NCaDA problem and formulate it as a mixed integer linear programming. Next, we develop efficient algorithms based on linear programming relaxation and give network coding designs to solve the NCsDA problem and the NCaDA problem. To validate our design, we conduct extensive simulations, which demonstrate the impact of important network parameters and the promising potentials of the proposed NCsDA and NCaDA sch

关键词： Device association FiWi access network joint optimization network coding

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-Satisfied Multicast by Multiple Trees and network coding in Lossy MANETs

引用

IEEE SYSTEMS JOURNAL 2017年第2期11卷 1116-1127页

作者： Chen, Yu-Hsun Wu, Eric Hsiao-Kuang Chen, Gen-Huey Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 10617 Taiwan Natl Cent Univ Dept Comp Sci & Informat Engn Coll Elect Engn & Comp Sci Taoyuan 320 Taiwan

Wireless links are inherently lossy due to channel fading or interference. Previously, duplicate packets were transmitted on multiple routes of lossy mobile ad hoc networks (MANETs) to enhance reliability. In this paper, a multicast routing protocol that constructs multiple multicast trees and employs network coding is proposed for lossy MANETs, where each multicast tree can satisfy a predefined percentage of the bandwidth requirement. The proposed protocol can reduce the total bandwidth consumption while providing bandwidth guarantees to a requested flow and ongoing flows. As a consequence of employing network coding, no redundant packet is generated, and no scheduling algorithm for distributing packets among the multicast trees is needed. Simulation results show that the proposed protocol outperforms prior multicast routing protocols in terms of the receiving ratio, the admission ratio, and the total bandwidth consumption.

关键词： Bandwidth guarantee lossy mobile ad hoc network (MANET) multicast network coding quality of service (QoS)

来源：评论

学校读者我要写书评

暂无评论

CodeDrip: Improving data dissemination for wireless sensor networks with network coding

引用

AD HOC networkS 2017年 54卷 42-52页

作者： Ribeiro Junior, Nildo dos Santos Tavares, Rodrigo C. Vieira, Marcos A. M. Vieira, Luiz F. M. Gnawali, Omprakash Univ Fed Minas Gerais Belo Horizonte Belo Horizonte MG Brazil Univ Houston Dept Comp Sci Houston TX 77204 USA

network coding is a technique that combines packets in the network with the potential to mitigate packet lost. In wireless communication systems, traditionally, dropped packets are recovered using retransmissions. By combining packets using network coding, it is possible to recover the transmitted information without needing to retransmit all the lost packets to all the nodes. In this paper, we present a show-case that applying network coding to data dissemination for Wireless Sensor networks provides benefits even for small values. CodeDrip is a data dissemination protocol with network coding capability. Dissemination is typically used to query nodes, send commands, and reconfigure the network. CoeDrip utilizes network coding to improve energy efficiency, reliability, and speed of dissemination. While previous work in combining network coding and dissemination focused on bulk data dissemination, we optimize the design of CodeDrip for dissemination of small values. We perform extensive evaluation of CodeDrip on simulations and a large-scale testbed and compare against the implementations of Drip, DIP and DHV protocols. We evaluate with more than 350 physical sensor nodes. Results show that CodeDrip is faster, smaller and sends fewer messages than Drip, DHV and DIP protocols. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks network coding Dissemination protocol Experimental and prototype results

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：