Search

The capacity of a linearly homomorphic signature (LHS) to facilitate linear computations on signed data is a frequently employed feature to safeguard network coding-based applications against pollution attacks. The security of LHS wholly depends on the security of secret signing keys; once a secret key is compromised, the application system's security will be broken. However, as relatively insecure mobile devices are increasingly used in network-coding application systems, the key exposure issue is becoming more prevalent. In order to mitigate the harm of key exposure to LHS deployed in network coding systems, we integrate forward security into LHS and use the fixed-dimension lattice basis delegation technique and the additive homomorphic hash function family to propose a forward-secure identity-based LHS scheme, which achieves post-quantum security while ensuring the validity of signatures from previous time periods even if the current secret key is compromised. The proposed scheme supports performing linearly homomorphic operations over the binary field so that the calculation of messages is a simple XOR operation. In this way, the decoding of the target node is equivalent to solving a linear system on F 2 , making it very suitable for deployment in network coding systems. We then define the first security model on the forward security of LHS and prove that the proposed scheme can resist adaptively chosen identity and dataset attacks under lattice assumptions. Moreover, compared with previous related works, the performance analysis shows that our scheme enjoys a comparable computation cost, has a lower communication cost, and provides higher security and stronger functionality. [ABSTRACT FROM AUTHOR]

In recent years, network coding has attracted widespread attention due to its important role in digital communication and network security. Among these, cyclic subspace codes have very important applications in error correction and rectification in random network coding, attracting many scholars to conduct research on them. As an important tool in constructing cyclic subspace codes, the present study focuses on the construction of Sidon spaces by leveraging the roots of irreducible polynomials and primitive elements over finite fields. In this paper, we construct some Sidon spaces with new parameters. Specifically, we let k , m 1 , m 2 be three positive integers and define ρ 1 = m 1 2 k − 1 , ρ 2 = m 2 2 m 1 − 1 . On the basis of these newly constructed Sidon spaces, we obtain new cyclic subspace codes with size ρ 1 ρ 2 q k q n − 1 q − 1 and minimum distance 2 k . [ABSTRACT FROM AUTHOR]

A subspace of a finite field is called a Sidon space if the product of any two of its nonzero elements is unique up to a scalar multiplier from the base field. Sidon spaces, introduced by Roth et al. in (IEEE Trans Inf Theory 64(6):4412–4422, 2018), have a close connection with optimal full-length orbit codes. In this paper, we will construct several families of large cyclic subspace codes based on the two kinds of Sidon spaces. These new codes have more codewords than the previous constructions in the literature without reducing minimum distance. In particular, in the case of n = 4 k , the size of our resulting code is within a factor of 1 2 + o k (1) of the sphere-packing bound as k goes to infinity. [ABSTRACT FROM AUTHOR]

Abstract Wireless communication systems are inherently challenged by factors such as fading, path loss, and shadowing, leading to potential errors in data transmission. Traditional methods to mitigate these issues include power control, diversification, variable beamforming, and modulation techniques. However, the unpredictable nature of the wireless medium often limits their effectiveness. A new approach to address these challenges is the implementation of cascaded intelligent reflecting surfaces (IRS). IRS systems consist of multiple passive elements that intelligently reflect electromagnetic waves, thereby enhancing signal quality. The Advanced Discrete Fourier Transform (ADFT) matrix scheme is explored in channel estimation, a novel method particularly suitable for wireless networks utilising cascaded IRS. The ADFT matrix scheme is significant for its efficiency in managing the common‐link configuration of cascading channel coefficients, which effectively reduces pilot overhead. When compared to traditional channel estimation methods like the Least Square|least squares, Maximal a posteriori probability, and Linear Minimum Mean Square Error, the ADFT matrix scheme exhibits superior performance. It achieves a remarkable reduction in normalised mean squared error (NMSE) – 66% and 80% at 20 dB and 15 dB Signal to‐Noise Ratios (SNR), respectively. Furthermore, increasing the pilot length correlates with enhanced NMSE performance, with a noted 33% improvement as the base station distance increases. Simulations demonstrate that with an escalation in the number of IRS elements and SNR, the ADFT matrix scheme consistently surpasses conventional methods. This advancement represents a significant leap in the field of wireless communication technology.

Homomorphic signature is an extremely important public key authentication technique for network coding to defend against pollution attacks. However, there are many problems with previous homomorphic signature schemes which require key escrow, cannot resist malicious key generation center (KGC), and are insecure in the post-quantum era. Therefore, we propose a lattice-based certificateless linearly homomorphic signature scheme. In our scheme, certificateless structure can avoid key escrow and malicious KGC. The lattice structure ensures that our scheme is secure in the post-quantum era. The bimodal Gaussian distribution is used to improve the security and the efficiency. Compared with the previous schemes, our scheme has smaller storage space (no key escrow), can avoid malicious KGC, is more secure in the post-quantum era, and has higher signature efficiency. At the same time, our scheme is more suitable for network coding. Finally, under random oracle model, we proved that our scheme is weakly context hiding and existentially unforgeable against adaptive chosen message attacks against external attackers and the internal KGC. [ABSTRACT FROM AUTHOR]

