Intrusion Detection Model Using Chaotic MAP for Network Coding Enabled Mobile Small Cells

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.

Multiway Relay Based Framework for Network Coding in Multi-Hop WSNs

In today’s information technology(IT)world,the multi-hop wireless sensor networks(MHWSNs)are considered the building block for the Internet of Things(IoT)enabled communication systems for controlling everyday tasks of organizations and industry to provide quality of service(QoS)in a stipulated time slot to end-user over the Internet.Smart city(SC)is an example of one such application which can automate a group of civil services like automatic control of traffic lights,weather prediction,surveillance,etc.,in our daily life.These IoT-based networks with multi-hop communication and multiple sink nodes provide efficient communication in terms of performance parameters such as throughput,energy efficiency,and end-to-end delay,wherein low latency is considered a challenging issue in next-generation networks(NGN).This paper introduces a single and parallels stable server queuing model with amulti-class of packets and native and coded packet flowto illustrate the simple chain topology and complexmultiway relay(MWR)node with specific neighbor topology.Further,for improving data transmission capacity inMHWSNs,an analytical framework for packet transmission using network coding at the MWR node in the network layer with opportunistic listening is performed by considering bi-directional network flow at the MWR node.Finally,the accuracy of the proposed multi-server multi-class queuing model is evaluated with and without network coding at the network layer by transmitting data packets.The results of the proposed analytical framework are validated and proved effective by comparing these analytical results to simulation results.

Anti-Noise Quantum Network Coding Protocol Based on Bell States and Butterfly Network Model

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.

Independent component analysis to physical-layer network coding over wireless fading channels

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.

Reliable Braided Multipath Routing with Network Coding for Underwater Sensor Networks

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.

RESEARCH ON ADAPTIVE COMPRESSION CODING FOR NETWORK CODING IN WIRELESS SENSOR NETWORK

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.

A Physical Layer Network Coding Based Tag Anti-Collision Algorithm for RFID System

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.

Continuous-Variable Quantum Network Coding Based on Quantum Discord

Establishing entanglement is an essential task of quantum communication technology.Beyond entanglement,quantum discord,as a measure of quantum correlation,is a necessary prerequisite to the success of entanglement distribution.To realize efficient quantum communication based on quantum discord,in this paper,we consider the practical advantages of continuous variables and propose a feasible continuous-variable quantum network coding scheme based on quantum discord.By means of entanglement distribution by separable states,it can achieve quantum entanglement distribution from sources to targets in a butterfly network.Compared with the representative discrete-variable quantum network coding schemes,the proposed continuous-variable quantum network coding scheme has a higher probability of entanglement distribution and defends against eavesdropping and forgery attacks.Particularly,the deduced relationship indicates that the increase in entanglement is less than or equal to quantum discord.

Network Coding Cooperation Performance Analysis in Wireless Network over a Lossy Channel, M Users and a Destination Scenario

Network coding (NC), introduced at the turn of the century, enables nodes in a network to combine data algebraically before either sending or forwarding them. Random network coding has gained popularity over the years by combining the received packet randomly before forwarding them, resulting in a complex Jordan Gaussian Elimination (JGE) decoding process. The effectiveness of random NC is through cooperation among nodes. In this paper, we propose a simple, low-complexity cooperative protocol that exploits NC in a deterministic manner resulting in improved diversity, data rate, and less complex JGE decoding process. The proposed system is applied over a lossy wireless network. The scenario under investigation is as follows: M users must send their information to a common destination D and to exchange the information between each others, over erasure channels;typically the channels between the users and the destination are worse than the channels between users. It is possible to significantly reduce the traffic among users and destination, achieving significant bandwidth savings, by combining packets from different users in simple, deterministic ways without resorting to extensive header information before being forwarded to the destination and the M users. The key problem we try to address is how to efficiently combine the packets at each user while exploiting user cooperation and the probability of successfully recovering information from all users at D with k < 2M unique linear equations, accounting for the fact that the remaining packets will be lost in the network and there are two transmission stages. Simulation results show the behaviour for two and three transmission stages. Our results show that applying NC protocols in two or three stages decreases the traffic significantly, beside the fact that the proposed protocols enable the system to retrieve the lost packets rather than asking for ARQ, resulting in improved data flow, and less power consumption. In fact, in some protocols the ARQ dropped from the rate 10ˉ1 to 10ˉ4, because of the proposed combining algorithm that enables the nodes to generate additional unique linear equations to broadcast rather than repeating the same ones via ARQ. Moreover, the number of the transmitted packets in each cooperative stage dropped from M (M - 1) to just M packets, resulting to 2 M packets instead 2 (M2 - 1) when three stages of transmission system are used instead of one stage (two cooperative stages).

