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

network coding with crowdsourcing-based trajectory estimation for vehicular networks

JOURNAL OF network AND COMPUTER APPLICATIONS 2016年 64卷 204-215页

作者： Li, Lingzhi Yang, Zhe Wang, Jin Zhang, Shukui Zhu, Yanqin Soochow Univ Sch Comp Sci & Technol Suzhou 215006 Peoples R China Collaborat Innovat Ctr Novel Software Technol & I Nanjing 210093 Jiangsu Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Jiangsu Peoples R China

It is a great challenge to transmit data in vehicular networks, where the link among nodes is very shaky because of the rapid movement of vehicles. In this paper, we propose a network coding with Crowdsourcing-based Trajectory Estimation (NC/CTE) method to transmit data in vehicular networks. Key points are designated beforehand in movement area. Every node estimates which of Key points the other nodes in the discovered area close to at the different times. The estimation is completed by every node in crowdsourcing method based on the pre-trajectory of GPS navigation. network coding, recoding and reverse forwarding are used for data transmission according to the result of trajectory estimation. Simulation results show that NC/CTE is able to cut down 1/2 overhead messages of TBNC when mobile nodes have shared their GPS trajectories. It improves the reliability and scalability of vehicular networks. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Vehicular networks network coding Crowdsourcing Trajectory estimation

来源：评论

学校读者我要写书评

暂无评论

network coding-based multisource content delivery in Content Centric networking

引用

JOURNAL OF network AND COMPUTER APPLICATIONS 2016年 64卷 167-175页

作者： Liu, Yan Yu, Shun-Zheng Sun Yat San Univ Sch Informat Sci & Technol Guangzhou 510006 Guangdong Peoples R China

Content Centric networking (CCN) is a new network architecture around content dissemination and retrieval. Its request-response and in-network caching mechanisms can significantly improve the network performance in reducing the transmission delay. However, the in-network caching may prevent the network coding technique from being applied into CCN because cached coded blocks may not be linearly independent to each other such that they cannot be used for responding the future requests. In this paper, we propose a novel request-specified network coding (RSNC) scheme for efficiently encoding and delivering chunks of content. In this scheme, a new Interest coding and forwarding strategy is proposed for specifying network coding requirements and getting linearly independent coded blocks simultaneously from multiple nodes. Our simulation results show that the proposed scheme achieves better performance than conventional CCN in terms of average download time, cache hit ratio, and transmission amount. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Content Centric networking network coding Multisource content delivery

来源：评论

学校读者我要写书评

暂无评论

network coding for hop-by-hop communication enhancement in multi-hop networks

引用

COMPUTER networkS 2016年 105卷 138-149页

作者： Pahlevani, Peyman Khamfroush, Hana Lucani, Daniel E. Pedersen, Morten V. Fitzek, Frank H. P. Inst Adv Studies Basic Sci Dept Comp Sci & Informat Technol Zanjan Iran Penn State Univ Dept Comp Sci University Pk PA 16802 USA Aalborg Univ Dept Elect Syst Aalborg Denmark Tech Univ Dresden Dresden Germany

In our recent study, we introduced the PlayNCool protocol that increases the throughput of the wireless networks by enabling a helper node to strengthen the communication link between two neighboring nodes and using random linear network coding. This paper focuses on design and implementation advantages of the PlayNCool protocol in a real environment of wireless mesh networks. We provide a detailed protocol to implement PlayNCool that is independent from the other protocols in the current computer network stack. PlayNCool performance is evaluated using NS-3 simulations and real-life measurements using Aalborg University's Raspberry Pi test-bed. Our results show that selecting the best policy to activate the helper node is a key to guarantee the performance of PlayNCool protocol. We also study the effect of neighbor nodes in the performance of PlayNCool. Using a helper in presence of active neighbors is useful even if the channel from helper to destination is not better than the channel between sender and destination. PlayNCool increases the gain of end-to-end communication by two-fold or more while maintaining compatibility to standard wireless ad-hoc routing protocols. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Wireless communication network coding Routing protocols

来源：评论

学校读者我要写书评

暂无评论

network coding channel virtualization schemes for satellite multicast communications

arXiv

引用

arXiv 2017年

作者： Ghanem, Samah A.M. Gharsellaoui, Ala Eddine Tarchi, Daniele Vanelli-Coralli, Alessandro Department of Electrical and Electronic Engineering University of Bologna Italy Independent Senior Researcher

