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

An efficient privacy-preserving scheme for secure network coding based on compressed sensing

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2017年 79卷 33-42页

作者： Xie, Dong Peng, Haipeng Li, Lixiang Yang, Yixian Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Informat Secur Ctr Beijing 100876 Peoples R China Anhui Normal Univ Sch Math & Comp Sci Wuhu 241000 Peoples R China Beijing Univ Posts & Telecommun Natl Engn Lab Disaster Backup & Recovery Beijing 100876 Peoples R China State Key Lab Publ Big Data Guiyang 550025 Guizhou Peoples R China

network coding (NC) provides an elegant solution for improving capacity and robustness in computer networks. Different to traditional "store-and-forward" transmission paradigm, each intermediate node linearly combines received data packets, and the original files can be decoded at the sink nodes in NC settings. This brand-new paradigm is vulnerable to pollution attack, which means that some malicious nodes inject fake data packets into the network and this will lead to incorrect decoding. There are some information-theoretical solutions and cryptographic solutions for solving this security issue, and most existing schemes can thwart data pollution attacks. However, the privacy of the original files are vital to some application environments (e.g. military network). To the best of our knowledge, there is not a secure scheme which can thwart pollution attack and can protect the privacy of transmitted data simultaneously. In this paper, we present an efficient privacy-preserving scheme for secure network coding based on compressed sensing (CS), which has attracted considerable research interest in the signal processing community. Specifically, we embed CS into the general NC framework, i.e., the source node needs to compress each original data packet using the sensing matrix before creating the augmented vector and the sink nodes require to perform an additional CS reconstruction algorithm for reconstructing the original file. In addition, we construct a simple key distribution protocol and each intermediate node just needs two secret keys for verifying the integrity of received data packets. Such novel hybrid construction enables the privacy-preserving guarantee, and the performance comparison shows the high-efficiency of our scheme in terms of the computational complexity and communication overhead. (C) 2017 Published by Elsevier GmbH.

关键词： network coding Privacy-preserving Compressed sensing Pollution attack

来源：评论

学校读者我要写书评

暂无评论

On Scheduling Delay-Sensitive SVC Multicast over Wireless networks with network coding

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2017年第3期E100B卷 407-416页

作者： Wang, Shujuan Yan, Chunting Kunming Univ Sci & Technol Sch Informat Engn & Automat Kunming Yunnan Peoples R China

In this work, we study efficient scheduling with network coding in a scalable video coding (SVC) multicast system. Transmission consists of two stages. The original SVC packets are multicasted by the server in the first stage and the lost packets are retransmitted in the second stage. With deadline constraint, the consumer can be only satisfied when the requested packets are received before expiration. Further, the hierarchical encoding architecture of SVC introduces extra decoding delay which poses a challenge for providing acceptable reconstructed video quality. To solve these problems, instantly decodable network coding is applied for reducing the decoding delay, and a novel packet weighted policy is designed to better describe the contribution a packet can make in upgrading the recovered video quality. Finally, an online packet scheduling algorithm based on the maximal weighted clique is proposed to improve the delay, deadline miss ratio and users' experience. Multiple characteristics of SVC packets, such as the packet utility, the slack time and the number of undelivered/wanted packets, are jointly considered. Simulation results prove that the proposed algorithm requires fewer retransmissions and achieves lower deadline miss ratio. Moreover, the algorithm enjoys fine recovery video quality and provides high user satisfaction.

关键词： scalable video coding network coding multicast scheduling time-sensitive user satisfaction

来源：评论

学校读者我要写书评

暂无评论

Efficient and Reliable Multicast Using Device-to-Device Communication and network coding for a 5G network

引用

IEEE network 2017年第4期31卷 78-84页

作者： Chi, Kaikai Huang, Liang Li, Yanjun Zhu, Yi-hua Tian, Xian-zhong Xia, Ming Zhejiang Univ Technol Sch Comp Sci & Technol Hangzhou Zhejiang Peoples R China Zhejiang Univ Technol Sch Informat Engn Hangzhou Zhejiang Peoples R China Zhejiang Univ Technol Hangzhou Zhejiang Peoples R China

