Intelligent Internet of Things with Reliable Communication and Collaboration Technologies

The Internet of Things(IoT)connects objects to Internet through sensor devices,radio frequency identification devices and other information collection and processing devices to realize information interaction.IoT is widely used in many fields,including intelligent transportation,intelligent healthcare,intelligent home and industry.In these fields,IoT devices connected via high-speed internet for efficient and reliable communications and faster response times.

Joint Optimization of Energy Consumption and Network Latency in Blockchain-Enabled Fog Computing Networks

Fog computing is considered as a solution to accommodate the emergence of booming requirements from a large variety of resource-limited Internet of Things(IoT)devices.To ensure the security of private data,in this paper,we introduce a blockchain-enabled three-layer device-fog-cloud heterogeneous network.A reputation model is proposed to update the credibility of the fog nodes(FN),which is used to select blockchain nodes(BN)from FNs to participate in the consensus process.According to the Rivest-Shamir-Adleman(RSA)encryption algorithm applied to the blockchain system,FNs could verify the identity of the node through its public key to avoid malicious attacks.Additionally,to reduce the computation complexity of the consensus algorithms and the network overhead,we propose a dynamic offloading and resource allocation(DORA)algorithm and a reputation-based democratic byzantine fault tolerant(R-DBFT)algorithm to optimize the offloading decisions and decrease the number of BNs in the consensus algorithm while ensuring the network security.Simulation results demonstrate that the proposed algorithm could efficiently reduce the network overhead,and obtain a considerable performance improvement compared to the related algorithms in the previous literature.

BArcherFuzzer:An Android System Services Fuzzier via Transaction Dependencies of BpBinder

By the analysis of vulnerabilities of Android native system services,we find that some vulnerabilities are caused by inconsistent data transmission and inconsistent data processing logic between client and server.The existing research cannot find the above two types of vulnerabilities and the test cases of them face the problem of low coverage.In this paper,we propose an extraction method of test cases based on the native system services of the client and design a case construction method that supports multi-parameter mutation based on genetic algorithm and priority strategy.Based on the above method,we implement a detection tool-BArcherFuzzer to detect vulnerabilities of Android native system services.The experiment results show that BArcherFuzzer found four vulnerabilities of hundreds of exception messages,all of them were confirmed by Google and one was assigned a Common Vulnerabilities and Exposures(CVE)number(CVE-2020-0363).

Software defined intelligent satellite-terrestrial integrated networks:Insights and challenges

Satellite-Terrestrial integrated Networks(STNs)have been advocated by both academia and industry as a promising network paradigm to achieve service continuity and ubiquity.However,STNs suffer from problems including poor flexibility of network architecture,low adaptability to dynamic environments,the lack of network intelligence,and low resource utilization.To handle these challenges,a Software defined Intelligent STN(SISTN)architecture is introduced.Specifically,the hierarchical architecture of the proposal is described and a distributed deployment scheme for SISTNs controllers is proposed to realize agile and effective network management and control.Moreover,three use cases in SISTNs are discussed.Meanwhile,key techniques and their corresponding solutions are presented,followed by the identification of several open issues in SISTNs including compatibility with existing networks,the tradeoff between network flexibility and performance,and so on.

A Machine Learning-Based Attack Detection and Prevention System in Vehicular Named Data Networking

