Nowadays, vehicles are not only merely used as a transportation medium, but also as a highly mobile Internet of Things (IoT) node, collecting data from all types of sources. The delivery of aggregated vehicle sensor d...
详细信息
ISBN:
(纸本)9781538663592;9781538663585
Nowadays, vehicles are not only merely used as a transportation medium, but also as a highly mobile Internet of Things (IoT) node, collecting data from all types of sources. The delivery of aggregated vehicle sensor data into the cloud for further analysis is very fragile, as vehicles move fast in their environment and channel conditions vary heavily. Next to mastering possible packet loss, communication protocols need to quickly adapt to the frequent data rate changes. Random Linear network coding (RLNC) has been proven as an efficient and robust mechanism for reliable data transfer especially on lossy channels. In this paper, the authors extend the Scalable network coding (ScalaNC) framework with the novel congestion control Bottleneck, Bandwidth and Round-Trip Time (BBR) in order to quickly adapt to the frequent changes in data rate and allow effective transfer of high amounts of data from vehicles and into the cloud. ScalaNC is validated in a Hardware-in-the-Loop field test consisting of a Long Term Evolution (LTE) base station and channel emulator.
This paper is devoted to multicomponent subspace codes with zero prefix (MZP) and their role in network coding. In fact, it is a collection of our results about multicomponent codes for last years. The MZP constructio...
详细信息
ISBN:
(纸本)9781728104331
This paper is devoted to multicomponent subspace codes with zero prefix (MZP) and their role in network coding. In fact, it is a collection of our results about multicomponent codes for last years. The MZP construction is described. The cardinality for different parameters is calculated. The efficiency as a ratio cardinality to the upper bound is estimated. It is shown that MZP additional components can increase cardinality up to 30 percents. The iterative decoding algorithm is presented. At the first stage of decoding it is necessary to obtain a MZP component and then, at the next stage to apply the decoding algorithm of Silva-Koetter-Kschischang (SKK) codes.
In this paper, we propose PopNetCod, a popularity-based caching policy for network coding enabled Named Data networking. PopNetCod is a distributed caching policy, in which each router measures the local popularity of...
详细信息
ISBN:
(纸本)9781538662809;9783903176089
In this paper, we propose PopNetCod, a popularity-based caching policy for network coding enabled Named Data networking. PopNetCod is a distributed caching policy, in which each router measures the local popularity of the content objects by analyzing the requests that it receives. It then uses this information to decide which Data packets to cache or evict from its content store. Since network coding is used, partial caching of content objects is supported, which facilitates the management of the content store. The routers decide the Data packets that they cache or evict in an online manner when they receive requests for Data packets. This allows the most popular Data packets to be cached closer to the network edges. The evaluation of PopNetCod shows an improved cache-hit rate compared to the widely used Leave Copy Everywhere placement policy and the Least Recently Used eviction policy. The improved cache-hit rate helps the clients to achieve higher goodput, while it also reduces the load on the source servers.
network coding simplifies routing decisions, improves throughput, and increases tolerance against packet loss. A fundamental limitation, however, is delay: decoding requires as many independent linear combinations as ...
详细信息
ISBN:
(纸本)9781538662809;9783903176089
network coding simplifies routing decisions, improves throughput, and increases tolerance against packet loss. A fundamental limitation, however, is delay: decoding requires as many independent linear combinations as data blocks. Prioritized network coding reduces this delay problem by introducing a hierarchy of prioritization layers. What remains is the problem of choosing a layer to approach two often-contradicting goals: reduce delay until prioritized layers can be decoded and keep the total number of transmissions low. In this paper, we propose an algorithm for this problem that - based on limited feedback - primarily minimizes per-layer delay but identifies opportunities to reduce the required transmissions when per-layer delay is unaffected. Our evaluation shows that our algorithm improves per-layer delay compared to hierarchical network coding and is close to the theoretical optimum number of total transmissions.
We revisit Physical-Layer network coding (PLNC) and the reasons preventing it from becoming a staple in wireless networks. We identify its strong coupling to the Two-Way Relay Channel (TWRC) as key among them due to i...
详细信息
ISBN:
(纸本)9781538647264
We revisit Physical-Layer network coding (PLNC) and the reasons preventing it from becoming a staple in wireless networks. We identify its strong coupling to the Two-Way Relay Channel (TWRC) as key among them due to its requiring crossing traffic flows and two-hop node coordination. We introduce SE-PLNC, a Source-Encoded PLNC scheme that is traffic pattern independent and involves coordination only among one-hop neighbors, making it significantly more practical to adopt PLNC in multi-hop wireless networks. To accomplish this, SE-PLNC introduces three innovations: it combines bit-level with physical-level network coding, it shifts most of the coding burden from the relay to the source of the PLNC scheme, and it leverages multi-path relaying opportunities available to a particular traffic flow. We evaluate SE-PLNC using theoretical analysis, proof-of-concept implementation on a Universal Software Radio Peripherals (USRP) testbed, and simulations. The theoretical analysis shows the scalability of SE-PLNC and its efficiency in large ad-hoc networks while the testbed experiments its real-life feasibility. Large-scale simulations show that TWRC PLNC barely boosts network throughput while SE-PLNC improves it by over 30%.
Energy efficiency becomes increasingly important due to the limited battery capacity in wireless devices while at the same time user throughput requirements are relentlessly increasing. In this paper, we study an ener...
详细信息
Energy efficiency becomes increasingly important due to the limited battery capacity in wireless devices while at the same time user throughput requirements are relentlessly increasing. In this paper, we study an energy efficient cooperation scheme which employs network coding to enhance the energy efficiency for mobile devices. Herein we propose that the mobile devices are clustered into mobile small cells with one of the mobile devices acting as a group head with basic transceiver, coding and relaying functionalities. Group heads coordinate the transmissions from the mobile devices in the mobile small cell to the networks base stations. The objective function of the cooperative scheme is to minimize mobile devices' energy consumption subject to a certain bit error probability. The proposed network-coding based scheme has been evaluated by means of numerical simulations and compared to both a conventional direct transmit scheme, with no cooperation groups, and a cooperative relaying scheme. Results show that, with network-coded cooperation, energy efficiency may significantly increase provided the density of base stations and mobile devices is below a certain value. Above this value none of the compared cooperation schemes may improve energy efficiency, but rather power consumption is reduced only when mobile devices transmit via base stations in their close proximity.
In order to solve the problem of existing routing algorithms,an efficient routing algorithm based on dynamic segmentation network coding(ERBNC) is *** compressing the header of the encoded packet,deleting the redundan...
详细信息
In order to solve the problem of existing routing algorithms,an efficient routing algorithm based on dynamic segmentation network coding(ERBNC) is *** compressing the header of the encoded packet,deleting the redundant ACK packet and setting the priority of sending the encoded packet,the proposed algorithm reduces the network overhead and packet average end-to-end *** simulation experiments of ERBNC algorithm,dynamic segmented network coding(DSNC) algorithm and segmented network coding(SNC) algorithm were completed by using OPNET simulation *** performance of various algorithms is compared and *** simulation results show that the ERBNC algorithm can effectively reduce the network overhead and reduce the average end-to-end delay of data packets.
A noncoherent two-way relaying system is developed using physical-layer network coding for improved throughput over conventional relaying in a fading channel. Energy-efficient noncoherent operation is achieved using m...
详细信息
network coding is an effective idea to boost the capacity of wireless networks, and a variety of studies have explored its advantages in different scenarios. However, there is not much analytical study on throughput a...
详细信息
Secure network coding realizes the secrecy of the message when the message is transmitted via noiseless network and a part of edges or a part of intermediate nodes are eavesdropped. In this framework, if the channels ...
详细信息
暂无评论