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

Outage behaviour and SCK-based power allocation for analogue network coding protocol in cooperative networks

IET COMMUNICATIONS 2018年第8期12卷 922-931页

作者： Zhan, Ao Ren, Zhu Wu, Chengyu Shi, Qingjiang Xu, Weiqiang Shi, Qiming Zhejiang Sci Tech Univ Dept Sch Informat Sci & Technol Hangzhou Zhejiang Peoples R China Ultra Mobile GroupIntel Corp Shanghai Peoples R China

In this study, the authors consider the communication scenario where two sources communicate with the help of a single relay, modelled as a half-duplex butterfly network. Closed-form expressions of the outage probabilities are derived in the high signal-to-noise ratio (SNR) regime for the orthogonal amplify-and-forward and non-orthogonal amplify-and-forward protocols. Then the expressions are approximated to enable power allocation. Closed-form power allocation schemes are proposed for each protocol, where only statistical channel knowledge is required. It is shown that the authors analyses match well with simulation results and the approximated versions are very close to the simulation results. The proposed power allocation schemes achieve a large SNR gain over the equal-power strategies and approach the optimal power allocation schemes.

关键词： cooperative communication network coding protocols relay networks (telecommunication) hypercube networks probability amplify and forward communication statistical analysis wireless channels SCK-based power allocation cooperative network analogue network coding protocol half-duplex butterfly network outage probability signal-to-noise ratio SNR orthogonal amplify-and-forward protocol nonorthogonal amplify-and-forward protocol closed-form power allocation scheme statistical channel knowledge

来源：评论

学校读者我要写书评

暂无评论

Linear network coding using channel quantization combining with SIC based estimation for multiple antenna systems

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2018年 95卷 107-117页

作者： Huu Minh Nguyen Xuan Nam Tran Van Bien Pham Cong Dinh Nguyen Le Quy Don Tech Univ Hanoi Vietnam Vietnam Peoples Army Broadcast Ctr Hanoi Vietnam

This paper proposes a network coding method with linear mapping and low-complexity estimation for the two-way relay non-reciprocal channel using the M-QAM modulation. The proposed network coding is developed by combining the channel quantization method and linear estimation based on successive interference cancellation. The effect of residual interference due to channel quantization on the signal decision is analyzed in detail in order to understand the system- behavior. Analytical and simulation results show that the proposed network coding method can achieve high SER performance and up-link throughput while requiring low computational complexity. (C) 2018 Elsevier GmbH. All rights reserved.

关键词： Maximum likelihood detection VBLAST Sorted VBLAST Two-way relay non-reciprocal channel network coding Physical-layer network coding Channel quantization Successive interference cancellation

来源：评论

学校读者我要写书评

暂无评论

Optimum Transmission Delay for Function Computation in NFV-Based networks: The Role of network coding and Redundant Computing

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2018年第10期36卷 2233-2245页

作者： Tahmasebi, Behrooz Maddah-Ali, Mohammad Ali Parsaeefard, Saeedeh Khalaj, Babak Hossein Sharif Univ Technol Dept Elect Engn Tehran *** Iran Iran Telecommun Res Ctr Dept Commun Technol Tehran *** Iran Inst Res Fundamental Sci IPM Sch Comp Sci Tehran *** Iran

In this paper, we study the problem of delay minimization in network function virtualization-based networks. In such systems, the ultimate goal of any request is to compute a sequence of functions in the network, where each function can be computed at only a specific subset of network nodes. In conventional approaches, for each function, we choose one node from the corresponding subset of the nodes to compute that function. In contrast, in this paper, we allow each function to be computed in more than one node, redundantly in parallel, to respond to a given request. We argue that such redundancy in computation not only improves the reliability of the network but also, perhaps surprisingly, reduces the overall transmission delay. In particular, we establish that by judiciously choosing the subset of nodes which compute each function, in conjunction with a linear network coding scheme to deliver the result of each computation, we can characterize and achieve the optimal end-to-end transmission delay. In addition, we show that using such technique, it is possible to significantly reduce the transmission delay as compared to the conventional approaches. In fact, in some scenarios, such reduction can even scale with the size of the network, where by increasing the number of nodes that can compute the given function in parallel by a multiplicative factor, the end-to-end delay will also decrease by the same factor. Moreover, we show that while finding the subset of nodes for each computation, in general, is a complex integer program, approximation algorithms can be proposed to reduce the computational complexity. In fact, for the case where the number of computing nodes for a given function is upper bounded by a constant, a dynamic programming scheme can be proposed to find the optimum subsets in polynomial times. Our numerical simulations confirm the achieved gain in performance in comparison with conventional approaches.

