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

Virtual overhearing: An effective way to increase network coding opportunities in wireless ad-hoc networks

COMPUTER networkS 2016年 105卷 111-123页

作者： Xie, Ling Fu Chong, Peter Han Joo Ho, Ivan Wang-Hei Chan, Henry C. B. Ningbo Univ Fac Elect Engn & Comp Sci Ningbo Zhejiang Peoples R China Auckland Univ Technol Dept Elect & Elect Engn Auckland New Zealand Hong Kong Polytech Univ Dept EIE Hong Kong Hong Kong Peoples R China Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

Overhearing is of great importance to wireless network coding in that it can be exploited to obtain the side information needed for packet decoding. Recently, a new technique called virtual overhearing (VOH) was proposed to allow a node to obtain the packet sent by another node that is multiple hops away for free. This can overcome the limitation of overhearing and be used to discover more coding opportunities. In this paper, we take advantage of VOH and propose two modes of exploiting VOH to increase coding opportunities in wireless ad-hoc networks. First, we make use of VOH to increase the chance of finding a route with coding opportunities for a new incoming flow. Second, and more importantly, we make use of VOH to create coding opportunities between two established flows which are currently unmixable. Note that most previous studies only attempt to find coding opportunities rather than create them. Based on these two modes of VOH usage, we design two routing protocols: distributed coding-aware routing with virtual overhearing (DCAR-VOH), and its enhanced version DCAR-VOH+. DCAR-VOH implements only the first mode of usage, whereas DCAR-VOH+ incorporates both modes of usage. Our extensive simulations indicate that VOH provides an effective way to discover coding opportunities, resulting in improved network performance. The positive effect of the second mode of usage stands out especially. (C) 2016 Elsevier B.V. All rights reserved.

关键词： network coding Overhearing Virtual overhearing coding-aware routing

来源：评论

学校读者我要写书评

暂无评论

A coalitional graph game framework for network coding-aided D2D communication

引用

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

作者： Zhao, Yulei Li, Yong Ding, Zhiguo Ge, Ning Poor, H. Vincent Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Princeton Univ Dept Elect Engn Princeton NJ 08544 USA Univ Lancaster Sch Comp & Commun Lancaster LA1 4WA England

The application of device-to-device (D2D) communication in cellular networks can significantly improve the efficiency of spectrum utilization, which benefits local area cooperative services. On the other hand, network coding can realize more efficient cooperation among cellular users. Thus, it is natural to combine network coding with D2D communication in order to further increase the system sum rate. In this paper, a coalitional graph game framework is proposed to jointly accomplish resource allocation and relay selection, two challenging problems in network coding-aided D2D communication networks. It is shown that this framework can model D2D communication combined with various network coding schemes. Based on the coalitional graph game framework, a distributed algorithm with low computational complexity is proposed to solve the formulated problem for physical layer network coding-aided D2D communication. Finally, the performance of the proposed transmission scheme is evaluated through extensive simulations.

关键词： Device-to-device communication network coding Coalitional graph game Resource allocation Relay selection

来源：评论

学校读者我要写书评

暂无评论

Queueing Characteristics of the Best Effort network coding Strategy

引用

IEEE ACCESS 2016年 4卷 5990-5997页

作者： Li, Xianxu Chang, Qing Xu, Yong Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China

Asynchronous network coding has the potential to improve wireless network performance compared with simple routing. However, to achieve the maximum network coding gain, the encoding node consumes a few computing and storage resources that may be unaffordable for wireless sensor networks such as CubeSats. An analogous threshold strategy, called best effort network coding (BENC), which requires only minimal storage resources and no computing resources, is investigated in this paper as an efficient and convenient method of network coding. In this strategy, a new packet arrival evicts the head packet when the queue is full to avoid excessively long waits. Moreover, in contrast to other methods that require a queue for each flow, the BENC uses only one queue for the two coded flows. In addition, the problem of time interval distribution for the output flow, which combines two independent flows, is investigated, and the network coding gain is then analyzed. While the maximum coding gain requires infinite buffer capacity under two independent Poisson arrivals with the same transmission rates, the calculation results show that the BENC needs only 4 buffers to achieve 90% of the maximum coding gain and can reach 99% of the maximum coding gain using 50 buffers. These results are verified by numerical simulations.

关键词： network coding best effort queueing analysis queue capacity wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Compressive network coding for wireless sensor networks: Spatio-temporal coding and optimization design

引用

COMPUTER networkS 2016年 108卷 345-356页

作者： Chen, Siguang Zhao, Chuanxin Wu, Meng Sun, Zhixin Zhang, Haijun Leung, Victor C. M. Nanjing Univ Posts & Telecommun Key Lab Broadband Wireless Commun & Sensor Networ Minist Educ Nanjing Jiangsu Peoples R China Curtin Univ Sch Elect Engn & Comp Perth WA Australia Univ British Columbia Dept Elect & Comp Engn Vancouver BC Canada Anhui Normal Univ Dept Network Engn Wuhu Peoples R China