In this paper, we propose two novel schemes to solve the problem of finding a quasi-optimal number of coded packets to multicast to a set of independent wireless receivers suffering different channel conditions. In particular, we propose two network channel virtualization schemes that allow for representing the set of intended receivers in a multicast group to be virtualized as one receiver. Such approach allows for a transmission scheme not only adapted to per-receiver channel variation over time, but to the network-virtualized channel representing all receivers in the multicast group. The first scheme capitalizes on a maximum erasure criterion introduced via the creation of a virtual worst per receiver per slot reference channel of the network. The second scheme capitalizes on a maximum completion time criterion by the use of the worst performing receiver channel as a virtual reference to the network. We apply such schemes to a GEO satellite scenario. We demonstrate the benefits of the proposed schemes comparing them to a per-receiver point-to-point adaptive strategy. Copyright © 2017, The Authors. All rights reserved.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

network coding Scheme Behavior in a Vehicle-to-Vehicle Safety Message Dissemination

Network Coding Scheme Behavior in a Vehicle-to-Vehicle Safet...

引用

International Conference on Communications Workshops

作者： Imen Achour Tarek Bejaoui Anthony Busson Sami Tabbane Mediatron Lab. SupCom University of Carthage Tunisia Laboratory of Parallel Computing University of Lyon 1 - ENS - Inria France

ISBN: (纸本)9781509015269

Message dissemination is considered as a challenging task in Vehicular Ad-hoc network (VANET). In particular, safety messages, such as, road accident warning, traffic congestion warning, etc., are the most critical messages type that need to be efficiently transmitted in a wireless and mobile network where the topology changes dynamically. Many protocols have been proposed for the sake of disseminating information with a high data reachability and a low end-to-end delay in a limited bandwidth. In this work, we focus on a new trend of dissemination protocols based on the "network coding" (NC) scheme. Precisely, we intent to study the NC gain toward safety message dissemination and deduce its suitability in accordance to such application requirements. To this end, three NC-based protocols are proposed for the aim at thoroughly studying the impact of such technique on the safety message dissemination performance. The gain of NC scheme is studied under different traffic densities (from low to high dense network). The simulation results show that NC could be an efficient solution to overcome the intermittent connectivity in sparse network mainly for comfort applications but not suitable for safety message dissemination, especially in high dense network, since it may introduce a high transmission delay.

关键词： Vehicular Ad hoc networks network coding Data Dissemination Vehicle-to-Vehicle Communication Intelligent Transportation System

来源：评论

学校读者我要写书评

暂无评论

network coding for system-level throughput improvement in satellite systems

引用

INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND networkING 2017年第6期35卷 551-570页

作者： Alegre-Godoy, R. Angeles Vazquez-Castro, M. Autonomous Univ Barcelona Engn Sch Dept Telecommun & Syst Engn E-08193 Barcelona Spain

In this paper, we introduce 2 designs based on network coding (NC) for system-level throughput improvement in satellite systems. The first design is applied to the forward downlink of multibeam satellite systems using an adaptive physical layer. In this type of systems, user terminals (UTs) receiving a satellite channel happen to also be able to receive physical links transmitted towards other UTs in other geographical areas. Hence, if UTs were able to tune other physical channels, they could access and decode all such signals. Assuming such multilink reception, the overall system would have an enormous increase of useful throughput, and moreover, multiple paths would become available to every UT. NC can then be naturally used to optimally mix the traffic towards the users through such multiple physical paths. The proposed full design targets multicast applications and achieves throughput improvements of up to the 88% with regard to state-of-the-art schemes. The second design applies to systems where multiple sources transmitting to one or more satellites experience severe packet losses (eg, forward uplink through multiple gateways). Nowadays, system availability is achieved by transmitting the same packets in different spatial channels, ie, using spatial diversity. Using NC to encode the data across users, and introducing novel cognitive elements, the system outage probability can be reduced, thus increasing the throughput. The design is shown to achieve more than one order of magnitude system outage probability advantage for a sufficient number of UTs. Furthermore, a methodology determining the optimal number of transmitting UTs and code rate is derived.

关键词： dual satellite multibeam network coding proportionally fair satellite spatial diversity

来源：评论

学校读者我要写书评

暂无评论

Wireless networks Using Matroid along with network coding

引用

JOURNAL OF INTERNET TECHNOLOGY 2017年第4期18卷 775-786页

作者： Pandey, Purnendu Shekhar Purohit, Neetesh Verma, Shekhar Indian Inst Informat Technol Dept Informat Technol Allahabad Uttar Pradesh India Indian Inst Informat Technol Dept Elect & Commun Engn Allahabad Uttar Pradesh India