On Latency Reductions in Vehicle-to-Vehicle Networks by Random Linear Network Coding

In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenario where the demands of a vehicle are satisfied by cooperative transmissions from those one in front is considered.Since the topology of the vehicle network is dynamic,random linear network coding is applied in such a multisource single-sink vehicle-to-vehicle network,where each vehicle is assumed to broadcast messages to others so that the intermediate vehicles between sources and sink can reduce the latency collaboratively.It is shown that the coding scheme can significantly reduce the time delay compared with the non-coding scheme even in the channels with high packet loss rate.In order to further optimize the coding scheme,one can increase the generation size,where the generation size means the number of raw data packets sent by the source node to the sink node in each round of communication.Under the premise of satisfying the coding validity,we can dynamically select the Galois field size according to the number of intermediate nodes.It is not surprised that the reduction in the Galois field size can further reduce the transmission latency.

Controlled Quantum Network Coding Without Loss of Information

Quantum network coding is used to solve the congestion problem in quantum communication,which will promote the transmission efficiency of quantum information and the total throughput of quantum network.We propose a novel controlled quantum network coding without information loss.The effective transmission of quantum states on the butterfly network requires the consent form a third-party controller Charlie.Firstly,two pairs of threeparticle non-maximum entangled states are pre-shared between senders and controller.By adding auxiliary particles and local operations,the senders can predict whether a certain quantum state can be successfully transmitted within the butterfly network based on the Z-{10>,|1>}basis.Secondly,when trans-mission fails upon prediction,the quantum state will not be lost,and it will sill be held by the sender.Subsequently,the controller Charlie re-prepares another three-particle non-maximum entangled state to start a new round.When the predicted transmission is successful,the quantum state can be transmitted successfully within the butterfly network.If the receiver wants to receive the effective quantum state,the quantum measurements from Charlie are needed.Thirdly,when the transmission fails,Charlie does not need to integrate the X-{1+>,1->}basis to measure its own particles,by which quantum resources are saved.Charlie not only controls the effective transmission of quantum states,but also the usage of classical and quantum channels.Finally,the implementation of the quantum circuits,as well as a flow chart and safety analysis of our scheme,is proposed.

A Practical Quantum Network Coding Protocol Based on Non-Maximally Entangled State

In many earlier works,perfect quantum state transmission over the butterfly network can be achieved via quantum network coding protocols with the assist of maximally entangled states.However,in actual quantum networks,a maximally entangled state as auxiliary resource is hard to be obtained or easily turned into a non-maximally entangled state subject to all kinds of environmental noises.Therefore,we propose a more practical quantum network coding scheme with the assist of non-maximally entangled states.In this paper,a practical quantum network coding protocol over grail network is proposed,in which the non-maximally entangled resource is assisted and even the desired quantum state can be perfectly transmitted.The achievable rate region,security and practicability of the proposed protocol are discussed and analyzed.This practical quantum network coding protocol proposed over the grail network can be regarded as a useful attempt to help move the theory of quantum network coding towards practicability.

Spatial-Modulated Physical-Layer Network Coding Based on Block Markov Superposition Transmission for Maritime Relay Communications