The complete characterization of the almost-entropic region yields rate regions for network coding problems. However, this characterization is difficult and open. In this paper, we propose a novel algorithm to determine whether an arbitrary vector in the entropy space is entropic or not, by parameterizing and generating probability mass functions by neural networks. Given a target vector, the algorithm minimizes the normalized distance between the target vector and the generated entropic vector by training the neural network. The algorithm reveals the entropic nature of the target vector, and obtains the underlying distribution, accordingly. The proposed algorithm was further implemented with convolutional neural networks, which naturally fit the structure of joint probability mass functions, and accelerate the algorithm with GPUs. Empirical results demonstrate improved normalized distances and convergence performances compared with prior works. We also conducted optimizations of the Ingleton score and Ingleton violation index, where a new lower bound of the Ingleton violation index was obtained. An inner bound of the almost-entropic region with four random variables was constructed with the proposed method, presenting the current best inner bound measured by the volume ratio. The potential of a computer-aided approach to construct achievable schemes for network coding problems using the proposed method is discussed. [ABSTRACT FROM AUTHOR]

Wireless communication systems are inherently challenged by factors such as fading, path loss, and shadowing, leading to potential errors in data transmission. Traditional methods to mitigate these issues include power control, diversification, variable beamforming, and modulation techniques. However, the unpredictable nature of the wireless medium often limits their effectiveness. A new approach to address these challenges is the implementation of cascaded intelligent reflecting surfaces (IRS). IRS systems consist of multiple passive elements that intelligently reflect electromagnetic waves, thereby enhancing signal quality. The Advanced Discrete Fourier Transform (ADFT) matrix scheme is explored in channel estimation, a novel method particularly suitable for wireless networks utilising cascaded IRS. The ADFT matrix scheme is significant for its efficiency in managing the common‐link configuration of cascading channel coefficients, which effectively reduces pilot overhead. When compared to traditional channel estimation methods like the Least Square|least squares, Maximal a posteriori probability, and Linear Minimum Mean Square Error, the ADFT matrix scheme exhibits superior performance. It achieves a remarkable reduction in normalised mean squared error (NMSE) – 66% and 80% at 20 dB and 15 dB Signal to‐Noise Ratios (SNR), respectively. Furthermore, increasing the pilot length correlates with enhanced NMSE performance, with a noted 33% improvement as the base station distance increases. Simulations demonstrate that with an escalation in the number of IRS elements and SNR, the ADFT matrix scheme consistently surpasses conventional methods. This advancement represents a significant leap in the field of wireless communication technology. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicles (UAVs) have emerged as efficient tools in disaster-stricken areas, facilitating efficient data dissemination for post-disaster rescue operations. However, the limited onboard energy of UAVs imposes significant constraints on their operational lifespan, thereby presenting substantial challenges for efficient data dissemination. Therefore, this work investigates a data dissemination scheme to enhance the UAVs' bandwidth efficiency in multi-UAV-enabled Internet of Vehicles, thereby reducing UAVs' energy consumption and improving overall system performance when UAVs hover along designated flight trajectories for data dissemination. Specifically, first, we present a software-defined network-based framework for data dissemination in multi-UAV-enabled IoV. According to this framework, we formulate a problem called C2BS (Coding-based Cooperative Broadcast Scheduling) that focuses on optimizing the UAVs' bandwidth efficiency by leveraging the combined benefits of coding and caching. Furthermore, we demonstrate the NP-hardness of the C2BS problem by employing a polynomial time reduction technique on the simultaneous matrix completion problem. Then, inspired by the benefits offered by genetic algorithms, we propose a novel approach called the Genetic algorithm-based Cooperative Scheduling (GCS) algorithm to address the C2BS problem. This approach encompasses a coding scheme for representing individuals, a fitness function for assessing individuals, operators (i.e., crossover and mutation) for generating offspring, a local search technique to enhance search performance, and a repair operator employed to rectify infeasible solutions. Additionally, we present an analysis of the time complexity for the GCS algorithm. Finally, we present a simulation model to evaluate the performance. Experimental findings provide evidence of the excellence of the proposed scheme. [ABSTRACT FROM AUTHOR]