network coding has a vast impact on the throughput of a network. It not only combines the packet to improve throughput but it makes it more robust from errors. A fundamental problem for applying network coding is to find the number of nodes that can be treated as network coding nodes. It is found that application of network coding to every node within network results in more delay and increases the computational complexity which ultimately results in huge congestion and packet loss. Whereas selective network coding node selection decreases packet replication and increases innovative flow rate within network. To overcome this node selection problem for dynamic changing network, we have applied the concept of Matroid to construct network and form various spanning trees out of that matroidal network. In this process, subsequently Greedy algorithm for matroid is applied to find the most suitable spanning tree with minimum weight. Hence forth, Priority based selection scheme is used to prioritize the nodes within the network and subsequently nodes having highest priority will perform network coding. Lastly, we have applied an algorithm to select the best spanning tree with the help of Laplacian Matrix and all these schemes put together are named as Rule Based Selective Scheme. Thus, priority node selection and dynamic switching of spanning trees and selected NC nodes, in case of congestion, makes this rule based selective scheme more appropriate for real scenarios whereas centrality based scheme and random selection scheme do not follow this approach. The Comparative results have shown a clear indication that finding and applying network coding to selected number of nodes in accordance with our algorithm produces better throughput, reduces decoding delay and dynamic switching in case of congestion makes it more efficient as compared to other mentioned schemes.

关键词： Matroid network coding coding gain XOR Decoding delay

来源：评论

学校读者我要写书评

暂无评论

network coding in the Link Layer for Reliable Narrowband Powerline Communications

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2016年第7期34卷 1965-1977页

作者： Bilbao, Josu Crespo, Pedro M. Armendariz, Igor Medard, Muriel IK4 Ikerlan Technol Res Ctr Dept Commun Arrasate Mondragon 20500 Spain Univ Navarra Tecnun Escuela Ingn Ctr Studies & Tech Res San Sebastian 20018 Spain MIT Dept Elect Engn & Comp Sci Cambridge MA 02139 USA

The wide availability of power distribution cables provides an interesting no-new-wires communication channel. However, its electrical characteristics make it a harsh environment for the data transmission purpose and prevent the deployment of services with high reliability requirements. This paper proposes and implements an OSI-Layer2 network coding-based cooperative scheme with the aim of improving communication reliability in indoor narrowband powerline channels. The proposed scheme uses random linear network coding with a sliding window and relaying. We use network coding to replace the retransmissions triggered by legacy subsequent repeat request (ARQ) schemes. We evaluate the performance of our approach in terms of throughput and delay. Regarding the throughput achieved in harsh environments, we show that our scheme often more than doubles the throughput of existing legacy ARQ schemes. At the same time, and even under the large variation of traffic characteristics, it is shown that the delay is likely to be upper bounded by a few seconds, a bound that cannot be guaranteed in other existing transmission techniques.

关键词： Powerline communications PLC ARQ cooperative schemes delay narrowband network coding reliability QoS

来源：评论

学校读者我要写书评

暂无评论

Hybrid services efficient provisioning over the network coding-enabled elastic optical networks

引用

OPTICAL ENGINEERING 2017年第3期56卷 036101-036101页

作者： Wang, Xin Gu, Rentao Ji, Yuefeng Kavehrad, Mohsen Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing Peoples R China Penn State Univ Dept Elect Engn University Pk PA 16802 USA Beijing Univ Technol Beijing Adv Innovat Ctr Future Internet Technol Beijing Peoples R China

As a variety of services have emerged, hybrid services have become more common in real optical networks. Although the elastic spectrum resource optimizations over the elastic optical networks (EONs) have been widely investigated, little research has been carried out on the hybrid services of the routing and spectrum allocation (RSA), especially over the network coding-enabled EON. We investigated the RSA for the unicast service and network coding-based multicast service over the network coding-enabled EON with the constraints of time delay and transmission distance. To address this issue, a mathematical model was built to minimize the total spectrum consumption for the hybrid services over the network coding-enabled EON under the constraints of time delay and transmission distance. The model guarantees different routing constraints for different types of services. The immediate nodes over the network coding-enabled EON are assumed to be capable of encoding the flows for different kinds of information. We proposed an efficient heuristic algorithm of the network coding-based adaptive routing and layered graph-based spectrum allocation algorithm (NCAR-LGSA). From the simulation results, NCAR-LGSA shows highly efficient performances in terms of the spectrum resources utilization under different network scenarios compared with the benchmark algorithms. (C) 2017 Society of Photo-Optical Instrumentation Engineers (SPIE)

关键词： hybrid services network coding routing and spectrum allocation elastic optical networks

来源：评论

学校读者我要写书评

暂无评论

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

引用

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2017年第2期28卷

作者： 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：