关键词： Delay-computation trade-off network coding network function virtualization (NFV) network optimization redundancy reliability

来源：评论

学校读者我要写书评

暂无评论

Efficient Coastal Communications with Sparse network coding

引用

IEEE network 2018年第4期32卷 122-128页

作者： Li, Ye Wang, Jue Zhang, Shibing Bao, Zhihua Wang, Jiangzhou Nantong Univ Sch Elect & Informat Nantong Peoples R China Nantong Univ Sch Elect & Informat Engn Nantong Peoples R China Nantong Univ Nantong Peoples R China Univ Kent Sch Engn & Digital Arts Canterbury Kent England Univ Kent Canterbury Kent England

The demand for wideband communication in the coastal area (i.e., = 100 km from the coastline) has been rapidly increasing in recent years. Compared to the terrestrial scenario, the coastal environment has long-distance and highly dynamic channels, and the communication devices are more strictly constrained by energy supplies. While the RLNC has the fountain erasure-correction property and is suitable for transmissions over the long-distance dynamic channels, it suffers from high coding coefficient delivery cost and decoding complexity. In this article, we look into the application of sparse network coding in coastal communication systems. We identify two typical multicast scenarios that may appear in coastal communications, namely the relay-aided multicast and multicast from a shore-based base station with D2D communication enabled among the subscribers. We provide a detailed comparison of existing sparse network coding schemes. Based on that, we demonstrate through simulations that an appropriate choice of sparse codes is critical to meet the unique requirements in coastal communication systems. We show that batched sparse code is suitable for relay-aided multicast, and subset-based sparse codes are preferable for D2D-enabled multicast.

关键词： Complexity theory Decoding Encoding network coding network topology Sea measurements Wideband

来源：评论

学校读者我要写书评

暂无评论

A Delay-Constrained network coding Algorithm Based on Power Control in Wireless networks

引用

IEEE ACCESS 2018年 6卷 62224-62233页

作者： Wang, Qi Cheng, Xi Wang, Qingshan Liu, Peng Deng, Bin Hefei Univ Technol Sch Math Hefei 230009 Anhui Peoples R China Hangzhou Dianzi Univ Sch Comp Sci & Technol Hangzhou 310018 Zhejiang Peoples R China

This paper investigates the problem of delay-constrained encoding by applying transmission power control in wireless networks. First, we formulate the problem using integer nonlinear programming and demonstrate that it is NP-complete. Moreover, a heuristic encoding algorithm based on power self-adaptation (EAPS) is proposed, which includes two sub-algorithms: the power optimal algorithm (POA) and encoding selection algorithm (ESA). The POA determines the initial transmission power for each packet by taking advantage of opportunities in which the transmission power is increased, thereby decreasing the transmission time without extra energy consumption. The ESA constructs two linked lists: the packet delay constraint linked list (D-List) and optimal power linked list (P-List) based on the POA. Whenever possible, it selects one packet with a tight delay constraint in the D-List and other packets in the same location as the above packet in the P-List to code. Furthermore, this paper includes an analysis of the probability of increasing any transmission power level without extra energy consumption in the POA. Lastly, the simulation results show that EAPS can significantly improve the delay satisfaction ratio and reduce transmission time compared to the COPE, TAONC, and *** algorithms.

关键词： Delay-constrained delay satisfaction ratio network coding power control

来源：评论