A Software-Defined Wireless Sensor Networks (SDWSNs) architecture is firstly proposed to address the issues of inflexible architecture strategies and low scalability of traditional WSNs in this article. The SDWSNs architecture involves the design of a software-defined sensor network model and a customized controller architecture, along with an analysis of the functionalities of each management module within the controller architecture. Secondly, to tackle limited energy problem of sensor nodes, a network coding opportunistic routing method (SDN-COR) is presented based on SDWSNs. This method incorporates considerations of coding opportunities, vertical distance, and remaining energy of nodes to design a metric for encoding opportunistic routing. By combining opportunistic forwarding mechanisms, candidate forwarding sets are selected and sorted based on priority to prioritize data transmission by higher-priority nodes. Simulation results indicate that, comparing with conventional methods, this approach achieves reduction in energy consumption by an average of 21.5%, improves network throughput by 24%, and extends network lifetime by 20%. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Chongqing University of Posts & Telecommunications (Natural Science Edition) is the property of Chongqing University of Posts & Telecommunications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In this paper we consider a scenario where there are two wireless body area networks (WBANs) interfere with each other from a game theoretic perspective. In particular, we envision two WBANs playing a potential game to enhance their performance by decreasing interference to each other. Decreasing interference extends the sensors' batteries life time and reduces the number of re‐transmissions. We derive the required conditions for the game to be a potential game and its associated the Nash equilibrium (NE). Specifically, we formulate a game where each WBAN has three strategies. Depending on the payoff of each strategy, the game can be designed to achieve a desired NE. Furthermore, we employ a learning algorithm to achieve that NE. In particular, we employ the Fictitious play (FP) learning algorithm as a distributed algorithm that WBANs can use to approach the NE. The simulation results show that the NE is mainly a function of the power cost parameter and a reliability factor that we set depending on each WBAN setting (patient). However, the power cost factor is more dominant than the reliability factor according to the linear cost function formulation that we use throughout this work. [ABSTRACT FROM AUTHOR]

As the demand for sensing and monitoring the marine environment increases, the Ocean Mobile Internet of Things (OM-IoT) has gradually attracted the interest of researchers. However, the unreliability of communication links represents a significant challenge to data transmission in the OM-IoT, given the complex and dynamic nature of the marine environment, the mobility of nodes, and other factors. Consequently, it is necessary to enhance the reliability of underwater data transmission. To address this issue, this paper proposes a reinforcement learning-based adaptive network coding (RL-ANC) approach. Firstly, the channel conditions are estimated based on the reception acknowledgment, and a feedback-independent decoding state estimation method is proposed. Secondly, the sliding coding window is dynamically adjusted based on the estimates of the channel erasure probability and decoding probability, and the sliding rule is adaptively determined using a reinforcement learning algorithm and an enhanced greedy strategy. Subsequently, an adaptive optimization method for coding coefficients based on reinforcement learning is proposed to enhance the reliability of the underwater data transmission and underwater network coding while reducing the redundancy in the coding. Finally, the sampling period and time slot table are updated using the enhanced simulated annealing algorithm to optimize the accuracy and timeliness of the channel estimation. Simulation experiments demonstrate that the proposed method effectively enhances the data transmission reliability in unreliable communication links, improves the performance of underwater network coding in terms of the packet delivery rate, retransmission, and redundancy transmission ratios, and accelerates the convergence speed of the decoding probability. [ABSTRACT FROM AUTHOR]

Signal space alignment (SSA) is a promising technique for interference management in wireless networks. However, despite the excellent work done on SSA, its robustness against jamming attacks has not been considered in the literature. In this paper, we propose two antijamming strategies for the SSA scheme applied in the multiple-input–multiple-output (MIMO) Y channel. The first scheme involves projecting the jamming signal into the null space of each source's precoding vectors, effectively eliminating it entirely. The second scheme removes interference originating from the jammer by subtracting the disturbance estimate from the incoming signal. The estimate is derived on the basis of the criterion of minimizing the received signal energy. The block error rate (BLER) performance of the proposed strategies in various channel configurations is verified by link level simulations and is presented to show the efficiency in mitigating jamming signals within the SSA-based MIMO Y channel. [ABSTRACT FROM AUTHOR]

Ensuring source location privacy is crucial for the security of underwater acoustic sensor networks amid the growing use of marine environmental monitoring. However, the traditional source location privacy scheme overlooks multi-attacker cooperation strategies and also has the problem of high communication overhead. This paper addresses the aforementioned limitations by proposing an underwater source location privacy protection scheme based on game theory under the scenario of multiple cooperating attackers (SLP-MACGT). First, a transformation method of a virtual coordinate system is proposed to conceal the real position of nodes to a certain extent. Second, through using the relay node selection strategy, the diversity of transmission paths is increased, passive attacks by adversaries are resisted, and the privacy of source nodes is protected. Additionally, a secure data transmission technique utilizing fountain codes is employed to resist active attacks by adversaries, ensuring data integrity and enhancing data transmission stability. Finally, Nash equilibrium could be achieved after the multi-round evolutionary game theory of source node and multiple attackers adopting their respective strategies. Simulation experiments and performance evaluation verify the effectiveness and reliability of SLP-MACGT regarding aspects of the packet forwarding success rate, security time, delay and energy consumption: the packet delivery rate average increases by 30%, security time is extended by at least 85%, and the delay is reduced by at least 90% compared with SSLP, PP-LSPP, and MRGSLP. [ABSTRACT FROM AUTHOR]

