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

High-rate secret key generation aided by multiple relays for Internet of things

ELECTRONICS LETTERS 2017年第17期53卷 1198-1200页

作者： Xiao, Shuaifang Guo, Yunfei Huang, Kaizhi Jin, Liang Natl Digital Switching Syst Engn Technol & Res Ct Zhengzhou Henan Peoples R China

A multiple relays aided secret key generation algorithm is proposed to improve the generated secret key rate for Internet of things when the wireless channels change slowly. First, the two legitimate users and relays send training sequences in turn to estimate the channels. Then, the relays employ secure network coding technique to help the two legitimate users exploit the randomness of relay channels. Finally, the two legitimate users agree on a secret key without the help of relays. In addition, the optimal relays selection with optimal power allocation algorithm is present to further improve the secret key rate when relay selection is needed. The performances of the proposed algorithms are verified by Monte Carlo simulation results.

关键词： Internet of Things wireless channels network coding relay networks (telecommunication) Monte Carlo methods channel allocation high-rate secret key generation multiple relays Internet of Things wireless channels legitimate users training sequences secure network coding relay channels optimal relays selection optimal power allocation Monte Carlo simulation

来源：评论

学校读者我要写书评

暂无评论

Efficient coding for unicast flows in opportunistic wireless networks

引用

IET COMMUNICATIONS 2017年第4期11卷 584-592页

作者： Awais, Muhammad Qureshi, Jalaluddin Namal Coll Dept Elect Engn 30 KM Talagang Rd Mianwali 42250 Pakistan

In this study the authors consider the scenario of multiple unicast flows intersecting a common router in an opportunistic wireless network. Instead of forwarding packets in each of the flows independently, the router can perform inter-session network coding and transmit codewords to improve the network throughput. Unlike coding for multicast data flow for which an optimal code can be constructed in polynomial time, coding for unicast data flows is a more complicated coding problem and has been shown to be an NP-hard problem. Opportunities for inter-session network coding have also been shown to exist in single-hop wireless data dissemination network such as Wi-Fi and WiMAX networks. In this study the authors propose an efficient coding scheme for unicast flows and demonstrate its higher coding gain over previously proposed state-of-the-art coding schemes, validated using simulation results and wireless sensor network testbed packet reception traces. The authors also show that the proposed algorithm is optimal for all 238 non-isomorphic coding instances for instances for n 4, and for 9500 of the 9608 non-isomorphic coding instances for n = 5, where n is the number of unicast packets.

关键词： network coding telecommunication network routing computational complexity wireless LAN WiMax wireless sensor networks opportunistic wireless networks multiple-unicast flows common router inter-session network coding codeword transmssion network throughput multicast data flow optimal code polynomial time NP-hard problem single-hop wireless data dissemination network Wi-Fi networks WiMAX networks coding gain wireless sensor network testbed packet reception trace nonisomorphic coding instances unicast packets

来源：评论

学校读者我要写书评

暂无评论

Superregular Lower Triangular Toeplitz Matrices for Low Delay Wireless Streaming

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第9期65卷 4027-4038页

作者： Hansen, Jonas Ostergaard, Jan Kudahl, Johnny Madsen, John H. Aalborg Univ Dept Elect Syst DK-9000 Aalborg Denmark Bang & Olufsen AS DK-7600 Struer Denmark

A matrix is termed superregular if all of its possible submatrices are non-singular. Superregular lower triangular Toeplitz matrices are useful for MDS convolutional codes and (sequential) network codes. In this paper, we present the explicit matrix constructions for superregular lower triangular Toeplitz matrices in GF(2(p))(kxk), k <= 5. For k > 5 we providea greedy algorithm, which (over sufficiently large fields) is guaranteed to find a superregular lower triangular Toeplitz matrix. We introduce (product preserving) joint superregularity, and extend our explicit matrix constructions to these cases. We provide methods for deriving the exact symbol loss probability and delay for any deterministic block code. We derive the exact symbol loss probability and delay for codes using a superregular lower triangular matrix and for codes using two (product preserving) jointly superregular lower triangular matrices. We then compare these results with those obtained from both simulations and our practical implementation, and for each case we also compare with random-based codes. Furthermore, our experiments show a gain in coding throughput above 40% for superregular lower triangular Toeplitz matrices over random matrices.

关键词： Superregular matrices network coding linear codes block codes wireless LAN random codes

来源：评论

学校读者我要写书评

暂无评论

Accurate and Generic Sender Selection for Bulk Data Dissemination in Low-Power Wireless networks

引用

IEEE-ACM TRANSACTIONS ON networkING 2017年第2期25卷 948-959页

