In less than ten years network coding has grown from a simple cute idea to an almost revolutionary research trend that has galvanized both the Information-theoretic Community (where it was born) and the networking Com...
详细信息
In less than ten years network coding has grown from a simple cute idea to an almost revolutionary research trend that has galvanized both the Information-theoretic Community (where it was born) and the networking Community (where it is expected to find its applications). By now, a casual observer might mistakenly conclude that the story of network coding is complete, that its fundamental properties are well understood, the challenges and obstacles have been identified, and that only limited applications of it have found their way to practice. This issue is proof to the contrary; that is, there is ample room for further theoretical development and there is a truly endless list of potential applications.
network coding means that bits in information flows do not have to be delivered as commodities; they can be mixed however we wish, as long as the receiving hosts have received sufficient "evidence" or "...
详细信息
network coding means that bits in information flows do not have to be delivered as commodities; they can be mixed however we wish, as long as the receiving hosts have received sufficient "evidence" or "clues" to reconstruct the original packets from the sending host.
Flying ad hoc networks (FANETs) use unmanned aerial vehicles (UAVs) to build a wireless network with special properties. The transmission of data between UAVs in FANETs has become a key area of research. However, they...
详细信息
Flying ad hoc networks (FANETs) use unmanned aerial vehicles (UAVs) to build a wireless network with special properties. The transmission of data between UAVs in FANETs has become a key area of research. However, they are confronted with many challenges and difficulties, which are due to the high mobility of UAVs, the frequent packet losses, and the weak links between UAVs, all affecting the reliability of the data delivery. Several enhancements exist to address the above issues, but most of these are simple improvements over traditional mobile ad hoc networks (MANETs) approaches such as vehicular ad hoc networks (VANETs) and wireless sensor networks (WSNs), and cannot be fully adapted to FANETs with their unique properties, even ignoring the requirements for data transmission between UAVs. In light of these limitations, we propose a novel transmission scheme based on an optimized link state routing (OLSR) protocol and network coding for efficient and reliable data transmission in FANET. Compared to the state-of-the-art, the novelty of this scheme is to improve and integrate two coding algorithms into the transmission process based on the characteristics of FANET. In addition, it considers factors such as link stability, coding gain, and node congestion during the multipoint relay (MPR) election phase, thereby enhancing the transmission performance of FANET. Experimental results showed that the proposed approach compensates for the existing methods' inability to manage high mobility and frequent topology changes, and addresses the issues of unstable link election and substantial packet loss.
In this work, the network coding (NC) technique is used in combination with routing and spectrum allocation (RSA) to establish confidential connections in elastic optical networks and protect these connections against...
详细信息
In this work, the network coding (NC) technique is used in combination with routing and spectrum allocation (RSA) to establish confidential connections in elastic optical networks and protect these connections against eavesdropping attacks. Utilizing NC, the signals of the confidential connections are encrypted using other signals at different nodes in their path while transmitted through the network, preventing an eavesdropper tapping a link to gain access to confidential information. A novel mixed integer linear program (MILP) is proposed to enable encrypted transmission of confidential connections, in combination with a mapping function that maximizes the security level provided for the largest possible set of confidential connections. Further, a heuristic approach is presented for the combined routing, spectrum, and network coding assignment (RSNCA) problem, along with a metaheuristic, for larger-sized networks. The proposed approaches are examined in terms of confidentiality, average number of encryption operations (EOs), spectrum utilization, and running times. Performance results demonstrate the applicability of the MILP formulations in providing optimal lightpath establishments that maximize physical layer security, with the proposed MILP-RSNCA approach achieving the best results in terms of the level of security and the average number of EOs provided, albeit utilizing more spectrum slots. Further, the metaheuristic exhibits results comparable to the MILP in terms of providing security, and can be also applied to large-size networks. In some scenarios, it can even provide the highest available level of security [i.e., a minimum of 7 EOs per link per demand] for more than 50% of the confidential demands.
This paper examines the collaborative recovery issue for the scalable video broadcasting (SVB) system, where two proximate user nodes are able to maintain a local out-of-band device-to-device (D2D) pair to cooperative...
详细信息
This paper examines the collaborative recovery issue for the scalable video broadcasting (SVB) system, where two proximate user nodes are able to maintain a local out-of-band device-to-device (D2D) pair to cooperatively recover their lost broadcasted packets. Traditional error protection methods, such as Forward Error Correction (FEC) and error concealment, often require the source node to dynamically adjust its broadcast content based on feedback from user nodes. However, in many practical SVB scenarios, such as mobile TV broadcasting systems and satellite-based video broadcast virtual file systems, user nodes are merely recipients of broadcast messages and cannot feasibly report their reception status back to the source node (i.e., feedback-free). To address these challenges, we propose the network coding based Collaborative recovery scheme for SVB, named NC2-SVB. NC2-SVB deviates from previous studies by employing a feedback-free transmission model, wherein the source node neither receives updates on reception status nor channel conditions from the user nodes, nor does it dynamically modify its broadcast content. By utilizing the designed coding window sliding mechanism and the collaborative video layer scheduling algorithm, each user node can independently maintain a sliding coding window, generate optimal network coded packets, and collaborate recovery for the partner in a timely manner. The theoretical bounds of reliability and decoding delay for NC2-SVB have been analyzed. Experimental results demonstrate that NC2-SVB, compared to existing schemes, enhances the collaboration throughput, achieves higher decoding rates, offers lower decoding delays, as well as improved video playback quality.
Quantum network coding aims to address the communication congestion problem of bottleneck channels. Different from existing methods, we propose a counterfactual quantum network coding protocol. This protocol requires ...
详细信息
Quantum network coding aims to address the communication congestion problem of bottleneck channels. Different from existing methods, we propose a counterfactual quantum network coding protocol. This protocol requires not only no physical particle traveling through the bottleneck network but also no pre-shared entanglement between the senders, and thus, it provides a new perspective for the development of quantum network coding theory.
With highly mobile and flexible-configurable, autonomous aerial vehicles (AAVs) are becoming crucial wireless communication infrastructures. To improve the reliability and throughput of data delivery for wireless netw...
详细信息
With highly mobile and flexible-configurable, autonomous aerial vehicles (AAVs) are becoming crucial wireless communication infrastructures. To improve the reliability and throughput of data delivery for wireless networks, network coding, as a progressive technology, can be applied in AAV networks. However, network coding incurs a security problem called pollution attacks for AAV networks. Although homomorphic network coding signature can prevent pollution attacks, existing schemes are not suitable for AAV networks due to cumbersome certificate management, the key-escrow issue, or insecurity. In this article, we propose an efficient certificateless homomorphic network coding signature scheme for secure transmission of AAV networks, which can avoid certificate management and the key-escrow issue. Then our scheme is proven to be secure against adaptive chosen identity-and-subspace attacks in the random oracle model, thus our scheme can guarantee data integrity and authenticity to resist pollution attacks. We provide a performance evaluation for the proposed scheme and prior research, and experimental results illustrate the efficiency and feasibility of our scheme for practical application, reducing the verification overhead by 42.918% for a 72-dimensional data vector.
Minimizing the decoding delay, the completion time, or the delivery time of instantly decodable network coding (IDNC) can all be approximated to a maximum weight clique (MWC) problem, which is well known to be NP hard...
详细信息
Minimizing the decoding delay, the completion time, or the delivery time of instantly decodable network coding (IDNC) can all be approximated to a maximum weight clique (MWC) problem, which is well known to be NP hard. Due to its good tradeoff between performance and computational complexity, a heuristic approach named as maximum weight vertex (MWV) search is widely employed to select MWC for IDNC. However, in MWV, when there are few coding connection edges among the adjacent vertices of a vertex, its modified vertex weight cannot well reflect the weight of the MWC containing the vertex, which leads to incorrect selection of MWC. This paper proposes a new method to calculate the modified weight of a vertex by summing the weights of the vertices in the approximate maximum weight path (A-MWP) generated by this vertex. Since the vertices in an A-MWP can form a maximal clique, the proposed modified vertex weight may well indicate the weight of the MWC containing the vertex. The proposed algorithm has the same computational complexity as the MWV algorithm. Simulation results show that when employing any of the three performance metrics of IDNC, our proposed algorithm can achieve better system performance than the MWV algorithm.
Mobile edge caching network (MEN), which enables popular or reusable content caching and sharing among adjacent mobile edge devices, has become a promising solution to reduce the traffic and burden over backhaul links...
详细信息
Mobile edge caching network (MEN), which enables popular or reusable content caching and sharing among adjacent mobile edge devices, has become a promising solution to reduce the traffic and burden over backhaul links. network coding (NC), represented by classical random linear network coding (RLNC), is utilized to facilitate content delivery and increase throughput in MEN. However, as the harsh decoding condition results in unacceptable time and storage overhead, classical RLNC schemes struggle to be widely deployed in practice. In this work, we propose a cost-effective NC-based content-sharing scheme based on binary sparse network coding (BSNC), called Bison, for D2D-enabled MEN. Based on the shared relationship between the binary sparse coded block (BSCB), Bison first designs a caching maintenance module to characterize the sharing progress and maintain the caching state of each edge node. Then, Bison defines a matching metric named neighbor utility to evaluate neighbors' matching values by considering nodes' demand and content decodability. Guiding by the metric, Bison achieves the most beneficial matching relationship among edge nodes through a proposed online matching policy. Finally, Bison devises a coded block delivery strategy to enable the sharing of valuable content between two matched edge nodes. Extensive experiments in simulations and real-world Android testbeds demonstrate its effectiveness and efficiency, wherein Bison is at least 30% less than the RLNC-based scheme on time consumption and at least 10% less than the classical BSNC-based scheme on storage overhead. The results also show that our matching policy and coded block delivery strategy can perform with a low response latency on edge and mobile devices.
暂无评论