学校读者我要写书评

暂无评论

Linear network coding Over Rings - Part I: Scalar Codes and Commutative Alphabets

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第1期64卷 274-291页

作者： Connelly, Joseph Zeger, Kenneth Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

Linear network coding over finite fields is a well-studied problem. We consider the more general setting of linear coding for directed acyclic networks with finite commutative ring alphabets. Our results imply that for scalar linear network coding over commutative rings, fields can always be used when the alphabet size is flexible, but other rings may be needed when the alphabet size is fixed. We prove that if a network has a scalar linear solution over some finite commutative ring, then the (unique) smallest such commutative ring is a field. We also show that fixed-size commutative rings are quasi-ordered, such that all the scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. We study commutative rings that are maximal with respect to this quasi-order, as they may be considered the best commutative rings of a given size. We prove that a commutative ring is maximal if and only if some network is scalar linearly solvable over the ring, but not over any other commutative ring of the same size. Furthermore, we show that maximal commutative rings are direct products of certain fields specified by the integer partitions of the prime factor multiplicities of the ring's size. Finally, we prove that there is a unique maximal commutative ring of size m if and only if each prime factor of m has multiplicity in {1, 2, 3, 4, 6}. As consequences, 1) every finite field is such a maximal ring and 2) for each prime p, some network is scalar linearly solvable over a commutative ring of size p(k) but not over the field of the same size if and only if k is not an element of. {1, 2, 3, 4, 6}.

关键词： Linear coding network solvability network coding modules (abstract algebra)

来源：评论

学校读者我要写书评

暂无评论

Simulation methodology and performance analysis of network coding based transport protocol in wireless big data networks

引用

SIMULATION MODELLING PRACTICE AND THEORY 2018年 84卷 38-49页

作者： Mao, Qian Hu, Fei Kumar, Sunil Univ Alabama Elect & Comp Engn Tuscaloosa AL 35487 USA San Diego State Univ Elect & Comp Engn San Diego CA 92182 USA

The Multi-Path, Multi-Hop (MPMH) communications have been extensively used in wireless network. It is especially suitable to big data transmissions due to its high throughput. To provide congestion and end-to-end reliability control, two types of transport layer protocols have been proposed in the literature: the TCP-based protocols and the rateless coding based protocols. However, the former is too conservative to explore the capacity of the MPMH networks, and the latter is too aggressive in filling up the communication capacity and performs poorly when dealing with congestions. To overcome their drawbacks, a novel network coding scheme, namely, Adjustable Batching coding (ABC), was proposed by us, which uses redundancy coding to overcome random loss and uses retransmissions and window size shrink to relieve congestion. The stratified congestion control strategy makes the ABC scheme especially suitable for big data transmissions. However, there is no simulation platform built so far that can accurately test the performance of the network coding based transport protocols. We have built a modular, easy-to-customize simulation system based on an event-based programming method, which can simulate the ABC-based MPMH transport layer behaviors. Using the proposed simulator, the optimal parameters of the protocol can be fine-tuned, and the performance is superior to other transport layer protocols under the same settings. Furthermore, the proposed simulation methodology can be easily extended to other variants of MPMH communication systems by adjusting the ABC parameters. (C) 2018 Elsevier B.V. All rights reserved.

关键词： network simulator Wireless big data networks Multi-path multi-hop communications Transport layer network coding

来源：评论

学校读者我要写书评

暂无评论

Device-to-Device networking Meets Cellular via network coding

引用

IEEE-ACM TRANSACTIONS ON networkING 2018年第1期26卷 370-383页

作者： Keshtkarjahromi, Yasaman Seferoglu, Hulya Ansari, Rashid Khokhar, Ashfaq Univ Illinois Dept Elect & Comp Engn Chicago IL 60607 USA Iowa State Univ Dept Elect & Comp Engn Ames IA 50011 USA

