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

IEEE International Conference on Communications (ICC)

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

ISBN: (纸本)9781467389990

In this paper, we propose a distributed solution based on game-theoretic approaches to the topology formation problem for mobile wireless sensor networks with multi-source multicast flows. Our solution significantly reduces computational complexity by taking advantage of network coding. Finding an optimal topology for network coding in multi-source multicast flows is NP-hard problem, so the proposed algorithm provides a suboptimal solution with low computational complexity. We formulate the problem of distributed network topology formation as a network formation game by considering the nodes in the network as players that can take actions for making outgoing links. The proposed game, which consists of multiple players and multicast flows, can be decomposed into independent link formation games played by only two players with a unicast flow. The proposed algorithm is also guaranteed to converge, i.e., a stable network topology can be always formed. Our simulation results confirm that the computational complexity of the proposed solution is low enough for practical deployment in large-scale mobile, wireless sensor networks.

关键词： Games network topology network coding Topology Ad hoc networks Computational complexity Silicon

来源：评论

学校读者我要写书评

暂无评论

Multipath Routing and Spectrum Allocation for network coding Enabled Elastic Optical networks

引用

CURRENT OPTICS AND PHOTONICS 2017年第5期1卷 456-467页

作者： Wang, Xin Gu, Rentao Ji, Yuefeng Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing 100876 Peoples R China Beijing Univ Technol Beijing Adv Innovat Ctr Future Internet Technol Beijing 100124 Peoples R China

The benefits of network coding in all-optical multicast networks have been widely demonstrated. In this paper, we mainly discuss the multicast service efficiently provisioning problem in the network coding enabled elastic optical networks (EONs). Although most research on routing and spectrum allocation (RSA) has been widely studied in the elastic optical networks (EONs), rare research studies RSA for multicast in the network coding enabled EON, especially considering the time delay constraint. We propose an efficient heuristic algorithm, called network coding based Multicast Capable-Multipath Routing and Spectrum Allocation (NCMC-MRSA) to solve the multipath RSA for multicast services in the network coding enabled EON. The well-known layered graph approach is utilized for NCMC-MRSA, and two request ordering strategies are utilized for multiple multicast requests. From the simulation results, we observe that the proposed algorithm NCMC-MRSA performs more efficient spectrum utilization compared with the benchmark algorithms. NCMC-MRSA utilizing the spectrum request balancing (SRB) ordering strategy shows the most efficient spectrum utilization performance among other algorithms in most test networks. Note that we also observe that the efficiency of NCMC-MRSA shows more obvious than the benchmark algorithm in large networks. We also conduct the performance comparisons of two request ordering strategies for NCMC-MRSA. Besides, we also evaluate the impact of the number of the link-disjoint parallel w paths on the spectrum utilization performance of the proposed algorithm NCMC-MRSA. It is interesting to find that the change of the parameter w in a certain range has a significant impact on the performance of NCMC-MRSA. As the parameter w increases to a certain value, the performances of NCMC-MRSA cannot be affected by the change of w any more.

关键词： Multipath RSA Multicast network coding EON

来源：评论

学校读者我要写书评

暂无评论

Asynchronous network coding for Multiuser Cooperative Communications

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2017年第12期16卷 8250-8260页

作者： Zhang, Xuehua Jafarkhani, Hamid Univ Calif Irvine Ctr Pervas Commun & Comp Irvine CA 92697 USA

In this paper, we present an asynchronous network coding (ANC) transmission strategy for multiuser co-operative networks. In particular, we consider a relay network comprised of multiple sources and mutiple relays. The sources all transmit simultaneously. The relay receives a sum of the signals with different delays. The decoded signals at the relay are network-coded by asynchronous delays and transmitted to the destination. We first present a decoding strategy for our ANC. We also compare our proposed ANC to complex field network coding and show the superiority of our proposed scheme in terms of decoding complexity and bit error rate (BER) performance. Next, we develop three relay selection strategies with different complexity in conjunction with the proposed ANC scheme. The proposed full selection and joint selection (JS) schemes consider both channel quality and delay effect in the selection. But the proposed individual selection scheme only considers channel quality in the selection. We derive an end-to-end (E2E) BER expression in terms of worst E2E SNR for the JS scheme. We also theoretically show that the proposed schemes achieve full diversity. In addition, we compare the performance of the three proposed relay selection schemes by simulations.