How to achieve efficient reliable multicast with 100 percent reliability is an important issue of emerging 5G network. In the 5G network, besides the macro BSs, ultra-dense low-power BSs (e.g., micro, pico, and femto eNBs) are deployed throughout the macrocell to form ultra-dense small cells, which reduces the number of associated multicast receivers per BS and consequenly reduces the number of retransmissions per packet (i.e., traffic load) at each BS. However, this gain is greatly limited by the nodes with bad channel quality. Adopting D2D-communication-based retransmission can effectively reduce the retransmissions at the BSs. There are some challenging issues to be addressed, like the selection of appropriate D2D links, extremely reducing D2D retransmissions, and the design of an efficient acknowledgment mechanism. In this article, considering the ultra-dense small cell deployment in a 5G network, we propose an efficient reliable multicast scheme that jointly utilizes D2D communication and network coding to achieve 100 percent reliability. In addition to discussing research issues that deserve further study, we present numerical results to illustrate the performance gains achieved by applying the proposed scheme in terms of traffic load reduction at the BSs.

关键词： 5G mobile communication Device-to-device communication Heterogeneous networks Microcell networks network coding Receivers Relays Reliability Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Improving capacity for physical network coding with lattice strategies in two-way fading channels

引用

IET COMMUNICATIONS 2017年第7期11卷 1123-1131页

作者： Zhan, Ao Wu, Chengyu Shi, Qingjiang Xu, Weiqiang Zhejiang Sci Tech Univ Dept Sch Informat Sci & Technol 5 Second Ave Xiasha Higher Educ Zone Hangzhou Zhejiang Peoples R China

In this study, the capacity problem in a two-way fading channel is considered. The authors propose amplify-and-forward with lattice codes (AF&LC), exploiting a modulo operation at the relay. Without destroying the construct of codebook, the modulo operation reduces the power of the received signals, and thus achieves a larger power-scaled gain than the amplified-and-forward with random codes (AF&RC). It is proved that AF&LC outperforms AF&RC in the high signal-to-noise ratio (SNR) regime by employing theoretical analyses. By simulating one-dimension lattice codes, AF&LC achieves about 1.5 dB SNR gain over AF&RC with error probability 10(-2). Compared with decode-and-forward with lattice codes (DF&LC) and fixed modulo-and-forward (FMF), AF&LC achieves larger rate region which is closer to upper bound in some scenarios. Moreover, AF&LC can work in fading two-way channels without feedback schemes, which is easier to be implemented than DF&LC, FMF and compress-and-forward.

关键词： fading channels channel coding relay networks (telecommunication) channel capacity error statistics amplify and forward communication network coding physical network coding capacity improvement lattice strategies two-way fading channels amplify-and-forward with lattice codes modulo operation received signal power reduction power-scaled gain AF& LC signal-to-noise ratio SNR one-dimension lattice code simulation error probability upper bound decode-and-forward with lattice codes DF& LC fixed modulo-and-forward FMF compress-and-forward

来源：评论

学校读者我要写书评

暂无评论

A Reliable Routing Algorithm with network coding in Internet of Vehicles

引用

China Communications 2017年第5期14卷 174-184页

作者： Zhen Wang Jianqing Li Manlin Fang Yang Li Botao Feng Faculty of Information Technology Macao University of Science and Technology College of Electronic Science and Technology Shenzhen University

The intelligent vehicle network uses advanced information technology to establish an efficient integrated vehicle transport system, which has received great attention in industry and academia, lnternet of Vehicles （loV） in an urban environment is operated in a wireless environment with high bit error rate and interference. In addition, the wireless link between vehicles is likely to be lost. All of this makes it an important challenge to provide reliable mobile routing in an urban traffic environment. In this paper, a reliable routing algorithm with network coding （RR_ NC） is proposed to solve the above problems. A routing node sequence is discovered in IoV from source to destination by multi-metric ant colony optimization algorithm （MACO）, and then clusters are formed around every node in the sequence. By adding linear encoding into the transmission of data between vehicle＇s clusters, the RR_NC provides much more reliable transmission and can recover the original message in the event of disorder and loss of message. Simulations are taken under different scenarios, and the results prove that this novel algorithm can deliver the information more reliably between vehicles in real-time with lower data loss and communication overhead.