Named Data Networking(NDN)is gaining a significant attention in Vehicular Ad-hoc Networks(VANET)due to its in-network content caching,name-based routing,and mobility-supporting characteristics.Nevertheless,existing NDN faces three significant challenges,including security,privacy,and routing.In particular,security attacks,such as Content Poisoning Attacks(CPA),can jeopardize legitimate vehicles with malicious content.For instance,attacker host vehicles can serve consumers with invalid information,which has dire consequences,including road accidents.In such a situation,trust in the content-providing vehicles brings a new challenge.On the other hand,ensuring privacy and preventing unauthorized access in vehicular(VNDN)is another challenge.Moreover,NDN’s pull-based content retrieval mechanism is inefficient for delivering emergency messages in VNDN.In this connection,our contribution is threefold.Unlike existing rule-based reputation evaluation,we propose a Machine Learning(ML)-based reputation evaluation mechanism that identifies CPA attackers and legitimate nodes.Based on ML evaluation results,vehicles accept or discard served content.Secondly,we exploit a decentralized blockchain system to ensure vehicles’privacy by maintaining their information in a secure digital ledger.Finally,we improve the default routing mechanism of VNDN from pull to a push-based content dissemination using Publish-Subscribe(Pub-Sub)approach.We implemented and evaluated our ML-based classification model on a publicly accessible BurST-Asutralian dataset for Misbehavior Detection(BurST-ADMA).We used five(05)hybrid ML classifiers,including Logistic Regression,Decision Tree,K-Nearest Neighbors,Random Forest,and Gaussian Naive Bayes.The qualitative results indicate that Random Forest has achieved the highest average accuracy rate of 100%.Our proposed research offers the most accurate solution to detect CPA in VNDN for safe,secure,and reliable vehicle communication.

Stochastic programming based multi-arm bandit offloading strategy for internet of things

In order to solve the high latency of traditional cloud computing and the processing capacity limitation of Internet of Things(IoT)users,Multi-access Edge Computing(MEC)migrates computing and storage capabilities from the remote data center to the edge of network,providing users with computation services quickly and directly.In this paper,we investigate the impact of the randomness caused by the movement of the IoT user on decision-making for offloading,where the connection between the IoT user and the MEC servers is uncertain.This uncertainty would be the main obstacle to assign the task accurately.Consequently,if the assigned task cannot match well with the real connection time,a migration(connection time is not enough to process)would be caused.In order to address the impact of this uncertainty,we formulate the offloading decision as an optimization problem considering the transmission,computation and migration.With the help of Stochastic Programming(SP),we use the posteriori recourse to compensate for inaccurate predictions.Meanwhile,in heterogeneous networks,considering multiple candidate MEC servers could be selected simultaneously due to overlapping,we also introduce the Multi-Arm Bandit(MAB)theory for MEC selection.The extensive simulations validate the improvement and effectiveness of the proposed SP-based Multi-arm bandit Method(SMM)for offloading in terms of reward,cost,energy consumption and delay.The results showthat SMMcan achieve about 20%improvement compared with the traditional offloading method that does not consider the randomness,and it also outperforms the existing SP/MAB based method for offloading.

Efficient Certificateless Authenticated Key Agreement for Blockchain-Enabled Internet of Medical Things

Internet of Medical Things(IoMT)plays an essential role in collecting and managing personal medical data.In recent years,blockchain technology has put power in traditional IoMT systems for data sharing between different medical institutions and improved the utilization of medical data.However,some problems in the information transfer process between wireless medical devices and mobile medical apps,such as information leakage and privacy disclosure.This paper first designs a cross-device key agreement model for blockchain-enabled IoMT.This model can establish a key agreement mechanism for secure medical data sharing.Meanwhile,a certificateless authenticated key agreement(KA)protocol has been proposed to strengthen the information transfer security in the cross-device key agreement model.The proposed KA protocol only requires one exchange of messages between the two parties,which can improve the protocol execution efficiency.Then,any unauthorized tampering of the transmitted signed message sent by the sender can be detected by the receiver,so this can guarantee the success of the establishment of a session key between the strange entities.The blockchain ledger can ensure that the medical data cannot be tampered with,and the certificateless mechanism can weaken the key escrow problem.Moreover,the security proof and performance analysis are given,which show that the proposed model and KA protocol are more secure and efficient than other schemes in similar literature.

Genuine Einstein-Podolsky-Rosen steering of generalized three-qubit states via unsharp measurements

We aim to explore all possible scenarios of(1→2)(where one wing is untrusted and the others two wings are trusted)and(2→1)(where two wings are untrusted,and one wing is trusted)genuine tripartite Einstein-Podolsky-Rosen(EPR)steering.The generalized Greenberger-Horne-Zeilinger(GHZ)state is shared between three spatially separated parties,Alice,Bob and Charlie.In both(1→2)and(2→1),we discuss the untrusted party and trusted party performing a sequence of unsharp measurements,respectively.For each scenario,we deduce an upper bound on the number of sequential observers who can demonstrate genuine EPR steering through the quantum violation of tripartite steering inequality.The results show that the maximum number of observers for the generalized GHZ states can be the same with that of the maximally GHZ state in a certain range of state parameters.Moreover,both the sharpness parameters range and the state parameters range in the scenario of(1→2)steering are larger than those in the scenario of(2→1)steering.