As an alternative to satellite communications,multi-hop relay networks can be deployed for maritime long-distance communications.Distinct from terrestrial environment,marine radio signals are affected by many factors,e.g.,weather conditions,evaporation ducting,and ship rocking caused by waves.To ensure the data transmission reliability,the block Markov superposition transmission(BMST)codes,which are easily configurable and have predictable performance,are applied in this study.Meanwhile,the physical-layer network coding(PNC)scheme with spatial modulation(SM)is adopted to improve the spectrum utilization.For the BMST-SMPNC system,we propose an iterative algorithm,which utilizes the channel observations and the a priori information from BMST decoder,to compute the soft information corresponding to the XORed bits constructed by the relay node.The results indicate that the proposed scheme outperforms the convolutional coded SM-PNC over fast-fading Rician channels.Especially,the performance can be easily improved in high spatial correlation maritime channel by increasing the memory m.

Physical Layer Deterministic Network Coding Using PUM Turbo Codes over AWGN Channel, N Nodes through a Base Station Scenario

Network Coding (NC) is a recent technique which is used to improve the transmission data rate and the power efficiency. These goals are obtained by combining data together before transmitting them, resulting to less transmitted data that carry the same amount of information. NC research work over the physical layer and the upper layers are popular and needed to be more investigated. In this paper, we propose a practical system of large-number of connected multi-source network coding (LMSNC), at the physical layer that exploits the broadcast nature of the wireless channel, using the practical and bandwidth-efficient schemes decode-and-forward (DF) and then compare it with Amplify and Forward (AF). The theoretical analysis and the simulation results show the effect of the noise when it cumulates in AF system and how DF is solving this severe default. Moreover, we consider the MSNC for Small-number of connected sources (SMSNC) and the two-way communication setup where two users exchange their information over an intermediate network node (ideally called Base Station), as two reference cases to compare with. With SMSNC, the number of necessary downlink transmissions from the intermediate node to the users is reduced, and thus the throughput is increased. Simulation results obtained using high-performance non-binary turbo codes, based on Partial Unit Memory (PUM) codes (4, 2, 1, 4) and (8, 4, 3, 8);confirm that combining PUM Turbo Code (PUMTC) and NC in the proposed MSNC setup gives almost the same BER performance as that for SMSNC at the small number of processing steps mainly when PUMTC (8, 4, 3, 8) is performed, which is required to retrieve the received coded messages. In the scenario of AF, combining packets results to cumulate the noise, which justifies the reason we decided to increase the number of transmitted coded messages in the network, i.e., the BER performance improves when sending extra coded messages. Finally, the possibility for a trade-off among BER, data rate and the number of transmitted coded messages is shown for LMSNC through graphics and simulation results.

Linear Network Coding Based Fast Data Synchronization for Wireless Ad Hoc Networks with Controlled Topology

Fast data synchronization in wireless ad hoc networks is a challenging and critical problem.It is fundamental for efficient information fusion,control and decision in distributed systems.Previously,distributed data synchronization was mainly studied in the latency-tolerant distributed databases,or assuming the general model of wireless ad hoc networks.In this paper,we propose a pair of linear network coding(NC)and all-to-all broadcast based fast data synchronization algorithms for wireless ad hoc networks whose topology is under operator’s control.We consider both data block selection and transmitting node selection for exploiting the benefits of NC.Instead of using the store-and-forward protocol as in the conventional uncoded approach,a compute-and-forward protocol is used in our scheme,which improves the transmission efficiency.The performance of the proposed algorithms is studied under different values of network size,network connection degree,and per-hop packet error rate.Simulation results demonstrate that our algorithms significantly reduce the times slots used for data synchronization compared with the baseline that does not use NC.

Optimal chunk caching in network coding-based qualitative communication

Network processing in the current Internet is at the entirety of the data packet,which is problematic when encountering network congestion.The newly proposed Internet service named Qualitative Communication changes the network processing paradigm to an even finer granularity,namely chunk level,which obsoletes many existing networking policies and schemes,especially the caching algorithms and cache replacement policies that have been extensively explored in Web Caching,Content Delivery Networks(CDN)or Information-Centric Networks(ICN).This paper outlines all the new factors that are brought by random linear network coding-based Qualitative Communication and proves the importance and necessity of considering them.A novel metric is proposed by taking these new factors into consideration.An optimization problem is formulated to maximize the metric value of all retained chunks in the local storage of network nodes under the constraint of storage limit.A cache replacement scheme that obtains the optimal result in a recursive manner is proposed correspondingly.With the help of the introduced intelligent cache replacement algorithm,the performance evaluations show remarkably reduced end-to-end latency compared to the existing schemes in various network scenarios.