关键词： intelligent transportation system （ITS） internet of vehicles （IoV） routing cluster network coding mobility

来源：评论

学校读者我要写书评

暂无评论

An Efficient Group Handover Scheme Using network coding in Fog-Computing-Based RANs

TANET2018 台湾网际网路研讨会

引用

TANET2018 台湾网际网路研讨会 2018年 799-804页

作者： Yuh-Shyan Chen Jia-shiang Syu Huei-En Lin

In this paper, we present an efficient group handover scheme using network coding approach in fog-computing based radio access network (Fog- RANs). When the cloudlet multicast to all the vehicles, the packet lost result from the fact that vehicles handover to the new cloudlet and interfered with another base stations. The proposed of video multicast using binary network coding and the base stations cooperative communication to each other. After the handover procedure, the initial cloudlet delivered the total of lost packets to the new cloudlet, the new cloudlet considers the lost packets from initial and the new packets from cloud to encode independent vector. The main advantage of the proposed approach is that using linear independent of binary network coding in fog-tofog communication to reduce number of total transmissions. To illustrate the performance achievement, the simulation results are examined in terms of the number of total transmissions.

关键词： Cloudlet group handover network coding fog-computing-based RAN mobility management

来源：评论

学校读者我要写书评

暂无评论

Homomorphic MAC from Algebraic One-Way Functions for network coding with Small Key Size

引用

COMPUTER JOURNAL 2017年第12期60卷 1785-1800页

作者： Wu, Ying Chang, Jinyong Xue, Rui Zhang, Rui Chinese Acad Sci Inst Informat Engn State Key Lab Informat Secur Beijing 100093 Peoples R China Univ Chinese Acad Sci Sch Cyber Secur Beijing 100049 Peoples R China Changzhi Univ Dept Math Changzhi 046011 Peoples R China

network coding is a routing technique that differs from traditional 'store-and-forward' mechanisms. It allows intermediate nodes to modify packets in transit. It is well known that network coding can increase throughput and improve robustness in network. However, it is the messages mixing feature that makes network coding susceptive to pollution attacks. To address this problem, homomorphic message authentication codes (MACs) have been proposed. The existing homomorphic MAC schemes adopt inner product to authenticate a message with a tag over a field F-q. In practical instantiations, the size of the field F-q is normally chosen (or desired) to be small (typically set as 2(8)) to limit computational and communication overheads. In these settings, an adversary will break the schemes with probability at least 1/q (typically 1/2(8)). The security is not guaranteed in this case. To waver the limitations and enhance the security, multiple tags are adopted for each message, that certainly incurs large key size overhead and is not preferred in applications. A scheme of homomorphic MAC with preferring security and shorter keys is much expected, and till now, to our knowledge, is not successfully constructed. This work solves this problem by presenting a new homomorphic MAC scheme for authentication in network coding. The proposed scheme allows us to authenticate a message in a linear space over a field of moderate size and at the same time, achieves a reliable security with a short key. The construction is based on a recently invented somewhat public-key notion: algebraic one-way function, by Catalano et al. (TCC 2013). Compared to the existing schemes, our scheme possesses the advantages that it achieves stronger security with much shorter keys, and is practical in applications. Hence resolve the longstanding problem.

关键词： homomorphic MAC network coding pollution attack algebraic one way functions

来源：评论

学校读者我要写书评

暂无评论

An efficient homomorphic MAC-based scheme against data and tag pollution attacks in network coding-enabled wireless networks

引用

INTERNATIONAL JOURNAL OF INFORMATION SECURITY 2017年第6期16卷 627-639页

作者： Esfahani, Alireza Mantas, Georgios Rodriguez, Jonathan Neves, Jose Carlos Campus Univ Santiago IT P-3810193 Aveiro Portugal

