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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Migrating Unfairness Among Subflows in MPTCP With network coding for Wired-Wireless networks

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2017年第1期66卷 798-809页

作者： Xue, Kaiping Han, Jiangping Zhang, Hong Chen, Ke Hong, Peilin Univ Sci & Technol China Dept Elect Engn & Informat Sci Hefei 230026 Peoples R China

Recently, two new technologies have been introduced into the transport layer. One is network coding, and the other is multipath transmission control protocol (MPTCP). network coding is introduced into the transport layer to enhance the performance of transmission control protocol (TCP) in wireless networks. Benefiting from multi-interface devices, MPTCP is proposed to make full use of the network resource. Theoretically, combining these two technologies can utilize resources more adequately. However, network coding and multipath transportation cannot collaborate well with each other because network coding invalidates the load-balancing feature of MPTCP congestion control schemes. In this paper, we first discuss the unfair congestion control issue in MPTCP combined with network coding (MPTCP/NC). Then, a new end-to-end congestion control solution, named Couple+, is presented to deal with the unfairness among subflows. In Couple+, sender tries to slightly slow down sending rate if the reason of packet loss is not decided. After judging of packet loss reason based on the characteristics of packet loss events, the rate will be recovered soon if the loss is caused by wireless error (wireless noise or collision) or be further reduced if the loss is caused by congestion. By simulation, we compare the performances of Couple+ and the previous congestion control scheme of MPTCP. The performance analysis proves that unfairness among subflows indeed exists, and our scheme can balance congestion among coded and noncoded subflows and can stay friendly with TCP flow.

关键词： Congestion control fairness load balance multipath transmission control protocol (MPTCP) network coding

来源：评论

学校读者我要写书评

暂无评论

An Optimal Design Framework for 1+1 Routing and network coding Assignment Problemin WDM Optical networks

引用

IEEE ACCESS 2017年 5卷 22291-22298页

作者： Dao Thanh Hai Hanoi Univ Ind Inst Technol Hanoi 100000 Vietnam

network coding (NC) features a new perspective for leveraging network performances as more efficient resources utilization could be achieved. In recent years, the application of NC to the realms of failure recovery in optical networks has been receiving growing attention and indeed, combining the nearinstantaneous recovery of dedicated protection and improved capacity efficiency enabled by NC constitutes an important research trend in optical protection. In order to maximize the bene fits empowered by NC, a critical problem on routing of traffic demands, selecting demands for encoding and determining the respective coding node and coding links has to be optimally addressed. The problem becomes even more challenging if multiple traffic demands are considered at once and the traffic is non-equal. In addressing those issues, for the first time, we present a novel unified framework for augmenting 1 + 1 dedicated protection against single link failures with a practical network coding scheme based on XOR operation for both equal and non-equal traffic scenarios. In line with this framework, a mathematical model in the form of integer linear programming for optimal routing and network coding assignment to minimize the path cost is presented. Numerical results based on evaluating the model on realistic topologies and all-to-one traffic setting highlight the cost advantages of our proposed NC-assisted protection scheme compared to traditional counterparts.

关键词： Routing network coding dedicated protection optical networks integer linear programming network optimization

来源：评论

学校读者我要写书评

暂无评论

Leveraging the Survivable All-Optical WDM network Design With network coding Assignment

引用

IEEE COMMUNICATIONS LETTERS 2017年第10期21卷 2190-2193页

作者： Dao Thanh Hai Hanoi Univ Ind Fac Elect Engn Hanoi 100000 Vietnam

This letter investigates a novel use of network coding (NC) in 1 + 1 protection for transparent wavelength-division multiplexing networks by utilizing a cost-effective all-optical XOR encoder/decoder. In applying this scheme, we introduce a new problem, called routing, wavelength, and NC assignment, and formulate it as the integer linear programming model, aiming at maximizing the network throughput under constrained bandwidth capacity. We evaluate our proposal on the realistic topology, COST239, with all-to-one traffic setting. The numerical results on studied case show that the our NC-based approach could support up to 30% traffic more than the conventional 1 + 1 protection.

关键词： Routing and wavelength assignment transparent WDM networks network coding dedicated protection integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Global optimum encoding packet selection mechanism based on opportunistic network coding for wireless network retransmission

引用

The Journal of China Universities of Posts and Telecommunications 2017年第1期24卷 47-59页

作者： Wang Lian Peng Daiyuan Liang Hongbin School of Information Science and Technology Southwest Jiaotong University Chengdu 610031 China School of Computing Science and Technology Chongqing University of Posts and Telecommunications Chongqing 400065 China School of Transportation and Logistics Southwest Jiaotong University Chengdu 610031 China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ 85281-8809 USA

Packet loss cannot be avoided in wireless network due to wireless transmission medium particularity, therefore improving retransmission efficiency is meaningful to wireless transmission. The current retransmission packet selection mechanisms based on oppornistic network coding （ONC） face low retransmission efficiency and high computational complexity problems. To these problems, an optimized encoding packet selection mechanism based on ONC in wireless network retransmission （OONCR） is proposed. This mechanism is based on mutual exclusion packets and decoding gain concepts, and makes full use of ONC advantages. The main contributions of this scheme are to control the algorithm eomplexity of the maximum encoding packets selection effectively, avoid the redundancy encoding packets due to the overlapping among encoding packets, and take the encoding packet local and global optimization problem into consideration. Retransmission efficiency is evaluated according to the computational complexity, the throughput, the retransmission redundancy ratio, and the number of average retransmission. Under the various conditions, the number of average retransmission of OONCR is mainly lower than that of other typical retransmission packet selection schemes. The average retransmission redundancy ratios of OONCR are lower about 5%-40% compared with other typical schemes. Simultaneously the computational complexity of OONCR is comparatively lower than that of other typical schemes.