作者： Zhao, Zhiwei Dong, Wei Bu, Jiajun Gu, Tao Min, Geyong Univ Elect Sci & Technol China Coll Comp Sci & Engn Chengdu 611731 Peoples R China Zhejiang Univ Coll Comp Sci Hangzhou 310027 Zhejiang Peoples R China RMIT Univ Comp Sci Melbourne Vic 300 Australia Univ Exeter Coll Engn Math & Phys Sci Exeter EX4 4QF Devon England

Data dissemination is a fundamental service offered by low-power wireless networks. Sender selection is the key to the dissemination performance and has been extensively studied. Sender impact metric plays a significant role in sender selection, since it determines which senders are selected for transmission. Recent studies have shown that spatial link diversity has a significant impact on the efficiency of broadcast. However, the existing metrics overlook such impact. Besides, they consider only gains but ignore the costs of sender candidates. As a result, existing works cannot achieve accurate estimation of the sender impact. Moreover, they cannot well support data dissemination with network coding, which is commonly used for lossy environments. In this paper, we first propose a novel sender impact metric, namely,., which jointly exploits link quality and spatial link diversity to calculate the gain/cost ratio of the sender candidates. Then, we develop a generic sender selection scheme based on the. metric (called.-component) that can generally support both types of dissemination using native packets and network coding. Extensive evaluations are conducted through real testbed experiments and large-scale simulations. The performance results and analysis show that. achieves far more accurate impact estimation than the existing works. In addition, the dissemination protocols based on.-component outperform the existing protocols in terms of completion time and transmissions (by 20.5% and 23.1%, respectively).

关键词： Sender selection network coding data dissemination low-power wireless network

来源：评论

学校读者我要写书评

暂无评论

Exploiting network coding for Data Availability in Vehicular networks: Issues and Opportunities

Exploiting Network Coding for Data Availability in Vehicular...

引用

International Conference on Mobile Ad-hoc and Sensor networks, MSN

作者： Zhenni Feng Yanmin Zhu Qian Zhang Min Gao Department of Computer Science and Engineering Shanghai Jiaotong University China Hong Kong University of Science and Technology Hong Kong China HKUST Fok Ying Tung Graduate School Hong Kong China

ISBN: (纸本)9781467358088

Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of applications of vehicular networks, such as road surface monitoring and sharing. The key to improving the data retrieval performance is to increase the data availability such that a retrieving node can easily acquire its desired data from the vehicles that it contacts. network coding has widely been exploited as an effective technique for defusing information over a network. In this paper we explore the exploitation of network coding for improving data availability in vehicular networks. By random linear codes, simple replication is avoided, and instead a node forwards a coded block which is a random combination of all data received by the node. We implement a network coding based approach for improving data availability in vehicular networks. To understand the performance of this approach, we have conducted empirical study with extensive simulations based on real vehicular GPS traces from around 2,000 taxis in Shanghai, China. We make the important observation that in spite of significant improvement up to 300% in data availability, there is a serious issue with linear correlation among the received codes, which degrades the performance of data retrieval success rate. By analyzing the real vehicular traces, we reveal that there is strong community structure with a real vehicular network and then explain that such community structure may contribute to the issue of linear dependence. Then, we point out the opportunities for improving the network coding based approach by developing community aware codes distribution techniques.

关键词： Vehicular networks network coding Data Availability Issues Opportunities data availability network coding Community structure Spectra applications Shanghai China

来源：评论

学校读者我要写书评

暂无评论

A New Construction of Exact-Repair MSR Codes Using Linearly Dependent Vectors

引用

IEEE COMMUNICATIONS LETTERS 2017年第8期21卷 1691-1694页

作者： Guan, Sheng Kan, Haibin Wen, Jie Xia, Shuli Fudan Univ Shanghai Key Lab Intelligent Informat Proc Fudan Zhongan Joint Lab Blockchain & Informat Sec Sch Comp Sci Shanghai 200433 Peoples R China

Regenerating codes focus on the efficient repair of node failures. In an [n, k, d] regenerating code system, any k nodes can retrieve the original data and any d nodes can repair a failed node by giving out beta pieces of data per node. For minimum storage regenerating (MSR) codes, d >= 2k - 3 has been proved. However, as far as we know, there is no construction of exact-repair MSR codes with d = 2k - 3 and beta = 1 at present. In this letter, we give the first construction of [6, 4, 5] MSR codes with beta = 1, which can perform exact repair of all nodes. Employing the technique of linearly dependent vectors, our codes can be constructed over a small finite field F-4.

关键词： Distributed storage systems interference alignment MSR codes network coding optimal repair

来源：评论