Recent research efforts have shown that wireless networks can benefit from network coding (NC) technology in terms of bandwidth, robustness to packet losses, delay and energy consumption. However, NC-enabled wireless networks are susceptible to a severe security threat, known as data pollution attack, where a malicious node injects into the network polluted packets that prevent the destination nodes from decoding correctly. Due to recoding, occurred at the intermediate nodes, according to the core principle of NC, the polluted packets propagate quickly into other packets and corrupt bunches of legitimate packets leading to network resource waste. Hence, a lot of research effort has been devoted to schemes against data pollution attacks. Homomorphic MAC-based schemes are a promising solution against data pollution attacks. However, most of them are susceptible to a new type of pollution attack, called tag pollution attack, where an adversary node randomly modifies tags appended to the end of the transmitted packets. Therefore, in this paper, we propose an efficient homomorphic message authentication code-based scheme, called HMAC, providing resistance against data pollution attacks and tag pollution attacks in NC-enabled wireless networks. Our proposed scheme makes use of three types of homomorphic tags (i.e., MACs, D-MACs and one signature) which are appended to the end of the coded packet. Our results show that the proposed HMAC scheme is more efficient compared to other competitive tag pollution immune schemes in terms of complexity, communication overhead and key storage overhead.

关键词： network coding Security Data pollution attack Tag pollution attack Wireless networks

来源：评论

学校读者我要写书评

暂无评论

TCP network coding with Enhanced Retransmission for Heavy and Bursty Loss

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2017年第2期E100B卷 293-303页

作者： Nguyen Viet Ha Kumazoe, Kazumi Tsuru, Masato Kyushu Inst Technol Grad Sch Comp Sci & Syst Engn Iizuka shi Iizuka Fukuoka 8208502 Japan Kyushu Inst Technol Network Design Res Ctr Iizuka Fukuoka 8208502 Japan

In general, Transmission Control Protocol (TCP), e.g., TCP NewReno, considers all losses to be a sign of congestion. It decreases the sending rate whenever a loss is detected. Integrating the network coding (NC) into protocol stack and making it cooperate with TCP (TCP/NC) would provide the benefit of masking packet losses in lossy networks, e.g., wireless networks. TCP/NC complements the packet loss recovery capability without retransmission at a sink by sending the redundant combination packets which are encoded at the source. However, TCP/NC is less effective under heavy and bursty loss which often occurs in fast fading channel because the retransmission mechanism of the TCP/NC entirely relies on the TCP layer. Our solution is TCP/NC with enhanced retransmission (TCP/NCwER), for which a new retransmission mechanism is developed to retransmit more than one lost packet quickly and efficiently, to allow encoding the retransmitted packets for reducing the repeated losses, and to handle the dependent combination packets for avoiding the decoding failure. We implement and test our proposal in network Simulator 3. The results show that TCP/NCwER overcomes the deficiencies of the original TCP/NC and improves the TCP goodput under both random loss and burst loss channels.

关键词： TCP network coding enhanced retransmission dependence retransmission heavy loss bursty loss

来源：评论

学校读者我要写书评

暂无评论

Overlapping Coalition Formation Game for Resource Allocation in network coding Aided D2D Communications

引用

IEEE TRANSACTIONS ON MOBILE COMPUTING 2017年第12期16卷 3459-3472页

作者： Zhao, Yulei Li, Yong Wu, Di Ge, Ning Tsinghua Univ TNLIST Dept Elect Engn Beijing 100084 Peoples R China Hunan Univ Dept Comp Engn Changsha 410082 Hunan Peoples R China

Due to spectrum sharing, device-to-device (D2D) communications underlaying cellular networks enhance system capacity significantly that benefits services of local area. On the other hand, network coding enables highly efficient cooperation, which increases the system capacity through code-and-forward mechanism. It is a challenging problem that how to allocate resource in the network coding aided cooperative D2D communications. In this paper, we first design a network coding aided cooperative diversity scheme for D2D communication, and derive the system transmission rate with the consideration of interference. Then, we formulate the problem of joint spectrum resource allocation and relay selection as an overlapping coalition formation game, where one relay is able to serve multiple coalitions to increase the system capacity. For each coalition, maximum bipartite graph matching model is established to select the optimal relay to achieve the maximum transmission rate. Finally, to solve the formulated game problem, we propose a distributed algorithm based on switch operations with low computation complexity. Extensive numerical results demonstrate that our solution increases the system transmission rate by about 30-40 percent without bringing extra computation complexity, compared with other state-of-the-art schemes.

关键词： Overlapping coalition formation game device-to-device communication network coding resource allocation relay selection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：