Multi-Hop Transmission Method of 5G Millimeter Wave Relay Based on Network Coding

With the rapid development of the Internet technology,millimeter wave(mmWave)will be used as a supplement to 5G low frequency bands to meet the extremely high system capacity requirements of 5G in hot spots.Although 5G mmWave communication can adapt to the needs of 5G network and carry a large amount of transmitted data,transmission stability has become one of the key technical issues of 5G network mmWave communication due to problems such as strong attenuation and poor penetration of mmWave.In order to improve the efficiency of the mmWave multi-hop transmission,we propose a 5G mmWave multi-hop transmission method based on network coding,which can adapt to the current wireless network environment,improve spectrum efficiency and increase network throughput.Based on MATLAB simulation experiments,it is verified that the proposed method can greatly improve the transmission efficiency and reduce the signal loss under the premise of ensuring the accurate signal transmission.

Network coding-aware cache replacement policy in on-demand 0broadcast environments

Network coding has been proved to be an effective technique in improving the performance of data broadcast systems because clients requesting different data items can be served simultaneously in one broadcast. Previous studies showed that its efficiency is highly related to the content of clients' cache. However, existing data broadcast systems do not take network coding information into account when making cache replacement decisions. In this paper, we propose two networks coding-aware cache replacement policies called DLRU and DLRU-CP to supplement network coding assisted data broadcast in on-demand broadcast environments. In DLRU, both data access and decoding contribution are taken into account to make replacement decisions. DLRU-CP is based on DLRU but allows clients to retrieve decodable data items that have not been requested yet. The performance gain of our proposed cache replacement policies over traditional cache replacement policy is shown in the simulation results, which demonstrate conclusively that the proposed policies can effectively reduce the overall response time.

PERFORMANCE ANALYSIS OF USER FAIR-BASED RELAY ADAPTIVE POWER ALLOCATION IN PHYSICAL-LAYER NETWORK CODING COOPERATION

Network Coding (NC) is an effective technology to enhance the cooperative system spectral efficiency. However, since it is network-oriented, the existing performance metric of single-user outage can not comprehensively evaluate its gain and the impact to the entire network, which affect the user fairness. This paper proposes two novel user fair-based adaptive relay power allocation algorithms in single-relay NC cooperative multiple access channels. Firstly, common outage probability is employed as the performance metric, and to minimize it, a specific condition is deduced. On this basis, the instantaneous channel information-based adaptive relay power allocation scheme and the channel statistic information-based one with lower complexity are designed respectively, which make users' signals superimposed at accurately calculated proportion to maintain fairness. Simulation results show that compared with other existing schemes, the proposed schemes can best maintain user fairness, and effectively improve the common outage performance of the whole system, at the expense of small spectral efficiency.

A NOVEL FRAMEWORK OF ONLINE NETWORK CODING FOR MULTICAST SWITCHES WITH CONSTRAINED BUFFERS

Network coding is able to address output conflicts when fanout splitting is allowed for multicast switching.Hence,it successfully achieves a larger rate region than non-coding approaches in crossbar switches.However,network coding requires large coding buffers and a high computational cost on encoding and decoding.In this paper,we propose a novel Online Network Coding framework called Online NC for multicast switches,which is adaptive to constrained buffers.Moreover,it enjoys a much lower decoding complexity by a Vandermonde matrix based approach,as compared to conven-tional randomized network coding Our approach realizes online coding with one coding algo-rithm that synchronizes buffering and coding.Therefore,we significantly reduce requirements on buffer space,while also sustaining high throughputs.We confirm the superior advantages of our contributions using empirical studies.