Blockchain technology has witnessed a burgeoning integration into diverse realms of economic and societal development. Nevertheless, scalability challenges, characterized by diminished broadcast efficiency, heightened communication overhead, and escalated storage costs, have significantly constrained the broad-scale application of blockchain. This paper introduces a novel Encode-and CRT-based Scalability Scheme (ECSS), meticulously refined to enhance both block broadcasting and storage. Primarily, ECSS categorizes nodes into distinct domains, thereby reducing the network diameter and augmenting transmission efficiency. Secondly, ECSS streamlines block transmission through a compact block protocol and robust RS coding, which not only reduces the size of broadcasted blocks but also ensures transmission reliability. Finally, ECSS utilizes the Chinese remainder theorem, designating the block body as the compression target and mapping it to multiple modules to achieve efficient storage, thereby alleviating the storage burdens on nodes. To evaluate ECSS's performance, we established an experimental platform and conducted comprehensive assessments. Empirical results demonstrate that ECSS attains superior network scalability and stability, reducing communication overhead by an impressive 72% and total storage costs by a substantial 63.6%. [ABSTRACT FROM AUTHOR]

Random Linear Network Coding (RLNC) is well-known to provide high throughput and low latency for vast communication networks. However, RLNC often suffers from high coefficients overhead, specifically, when it's applied to limited resource or short-packet networks. Herein, the problem of RLNC coefficients vector overhead is revisited. A novel framework, based on modular arithmetic and prime numbers, and influenced by the Chinese remainder theorem (CRT), is proposed to reduce the coefficients overhead by augmenting only a tiny one item coefficient instead of the entire coefficients vector. The proposed method successfully addresses all the shortcomings of previous methods, including restrictions on generation size and packet density, recoding on intermediate nodes, and creating innovative coding vectors. Theoretical analysis and experimental demonstrate the superior performance of the proposed scheme in terms of coefficients overhead ratio, download time, throughput, and packet drop rate. This evaluation has considered two types of networks: wireless sensors network for Internet of things, and conventional wireline Ethernet. [ABSTRACT FROM AUTHOR]

The multi-hop wireless sensor network (WSN) suffers from energy limitation and eavesdropping attacks. We propose a simple and energy-efficient convergecast mechanism using inter-flow random linear network coding that can provide confidentiality to the multi-hop WSN. Our scheme consists of two steps, constructing a logical tree of sensor nodes rooted at the sink node, with using the Bloom filter, and transmitting sensory data encoded by sensor nodes along the logical tree upward to the sink where the encoded data are decoded according to our proposed multi-hop network coding (MHNC) mechanism. We conducted simulations using OMNET++ CASTALIA-3.3 framework and validated that MHNC outperforms the conventional mechanism in terms of packet delivery ratio, data delivery time and energy efficiency. [ABSTRACT FROM AUTHOR]

Network coding is a potent technique extensively utilized in decentralized Internet of Things (IoT) systems, including the Internet of Medical Things (IoMT). Nevertheless, the inherent packet-mixing characteristics of network coding expose data transmission to pollution attacks, potentially compromising the integrity of original files. The homomorphic signature scheme serves as a robust cryptographic tool that can bolster network coding's resilience against such attacks. However, current schemes are computationally intensive for signature verification, making them impractical for IoMT environments. In this study, we propose a lightweight identity-based network coding scheme (IBNS) that minimizes computational overhead during the signing and verification processes. This scheme has been demonstrated to be secure against adaptive chosen-message attacks and is well-suited for IoMT applications. Furthermore, we assess the performance of our IBNS through both theoretical and experimental analyses. Simulation outcomes confirm that our scheme outperforms previous ones in terms of practicality and efficiency. [ABSTRACT FROM AUTHOR]

Multicast transmission is the natural approach to efficiently transport data from a source to multiple receivers using minimum network bandwidth. Two incompatible options exist to realize this multicast support: the classical one is the design and deployment of a specific multicast routing protocol at the network layer, and the other one is the shift toward a network-coding solution where the routers encode incoming packets into algebraic structures before forwarding them to the next hop. Both alternatives involve practical complexities that have hindered their adoption at a large scale in content delivery networks (CDN) due to their signaling overhead, but mainly because in both cases the network must adhere to an all-or-nothing behavior: either all the routers follow the rules of the data and control planes, or the schemes fail to work globally. In this paper, we propose Source-Coded Multicast (SCM), a novel technique for content delivery in multicast networks that uses the network bandwidth efficiently while requiring encoding operations only at the source node. Thus, SCM does not rely on a strict multicast routing protocol nor on re-encoding algorithms at the routers, so it is both practical and useful for CDNs and other applications. We further extend the approach to aggregated sources, i.e., multiple multicast sources with partially overlapped distribution trees. Our numerical results show that SCM is optimal or nearly optimal in a large fraction of network topologies, and overcomes the complexity of legacy IP-based multicast and network coding.