关键词： Asynchronous transmission cooperative diversity decode-and-forward network coding relay selection

来源：评论

学校读者我要写书评

暂无评论

Energy Minimization With network coding via Latin Hypercubes

引用

IEEE SYSTEMS JOURNAL 2017年第2期11卷 696-705页

作者： Kocaoglu, Murat Akan, Ozgur B. Koc Univ Dept Elect & Elect Engn Next Generat & Wireless Commun Lab TR-34450 Istanbul Turkey Univ Texas Austin Dept Elect & Comp Engn Austin TX 78712 USA

network coding is mostly used to achieve the capacity of communication networks. In this paper, motivated by the nanoscale communications where the energy cost for the channel symbols is asymmetric due to the widely employed on-off keying modulation, we design energy-minimizing network codes. We develop the best mapping between the input and output symbols at the network coding node that minimizes the average codeword energy using Latin squares, which we call the minimum energy network code (MENC). We define the class of networks composed of coding nodes with N incoming and 1 outgoing symbols as in-N networks. First, we derive the condition on the network code to minimize the average energy in in-two networks and propose two linear MENCs. Later, we investigate the MENCs for in-N networks using the Latin hypercubes and propose a low-energy network code (LENC) to reduce the average energy with network coding. We compare MENC with the classical XOR and random network codes for in-two networks. The performance comparison between LENC and random network codes for in-N networks shows that the proposed network codes provide significant energy gains.

关键词： Energy-efficient network codes green communications Latin squares minimum energy coding (MEC) network coding

来源：评论

学校读者我要写书评

暂无评论

Bandwidth-Satisfied Multicast by Multiple Trees and network coding in Lossy MANETs

引用

IEEE SYSTEMS JOURNAL 2017年第2期11卷 1116-1127页

作者： Chen, Yu-Hsun Wu, Eric Hsiao-Kuang Chen, Gen-Huey Natl Taiwan Univ Dept Comp Sci & Informat Engn Taipei 10617 Taiwan Natl Cent Univ Dept Comp Sci & Informat Engn Coll Elect Engn & Comp Sci Taoyuan 320 Taiwan

Wireless links are inherently lossy due to channel fading or interference. Previously, duplicate packets were transmitted on multiple routes of lossy mobile ad hoc networks (MANETs) to enhance reliability. In this paper, a multicast routing protocol that constructs multiple multicast trees and employs network coding is proposed for lossy MANETs, where each multicast tree can satisfy a predefined percentage of the bandwidth requirement. The proposed protocol can reduce the total bandwidth consumption while providing bandwidth guarantees to a requested flow and ongoing flows. As a consequence of employing network coding, no redundant packet is generated, and no scheduling algorithm for distributing packets among the multicast trees is needed. Simulation results show that the proposed protocol outperforms prior multicast routing protocols in terms of the receiving ratio, the admission ratio, and the total bandwidth consumption.

关键词： Bandwidth guarantee lossy mobile ad hoc network (MANET) multicast network coding quality of service (QoS)

来源：评论

学校读者我要写书评

暂无评论

Two-Way Incremental Relaying With Symbol-Based network coding: Performance Analysis and Optimal Thresholds

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第2期65卷 564-578页

作者： Bastami, Ali H. KN Toosi Univ Technol Dept Elect Engn Tehran *** Iran

In this paper, we investigate the signal-to-noise ratio-based incremental relaying scheme for a two-way relay channel (TWRC) with symbol-based network coding. Under the assumption of error propagation from the relay to the destination, we analyze the performance of the system in terms of the end-to-end symbol error rate (SER), the average spectral efficiency (ASE), the outage probability, the asymptotic behavior, and the diversity order for M-ary phase-shift keying modulation. All of these performance measures depend on a single threshold employed by the destination. By optimizing this threshold with respect to two different performance measures, we attain two different incremental relaying schemes: 1) the SER-optimal scheme that minimizes the end-to-end SER and 2) the ASE-constrained scheme that minimizes the end-to-end SER under an ASE constraint for the TWRC. In all cases, we derive closed-form expressions for the performance measures and the optimal thresholds. The asymptotic analysis of the system shows that both the SER-optimal and ASE-constrained schemes achieve the full diversity gain at both transceivers. Moreover, both of the schemes are optimal in the sense of the asymptotic ASE. We also propose a class of thresholds that are independent of the network geometry and asymptotically perform the same as the optimal thresholds.