Considering the temporal and spatial correlations of sensor readings in wireless sensor networks (WSNs), this paper develops a clustered spatio-temporal compression scheme by integrating network coding (NC), compressed sensing (CS) and spatio-temporal compression for correlated data. The proper selection of NC coefficients and measurement matrix is investigated for this scheme. This design ensures successful reconstruction of original data with a considerably high probability and enables successful deployment of NC and CS in a real field. Moreover, in contrast to other spatio-temporal schemes with the same computational complexity, the proposed scheme possesses lower reconstruction error by employing independent encoding in each sensor node (including the cluster head nodes) and joint decoding in the sink node. In order to further reduce the reconstruction error, we construct a new optimization model of reconstruction error for the clustered spatio-temporal compression scheme. A distributed algorithm is developed to iteratively determine the optimal solution. Finally, simulation results verify that the clustered spatio-temporal compression scheme outperforms other two categories of compression schemes significantly in terms of recovery error and compression gain and the distributed algorithm converges to the optimal solution with a fast and stable speed. (C) 2016 Elsevier B.V. All rights reserved.

关键词： network coding Compressed sensing Spatio-temporal compression Optimization Distributed algorithm Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

GREEN protocol: gradient based energy efficient routing with network coding capacity

引用

TELECOMMUNICATION SYSTEMS 2016年第1期62卷 135-147页

作者： Nawaz, Faiza Jeoti, Varun Univ Teknol Petronas Dept Elect & Elect Engn Seri Iskandar Perak Malaysia

A fundamental challenge in the acceptability of Wireless SAW Sensor network (WSSN) for industrial applications, is to enhance the lifespan and packet delivery ratio (PDR) of the network. This work proposes a routing protocol for WSSN that selects the best neighbours for data forwarding and employs network coding to provide reliable and energy efficient data delivery. The proposed algorithm improves the lifetime of industrial wireless mesh and star mesh networks. Energy efficiency increases as more data is routed towards the sink with less number of transmissions. Performance metrics including latency, PDR and throughput have been investigated to prove the effectiveness of the proposed routing protocol. The proposed routing protocol is particularly suited to the needs of dense reader environment deployed in an industrial environment, where the sensors are passive and have a limited transmission range. The protocol is applicable to long term passive sensor network and operates in an unattended environment.

关键词： Energy efficiency Gradient based routing network coding Routing protocol Wireless Mesh network

来源：评论

学校读者我要写书评

暂无评论

Exploiting Opportunistic network coding for Improving Wireless Reliability Against Co-Channel Interference

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2016年第5期12卷 1692-1701页

作者： Zhu, Jia Nanjing Univ Posts & Telecommun Sch Telecommun & Informat Engn Nanjing 210003 Peoples R China

This paper investigates network coding with full diversity and a high rate for improving the reliability of wireless communications against the co-channel interference. We consider a cellular network composed of two user terminals that are intended to communicate with a common base station (BS), where a two-way relay node is used to assist the bidirectional communications between the users and BS. We propose an opportunistic network coding (ONC) scheme with the two-way relay, called two-way ONC, which operates depending on whether or not the relay node successfully decodes data packets of the user terminals and BS. Closed-form outage probability expressions of the uplink transmission (from users to BS) and downlink transmission (from BS to users) are derived for the proposed two-way ONC scheme in the presence of co-channel interference over Rayleigh fading channels. We also develop the diversity-multiplexing tradeoff (DMT) of the two-way ONC scheme and show that it obtains the full diversity and an increased multiplexing gain, as compared with conventional one-way relay methods. Additionally, numerical outage probability results demonstrate that the proposed two-way ONC scheme outperforms the conventional one-way relay approaches in terms of improving the communication's reliability against co-channel interference.

关键词： Cellular networks co-channel interference diversity-multiplexing tradeoff (DMT) network coding outage probability wireless reliability

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2016年第7期62卷 4081-4095页

作者： Martinez-Penas, Umberto Aalborg Univ Dept Math Sci DK-9220 Aalborg Denmark

Rank weights and generalized rank weights have been proved to characterize error and erasure correction, and information leakage in linear network coding, in the same way as Hamming weights and generalized Hamming weights describe classical error and erasure correction, and information leakage in wire-tap channels of type II and code-based secret sharing. Although many similarities between both the cases have been established and proved in the literature, many other known results in the Hamming case, such as bounds or characterizations of weight-preserving maps, have not been translated to the rank case yet, or in some cases have been proved after developing a different machinery. The aim of this paper is to further relate both weights and generalized weights, show that the results and proofs in both cases are usually essentially the same, and see the significance of these similarities in network coding. Some of the new results in the rank case also have new consequences in the Hamming case.