Index coding is an elegant and powerful idea for minimal usage of broadcast channels that investigates the fundamental limits and optimal coding schemes in information flow networks such as wireless networks, data storage networks, and content delivery networks. Minimal usage of broadcast channels is the main requirement of efficient information broadcasting in information flow networks which is the ultimate goal for successful communication. Finding the optimal index code with extreme rate for the class of index coding problems is the fundamental question in index coding. In this work, we present a new class of index coding problems with the size of maximum acyclic induced subgraph = 3. We refer to this class of index coding problems as $class \mathbb {III}$ index coding problems. Our goal is to characterize the extreme rate (i.e., the optimal index code length for extreme rate) for $class \mathbb {III}$ index coding problems. We show that the optimal linear index code of the $class \mathbb {III}$ index coding problem over $\mathbb {F}_{2}$ achieves the extreme rate on the broadcast rate. To present this new result, we use the results of index coding network coding duality. In contrast with this new result, we also present that there exists maximum acyclic induced subgraph size 3 index coding problems with the optimal broadcast rate strictly greater than the extreme rate. To present this contrast, we use the alignment graph and the conflict hyper graph based approach.

This paper proposes a reliable data dissemination framework for edge networks, leveraging network coding combined with low-rank approximation. We consider an edge network that consists of a server and power-limited mobile devices, where the data is broadcasted by the server. In such networks, broadcasted data may be lost due to poor channel conditions or the interference caused by the mobility of edge mobile devices, particularly without a retransmission mechanism. This can cause application errors in edge devices, lower the Quality of Service (QoS), and compromise network stability. To overcome these challenges, we propose a framework for reliable edge networks in broadcasting without retransmissions. The edge network reliability can be achieved by the approximate decoding of broadcasted data. In the proposed framework, the edge server employs matrix factorization to encode data with principal components, ensuring a lower decoding error rate even with potential packet losses. Furthermore, the proposed framework can shift the computational complexity from mobile edge devices to the edge server using the low-rank approximation at the decoding stage, effectively mitigating power limitations on mobile devices. Through theoretical analysis, we demonstrate that the proposed algorithm outperforms typical broadcasting in terms of decoding accuracy, and present an upper bound error rate for the proposed algorithm. The simulation results confirm that the proposed algorithm outperforms other state-of-the-art algorithms in terms of decoding accuracy, time delay, and complexity.

Wireless Sensor Networks (WSNs) comprise interconnected wireless nodes that receive and transmit data across applications and platforms. This paper addressed the problem of link failures in WSNs that potentially could lead to the loss of data packets while still in transit. This was achieved through the use of network coding which is known to address capacity bottleneck problems in WSNs. In particular, a technique called Ant Agent-Assisted Network Coding (AAANC) is proposed that employs the ant colony optimization technique in addition to network coding operations. The main aim of AAANC is to facilitate the successful delivery and decoding of coded data packets in the presence of link failures. AAANC employs a packet route selection technique that is inspired by the social behavior of natural ants. For natural ants, a strong pheromone trail along a path indicates a promising route to a food source, and this is analogous to a reliable communication link for routing data packets in this paper. Through simulations, AAANC was compared to diagonal pseudorandom network coding (DNC) and triangular pseudorandom network coding (TNC), and it proved to have a superior performance in terms of packet delivery ratio and number of decoded packets. Significant performance gain can be achieved if AAANC algorithm is made to dynamically adapt the ant colony and network coding parameters in response to traffic changes. [ABSTRACT FROM AUTHOR]

This letter proposes an augmented scheme of LT codes to improve the decoding success rate. The method involves substituting the 1‐s in full‐degree columns of the generator matrix of conventional LT codes with binary extension field elements and simultaneously increasing the ratio of full‐degree columns in the ideal soliton distribution. For non‐full‐degree columns, we retain the nonzero elements as 1‐s in the conventional LT codes generator matrix to preserve computational efficiency. Compared to conventional LT codes, the proposed method enhances the linear independence of the generator matrix, leading to a higher decoding success rate with minimal data packets. Experimental results demonstrate the effectiveness of the method at improving the performance of LT codes, with close to 100% decoding success rate achieved with around 5% data redundancy. [ABSTRACT FROM AUTHOR]

