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.

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.

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.

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.

Multi-Source Spinal Coding for Coded Caching Multicast Transmissions in Wireless Networks

Recently,coded caching has been treated as a promising technique to alleviate the traffic burden in wireless networks.To support high efficient coded caching multicast transmissions,the time-varying heterogeneous channel conditions need to be considered.In this paper,a practical and novel multi-source spinal coding(MSSC)scheme is developed for coded caching multicast transmissions under heterogeneous channel conditions.By exploring joint design of network coding and spinal coding(SC),MSSC can achieve unequal link rates in multicast transmissions for different users.Moreover,by leveraging the rateless feature of SC in our design,MSSC can well adapt the link rates of all users in multicast transmissions without any feedback of time-varying channel conditions.A maximum likelihood(ML)based decoding process for MSSC is also developed,which can achieve a linear complexity with respect to the user number in the multicast transmission.Simulation results validate the effectiveness of the MSSC scheme.Compared to the existing scheme,the sum rate of MSSC in multicast transmissions is improved by about 20%.When applying MSSC in coded caching systems,the total transmission time can be reduced by up to 48% for time-varying channels.

Unveiling the Challenges in Improving Data Availability in Vehicular Networks with Network Codingin

Retrieving data from mobile source vehicles is a crucial routine operation for a wide spectrum of vehicular network applications, in- cluding road surface monitoring and sharing. Network coding has been widely exploited and is an effective technique for diffusing in- formation over a network. The use of network coding to improve data availability in vehicular networks is explored in this paper. With random linear network codes, simple replication is avoided, and instead, a node forwards a coded block that is a random combination of all data received by the node. We use a network-coding-based approach to improve data availability in vehicular networks. To deter- mine the feasibility of this approach, we conducted an empirical study with extensive simulations based on two real vehicular GPS traces, both of which contain records from thousands of vehicles over more than a year. We observed that, despite significant improve- ment in data availability, there is a serious issue with linear correlation between the received codes. This reduces the data-retrieval success rate. By analyzing the real vehicular traces, we discovered that there is a strong community structure within a real vehicular network. We verify that such a structure contributes to the issue of linear dependence. Then, we point out opportunities to improve the network-coding-based approach by developing community-aware code-distribution techniques.

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.

An Encode-and CRT-Based Scalability Scheme for Optimizing Transmission in Blockchain

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

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.

Complex field network-coded cooperation based on multi-user detection in wireless networks

Cooperative communication can achieve spatial diversity gains,and consequently combats signal fading due to multipath propagation in wireless networks powerfully.A novel complex field network-coded cooperation（CFNCC） scheme based on multi-user detection for the multiple unicast transmission is proposed.Theoretic analysis and simulation results demonstrate that,compared with the conventional cooperation（CC） scheme and network-coded cooperation（NCC） scheme,CFNCC would obtain higher network throughput and consumes less time slots.Moreover,a further investigation is made for the symbol error probability（SEP） performance of CFNCC scheme,and SEPs of CFNCC scheme are compared with those of NCC scheme in various scenarios for different signal to noise ratio（SNR） values.

Power Splitting Based SWIPT in Network-Coded Two-Way Networks with Data Rate Fairness:An Information-Theoretic Perspective

This paper investigates the simultaneous wireless information and powertransfer(SWIPT) for network-coded two-way relay network from an information-theoretic perspective, where two sources exchange information via an SWIPT-aware energy harvesting(EH) relay. We present a power splitting(PS)-based two-way relaying(PS-TWR) protocol by employing the PS receiver architecture. To explore the system sum rate limit with data rate fairness, an optimization problem under total power constraint is formulated. Then, some explicit solutions are derived for the problem. Numerical results show that due to the path loss effect on energy transfer, with the same total available power, PS-TWR losses some system performance compared with traditional non-EH two-way relaying, where at relatively low and relatively high signalto-noise ratio(SNR), the performance loss is relatively small. Another observation is that, in relatively high SNR regime, PS-TWR outperforms time switching-based two-way relaying(TS-TWR) while in relatively low SNR regime TS-TWR outperforms PS-TWR. It is also shown that with individual available power at the two sources, PS-TWR outperforms TS-TWR in both relatively low and high SNR regimes.

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).

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.

Efficient Video Transmission in D2D Assisted Mobile Cloud Networks

The increasing popularity of smart mobile devices and the rise of online services has increased the requirements for efficient dissemination of social video contents. In this paper,we study the problem of distributing video from cloud server to users in partially connected cooperative D2 D network using network coding. In such a scenario, the transmission conflicts occur from simultaneous transmissions of multiple devices, and the scheduling decision should be made not only on the encoded packets but also on the set of transmitting devices. We analyze the lower bound and give an integer linear formulation of the joint optimization problem over the set of transmitting devices and the packet combinations.We also propose a heuristic solution for this setup using a conflict graph and local graph at every device. Simulation results show that our coding scheme significantly reduces the number of transmission slots, which will increase the efficiency of video delivery.

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.

Two-Phase Bidirectional Dual-Relay Selection Strategy for Wireless Relay Networks

In this article,we introduce a new bi-directional dual-relay selection strategy with its bit error rate(BER)performance analysis.During the first step of the proposed strategy,two relays out of a set of N relay-nodes are selected in a way to optimize the system performance in terms of BER,based on the suggested algorithm which checks if the selected relays using the maxmin criterion are the best ones.In the second step,the chosen relay-nodes perform an orthogonal space-time coding scheme using the two-phase relaying protocol to establish a bi-directional communication between the communicating terminals,leading to a significant improvement in the achievable coding and diversity gain.To further improve the overall system performance,the selected relay-nodes apply also a digital network coding scheme.Furthermore,this paper discusses the analytical approximation of the BER performance of the proposed strategy,where we prove that the analytical results match almost perfectly the simulated ones.Finally,our simulation results show that the proposed strategy outperforms the current state-of-the-art ones.

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.