关键词： Rank weight generalized rank weight rank distance rank-metric codes network coding network error correction secure network coding

来源：评论

学校读者我要写书评

暂无评论

A Modified Ant Colony Optimization Algorithm for network coding Resource Minimization

引用

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 2016年第3期20卷 325-342页

作者： Wang, Zhaoyuan Xing, Huanlai Li, Tianrui Yang, Yan Qu, Rong Pan, Yi Southwest Jiaotong Univ Sch Informat Sci & Technol Chengdu 611756 Peoples R China Univ Nottingham Sch Comp Sci Nottingham NG8 1BB England Georgia State Univ Dept Comp Sci Atlanta GA 30303 USA

This paper presents a modified ant colony optimization (ACO) approach for the network coding resource minimization problem. It is featured with several attractive mechanisms specially devised for solving the concerned problem: 1) a multidimensional pheromone maintenance mechanism is put forward to address the issue of pheromone overlapping;2) problem-specific heuristic information is employed to enhance the capability of heuristic search (neighboring area search);3) a tabu-table-based path construction method is devised to facilitate the construction of feasible (link-disjoint) paths from the source to each receiver;4) a local pheromone updating rule is developed to guide ants to construct appropriate promising paths;and 5) a solution reconstruction method is presented, with the aim of avoiding prematurity and improving the global search efficiency of proposed algorithm. Due to the way it works, the ACO can well exploit the global and local information of routing-related problems during the solution construction phase. The simulation results on benchmark instances demonstrate that with the integrated five extended mechanisms, our algorithm outperforms a number of existing algorithms with respect to the best solutions obtained and the computational time.

关键词： Ant colony optimization (ACO) combinatorial optimization network coding

来源：评论

学校读者我要写书评

暂无评论

How to tune sparse network coding over wireless links

How to tune sparse network coding over wireless links

引用

IEEE Wireless Communications and networking Conference (WCNC)

作者： Garrido, Pablo Lucani, Daniel E. Aguero, Ramon Univ Cantabria Santander Spain Aalborg Univ Dept Elect Syst Aalborg Denmark

ISBN: (纸本)9781509041831

Despite their high computational complexity, Random Linear network coding (RLNC) techniques have been shown to offer a good robustness against packet erasure wireless channels. Some approaches have been recently proposed to reduce such computational burden, for both encoder and decoder elements. One of those approaches are the so-called Tunable Sparse network coding (TSNC) techniques, which advocate limiting the number of packets that are combined to build a coded packet. They also propose dynamically adapting the corresponding sparsity level, as the transmission evolves, although an optimum tuning policy has not been yet found. In this paper we present a TSNC implementation that exploits a novel analytical model to estimate the probability of generating an innovative packet (linearly independent combination), given the current status at the decoder. Taking advantage of the model's accuracy, the proposed scheme offers a better trade-off between computational complexity and network performance. Furthermore, we broaden the analysis of TSNC techniques by thoroughly assessing their behavior over wireless networks using the ns-3 platform. The results yield a remarkable complexity reduction (approximate to 3.33x less complexity), without jeopardizing network performance.

关键词： Random Linear coding Sparse coding network coding

来源：评论

学校读者我要写书评

暂无评论

Integration of scheduling and network coding in multi-rate wireless mesh networks: Optimization models and algorithms

引用

AD HOC networkS 2016年 36卷 386-397页

作者： Ning, Zhaolong Song, Qingyang Guo, Lei Chen, Zhikui Jamalipour, Abbas Northeastern Univ Sch Informat Sci & Engn Shenyang 110819 Peoples R China Dalian Univ Technol Sch Software Technol Dalian 116020 Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Jiangsu Peoples R China Univ Sydney Sch Elect & Informat Engn Sydney NSW 2006 Australia

In order to fully utilize spectrum resource in wireless mesh networks (WMNs), we propose a combination of some popular communication techniques, including link scheduling, spatial reuse, power and rate adaptation and network coding (NC), to activate as many transmission links as possible during one scheduling period, so that the total scheduling length can be minimized and network throughput can be maximized. Different from previous studies, we consider the interplay among these techniques and present an optimal NC-aware link scheduling mechanism in multi-rate WMNs, which relies on the enumeration of all possible schedules. Due to the high computational complexity of our proposed model, we utilize a column generation (CG)-based method to resolve the optimization problem and decompose it into a master problem (MP) and a pricing problem (PP). Furthermore, we present a distributed power control algorithm for PP, by which the computational complexity of the CG-based scheme can be largely reduced. Simulation results demonstrate the superiority of our method under various network situations. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Link scheduling network coding Column generation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：