Wireless Network security management is difficult because of the ever-increasing number of wireless network malfunctions, vulnerabilities, and assaults. Complex security systems, such as Intrusion Detection Systems (IDS), are essential due to the limitations of simpler security measures, such as cryptography and firewalls. Due to their compact nature and low energy reserves, wireless networks present a significant challenge for security procedures. The features of small cells can cause threats to the network. Network Coding (NC) enabled small cells are vulnerable to various types of attacks. Avoiding attacks and performing secure "peer" to "peer" data transmission is a challenging task in small cells. Due to the low power and memory requirements of the proposed model, it is well suited to use with constrained small cells. An attacker cannot change the contents of data and generate a new Hashed Homomorphic Message Authentication Code (HHMAC) hash between transmissions since the HMAC function is generated using the shared secret. In this research, a chaotic sequence mapping based low overhead 1D Improved Logistic Map is used to secure "peer" to "peer" data transmission model using lightweight H-MAC (1D-LM-P2P-LHHMAC) is proposed with accurate intrusion detection. The proposed model is evaluated with the traditional models by considering various evaluation metrics like Vector Set Generation Accuracy Levels, Key Pair Generation Time Levels, Chaotic Map Accuracy Levels, Intrusion Detection Accuracy Levels, and the results represent that the proposed model performance in chaotic map accuracy level is 98% and intrusion detection is 98.2%. The proposed model is compared with the traditional models and the results represent that the proposed model secure data transmission levels are high. [ABSTRACT FROM AUTHOR]

Desktop as a Service (DaaS) provides users with flexible, customizable and highly secure cloud based virtual desktop access. As the major carrier of execution results in DaaS, screen updates play an important role in users' quality of experience. In order to bring users the same feelings like manipulating a local device, timeliness and reliability should be balanced. However, a timely but unreliable transmission scheme (i.e. UDP) or a completely reliable transmission scheme (i.e. TCP) is inappropriate for such a transmission scenario, especially under a high-loss network. In this paper, we propose a Prediction and Network Coding based Transmission Scheme (PNCTS) for efficient screen updates delivery in DaaS. As an end-to-end partially reliable transmission scheme, it prioritizes different data obtained by partitioning screen updates and employs network coding and TFRC (TCP Friendly Rate Control) to compensate for data loss and adjust the sending rate of screen updates, respectively. To reduce the overhead of network coding, PNCTS uses a Hidden Markov Model to predict the reliability level of network and makes different encoding strategies for the data with different priorities. Simulation results show that PNCTS can improve display quality and instantaneous goodput effectively while maintaining end-to-end delay and jitter at a relatively low level under the static and time-varying network conditions. [ABSTRACT FROM AUTHOR]

Cognitive radio is one of the new technologies for 4G/5G applications, so cooperative relay communication and network coding are considered as certain methods to help improve their respective applications. A primary broadcast system for multimedia video streaming applications that broadcasts data to primary users and an auxiliary cooperative relay secondary cognitive radio system are considered. The secondary cooperative overlay system can use multiple error control coding methods for point-to-point data retransmission, such as channel coding, network coding, and combined coding methods to improve system performance under variable link conditions. A new technique of adaptive coding of AC2NC combined channel network for data retransmission is proposed. The new AC2NC first analyzes the channel feedback information and then selects the best retransmission coding technique based on the target bandwidth or transmission time optimization. This is instead of using a single static channel or a network coding technique with dynamic channel conditions. The proposed AC2NC improves system throughput, reduces retransmission time, and provides more spectrum access opportunities for the secondary system's own data transmissions. AC2NC's relative throughput and time saving capabilities for cognitive radio users have been shown to exceed ninety percent, under certain channel conditions, compared to some static coding methods. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicles (UAVs) have emerged as efficient tools in disaster-stricken areas, facilitating efficient data dissemination for post-disaster rescue operations. However, the limited onboard energy of UAVs imposes significant constraints on their operational lifespan, thereby presenting substantial challenges for efficient data dissemination. Therefore, this work investigates a data dissemination scheme to enhance the UAVs’ bandwidth efficiency in multi-UAV-enabled Internet of Vehicles, thereby reducing UAVs’ energy consumption and improving overall system performance when UAVs hover along designated flight trajectories for data dissemination. Specifically, first, we present a software-defined network-based framework for data dissemination in multi-UAV-enabled IoV. According to this framework, we formulate a problem called C2BS (Coding-based Cooperative Broadcast Scheduling) that focuses on optimizing the UAVs’ bandwidth efficiency by leveraging the combined benefits of coding and caching. Furthermore, we demonstrate the NP-hardness of the C2BS problem by employing a polynomial time reduction technique on the simultaneous matrix completion problem. Then, inspired by the benefits offered by genetic algorithms, we propose a novel approach called the Genetic algorithm-based Cooperative Scheduling (GCS) algorithm to address the C2BS problem. This approach encompasses a coding scheme for representing individuals, a fitness function for assessing individuals, operators (i.e., crossover and mutation) for generating offspring, a local search technique to enhance search performance, and a repair operator employed to rectify infeasible solutions. Additionally, we present an analysis of the time complexity for the GCS algorithm. Finally, we present a simulation model to evaluate the performance. Experimental findings provide evidence of the excellence of the proposed scheme.

