The 3-D Mesh network-on-Chip (NoC) is widely used as the communication backbone of the 3-D multiprocessor system-on-chips (MPSoCs) and chiplet-based 3-D integrated systems, which enable the efficient computation parad...
详细信息
The 3-D Mesh network-on-Chip (NoC) is widely used as the communication backbone of the 3-D multiprocessor system-on-chips (MPSoCs) and chiplet-based 3-D integrated systems, which enable the efficient computation paradigm in Internet of Things (IoT) scenarios. The functional test is a good choice for the 3-D Mesh NoCs to detect the defects introduced in manufacture process, because it reuses the at-speed on-chip network and consumes little hardware overhead. However, the test time of the functional test in 3-D Mesh NoCs grows dramatically with the NoC size. In order to reduce the test time on the premise of ensuring fault coverage, this work proposes a functional test method leveraging the exclusive OR (xor) network coding (NC) technique. In this work, thexor NC function is embedded in the routers by the extension modules with an additional area overhead less than 3%, and an efficient functional test process based on the embeddedxor NC function is proposed. The proposed functional test process covers all the straight and turning paths, and all the working modes of the routers are tested. The time complexity of the proposed method only increases linearly with the NoC size, which manifests that the proposed test method is applicable for the large-scale 3-D Mesh NoCs.
Vehicular named data networking (V-NDN) is promising to match dynamic topology of vehicular ad hoc networks. However, it has some potential issues such as broadcast storm of Interest packets due to flooding and blind ...
详细信息
ISBN:
(纸本)9781728190549
Vehicular named data networking (V-NDN) is promising to match dynamic topology of vehicular ad hoc networks. However, it has some potential issues such as broadcast storm of Interest packets due to flooding and blind forwarding strategy at intermediate nodes. To address these issues, we propose a network coding enhanced forwarding strategy with predictive content discovery (NC-PCD) mechanism which functions at key nodes (e.g., road intersections). First, content providers provide innovative encoded data packets. Second, the NDN packet formats are extended to carry the information about the innovative degree, distance, congestion level and path quality, etc. Finally, the NDN router at the key node collects information to select the optimal forwarding direction for subsequent requests. This problem is formulated as a joint optimization problem and solved by deep reinforcement learning. Simulation results show that the proposed NC-PCD is significantly superior to the existing forwarding strategies in terms of Interest satisfied ratio, response delay and number of transmitted packets.
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this wo...
详细信息
Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials. They achieve the Singleton bound in the sum-rank metric and therefore are known as maximum sum-rank distance (MSRD) codes. In this work, we give necessary and sufficient conditions for the existence of MSRD codes with a support-constrained generator matrix. The conditions on the support constraints are identical to those for MDS codes and MRD codes. The required field size for an [n, k](q)(m) LRS codes with support-constrained generator matrix is q >= l+1 and m >= max(l is an element of[l]){k-1+log(q) k,n(l)} , where l is the number of blocks and n(l) is the size of the l-th block. The special cases of the result coincide with the known results for Reed-Solomon codes and Gabidulin codes. For the support constraints that do not satisfy the necessary conditions, we derive the maximum sum-rank distance of a code whose generator matrix fulfills the constraints. Such a code can be constructed from a subcode of an LRS code with a sufficiently large field size. Moreover, as an application in network coding, the conditions can be used as constraints in an integer programming problem to design distributed LRS codes for a distributed multi-source network.
We consider broadcasting a block of data packets to multiple users via instantly decodable network coding (IDNC) under the semi-online feedback transmission mode. In this paper, we first introduce a new class of IDNC ...
详细信息
We consider broadcasting a block of data packets to multiple users via instantly decodable network coding (IDNC) under the semi-online feedback transmission mode. In this paper, we first introduce a new class of IDNC schemes called lightweight IDNC, tailored for wireless broadcast with stringent computational load at the receiver end. Unlike traditional IDNC that may encode a larger number of original packets together, lightweight IDNC limits each coded packet to a combination of at most two original packets. Explicit lower bounds of the total completion delay as well as the decoding delay are respectively obtained for arbitrary lightweight IDNC schemes. We further investigate the number of transmission rounds as another performance metric, and explicitly characterize its distribution and expectation. The characterizations apply to arbitrary partition-based IDNC schemes, including the lightweight IDNC schemes considered in this paper. A new efficient algorithm is also proposed to construct lightweight IDNC schemes which grants the original packets with lower coding opportunity a higher priority to be encoded. Numerical analyses demonstrate that the lightweight IDNC schemes constructed by the new algorithm not only achieve lower completion and decoding delays in comparison with the ones constructed by the existing algorithm but also adhere closely to theoretical lower bounds, demonstrating their efficiency and practical utility.
For low -latency communication in massive machinetype communication (MTC), since re -transmissions may not be allowed, one-shot random access (OSRA) such as K -repetition or network coding (NC) -based OSRA can be cons...
详细信息
For low -latency communication in massive machinetype communication (MTC), since re -transmissions may not be allowed, one-shot random access (OSRA) such as K -repetition or network coding (NC) -based OSRA can be considered. In our previous study, it was shown that NC -based OSRA can always perform better than K -repetition for some limited cases. In this article, more realistic conditions are considered to derive the packet loss rate (PLR) of NC -based OSRA for a fair performance comparison in terms of PLR. Interestingly, it is shown that K -repetition can outperform NC -based OSRA when the traffic intensity is sufficiently low, which might be necessary to provide a high reliability in terms of PLR. For a low -medium traffic intensity, the PLR of NC -based OSRA is lower than that of K -repetition. Simulations are also carried out to confirm our derivations.
We investigate the timeliness in delivering updates within a multisource multihop Internet of Things (IoT) network via multicast transmissions with or without employing network coding, using a completely probabilistic...
详细信息
We investigate the timeliness in delivering updates within a multisource multihop Internet of Things (IoT) network via multicast transmissions with or without employing network coding, using a completely probabilistic model. Age of Information (AoI) is adopted to quantify the timeliness of packets. Extensive simulation results, which corroborate the theoretical findings, demonstrate that in scenarios where the number of sources is high, the number of intermediate nodes relaying to monitors is low, there are multiple monitors, the transmission success probability is low, and computational resources are sufficient, the utilization of network coding has a great potential to improve the data-freshness in multisource multihop IoT networks which closely represent the spine of the real-life scenarios.
Wireless sensor networks have been applied in diverse applications, from facility monitoring to localized event surveillance, e.g., in power distribution grids of developing regions where traditional cables are not fe...
详细信息
ISBN:
(纸本)9798350330946;9798350330953
Wireless sensor networks have been applied in diverse applications, from facility monitoring to localized event surveillance, e.g., in power distribution grids of developing regions where traditional cables are not feasible. Linear wireless sensor networks are employed in such situations, where nodes link through lossy tandem links. Sensors generate and send data packets through intermediaries to reach network endpoints, where gateways forward aggregated data to a central server. Our previous research introduced a TDMA-based framework to ensure stable, cost-effective deployment, optimize delivery efficiency, and feature a proactive loss recovery mechanism in lossy links. However, as link loss increases, maintaining a high successful delivery probability that all packets from all nodes to the server becomes more challenging. Besides, the number of packets generated at sensors can fluctuate and sometimes exceed downstream link capacity, resulting in unrecovered packet losses. This paper investigates the benefit of using network coding schemes to enhance data transmission reliability in linear multi-hop wireless sensor networks, especially in a high link loss rate and packet fluctuation situations. The simulation results show a significant improvement in overall successful delivery probability and fairness (small deviations of success delivery probability among nodes) compared to the previous method in scenarios with a high link loss rate and moderate packet fluctuation.
For a wireless sensor network (WSN), we proposed a network coding scheme that adopts a neural network (NN) instead of methods based on Shannon theory, and this scheme can transmit specific data such as images of speci...
详细信息
For a wireless sensor network (WSN), we proposed a network coding scheme that adopts a neural network (NN) instead of methods based on Shannon theory, and this scheme can transmit specific data such as images of specific data sets. In further, it also can transmit universal data with the channel code. In the source, the specific data or the code word is sent out to a network performing network coding, where the universal data are encoded into the code word with Reed Solomon code and Polar code. In the intermediate nodes, the network coding based on Shannon theory is replaced with a multilayer perceptron, convolutional neural networks (CNNs), and recurrent neural networks (RNNs). In the sink, we trained a NN with the received massage as the input and the original data as the label. The trained NN includes the sublayers, which are the subneural networks in every node. We test the new transmission scheme for some datasets and channel code such as Reed Solomon code in a WSN environment, and it is proven to be effective.
Linear secret sharing schemes protect secret information from leakage and destruction by encoding secret information into multiple shares, where the secret information can be reconstructed by collecting a certain subs...
详细信息
Linear secret sharing schemes protect secret information from leakage and destruction by encoding secret information into multiple shares, where the secret information can be reconstructed by collecting a certain subsets of shares. Perfect Security, alpha -strong Security, and Individual Security (IS) have been given as security measures of linear secret sharing schemes. Consider the threshold for each security measure, which is defined as the maximum allowable size of the set of leaked shares. Kurihara et al. have revealed that thresholds for Perfect Security and alpha -strong Security are characterized in terms of a relative code parameter Relative Generalized Hamming Weight (RGHW). However, the threshold for IS is not yet characterized. In this paper, we focus on individual elements of secret information and give the threshold for IS (Individual Security Threshold IST) as a new security measure, where each element of secret information cannot be uniquely determined from subsets of shares with size less than or equal to the IST. We show that the IST can be characterized in terms of RGHW as well as Perfect Security and alpha-strong Security. We also give a precoding method for secret information that can guarantee IST above a certain value in any existing linear secret sharing schemes. Moreover, we extend the notion of the IST to universal secure network coding (USNC) and present the Universal IST. We also show that the Universal IST can be represented by the code parameter Relative Generalized Rank Weight (RGRW) similarly to the IST of the linear secret sharing schemes.
We consider the timeliness in delivering an update consisting of multiple message packets to multiple users via multicast transmissions with or without employing network coding where Age of Information (AoI) is adopte...
详细信息
We consider the timeliness in delivering an update consisting of multiple message packets to multiple users via multicast transmissions with or without employing network coding where Age of Information (AoI) is adopted to quantify the timeliness of packets. The expressions for peak and average expected AoIs are analytically derived for both uncoded and network coded transmissions for both 2-user and generalized $k$ -users scenarios where the computational burden stemming from network coding is taken into account. The behavioral analyses of a number of network parameters are investigated, and the effect of data rate and computational capacity of nodes is analyzed. Simulations are performed for various Internet of Things (IoT) deployments, and the analyses suggest that the use of network coding for multicast transmissions can result in substantial AoI improvements, with the exception of scenarios in which sensors have extremely limited computational capabilities.
暂无评论