关键词： Bidirectional relaying cooperative diversity error propagation incremental relaying network coding spectral efficiency two-way relay channel

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Information transmission based on network coding over wireless networks: a survey

引用

TELECOMMUNICATION SYSTEMS 2017年第4期65卷 551-565页

作者： Ben Rhaiem, Olfa Chaari, Lamia Univ Sfax ENIS Sfax Tunisia

network coding (NC) for wireless local area network has received a lot of attention from researchers. It replaces the traditional methods of video erasure protection. The principal of NC is to combine several packets together before their transmission. Thus, NC is able to provide higher throughput, reliability and efficient transmission. Up to now, many works have been done to ensure the advantages and the robustness of NC against the packet loss and link failures. The performance gains of NC are successfully processed not only for data to increase throughput, but also for video streaming over wireless networks. In this context, this paper surveys and discusses the most popular approaches based on NC of both data and video transmission over wireless network (static or dynamic). Strength and limitations for robust video streaming and data transmission are deeply discussed.

关键词： network coding H.264/SVC WLAN MANET RLNC

来源：评论

学校读者我要写书评

暂无评论

Adaptive Video Streaming With network coding Enabled Named Data networking

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2017年第10期19卷 2182-2196页

作者： Saltarin, Jonnahtan Bourtsoulatze, Eirina Thomos, Nikolaos Braun, Torsten Univ Bern CH-3012 Bern Switzerland Imperial Coll London London SW7 2AZ England Univ Essex Colchester CO4 3SQ Essex England

The fast and huge increase of Internet traffic motivates the development of new communication methods that can deal with the growing volume of data traffic. To this aim, named data networking (NDN) has been proposed as a future Internet architecture that enables ubiquitous in-network caching and naturally supports multipath data delivery. Particular attention has been given to using dynamic adaptive streaming over HTTP to enable video streaming in NDN as in both schemes data transmission is triggered and controlled by the clients. However, state-of-the-art works do not consider the multipath capabilities of NDN and the potential improvements that multipath communication brings, such as increased throughput and reliability, which are fundamental for video streaming systems. In this paper, we present a novel architecture for dynamic adaptive streaming over network coding enabled NDN. In comparison to previous works proposing dynamic adaptive streaming over NDN, our architecture exploits network coding to efficiently use the multiple paths connecting the clients to the sources. Moreover, our architecture enables efficient multisource video streaming and improves resiliency to Data packet losses. The experimental evaluation shows that our architecture leads to reduced data traffic load on the sources, increased cache-hit rate at the in-network caches and faster adaptation of the requested video quality by the clients. The performance gains are verified through simulations in a Netflix-like scenario.

关键词： network coding multimedia communication streaming media content distribution networks next generation networking

来源：评论

学校读者我要写书评

暂无评论

Joint LDPC and physical-layer network coding with incremental phase pre-rotation for two-way relaying

引用

IET COMMUNICATIONS 2017年第13期11卷 2095-2100页

作者： Jiang, Ming Sha, Xiaoshi Zhao, Chunming Southeast Univ Sch Informat Sci & Engn Natl Mobile Commun Res Lab Nanjing Jiangsu Peoples R China

To obtain a robust physical-layer network coding (PLNC) for two-way relaying system, the authors propose a low-density parity-check (LDPC) coded PLNC scheme with phase pre-rotation to combat the carrier phase asynchronous in the multiple access stage. At two users, each modulation symbol is rotated according to a predefined incremental phase without the knowledge of carrier phase difference. Decoding simulation and numerical analysis are carried out to evaluate this joint LDPC and PLNC scheme with phase pre-rotation. Simulation results show that this strategy can achieve a significant improvement and a good trade-off between performance and complexity. Protograph-based extrinsic information transfer analysis demonstrates the proposed scheme is robust, which is consistent with the simulation results.

关键词： relay networks (telecommunication) parity check codes network coding multi-access systems decoding numerical analysis joint LDPC and physical-layer network coding incremental phase pre-rotation low-density parity-check coded PLNC scheme two-way relaying system asynchronous carrier phase multiple access stage modulation symbol decoding simulation numerical analysis protograph-based extrinsic information transfer analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：