During the handover, quality of service (QoS) in LTE-A systems poses quite a challenge especially for real-time services. In high speed mobility, the handover procedure becomes more delicate as it occurs more frequent...
详细信息
ISBN:
(纸本)9781509003044
During the handover, quality of service (QoS) in LTE-A systems poses quite a challenge especially for real-time services. In high speed mobility, the handover procedure becomes more delicate as it occurs more frequently in a time basis scale. In fact, a currently used resource in a "source node" could be not available in the "target node" over the handover decision. In this paper we present a network coding based approach (NCA) in the context of coordinated multiple point transmission (CoMP) technologies. Our approach aims to optimize resources allocation during the handover decision, in the case of a congested target node. We demonstrate, with results, that NCA solution can sustain better levels of QoS by minimizing packet loss rate for both real time and best effort traffic.
In wireless networks, spectral efficiency is a vital issue in the wake of ever increasing bandwidth usage. To improve throughput, in wired and wireless networks, network coding is one of the promising solutions which ...
详细信息
ISBN:
(纸本)9781467392921
In wireless networks, spectral efficiency is a vital issue in the wake of ever increasing bandwidth usage. To improve throughput, in wired and wireless networks, network coding is one of the promising solutions which has been used for a quite some time. On getting coding opportunity in a hop, coding gain is around 100% if physical layer networking, unlike linear network coding which offers maximum coding gain upto 33%. However, PNC has symbol-level synchronization, carrier-frequency synchronization, and carrier-phase synchronization. The throughput elevate with number of nodes involved in physical layer network coding. In the literature, there is no proposal which increases the involvement of number nodes to elevate overall throughput of the network. In this paper, we are forcing multiple opposite direction routes to share common road segments without compromising delay and reliability requirements. We designed a new particle swarm optimization (PSO) mechanism which offers maximum throughput gain for the entire network. Through network coding such voluntary congestion is solved. Thus, higher packet delivery ratio can be achieved while keeping lower end to end delay which is verified by graphs.
On-demand data broadcast has been broadly utilized in wireless communication networks. With the rapid increase of on-demand data dissemination services in burgeoning applications, clients are not satisfied with one da...
详细信息
ISBN:
(纸本)9781509040933
On-demand data broadcast has been broadly utilized in wireless communication networks. With the rapid increase of on-demand data dissemination services in burgeoning applications, clients are not satisfied with one data item per request but turn to multiple data item per request, while most of the existing scheduling algorithms focus on single-item request environment. In this work, we lucubrate the performance of the original scheduling algorithms that are proposed for singleitem request based on network coding in multi-item request circumstances. The simulations come out that more hot data requested and larger cache size have positive effects on the performance of average access time and deadline miss ratio.
In this paper, the performance of network coding-based gossip algorithms-i.e. algebraic gossip algorithms-is analyzed on random geometric graphs under static and mobile environments. The lower bounds for the convergen...
详细信息
ISBN:
(纸本)9781509040650
In this paper, the performance of network coding-based gossip algorithms-i.e. algebraic gossip algorithms-is analyzed on random geometric graphs under static and mobile environments. The lower bounds for the convergence time of algebraic gossip algorithms are derived based on the conductance, and these bounds are O(n log n log epsilon(-1) - log n log epsilon(-1)) with node mobility and O((n(3/2) - n(1/2))log epsilon(-1)/log(1/2)n) without node mobility. Theoretical results show that algebraic gossip algorithms with node mobility converge O(n(1/2)/log(3/2)n) more quickly than without node mobility, and O(log n) more quickly than a gossip algorithm with node mobility but without network coding. Finally, we assess and compare the convergence time of various gossip algorithms, with both mobility and network coding. As corroborated by extensive numerical experimentation, integrated network coding with mobility can significantly improve the convergence time of information dissemination in dynamic environments.
Although random linear network coding (RLNC) constitutes a highly efficient and distributed approach to enhance communication networks and distributed storage, it requires additional processing to be carried out in th...
详细信息
ISBN:
(纸本)9781467398145
Although random linear network coding (RLNC) constitutes a highly efficient and distributed approach to enhance communication networks and distributed storage, it requires additional processing to be carried out in the network and in end devices. For mobile devices, this processing translates into energy use that may reduce the battery life of a device. This paper focuses not only on providing a comprehensive measurement study of the energy cost of RLNC in eight different computing platforms, but also explores novel approaches (e.g., tunable sparse network coding) and hardware optimizations for Single Instruction Multiple Data (SIMD) available in the latest generations of Intel and Advanced RISC Machines (ARM) processors. Our measurement results show that the former provides gains of two-to six-fold from the underlying algorithms over RLNC, while the latter provides gains for all schemes from 2x to as high as 20x. Finally, our results show that the latest generation of mobile processors reduce dramatically the energy per bit consumed for carrying out network coding operations compared to previous generations, thus making network coding a viable technology for the upcoming 5G communication systems, even without dedicated hardware.
Proposing of network coding breaks the traditional routing mode which is only responsible for receiving and forwarding information [1]. The researches show that network coding can improve the network throughput, reduc...
详细信息
ISBN:
(纸本)9781509007295
Proposing of network coding breaks the traditional routing mode which is only responsible for receiving and forwarding information [1]. The researches show that network coding can improve the network throughput, reduce node energy consumption, balance network load, reduce transmission delay, increase network fault tolerance and robustness, and improve information security [2]. This paper focuses on how to utilize network coding in wireless sensor networks and select typical wireless sensor networks routing protocol --- LEACH protocol as the object of study. In order to decrease the number of transmissions used, traffic in opposite directions over two wireless hops can utilize the advantage of network coding. Based on this point, this paper creates network coding opportunities on the Sink node in the LEACH protocol model and improve LEACH protocol model --- LEACH model based on network coding (NCLEACH model). Simulation shows that NCLEACH model has better performance. The network throughput and the Sink node residual energy are both improved
In this paper we introduce a network coding aware Medium Access Control (necoMAC) scheme that incorporates many protocols such as NCA-2PSP, 2PSP and NCA-CSMA in order to provide data transmission in higher rates with ...
详细信息
ISBN:
(纸本)9781509018574
In this paper we introduce a network coding aware Medium Access Control (necoMAC) scheme that incorporates many protocols such as NCA-2PSP, 2PSP and NCA-CSMA in order to provide data transmission in higher rates with fewer number of transmissions for multirate wireless networks. We create two golden topologies called golden chain and golden triangle, and calculate their energy consumption, overhead ratio, throughput and fairness for each protocol. We also set up a simulation to further analyze the performance of these protocols with the increasing number of nodes and flows. The simulation results show that the proposed scheme provides higher throughput and less energy consumption compared to the conventional CSMA/CA.
In this paper, we propose the Adaptive network coding (ANC) mechanism for multi-hop wireless networks. The ANC mechanism takes an adaptive approach to the network coding-based forwarding and focuses on improving the r...
详细信息
ISBN:
(纸本)9781467387965
In this paper, we propose the Adaptive network coding (ANC) mechanism for multi-hop wireless networks. The ANC mechanism takes an adaptive approach to the network coding-based forwarding and focuses on improving the robustness and the reliability of the network in the unreliable wireless environment. This paper introduces the Neighbor's Overhearing Link quality Measurement (NOLM) which allows the intermediate node to measure the quality of the overhearing channel of each of its one-hop neighbors in an indirect manner. The performance of our proposed mechanism is evaluated using the network simulator QualNet. The simulation results show that our ANC provides an average throughput gain of 56% in the fixed topology over the existing COPE.
This paper presents a smooth way to include network coding in the Constrained Application Protocol (CoAP) for large resource transmissions. Devices in the Internet of Things usually communicate using short messages wi...
详细信息
ISBN:
(纸本)9781509020546
This paper presents a smooth way to include network coding in the Constrained Application Protocol (CoAP) for large resource transmissions. Devices in the Internet of Things usually communicate using short messages with little data. In some cases, for example, requesting firmware updates, bigger resources need to be transferred. CoAP's recently finalized blockwise transfer scheme can handle large resources, but is not efficient in lossy environments. network coding has proven to be more error resistant. This paper demonstrates the limitations of CoAP's existing blockwise transfer scheme and presents a new approach, based on network coding. The evaluation compares CoAP's regular blockwise transfer to the new network coding extension. Measurements on an implemented client-server application with simulated losses and delay, confirm the benefits of the extension, resulting in reduced transfer durations.
Named Data networking(NDN) architecture promises significant advantages over current Internet architecture by replacing its host-centric design with a content-centric *** NDN,the mode that one Interest packet gets one...
详细信息
ISBN:
(纸本)9781509009107
Named Data networking(NDN) architecture promises significant advantages over current Internet architecture by replacing its host-centric design with a content-centric *** NDN,the mode that one Interest packet gets one Data packet can quite easily lead to Interest flooding and a huge number of the related ***,the absence of predefined connections is a challenge for NDN to efficiently manage the successive requests from consumers or the in-network concurrent *** this paper,we describes an adaptive traffic scheduling mechanism where multiple Data packets per Interest packet are allowed without violating the operational principle of original NDN protocol and in-network caching can be collaborated with network coding to achieve multi-path *** results show that the proposed scheme can significantly improve transmission efficiency and reduce system load including the number of Interest packets and lookup operations performed on the related tables in routers.
暂无评论