Cryptanalysis and Improvement of Two GHZ-State-Based QSDC Protocols

In a recent paper[J. Korean. Phys. Soc. 49 （2006） 459], two GHZ-state-based quantum secure direct communication protocols were presented. Here we point out that an eavesdropper can utilize a special property of GHZ states, i.e. ＂correlation-elicitable＂ to obtain half information of the transmitted secrets without being detected in both protocols. The particular attack strategy is demonstrated in detail. Furthermore, a possible improvement is proposed, which makes the protocols secure against this kind of attack.

Cryptanalysis of Quantum Secure Direct Communication and Authentication Scheme via Bell States

The security of the quantum secure direct communication(QSDC)and authentication protocol based on Bell states is analyzed.It is shown that an eavesdropper can invalidate the authentication function,and implement a successful man-in-the-middle attack,where he/she can obtain or even modify the transmitted secret without introducing any error.The particular attack strategy is demonstrated and an improved protocol is presented.

Design Framework of Unsourced Multiple Access for 6G Massive IoT

In this paper,ambient IoT is used as a typical use case of massive connections for the sixth generation(6G)mobile communications where we derive the performance requirements to facilitate the evaluation of technical solutions.A rather complete design of unsourced multiple access is proposed in which two key parts:a compressed sensing module for active user detection,and a sparse interleaver-division multiple access(SIDMA)module are simulated side by side on a same platform at balanced signal to noise ratio(SNR)operating points.With a proper combination of compressed sensing matrix,a convolutional encoder,receiver algorithms,the simulated performance results appear superior to the state-of-the-art benchmark,yet with relatively less complicated processing.

Energy Minimization for Heterogenous Traffic Coexistence with Puncturing in Mobile Edge Computing-Based Industrial Internet of Things

Puncturing has been recognized as a promising technology to cope with the coexistence problem of enhanced mobile broadband(eMBB) and ultra-reliable low latency communications(URLLC)traffic. However, the steady performance of eMBB traffic while meeting the requirements of URLLC traffic with puncturing is a major challenge in some realistic scenarios. In this paper, we pay attention to the timely and energy-efficient processing for eMBB traffic in the industrial Internet of Things(IIoT), where mobile edge computing(MEC) is employed for data processing. Specifically, the performance of eMBB traffic and URLLC traffic in a MEC-based IIoT system is ensured by setting the threshold of tolerable delay and outage probability, respectively. Furthermore,considering the limited energy supply, an energy minimization problem of eMBB device is formulated under the above constraints, by jointly optimizing the resource blocks(RBs) punctured by URLLC traffic, data offloading and transmit power of eMBB device. With Markov's inequality, the problem is reformulated by transforming the probabilistic outage constraint into a deterministic constraint. Meanwhile, an iterative energy minimization algorithm(IEMA) is proposed.Simulation results demonstrate that our algorithm has a significant reduction in the energy consumption for eMBB device and achieves a better overall effect compared to several benchmarks.

Associative Tasks Computing Offloading Scheme in Internet of Medical Things with Deep Reinforcement Learning