Utilizing device-to-device (D2D) connections among mobile devices is promising to meet the increasing throughput demand over cellular links. In particular, when mobile devices are in close proximity of each other and are interested in the same content, D2D connections such as Wi-Fi Direct can be opportunistically used to construct a cooperative (and jointly operating) cellular and D2D networking system. However, it is crucial to understand, quantify, and exploit the potential of network coding for cooperating mobile devices in the joint cellular and D2D setup. In this paper, we consider this problem, and: 1) develop a network coding framework, namely NCMI, for cooperative mobile devices in the joint cellular and D2D setup, where cellular and D2D link capacities are the same;and 2) characterize the performance of the proposed network coding framework, where we use packet completion time, which is the number of transmission slots to recover all packets, as a performance metric. We demonstrate the benefits of our network coding framework through simulations.

关键词： network coding cooperative mobile devices device-to-device (D2D) networking

来源：评论

学校读者我要写书评

暂无评论

Enjoy the Benefit of network coding: Combat Pollution Attacks in 5G Multihop networks

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2018年第1期000卷

作者： Li, Jian Li, Tongtong Ren, Jian Chao, Han-Chieh Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing 100044 Peoples R China Michigan State Univ Dept ECE E Lansing MI 48824 USA Natl Dong Hwa Univ Dept Elect Engn Hualien 97401 Taiwan Natl Ilan Univ Inst Comp Sci & Informat Engn Yilan Taiwan Natl Ilan Univ Dept Elect Engn Yilan Taiwan

In the upcoming 5G era, many new types of networks will greatly expand the connectivity of the world such as vehicular ad hoc networks (VANETs), Internet of Things (IoT), and device-to-device communications (D2D). network coding is a promising technology that can significantly improve the throughput and robustness of these emerging 5G multihop networks. However, network coding is generally very fragile to malicious attacks such as message content corruption and node compromise attacks. To take advantage of network coding in performance gain while refraining malicious network attacks is an interesting and challenging research issue. In this paper, we propose a new error-detection and error-correction (EDEC) scheme that can jointly detect and remove the malicious attacks based on the underlying error-control scheme for general multihop networks that can model the 5G multihop networks. The proposed scheme can increase the throughput for network with pollution attacks compared to existing error-detection based schemes. Then we propose a low-density parity check (LDPC) decoding based EDEC (LEDEC) scheme. Our theoretical analysis demonstrates that the LEDEC scheme can further increase the throughput for heavily polluted network environments. We also provide extensive performance evaluation and simulation results to validate the proposed schemes. This research ensures the expected performance gain for the application of network coding in the 5G network under malicious pollution attacks.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Reliability benefit of network coding and cooperative communication

引用

PHYSICAL COMMUNICATION 2018年 29卷 217-229页

作者： Roy, Arghyadip Roy, Rajarshi Indian Inst Technol Dept Elect Engn Bombay 400076 Maharashtra India Indian Inst Technol Kharagpur Elect & Elect Commun Engn Kharagpur 721302 W Bengal India

network coding (NC) can reduce the number of packet retransmissions and improve the network reliability in lossy networks. Reliability gain of NC over traditional error control mechanisms has been investigated in recent works. In this paper, we study reliable broadcast in a real-world topology where link loss probabilities are different from each other. We derive approximate closed-form expressions and analyse asymptotic behaviour for expected number of transmissions employing stop-and-wait automatic repeat request (ARQ) and NC as error control mechanisms. In physical layer cooperative communication, multiple nodes can transmit collectively to take advantage of spatial diversity. We incorporate the idea of physical layer cooperative communication with ARQ and NC separately, to obtain further reliability. Numerical results based on our asymptotic analysis indicate that NC offers more reliability than stopand-wait ARQ. However, as the size of the cooperating set increases, both the schemes offer the same reliability. Approximate closed-form expressions for the reliability metric of these schemes and their asymptotic results match well with simulation results. Furthermore, simulation results establish that the proposed NC scheme outperforms existing schemes in literature. (C) 2018 Elsevier B.V. All rights reserved.

关键词： network coding Cooperative communication ARQ Asymptotic analysis Approximation in probability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：