关键词： wireless network retransmission network coding throughput

来源：评论

学校读者我要写书评

暂无评论

Optimal Rate-Diverse Wireless network coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第6期65卷 2411-2426页

作者： Wang, Taotao Liew, Soung Chang Shi, Long Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing 211106 Jiangsu Peoples R China

This paper proposes an encoding/decoding framework for achieving the optimal channel capacities of the two-user broadcast channel where each user (receiver) has the message targeted for the other user (receiver) as side information. Since the link qualities of the channels from the base station to the two users are different, their respective single-user non-broadcast channel capacities are also different. A goal is to simultaneously achieve/approach the single-user non-broadcast channel capacities of the two users with a single broadcast transmission by applying network coding. This is referred to as the ratediverse wireless network coding problem. For this problem, this paper presents a capacity-achieving framework based on linear-structured nested lattice codes. The significance of the proposed framework, besides its theoretical optimality, is that it suggests a general design principle for linear rate-diverse wireless network coding going beyond the use of lattice codes. We refer to this design principle as the principle of virtual single-user channels. Guided by this design principle, we propose two implementations of our encoding/decoding framework using practical linear codes amenable to decoding with affordable complexities: the first implementation is based on Low Density Lattice Codes (LDLC) and the second implementation is based on Bit-interleaved Coded Modulation (BICM). These two implementations demonstrate the validity and performance advantage of our framework.

关键词： Broadcast channel with side information network coding nested lattice codes LDLC BICM

来源：评论

学校读者我要写书评

暂无评论

Social Norm Incentives for network coding in MANETs

引用

IEEE-ACM TRANSACTIONS ON networkING 2017年第3期25卷 1761-1774页

作者： Wu, Chuchu Gerla, Mario van der Schaar, Mihaela Teradata Corp El Segundo CA 90245 USA Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90095 USA Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

The performance of mobile ad hoc network transmissions subject to disruption, loss, interference, and jamming can be significantly improved with the use of network coding (NC). However, NC requires extra work for forwarders, including additional bandwidth consumption due to transmitting overheads for redundant NC packets and additional processing due to generating the NC packets. Selfish forwarders may prefer to simply forward packets without coding them to avoid such overhead. This is especially true when network coding must be protected from pollution attacks, which involves additional, often processor intensive, pollution detection procedures. To drive selfish nodes to cooperate and encode the packets, this paper introduces social norm-based incentives. The social norm consists of a social strategy and a reputation system with reward and punishment connected with node behavior. Packet coding and forwarding are modeled and formalized as a repeated NC forwarding game. The conditions for the sustainability (or compliance) of the social norm are identified, and a sustainable social norm that maximizes the social utility is designed via selecting the optimal design parameters, including the social strategy, reputation threshold, reputation update frequency, and the generation size of network coding. For this game, the impacts of packet loss rate and transmission patterns on performance are evaluated, and their impacts on the decision of selecting the optimal social norm are discussed. Finally, practical issues, including distributed reputation dissemination and the existence of altruistic and malicious users, are discussed.

关键词： Game theory network coding incentive design reputation scheme

来源：评论

学校读者我要写书评

暂无评论

Distributed network Formation Strategy for network coding Based Wireless networks

引用

IEEE SIGNAL PROCESSING LETTERS 2017年第4期24卷 432-436页

作者： Kwon, Minhae Park, Hyunggon EwhaWomans Univ Dept Elect & Elect Engn Seoul 03760 South Korea

In this letter, we propose a distributed network formation solution for network coding deployed wireless networks which includes multisource multicast flows. This is an attempt to solve an open problem of network coding based multisource multicast flow design based on a game theoretic approach, which can eventually form a network in a distributed way. The network is in particular constructed by individual decision makings of the nodes, while taking advantages of network coding techniques. The decisions made by the nodes include the transmission powers and the use of network coding operations. In each stage game, nodes update the parameters based on feedbacks such as rewards, penalties, and evaluate their prior actions, which enables the nodes to make best responses in the next stage game. Our simulations confirm that the resulting network can reduce overall power consumption compared to direct transmission, and improve system throughput with less power consumption compared to no coding strategy.

关键词： Distributed network formation game theory network coding network topology wireless mesh networks

来源：评论

学校读者我要写书评

暂无评论

Energy Efficient Survivable IP-Over-WDM networks With network coding

引用

JOURNAL OF OPTICAL COMMUNICATIONS AND networkING 2017年第3期9卷 207-217页

作者： Musa, Mohamed Elgorashi, Taisir Elmirghani, Jaafar Univ Leeds Sch Elect & Elect Engn Leeds LS2 9JT W Yorkshire England Univ Leeds Opt Networks Sch Elect & Elect Engn Leeds LS2 9JT W Yorkshire England Univ Leeds Inst Integrated Informat Syst Sch Elect & Elect Engn Leeds LS2 9JT W Yorkshire England

In this work we investigate the use of network coding in 1 + 1 survivable IP-over-wavelength-division-multiplexing (WDM) networks by encoding the protection paths of multiple flows with each other at intermediate nodes. We study the energy efficiency of this scheme through mixed-integer linear programming (MILP) and a heuristic with five operating options. We evaluate the MILP and the heuristics on typical and regular network topologies. Our results show that implementing network coding can produce savings up to 37% on the ring topology and 23% considering typical topologies. We also study the impact of varying the demand volumes on the network coding performance.

关键词： Energy efficiency IP/WDM MILP model network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：