The Internet of Medical Things(Io MT) is regarded as a critical technology for intelligent healthcare in the foreseeable 6G era. Nevertheless, due to the limited computing power capability of edge devices and task-related coupling relationships, Io MT faces unprecedented challenges. Considering the associative connections among tasks, this paper proposes a computing offloading policy for multiple-user devices(UDs) considering device-to-device(D2D) communication and a multi-access edge computing(MEC)technique under the scenario of Io MT. Specifically,to minimize the total delay and energy consumption concerning the requirement of Io MT, we first analyze and model the detailed local execution, MEC execution, D2D execution, and associated tasks offloading exchange model. Consequently, the associated tasks’ offloading scheme of multi-UDs is formulated as a mixed-integer nonconvex optimization problem. Considering the advantages of deep reinforcement learning(DRL) in processing tasks related to coupling relationships, a Double DQN based associative tasks computing offloading(DDATO) algorithm is then proposed to obtain the optimal solution, which can make the best offloading decision under the condition that tasks of UDs are associative. Furthermore, to reduce the complexity of the DDATO algorithm, the cacheaided procedure is intentionally introduced before the data training process. This avoids redundant offloading and computing procedures concerning tasks that previously have already been cached by other UDs. In addition, we use a dynamic ε-greedy strategy in the action selection section of the algorithm, thus preventing the algorithm from falling into a locally optimal solution. Simulation results demonstrate that compared with other existing methods for associative task models concerning different structures in the Io MT network, the proposed algorithm can lower the total cost more effectively and efficiently while also providing a tradeoff between delay and energy consumption tolerance.

A Double-Timescale Reinforcement Learning Based Cloud-Edge Collaborative Framework for Decomposable Intelligent Services in Industrial Internet of Things

With the proportion of intelligent services in the industrial internet of things(IIoT)rising rapidly,its data dependency and decomposability increase the difficulty of scheduling computing resources.In this paper,we propose an intelligent service computing framework.In the framework,we take the long-term rewards of its important participants,edge service providers,as the optimization goal,which is related to service delay and computing cost.Considering the different update frequencies of data deployment and service offloading,double-timescale reinforcement learning is utilized in the framework.In the small-scale strategy,the frequent concurrency of services and the difference in service time lead to the fuzzy relationship between reward and action.To solve the fuzzy reward problem,a reward mapping-based reinforcement learning(RMRL)algorithm is proposed,which enables the agent to learn the relationship between reward and action more clearly.The large time scale strategy adopts the improved Monte Carlo tree search(MCTS)algorithm to improve the learning speed.The simulation results show that the strategy is superior to popular reinforcement learning algorithms such as double Q-learning(DDQN)and dueling Q-learning(dueling-DQN)in learning speed,and the reward is also increased by 14%.

Graph Attention Residual Network Based Routing and Fault-Tolerant Scheduling Mechanism for Data Flow in Power Communication Network

For permanent faults(PF)in the power communication network(PCN),such as link interruptions,the timesensitive networking(TSN)relied on by PCN,typically employs spatial redundancy fault-tolerance methods to keep service stability and reliability,which often limits TSN scheduling performance in fault-free ideal states.So this paper proposes a graph attention residual network-based routing and fault-tolerant scheduling mechanism(GRFS)for data flow in PCN,which specifically includes a communication system architecture for integrated terminals based on a cyclic queuing and forwarding(CQF)model and fault recovery method,which reduces the impact of faults by simplified scheduling configurations of CQF and fault-tolerance of prioritizing the rerouting of faulty time-sensitive(TS)flows;considering that PF leading to changes in network topology is more appropriately solved by doing routing and time slot injection decisions hop-by-hop,and that reasonable network load can reduce the damage caused by PF and reserve resources for the rerouting of faulty TS flows,an optimization model for joint routing and scheduling is constructed with scheduling success rate as the objective,and with traffic latency and network load as constraints;to catch changes in TSN topology and traffic load,a D3QN algorithm based on a multi-head graph attention residual network(MGAR)is designed to solve the problem model,where the MGAR based encoder reconstructs the TSN status into feature embedding vectors,and a dueling network decoder performs decoding tasks on the reconstructed feature embedding vectors.Simulation results show that GRFS outperforms heuristic fault-tolerance algorithms and other benchmark schemes by approximately 10%in routing and scheduling success rate in ideal states and 5%in rerouting and rescheduling success rate in fault states.

Robustness self-testing of states and measurements in the prepare-and-measure scenario with 3 → 1 random access code

Recently, Tavakoli et al.proposed a self-testing scheme in the prepare-and-measure scenario, showing that self-testing is not necessarily based on entanglement and violation of a Bell inequality [Phys.Rev.A 98 062307(2018)].They realized the self-testing of preparations and measurements in an N → 1(N ≥ 2) random access code(RAC), and provided robustness bounds in a 2 → 1 RAC.Since all N → 1 RACs with shared randomness are combinations of 2 → 1 and 3 → 1 RACs, the3 → 1 RAC is just as important as the 2 → 1 RAC.In this paper, we find a set of preparations and measurements in the3 → 1 RAC, and use them to complete the robustness self-testing analysis in the prepare-and-measure scenario.The method is robust to small but inevitable experimental errors.

