In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, c...
详细信息
In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., random linear network coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.
Using random linear network coding (RLNC) in asynchronous networks with one-to-many information flow has already been proven to be a valid approach to maximize the channel capacities. Message-based consensus protocols...
详细信息
Using random linear network coding (RLNC) in asynchronous networks with one-to-many information flow has already been proven to be a valid approach to maximize the channel capacities. Message-based consensus protocols such as practical Byzantine fault tolerance (pBFT) adhere partially to said scenario. Protocol phases with many-to-many communication, however, still suffer from quadratic growth in the number of required transmissions to reach consensus. We show that an enhancement in the data transmission behavior in the quadratic phases is possible through combining RLNC with pBFT as one hybrid protocol. We present several experiments conducted on randomnetwork topologies. We conclude that using RLNC-based data transmission offers a significantly better performance under specific circumstances, which depend on the number of participating network nodes and the chosen coding parameters. Applying the same approach to other combinations of message-based consensus and networkcoding protocols promises not only a gain in performance, but may also improve robustness and security and open up new application scenarios for RLNC, e.g., running it on the application layer.
Future networks require low latency communications which can be achieved using networkcoding. While random linear network coding is an effective technique for disseminating information in networks, it is highly sensi...
详细信息
Future networks require low latency communications which can be achieved using networkcoding. While random linear network coding is an effective technique for disseminating information in networks, it is highly sensitive to error propagation. Classical error correction codes are therefore inadequate to solve the problem, which requires new techniques. Recently, Kotter and Kschischang (KK) codes, have been proposed for error control in non-coherent random linear network coding. These codes can also be constructed from the lifting of rank metric codes (LRMC) as Gabidulin codes. In this paper, we first propose a novel coding scheme in mesh networks to improve the performance of KK and LRMC codes in random linear network coding, using cyclic redundancy check (CRC) codes to prevent error propagation. Then, we give a performance evaluation and comparison between KK and LRMC codes in terms of Packet Error Rate (PER) without and with error detection. Simulation results show that a significant performance improvement in terms of PER is achieved using our proposed scheme.
Unlike general routing strategies, networkcoding (NC) can combine encoding functions with multi-path propagation over a network. This allows network capacity to be achieved to support complex security solutions. More...
详细信息
Unlike general routing strategies, networkcoding (NC) can combine encoding functions with multi-path propagation over a network. This allows network capacity to be achieved to support complex security solutions. Moreover, NC has intrinsic security advantages against passive attacks over traditional routing techniques. However, due to the transmission of the global encoding kernels, the system is fragile to eavesdropping attacks with multiple probes. This paper proposes a generic unicast secure transmission scheme based on random linear network coding (RLNC). Specifically, the intended receiver generates a random matrix upon receiving the request from the source node, and then transmits each row vector of this matrix over a link reversely to the source node. Each intermediate node rearranges all received vectors to form a matrix by row, and then post-multiplies its local encoding kernel by this matrix to obtain a new matrix. Similarly, each row vector of the new matrix is reversely transmitted over a link to the source node. This procedure is performed until we have the source node, where the generalized inverse of the received matrix (or part of it) can be used as its local encoding kernel. Hence, the intended receiver can use the generated matrix (or the corresponding part) to decode the received data packets directly. We also analyze the security to demonstrate that the proposed scheme is at least as secure as other methods against wiretapping attacks. We also evaluate the performance of the proposed scheme to demonstrate its utility.
The authors investigate physical layer security design, which employs a random linear network coding with opportunistic relaying and jamming to exploit the secrecy benefit of both source and relay transmissions. The p...
详细信息
The authors investigate physical layer security design, which employs a random linear network coding with opportunistic relaying and jamming to exploit the secrecy benefit of both source and relay transmissions. The proposed scheme requires the source to transmit artificial noise along with a confidential message. Moreover, in order to further improve the dynamical behaviour of the network against an eavesdropping attack, aggregated power controlled transmissions with optimal power allocation strategy is considered. The network security is accurately characterised by the probability that the eavesdropper will manage to intercept a sufficient number of coded packets to partially or fully recover the confidential message.
In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base *** this paper,the scenario wher...
详细信息
In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base *** this paper,the scenario where the demands of a vehicle are satisfied by cooperative transmissions from those one in front is *** the topology of the vehicle network is dynamic,random linear network coding is applied in such a multisource single-sink vehicle-to-vehicle network,where each vehicle is assumed to broadcast messages to others so that the intermediate vehicles between sources and sink can reduce the latency *** is shown that the coding scheme can significantly reduce the time delay compared with the non-coding scheme even in the channels with high packet loss *** order to further optimize the coding scheme,one can increase the generation size,where the generation size means the number of raw data packets sent by the source node to the sink node in each round of *** the premise of satisfying the coding validity,we can dynamically select the Galois field size according to the number of intermediate *** is not surprised that the reduction in the Galois field size can further reduce the transmission latency.
In wireless broadcast, random linear network coding (RLNC) over GF(2(L)) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential a...
详细信息
In wireless broadcast, random linear network coding (RLNC) over GF(2(L)) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF(2(L)). In this paper, a comprehensive analysis of completion delay and decoding complexity is conducted for field-based systematic RLNC schemes in wireless broadcast. In particular, we prove that the RLNC scheme over GF(2) can also asymptotically approach the optimal completion delay per packet when the packet number goes to infinity. Moreover, we introduce a new method, based on circular-shift operations, to design RLNC schemes which avoid multiplications over large GF(2(L)). Based on both theoretical and numerical analyses, the new RLNC schemes turn out to have a much better trade-off between completion delay and decoding complexity. In particular, numerical results demonstrate that the proposed schemes can attain average completion delay just within 5% higher than the optimal one, while the decoding complexity is only about 3 times the one of the RLNC scheme over GF(2).
By extending the traditional store-and-forward mechanism, networkcoding has the capability to improve a network's throughput, robustness, and security. Given the fundamentally different packet processing required...
详细信息
ISBN:
(纸本)9781728143873
By extending the traditional store-and-forward mechanism, networkcoding has the capability to improve a network's throughput, robustness, and security. Given the fundamentally different packet processing required by this new paradigm and the inflexibility of hardware, existing solutions are based on software. As a result, they have limited performance and scalability, creating a barrier to its wide-spread adoption. By leveraging the recent advances in programmable networking hardware, in this paper we propose a random linear network coding data plane written in P4, as a first step towards a production-level platform. Our solution includes the ability to combine the payload of multiple packets and of executing the required Galois field operations, and shows promise to be practical even under the strict memory and processing constraints of switching hardware.
In wireless broadcast, random linear network coding (RLNC) over GF(2(L)) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential a...
详细信息
ISBN:
(纸本)9781728150895
In wireless broadcast, random linear network coding (RLNC) over GF(2(L)) is known to asymptotically achieve the optimal completion delay with increasing L. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF(2(L)). In this paper, a comprehensive analysis of completion delay and decoding complexity is conducted for field-based systematic RLNC schemes in wireless broadcast. In particular, we prove that the RLNC scheme over GF(2) can also asymptotically approach the optimal completion delay per packet when the packet number goes to infinity. Moreover, we introduce a new method, based on circular-shift operations, to design RLNC schemes which avoid multiplications over large GF(2(L)). The new RLNC schemes turn out to have a much better trade-off between completion delay and decoding complexity. In particular, numerical results demonstrate that the proposed schemes can attain average completion delay just within 5% higher than the optimal one, while the decoding complexity is only about 3 times the one of the RLNC scheme over GF(2).
This paper considers throughput of an unreliable single-hop broadcast channel by employing random linear network coding technology at the source node. Closed form expressions of the total broadcast throughput for each...
详细信息
ISBN:
(纸本)9781728121840
This paper considers throughput of an unreliable single-hop broadcast channel by employing random linear network coding technology at the source node. Closed form expressions of the total broadcast throughput for each transmission time slot are derived for system random linear network coding and non-systematic random linear network coding, respectively. Furthermore, the expressions of the total broadcast throughput are also presented in a recursive manner. These expressions is related to the link erasure probability, the number of subscribers in the broadcast link, the number of packets per generation, and the field size. We then investigate the impact of the link erasure probability, the number of receivers, the generation size, and the field size on the throughput performance gains of system random linear network coding and non-systematic random linear network coding over the round robin transmission scheme.
暂无评论