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.展开更多
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),a...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.展开更多
To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation o...To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random Convolutional Network Coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm.展开更多
How to establish a secure and efficient quantum network coding algorithm isone of important research topics of quantum secure communications. Based on thebutterfly network model and the characteristics of easy prepara...How to establish a secure and efficient quantum network coding algorithm isone of important research topics of quantum secure communications. Based on thebutterfly network model and the characteristics of easy preparation of Bell states, a novelanti-noise quantum network coding protocol is proposed in this paper. The new protocolencodes and transmits classical information by virtue of Bell states. It can guarantee thetransparency of the intermediate nodes during information, so that the eavesdropper Evedisables to get any information even if he intercepts the transmitted quantum states. Inview of the inevitability of quantum noise in quantum channel used, this paper analyzesthe influence of four kinds of noises on the new protocol in detail further, and verifies theefficiency of the protocol under different noise by mathematical calculation and analysis.In addition, based on the detailed mathematical analysis, the protocol has functioned wellnot only on improving the efficiency of information transmission, throughput and linkutilization in the quantum network, but also on enhancing reliability and antieavesdroppingattacks.展开更多
A new combinational technology is proposed,which is feasible to apply physical-layer network coding（PNC） to wireless fading channels by employing the harmful interference strategically.The key step of PNC is that so...A new combinational technology is proposed,which is feasible to apply physical-layer network coding（PNC） to wireless fading channels by employing the harmful interference strategically.The key step of PNC is that sources broadcast signals simultaneously without orthogonal scheduling.Naturally,the signals overlap in the free space at the receivers.Since the signals from different sources are mutual independent,rooted on this rational assumption,an enhanced joint diagonalization separation named altering row diagonalization（ARD） algorithm is exploited to separate these signals by maximizing the cost function measuring independence among them.This ARD PNC（APNC） methodology provides an innovative way to implement signal-level network coding at the presence of interference and without any priori information about channels in fading environments.In conclusions,the proposed APNC performs well with higher bandwidth utility and lower error rate.展开更多
Network coding (NC), which works in the network layer, is an effective technology to improve the network throughput, by allowing the relay to encode the information from different users and ensuring the destination to...Network coding (NC), which works in the network layer, is an effective technology to improve the network throughput, by allowing the relay to encode the information from different users and ensuring the destination to retrieve the desired information. Employing network coding technique in a cooperative network can improve the network performance further. In this paper, we introduce analog network coding (ANC) to a simple two-user cooperative diversity network, which adopts amplify-and-forward (AF) mode and all nodes use multiple antennas. The impact of the number of antenna on the system achievable rate is investigated. And the bit error rate (BER) performances of the traditional relay cooperative network and the cooperative network based on analog network coding under different propagation conditions are discussed. The simulation results show that the performance of the traditional cooperative network has improved significantly due to the employ of network coding.展开更多
To characterize the algebraic structure of wireless network coding, a hypergragh is utilized to model wireless packet networks from network layer. The algebraic description of random convolutional network coding is de...To characterize the algebraic structure of wireless network coding, a hypergragh is utilized to model wireless packet networks from network layer. The algebraic description of random convolutional network coding is deduced, and the coding condition is also presented. Analyses and simulations show that random convolutional coding is capacity-achieving with probability approaching 1.展开更多
Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions...Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions for securing network coding,a novel securing network coding paradigm is presented relying on two coding models:intra-generation coding and inter-generation coding.The basic idea to secure network coding using intra-generation coding is to limit the encryption operations for each generation,and then subject the scrambled and the remaining original source vectors to a linear transformation.This method is then generalized seamlessly using inter-generation coding by further exploiting the algebraic structure of network coding.We show that the proposed schemes have properties of low-complexity security,little bandwidth consumption,and high efficiency in integrating with the existing security techniques effectively.展开更多
Owing to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for underwater sensor networks. Moreover, network coding is proved to be an effect...Owing to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for underwater sensor networks. Moreover, network coding is proved to be an effective coding technique for throughput and robustness of networks. In this paper, we propose a Reliable Braided Multipath Routing with Network Coding for underwater sensor networks （RBMR-NC）. Disjoint multi-path algorithm is used to build independent actual paths, as called main paths. Some braided paths on each main path are built according to the braided multi-path algorithm, which are called logic paths. When a data packet is transmitted by these nodes, the nodes can employ network coding to encode packets coming from the same group in order to further reduce relativity among these packets, and enhance the probability of successful decoding at the sink node. Braided multi-path can make the main paths to be multiplexed to reduce the probability of long paths. This paper mainly employs successful delivery rate to evaluate RBMR-NC model with theoretical analysis and simulation methods. The results indicate that the proposed RBMR-NC protocol is valuable to enhance network reliability and to reduce system redundancy.展开更多
Recently, network coding has been applied to the loss recovery of reliable broadcast transmission in wireless networks. Since it was proved that fi nding the optimal set of lost packets for XOR-ing is a complex NP-com...Recently, network coding has been applied to the loss recovery of reliable broadcast transmission in wireless networks. Since it was proved that fi nding the optimal set of lost packets for XOR-ing is a complex NP-complete problem, the available time-based retransmission scheme and its enhanced retransmission scheme have exponential computational complexity and thus are not scalable to large networks. In this paper, we present an efficient heuristic scheme based on hypergraph coloring and also its enhanced heuristic scheme to improve the transmission efficiency. Basically, our proposed schemes fi rst create a hypergraph according to the packet-loss matrix. Then our schemes solve the problem of generating XORed packets by coloring the edges of hypergraph. Extensive simulation results demonstrate that, the heuristic scheme based on hypergraph coloring and its enhanced scheme can achieve almost the same transmission efficiency as the available ones, but have much lower computational complexity, which is very important for the wireless devices without high computation capacity.展开更多
Although the wireless network is widely used in many fields,its characteristics such as high bit error rate and broadcast links may block its development.Network coding is an artistic way to exploit its intrinsic char...Although the wireless network is widely used in many fields,its characteristics such as high bit error rate and broadcast links may block its development.Network coding is an artistic way to exploit its intrinsic characteristics to increase the network reliability.Some people research network coding schemes for inter-flow or intra-flow,each type with its own advantages and disadvantages.In this paper,we propose a new mechanism,called MM-NCOPE,which integrates the idea of inter-flow and intra-flow coding.On the one hand,MM-NCOPE utilizes random liner coding to encode the NCOPE packets while NCOPE is a sub-protocol for optimizing the COPE algorithm by iteration.In NCOPE,packets are automatically matched by size to be coded.As a result,it improves the coding gain in some level.On the other hand,we adopt the partial Acknowledgement retransmission scheme to achieve high compactness and robustness.ACK is an independent packet with the highest priority rather than a part of the data packets.Compared with existing works on opportunistic network coding,our approach ensures the reliability of wireless links and improves the coding gain.展开更多
In this paper, we first overview some traditional relaying technologies, and then present a Network Coding-Aware Cooperative Relaying （NC2R） scheme to improve the performance of downlink transmission for relayaided ...In this paper, we first overview some traditional relaying technologies, and then present a Network Coding-Aware Cooperative Relaying （NC2R） scheme to improve the performance of downlink transmission for relayaided cellular networks. Moreover, systematic performance analysis and extensive simulations are performed for the proposed NC2R and traditional relaying and non-relaying schemes. The results show that NCR outperforms conventional relaying and non-relaying schemes in terms of blocking probability and spectral efficiency, especially for cell-edge users. Additionally, the location selections for relays with NCR are also discussed. These results will provide some insights for incorporating network coding into next-generation broadband cellular relay mobile systems.展开更多
A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algori...A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algorithm uses a random linear network coding strategy to code data pack- ets. Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together. The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding. Meanwhile, the algorithm also adopts the flow distribution strategy based on time delay to balance network load. Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate, reduce packet delay, and enhance network performance.展开更多
Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks...Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks, an efficient secure coding scheme is proposed in conjunction with the inherent mix- ing characteristic of network coding. The key idea is to minimize the randomizing operations to the entire plaintext data. The pro- posed scheme is shown to have properties of lightweight security complexity and lower communication overhead compared with the existing traditional solutions, and can be easy in implementation and combination with classical cryptography techniques.展开更多
A new Network Coding mechanism in WSNs(Wireless Sensor Networks), which is named COEQ and aims at balancing coding opportunities, energy and QoS, is proposed and analyzed. Implemented on the basis of traditional AODV ...A new Network Coding mechanism in WSNs(Wireless Sensor Networks), which is named COEQ and aims at balancing coding opportunities, energy and QoS, is proposed and analyzed. Implemented on the basis of traditional AODV protocol, COEQ evaluates several metrics of paths comprehensively with TOPSIS method including minimum remaining energy, coding opportunities, QoS and so on, so as to select the optimal transmitting route. Experiments on NS[2] show that COEQ can improve throughput and save energy when the transmitting rate is low.展开更多
In this paper, we study the performance of physical-layer network coding in asymmetric two-way relay channels using four different cases having different poor channels:phase asymmetry, downlink asymmetry, uplink asymm...In this paper, we study the performance of physical-layer network coding in asymmetric two-way relay channels using four different cases having different poor channels:phase asymmetry, downlink asymmetry, uplink asymmetry and node asymmetry. The decision and mapping rule for symmetric and asymmetric cases are studied. The performance in terms of bit error rate for each case will be studied and analysed by computer simulation. Analytical and simulation results show that uplink asymmetry is the worst case;intra-phase asymmetry and unreliable uplink channels will more severely affect the performance degradation, which is caused by channel asymmetry.展开更多
Network coding can improve network throughput in large, but it is vulnerable to the data pollution attacks. In this paper, we propose an efficient homomorphic message authentication code （MAC） scheme with discrete l...Network coding can improve network throughput in large, but it is vulnerable to the data pollution attacks. In this paper, we propose an efficient homomorphic message authentication code （MAC） scheme with discrete logarithm to detect and locate the malicious nodes. We also prove the security property of the scheme theoretically. Its effectiveness is demonstrated, and overhead is analyzed through extensive experiments.展开更多
Based on the sequence entropy of Shannon information theory, we work on the network coding technology in Wireless Sensor Network (WSN). In this paper, we take into account the similarity of the transmission sequences ...Based on the sequence entropy of Shannon information theory, we work on the network coding technology in Wireless Sensor Network (WSN). In this paper, we take into account the similarity of the transmission sequences at the network coding node in the multi-sources and multi-receivers network in order to compress the data redundancy. Theoretical analysis and computer simulation results show that this proposed scheme not only further improves the efficiency of network transmission and enhances the throughput of the network, but also reduces the energy consumption of sensor nodes and extends the network life cycle.展开更多
In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,w...In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,which results in a collision and leads to the degrading of tags identifying efficiency.To improve the multiple tags’identifying efficiency due to collision,a physical layer network coding based binary search tree algorithm(PNBA)is proposed in this paper.PNBA pushes the conflicting signal information of multiple tags into a stack,which is discarded by the traditional anti-collision algorithm.In addition,physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the conflicting information in the stack.Therefore,PNBA reduces the number of interactions between reader and tags,and improves the tags identification efficiency.Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings,and improve RFID identification efficiency.Especially,when the number of tags to be identified is 100,the average needed reading number of PNBA is 83%lower than the basic binary search tree algorithm,43%lower than reverse binary search tree algorithm,and its reading efficiency reaches 0.93.展开更多
Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, t...Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications.展开更多
文摘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.
文摘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.
基金supported by the National Science Foundation （NSF） under Grants No.60832001,No.61271174 the National State Key Lab oratory of Integrated Service Network （ISN） under Grant No.ISN01080202
文摘To address the issue of field size in random network coding, we propose an Improved Adaptive Random Convolutional Network Coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random Convolutional Network Coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm.
文摘How to establish a secure and efficient quantum network coding algorithm isone of important research topics of quantum secure communications. Based on thebutterfly network model and the characteristics of easy preparation of Bell states, a novelanti-noise quantum network coding protocol is proposed in this paper. The new protocolencodes and transmits classical information by virtue of Bell states. It can guarantee thetransparency of the intermediate nodes during information, so that the eavesdropper Evedisables to get any information even if he intercepts the transmitted quantum states. Inview of the inevitability of quantum noise in quantum channel used, this paper analyzesthe influence of four kinds of noises on the new protocol in detail further, and verifies theefficiency of the protocol under different noise by mathematical calculation and analysis.In addition, based on the detailed mathematical analysis, the protocol has functioned wellnot only on improving the efficiency of information transmission, throughput and linkutilization in the quantum network, but also on enhancing reliability and antieavesdroppingattacks.
基金supported by the National Natural Science Foundation of China(6120118361132002)
文摘A new combinational technology is proposed,which is feasible to apply physical-layer network coding（PNC） to wireless fading channels by employing the harmful interference strategically.The key step of PNC is that sources broadcast signals simultaneously without orthogonal scheduling.Naturally,the signals overlap in the free space at the receivers.Since the signals from different sources are mutual independent,rooted on this rational assumption,an enhanced joint diagonalization separation named altering row diagonalization（ARD） algorithm is exploited to separate these signals by maximizing the cost function measuring independence among them.This ARD PNC（APNC） methodology provides an innovative way to implement signal-level network coding at the presence of interference and without any priori information about channels in fading environments.In conclusions,the proposed APNC performs well with higher bandwidth utility and lower error rate.
基金Sponsored by the National Natural Science Foundation of China (Grant No. 60872016)
文摘Network coding (NC), which works in the network layer, is an effective technology to improve the network throughput, by allowing the relay to encode the information from different users and ensuring the destination to retrieve the desired information. Employing network coding technique in a cooperative network can improve the network performance further. In this paper, we introduce analog network coding (ANC) to a simple two-user cooperative diversity network, which adopts amplify-and-forward (AF) mode and all nodes use multiple antennas. The impact of the number of antenna on the system achievable rate is investigated. And the bit error rate (BER) performances of the traditional relay cooperative network and the cooperative network based on analog network coding under different propagation conditions are discussed. The simulation results show that the performance of the traditional cooperative network has improved significantly due to the employ of network coding.
基金Supported by National Natural Science Foundation of China (No.61271174)Young Teachers' Innovation Foundation of Xidian University(K5051303137)
文摘To characterize the algebraic structure of wireless network coding, a hypergragh is utilized to model wireless packet networks from network layer. The algebraic description of random convolutional network coding is deduced, and the coding condition is also presented. Analyses and simulations show that random convolutional coding is capacity-achieving with probability approaching 1.
基金supported by the National Natural Science Foundation of China(Grant No.11371290,No.61271174,No. 61301178)the Science and Technology Innovation Foundation of Xi'an(Grant No. CXY1352WL28)
文摘Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions for securing network coding,a novel securing network coding paradigm is presented relying on two coding models:intra-generation coding and inter-generation coding.The basic idea to secure network coding using intra-generation coding is to limit the encryption operations for each generation,and then subject the scrambled and the remaining original source vectors to a linear transformation.This method is then generalized seamlessly using inter-generation coding by further exploiting the algebraic structure of network coding.We show that the proposed schemes have properties of low-complexity security,little bandwidth consumption,and high efficiency in integrating with the existing security techniques effectively.
基金supported by the National Natural Science Foundation of China (Grant Nos.60472060 and 60473039)the National High Technology Research and Development Programof China (863 Program,Grant No.2006AA01Z119)the Innovation Fund of Chinese Academy of Space Technology (Grant No.CAST20090801)
文摘Owing to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for underwater sensor networks. Moreover, network coding is proved to be an effective coding technique for throughput and robustness of networks. In this paper, we propose a Reliable Braided Multipath Routing with Network Coding for underwater sensor networks （RBMR-NC）. Disjoint multi-path algorithm is used to build independent actual paths, as called main paths. Some braided paths on each main path are built according to the braided multi-path algorithm, which are called logic paths. When a data packet is transmitted by these nodes, the nodes can employ network coding to encode packets coming from the same group in order to further reduce relativity among these packets, and enhance the probability of successful decoding at the sink node. Braided multi-path can make the main paths to be multiplexed to reduce the probability of long paths. This paper mainly employs successful delivery rate to evaluate RBMR-NC model with theoretical analysis and simulation methods. The results indicate that the proposed RBMR-NC protocol is valuable to enhance network reliability and to reduce system redundancy.
基金supported by the National Natural Science Foundation of China (60502046, 60573034)863 Foundation of China (2007AA01Z215)
文摘Recently, network coding has been applied to the loss recovery of reliable broadcast transmission in wireless networks. Since it was proved that fi nding the optimal set of lost packets for XOR-ing is a complex NP-complete problem, the available time-based retransmission scheme and its enhanced retransmission scheme have exponential computational complexity and thus are not scalable to large networks. In this paper, we present an efficient heuristic scheme based on hypergraph coloring and also its enhanced heuristic scheme to improve the transmission efficiency. Basically, our proposed schemes fi rst create a hypergraph according to the packet-loss matrix. Then our schemes solve the problem of generating XORed packets by coloring the edges of hypergraph. Extensive simulation results demonstrate that, the heuristic scheme based on hypergraph coloring and its enhanced scheme can achieve almost the same transmission efficiency as the available ones, but have much lower computational complexity, which is very important for the wireless devices without high computation capacity.
基金National Natural Science Foundation of China under Grant No. 60903196,60903175National Critical Patented Projects in the Next Generation Broadband Wireless Mobile Communication Network under Grant No. 2010ZX03006-001-01+1 种基金National High Technical Research and Development Program of China under Grant No. 2009AA01Z418Educational Commission of Hubei Province of China under Grant No. D20114401
文摘Although the wireless network is widely used in many fields,its characteristics such as high bit error rate and broadcast links may block its development.Network coding is an artistic way to exploit its intrinsic characteristics to increase the network reliability.Some people research network coding schemes for inter-flow or intra-flow,each type with its own advantages and disadvantages.In this paper,we propose a new mechanism,called MM-NCOPE,which integrates the idea of inter-flow and intra-flow coding.On the one hand,MM-NCOPE utilizes random liner coding to encode the NCOPE packets while NCOPE is a sub-protocol for optimizing the COPE algorithm by iteration.In NCOPE,packets are automatically matched by size to be coded.As a result,it improves the coding gain in some level.On the other hand,we adopt the partial Acknowledgement retransmission scheme to achieve high compactness and robustness.ACK is an independent packet with the highest priority rather than a part of the data packets.Compared with existing works on opportunistic network coding,our approach ensures the reliability of wireless links and improves the coding gain.
基金supported by the State Key Laboratory of Rail Traffic Control and Safety,Beijing Jiaotong University under Grant No.RCS2012ZT008the National Key Basic Research Program of China(973Program)under Grant No.2012CB316100(2)+1 种基金the National Natural Science Foundation of China under Grants No.61201203,No.61171064the Fundamental Research Funds for the Central Universities under Grant No.2012JBM030
文摘In this paper, we first overview some traditional relaying technologies, and then present a Network Coding-Aware Cooperative Relaying （NC2R） scheme to improve the performance of downlink transmission for relayaided cellular networks. Moreover, systematic performance analysis and extensive simulations are performed for the proposed NC2R and traditional relaying and non-relaying schemes. The results show that NCR outperforms conventional relaying and non-relaying schemes in terms of blocking probability and spectral efficiency, especially for cell-edge users. Additionally, the location selections for relays with NCR are also discussed. These results will provide some insights for incorporating network coding into next-generation broadband cellular relay mobile systems.
基金supported by the National Natural Science Foundation of China (No. 60929003)
文摘A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algorithm uses a random linear network coding strategy to code data pack- ets. Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together. The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding. Meanwhile, the algorithm also adopts the flow distribution strategy based on time delay to balance network load. Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate, reduce packet delay, and enhance network performance.
基金Supported by the National Natural Science Foundation of China(11371290,61301178)the Science and Technology Innovation Foundation of Xi'an(CXY1352WL28,CXY1352WL27)
文摘Existing works for securing network coding against wiretapping either incur high coding complexity or bring large bandwidth overhead. For exploiting the lightweight security mechanism for resource-constrained networks, an efficient secure coding scheme is proposed in conjunction with the inherent mix- ing characteristic of network coding. The key idea is to minimize the randomizing operations to the entire plaintext data. The pro- posed scheme is shown to have properties of lightweight security complexity and lower communication overhead compared with the existing traditional solutions, and can be easy in implementation and combination with classical cryptography techniques.
基金supported by the Chinese National Natural Science Foundation(No:61070204,61101108)Funding Project for Academic Human Resources Development in Institutions of Higher Learning Under the Jurisdiction of Beijing Municipality(11530500015)
文摘A new Network Coding mechanism in WSNs(Wireless Sensor Networks), which is named COEQ and aims at balancing coding opportunities, energy and QoS, is proposed and analyzed. Implemented on the basis of traditional AODV protocol, COEQ evaluates several metrics of paths comprehensively with TOPSIS method including minimum remaining energy, coding opportunities, QoS and so on, so as to select the optimal transmitting route. Experiments on NS[2] show that COEQ can improve throughput and save energy when the transmitting rate is low.
基金supported by the National Natural Science Foundation of China under Grant No.61101248the Equipment Advance Research Projectof"Twelfth Five-Year"Plan under Grant No.51306040202And this work has been performed in the Project"Advanced Communication Research Program(ACRP)"supported by the Directorate of Research and Development,Defense Science and Technology Agency,Singapore under Grant No.DSOCL04020
文摘In this paper, we study the performance of physical-layer network coding in asymmetric two-way relay channels using four different cases having different poor channels:phase asymmetry, downlink asymmetry, uplink asymmetry and node asymmetry. The decision and mapping rule for symmetric and asymmetric cases are studied. The performance in terms of bit error rate for each case will be studied and analysed by computer simulation. Analytical and simulation results show that uplink asymmetry is the worst case;intra-phase asymmetry and unreliable uplink channels will more severely affect the performance degradation, which is caused by channel asymmetry.
基金Supported by the General Program of Science and Technology Development Project of Beijing Municipal Education Commission(KM201311232014)the Opening Project of Beijing Key Laboratory of Internet Culture and Digital Dissemination Research (ICDD201206, ICDD201207)
文摘Network coding can improve network throughput in large, but it is vulnerable to the data pollution attacks. In this paper, we propose an efficient homomorphic message authentication code （MAC） scheme with discrete logarithm to detect and locate the malicious nodes. We also prove the security property of the scheme theoretically. Its effectiveness is demonstrated, and overhead is analyzed through extensive experiments.
基金Supported by Major Projects of the National Science and Technology (2010ZX03003-003-02) National 973 Key Project (2011CB302903)
文摘Based on the sequence entropy of Shannon information theory, we work on the network coding technology in Wireless Sensor Network (WSN). In this paper, we take into account the similarity of the transmission sequences at the network coding node in the multi-sources and multi-receivers network in order to compress the data redundancy. Theoretical analysis and computer simulation results show that this proposed scheme not only further improves the efficiency of network transmission and enhances the throughput of the network, but also reduces the energy consumption of sensor nodes and extends the network life cycle.
基金the National Natural Science Foundation of China under Grant 61502411Natural Science Foundation of Jiangsu Province under Grant BK20150432 and BK20151299+7 种基金Natural Science Research Project for Universities of Jiangsu Province under Grant 15KJB520034China Postdoctoral Science Foundation under Grant 2015M581843Jiangsu Provincial Qinglan ProjectTeachers Overseas Study Program of Yancheng Institute of TechnologyJiangsu Provincial Government Scholarship for Overseas StudiesTalents Project of Yancheng Institute of Technology under Grant KJC2014038“2311”Talent Project of Yancheng Institute of TechnologyOpen Fund of Modern Agricultural Resources Intelligent Management and Application Laboratory of Huzhou Normal University.
文摘In RFID(Radio Frequency IDentification)system,when multiple tags are in the operating range of one reader and send their information to the reader simultaneously,the signals of these tags are superimposed in the air,which results in a collision and leads to the degrading of tags identifying efficiency.To improve the multiple tags’identifying efficiency due to collision,a physical layer network coding based binary search tree algorithm(PNBA)is proposed in this paper.PNBA pushes the conflicting signal information of multiple tags into a stack,which is discarded by the traditional anti-collision algorithm.In addition,physical layer network coding is exploited by PNBA to obtain unread tag information through the decoding operation of physical layer network coding using the conflicting information in the stack.Therefore,PNBA reduces the number of interactions between reader and tags,and improves the tags identification efficiency.Theoretical analysis and simulation results using MATLAB demonstrate that PNBA reduces the number of readings,and improve RFID identification efficiency.Especially,when the number of tags to be identified is 100,the average needed reading number of PNBA is 83%lower than the basic binary search tree algorithm,43%lower than reverse binary search tree algorithm,and its reading efficiency reaches 0.93.
基金Supported by the National Natural Science Foundation of China(6127117)
文摘Existing solutions for secure network coding either bring significant bandwidth overhead or incur a high computational complexity. For exploiting low-overhead mechanism for secure network coding against wiretapping, three efficient schemes are proposed for the applications with different security requirements. The basic idea behind this paper is first to encrypt a small part of source vectors and then subject the remaining original source vectors and the encrypted vectors to a special linear transformation. Also, a lightweight version of this scheme is then presented for resource-constrained networks. Moreover, an extensive scheme with enhanced security is also considered. All proposals are shown to have properties of lower security complexity and smaller bandwidth usage compared with the existing solutions. Also, the proposals can be easy to achieve flexible levels of security for various applications.