In this paper, we propose Triangular Code (TC), a new class of fountain code with near-zero redundancy and linear encoding and decoding computational complexities of O(Lklogk), where k is the packet batch size and L is the packet data length. Different from previous works where the optimal performance of codes has been shown under asymptotic assumption, TC enjoys near-zero redundancy even under non-asymptotic settings for small-moderate number of packets. These features make TC suitable for practical implementation in battery-constrained devices in IoT, D2D and M2M network paradigms to achieve scalable reliability, and minimize latency due to its low decoding delay. TC is a non-linear code, which is encoded using the simple shift and XOR addition operations, and decoded using the simple back-substitution algorithm. Although it is nonlinear code at the packet level, it remains linear code when atomized at the bit level. We use this property to show that the back-substitution decoder of TC is equivalent to the Belief Propagation (BP) decoder of LT code. Therefore, TC can benefit from rich prolific literature published on LT code, to design efficient code for various applications. Despite the equivalency between the decoders of TC and LT code, we show that compared to state-of-the-art optimized LT code, TC reduces the redundancy of LT code by 68%–99% for k reaching 1024.© 2022 Published by Elsevier Ltd.

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

As the demand for sensing and monitoring the marine environment increases, the Ocean Mobile Internet of Things (OM-IoT) has gradually attracted the interest of researchers. However, the unreliability of communication links represents a significant challenge to data transmission in the OM-IoT, given the complex and dynamic nature of the marine environment, the mobility of nodes, and other factors. Consequently, it is necessary to enhance the reliability of underwater data transmission. To address this issue, this paper proposes a reinforcement learning-based adaptive network coding (RL-ANC) approach. Firstly, the channel conditions are estimated based on the reception acknowledgment, and a feedback-independent decoding state estimation method is proposed. Secondly, the sliding coding window is dynamically adjusted based on the estimates of the channel erasure probability and decoding probability, and the sliding rule is adaptively determined using a reinforcement learning algorithm and an enhanced greedy strategy. Subsequently, an adaptive optimization method for coding coefficients based on reinforcement learning is proposed to enhance the reliability of the underwater data transmission and underwater network coding while reducing the redundancy in the coding. Finally, the sampling period and time slot table are updated using the enhanced simulated annealing algorithm to optimize the accuracy and timeliness of the channel estimation. Simulation experiments demonstrate that the proposed method effectively enhances the data transmission reliability in unreliable communication links, improves the performance of underwater network coding in terms of the packet delivery rate, retransmission, and redundancy transmission ratios, and accelerates the convergence speed of the decoding probability.

Signal space alignment (SSA) is a promising technique for interference management in wireless networks. However, despite the excellent work done on SSA, its robustness against jamming attacks has not been considered in the literature. In this paper, we propose two antijamming strategies for the SSA scheme applied in the multiple-input–multiple-output (MIMO) Y channel. The first scheme involves projecting the jamming signal into the null space of each source’s precoding vectors, effectively eliminating it entirely. The second scheme removes interference originating from the jammer by subtracting the disturbance estimate from the incoming signal. The estimate is derived on the basis of the criterion of minimizing the received signal energy. The block error rate (BLER) performance of the proposed strategies in various channel configurations is verified by link level simulations and is presented to show the efficiency in mitigating jamming signals within the SSA-based MIMO Y channel.

Ensuring source location privacy is crucial for the security of underwater acoustic sensor networks amid the growing use of marine environmental monitoring. However, the traditional source location privacy scheme overlooks multi-attacker cooperation strategies and also has the problem of high communication overhead. This paper addresses the aforementioned limitations by proposing an underwater source location privacy protection scheme based on game theory under the scenario of multiple cooperating attackers (SLP-MACGT). First, a transformation method of a virtual coordinate system is proposed to conceal the real position of nodes to a certain extent. Second, through using the relay node selection strategy, the diversity of transmission paths is increased, passive attacks by adversaries are resisted, and the privacy of source nodes is protected. Additionally, a secure data transmission technique utilizing fountain codes is employed to resist active attacks by adversaries, ensuring data integrity and enhancing data transmission stability. Finally, Nash equilibrium could be achieved after the multi-round evolutionary game theory of source node and multiple attackers adopting their respective strategies. Simulation experiments and performance evaluation verify the effectiveness and reliability of SLP-MACGT regarding aspects of the packet forwarding success rate, security time, delay and energy consumption: the packet delivery rate average increases by 30%, security time is extended by at least 85%, and the delay is reduced by at least 90% compared with SSLP, PP-LSPP, and MRGSLP.

Message-transmission energy expenditure dominates battery lifetime in a Wireless Sensor Network (WSN). This paper newly combines network coding with a brokered WSN architecture to decrease the number of messages by means of message aggregation. It also facilitates low-latency delivery of critical messages and improves the overall energy efficiency of a WSN. Sensor nodes are arranged into subgroups, in each of which a broker separates messages into High Priority (HP) and Best Effort (BE) queues. Both arriving HP and BE messages are separately aggregated through network coding and, according to priority, are forwarded to the next broker or eventually to a data sink, where they are decoded. Service differentiation, together with network coding, prolongs the lifetime of the network by reducing the amount of energy consumed in brokers and increases message throughput by reducing waiting times at intermediate brokers. Best-effort message latency was reduced message as well as for high-priority messages. Without network coding all WSN nodes had run out of energy, whereas with the network-coded approach, twenty percent of the sensor nodes were still alive. This compares with some prior research which provides one or more of low message latency, increased message throughput, reduced WSN energy consumption, and prioritized queueing but not all these features together. [ABSTRACT FROM AUTHOR]