学校读者我要写书评

暂无评论

Multi-way relay based deterministic broadcast with side information: Pair-wise network coding is sum-capacity optimal

Multi-way relay based deterministic broadcast with side info...

引用

Annual Conference on Information Sciences and Systems (CISS)

作者： Viveck Cadambe Research Laboratory of Electronics Massachusetts Institute of Technology Cambridge MA USA

ISBN: (纸本)9781467331395

We consider a K user deterministic broadcast channel where the receivers have apriori side information of a set of messages. The (deterministic) broadcast channel defined by the identity function on {0; 1}, i.e., all the receivers receive the input bit free-of-noise. The message set is inspired by the multi-way relay channel which has K users communicating through a relay, where each user has an independent message for the remaining K - 1 users. The multi-way relay channel can be converted to a broadcast channel with side information if the relay is able to decode all the messages. Thus, in the broadcast set up, there are K(K - 1) messages, with K - 1 messages intended for each receiver. Each receiver has apriori side information of a (different) set of K-1 messages. In this set up, when there are K= 2 users, it is well known that the optimal strategy for sum-capacity is to use network coding, i.e., to send an XOR of the two messages since each receiver can cancel the interfering message using its side information. The main result of this note is an outerbound for the K user version of this channel showing that scheduling users pairwise and using network coding for the scheduled pair is optimal.

关键词： Relays Receivers Encoding network coding Indexes Context Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Performance of network coding in ad hoc network multipath routing protocol

Performance of network coding in ad hoc network multipath ro...

引用

International Conference on Consumer Electronics, Communications and networks

作者： Hua Chen Hui Xu Ting Zhang Baolin Sun College of Mathematics & Computer Science Wuhan Textile University Wuhan China China Ship Development and Design Center Wuhan China Department of Computer Science and Technology Wuhan Yangtze Business University Wuhan China

ISBN: (纸本)9781457714146

network coding, the notion of performing coding operations on the contents of packets while in transit through the network, was originally developed for wired networks; recently, however, it has been also applied with success also to mobile ad hoc networks (MANET). In this paper, we compare the performance of different protocols for ad hoc networks - Multipath routing based on fresnel zone routing (FZR), and Energy aware Node Disjoint Multipath Routing (ENDMR) protocol. Simulation results show that, with the proposed network coding in ad hoc network multipath routing protocol (NC-MR), packet delivery ratio, network lifetime and packet loss can be improved in most of cases. It is an available approach to multipath routing decision.

关键词： Routing Routing protocols Mobile ad hoc networks network coding Encoding

来源：评论

学校读者我要写书评

暂无评论

Non-Orthogonal Multiple Access Combined With Random Linear network Coded Cooperation

引用

IEEE SIGNAL PROCESSING LETTERS 2017年第9期24卷 1298-1302页

作者： Khan, Amjad Saeed Chatzigeorgiou, Ioannis Univ Lancaster Sch Comp & Communcat Lancaster LA1 4WA England

This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed, whereby packets at the relay nodes are combined using two methods;packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using random linear network coding. An analytical framework that characterizes the performance of the proposed scheme is developed, compared to simulation results, and benchmarked against a counterpart scheme that is based on orthogonal multiple access.

关键词： Decoding probability network coding nonorthogonal multiple access (NOMA) sparse random matrices throughput

来源：评论

学校读者我要写书评

暂无评论

Optimal solution for the index coding problem using network coding over GF(2)

Optimal solution for the index coding problem using network ...

引用

IEEE Communications Society Conference on Sensor and Ad Hoc Communications and networks (SECON)

作者： Jalaluddin Qureshi Chuan Heng Foh Jianfei Cai School of Computer Engineering Nanyang Technological University Singapore

The index coding problem is a fundamental transmission problem which occurs in a wide range of multicast networks. network coding over a large finite field size has been shown to be a theoretically efficient solution to the index coding problem. However the high computational complexity of packet encoding and decoding over a large finite field size, and its subsequent penalty on encoding and decoding throughput and higher energy cost makes it unsuitable for practical implementation in processor and energy constraint devices like mobile phones and wireless sensors. While network coding over GF(2) can alleviate these concerns, it comes at a tradeoff cost of degrading throughput performance. To address this tradeoff, we propose a throughput optimal triangular network coding scheme over GF(2). We show that such a coding scheme can supply unlimited number of innovative packets and the decoding involves the simple back substitution. Such a coding scheme provides an efficient solution to the index coding problem and its lower computation and energy cost makes it suitable for practical implementation on devices with limited processing and energy capacity.

关键词： Encoding Receivers Decoding Indexes network coding Throughput Transmitters

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：