Steganalysis and improvement of a quantum steganography protocol via a GHZ_4 state

Quantum steganography that utilizes the quantum mechanical effect to achieve the purpose of information hiding is a popular topic of quantum information. Recently, E1 Allati et al. proposed a new quantum steganography using the GHZ4 state. Since all of the 8 groups of unitary transformations used in the secret message encoding rule change the GHZ4 state into 6 instead of 8 different quantum states when the global phase is not considered, we point out that a 2-bit instead of a 3-bit secret message can be encoded by one group of the given unitary transformations. To encode a 3-bit secret message by performing a group of unitary transformations on the GHZ4 state, we give another 8 groups of unitary transformations that can change the GHZ4 state into 8 different quantum states. Due to the symmetry of the GHZ4 state, all the possible 16 groups of unitary transformations change the GHZ4 state into 8 different quantum states, so the improved protocol achieves a high efficiency.

Blockchain-based fog radio access networks:Architecture,key technologies,and challenges

Fog Radio Access Network(F-RAN)has been regarded as a promising solution to the alleviation of the ever-increasing traffic burden on current and future wireless networks,for it shifts the caching and computing resources from remote cloud to the network edge.However,it makes wireless networks more vulnerable to security attacks as well.To resolve this issue,in this article,we propose a secure yet trustless Blockchain-based F-RAN(BF-RAN),which allows a massive number of trustless devices to form a large-scale trusted cooperative network by leveraging the key features of blockchain,such as decentralization,tamper-proof,and traceability.The architecture of BF-RAN is first presented.Then,the key technologies,including access control,dynamic resource management,and network deployment are discussed.Finally,challenges and open problems in the BF-RAN are identified.

Performance analysis of diffusion-based decode-and-forward relay with depleted molecule shift keying

The distance-decay effect of molecular signals makes communication range a major challenge for diffusion-based Molecular Communication(MC).To solve this problem,the intermediate nano-machine is deployed as a relay between the transmitter and its intended receiver nano-machines.In this work,we employ the Depleted Molecule Shift Keying(D-MoSK)to model a Decode-and-Forward(DF)relay communication scheme.The closed-form expression of Bit Error Rate(BER)for the concerned DF relay with D-MoSK is derived.Meanwhile,the maximum a posteriori probability,minimum error probability,and maximum likelihood schemes are formulated for data detection.The relationships between BER and other key parameters,including the number of released molecules,receiving radius,and relay position,are investigated in detail.Simulation results show that the proposed scheme can improve communication reliability significantly.Moreover,the performance gain can be maximized by optimizing the position of the relay and the receiving radius.

Review of Electrical and Electronic Architectures for Autonomous Vehicles:Topologies,Networking and Simulators

With the rapid development of autonomous vehicles,more and more functions and computing requirements have led to the continuous centralization in the topology of electrical and electronic(E/E)architectures.While certain Tier1 suppliers,such as BOSCH,have previously proposed a serial roadmap for E/E architecture development,implemented since 2015 with significant contributions to the automotive industry,lingering misconceptions and queries persist in actual engineering processes.Notably,there are concerns regarding the perspective of zone-oriented E/E architectures,characterized by zonal concentration,as successors to domain-oriented E/E architectures,known for functional concentration.Addressing these misconceptions and queries,this study introduces a novel parallel roadmap for E/E architecture development,concurrently evaluating domain-oriented and zone-oriented schemes.Furthermore,the study explores hybrid E/E architectures,amalgamating features from both paradigms.To align with the evolution of E/E architectures,networking technologies must adapt correspondingly.The networking mechanisms pivotal in E/E architecture design are comprehensively discussed.Additionally,the study delves into modeling and verification tools pertinent to E/E architecture topologies.In conclusion,the paper outlines existing challenges and unresolved queries in this domain.