Summary: Resource scheduling mechanism of LEO satellite networks is the key to determining communication efficiency. Facing the LEO satellite networks with the dynamic topology changes, varying service requirements, and intermittent inter‐satellite links (ISLs), the state‐of‐the‐art cannot achieve high resource efficiency under both heavy and burst traffic loads, and the applicability of parameters design is insufficient under intermittent ISLs. Considering this, we propose a dynamic even distribution mechanism combined with network coding DENC. This novel mechanism obtains the service requirements and allocates resources dynamically through the even distribution algorithm to balance network maintenance overhead and resource waste and improves the success probability of transmission based on network coding to balance retransmission and redundancy. In this paper, we establish performance analysis models to optimize the parameters such as maintenance frequency and coding coefficient. Besides, we construct a system‐level simulation platform. Mathematical and simulation results indicate that the resource efficiency of EMNC can be improved by more than 48% compared with SAHN‐MAC, ICSMA, CSMA‐TDMA, and HTM when all nodes have service needs, and the ISL outage rate is 20%. As the outage probability of ISL increases and the proportion of nodes with service requirements decreases, the performance advantage of EMNC becomes more apparent. [ABSTRACT FROM AUTHOR]

In this paper, we put forward the model of multiple linear-combination security multicast network coding, where the wiretapper desires to obtain some information about a predefined set of multiple linear combinations of the source symbols by eavesdropping any one (but not more than one) channel subset up to a certain size r, referred to as the security level. For this model, the security capacity is defined as the maximum average number of source symbols that can be securely multicast to all sink nodes for one use of the network under the linear-combination security constraint. For any security level and any linear-combination security constraint, we fully characterize the security capacity in terms of the ratio of the rank of the linear-combination security constraint to the number of source symbols. Also, we develop a general construction of linear security network codes. Finally, we investigate the asymptotic behavior of the security capacity for a sequence of linear-combination security models and discuss the asymptotic optimality of our code construction. [ABSTRACT FROM AUTHOR]

Systematic codes are of important practical interest for communications. Network coding, however, seems to conflict with systematic codes: although the source node can transmit message packets, network coding at the intermediate network nodes may significantly reduce the number of message packets received by the destination node. Is it possible to obtain the benefit of network coding while preserving some properties of the systematic codes? In this paper, we study the systematic design of batched network coding, which is a general network coding framework that includes random linear network coding as a special case. A batched network code has an outer code and an inner code, where the latter is formed by linear network coding. A systematic batched network code must take both the outer code and the inner code into consideration. Based on the outer code of a BATS code, which is a matrix-generalized fountain code, we propose a general systematic outer code construction that achieves a low encoding/decoding computation cost. To further reduce the number of random trials required to search a code with a close-to-optimal coding overhead, a triangular embedding approach is proposed for the construction of the systematic batches. We introduce new inner codes that provide protection for the systematic batches during transmission and show that it is possible to significantly increase the expected number of message packets in a received batch at the destination node, without harm to the expected rank of the batch transfer matrix generated by network coding. [ABSTRACT FROM AUTHOR]

Achieving efficient end-to-end file transfer is challenging in a narrow-band communication environment with high latency and high packet loss rate. The traditional TCP-based scheme and the UDP-based automatic retransmission scheme have defects in the transmission performance, which cannot meet the increasing user demands. This paper proposes a high-efficiency file transfer scheme based on random linear network coding and the Kalman filtering algorithm to implement an efficient end-to-end file transfer scheme in a narrow-band environment. The scheme predicts the link quality of file transmission through the Kalman filter algorithm and designs an adaptive coding strategy for file transfer through random linear network coding. Experimental results show that the proposed method outperforms traditional file transfer schemes. [ABSTRACT FROM AUTHOR]

We provide a detailed algorithm to repair a single node failure in an (n,k) Reed-Solomon code over GF(2ℓ) with repair bandwidth ℓ/a(n-1)(a-s), for any integers a, s such that a|ℓ, 2a ≥ n + 1, 2s ≤ n-k. We present the constructions of necessary lookup tables for the repair. The storage overhead and the repair complexity of our algorithm are also analyzed. The algorithm can be applied to the (14,10) Reed-Solomon codes over GF(28), which is a modification of the code in Facebook's f4 system, and reaches the lowest repair bandwidth among the existing schemes to the best of our knowledge. The algorithm can be generalized to other codes, including the ones based on Yahoo Object Store and Baidu's Atlas.