Theoretical Framework for a Polymorphic Network Environment

The question of whether an ideal network exists with global scalability in its full life cycle has always been a first-principles problem in the research of network systems and architectures.Thus far,it has not been possible to scientifically practice the design criteria of an ideal network in a unimorphic network system,making it difficult to adapt to known services with clear application scenarios while supporting the ever-growing future services with unexpected characteristics.Here,we theoretically prove that no unimorphic network system can simultaneously meet the scalability requirement in a full cycle in three dimensions—the service-level agreement(S),multiplexity(M),and variousness(V)—which we name as the“impossible SMV triangle”dilemma.It is only by transforming the current network development paradigm that the contradiction between global scalability and a unified network infrastructure can be resolved from the perspectives of thinking,methodology,and practice norms.In this paper,we propose a theoretical framework called the polymorphic network environment(PNE),the first principle of which is to separate or decouple application network systems from the infrastructure environment and,under the given resource conditions,use core technologies such as the elementization of network baselines,the dynamic aggregation of resources,and collaborative software and hardware arrangements to generate the capability of the“network of networks.”This makes it possible to construct an ideal network system that is designed for change and capable of symbiosis and coexistence with the generative network morpha in the spatiotemporal dimensions.An environment test for principle verification shows that the generated representative application network modalities can not only coexist without mutual influence but also independently match well-defined multimedia services or custom services under the constraints of technical and economic indicators.

Intrusion Detection System for Smart Industrial Environments with Ensemble Feature Selection and Deep Convolutional Neural Networks

Smart Industrial environments use the Industrial Internet of Things(IIoT)for their routine operations and transform their industrial operations with intelligent and driven approaches.However,IIoT devices are vulnerable to cyber threats and exploits due to their connectivity with the internet.Traditional signature-based IDS are effective in detecting known attacks,but they are unable to detect unknown emerging attacks.Therefore,there is the need for an IDS which can learn from data and detect new threats.Ensemble Machine Learning(ML)and individual Deep Learning(DL)based IDS have been developed,and these individual models achieved low accuracy;however,their performance can be improved with the ensemble stacking technique.In this paper,we have proposed a Deep Stacked Neural Network(DSNN)based IDS,which consists of two stacked Convolutional Neural Network(CNN)models as base learners and Extreme Gradient Boosting(XGB)as the meta learner.The proposed DSNN model was trained and evaluated with the next-generation dataset,TON_IoT.Several pre-processing techniques were applied to prepare a dataset for the model,including ensemble feature selection and the SMOTE technique.Accuracy,precision,recall,F1-score,and false positive rates were used to evaluate the performance of the proposed ensemble model.Our experimental results showed that the accuracy for binary classification is 99.61%,which is better than in the baseline individual DL and ML models.In addition,the model proposed for IDS has been compared with similar models.The proposed DSNN achieved better performance metrics than the other models.The proposed DSNN model will be used to develop enhanced IDS for threat mitigation in smart industrial environments.

AN ADAPTIVE OPPORTUNISTIC RETRANSMISSION CONTROL SCHEME ENVIRONMENT-AWARE-BASED FOR WIRELESS MULTIMEDIA MESH NETWORKS

In this paper, we propose an aware-based adaptive opportunistic retransmission control scheme for wireless multimedia Mesh networks. The proposed scheme provides maximum retransmis-sion count optimization based on environment-aware to improve packet relay probability. The scheme discriminates the types of packet loss in wireless link by means of environment information and selects the retransmission count by taking the IEEE 802.11 wireless channel characteristics into consideration. Furthermore, the maximum retransmission count of MAC is adjusted adaptively. Extensive simulations demonstrate that the proposed scheme significantly reduces packet collision probability and packet loss rate, and thus improves network throughput.

SFC placement and dynamic resource allocation based on VNF performance-resource function and service requirement in cloud-edge environment

With the continuous development of network func-tions virtualization(NFV)and software-defined networking(SDN)technologies and the explosive growth of network traffic,the requirement for computing resources in the network has risen sharply.Due to the high cost of edge computing resources,coordinating the cloud and edge computing resources to improve the utilization efficiency of edge computing resources is still a considerable challenge.In this paper,we focus on optimiz-ing the placement of network services in cloud-edge environ-ments to maximize the efficiency.It is first proved that,in cloud-edge environments,placing one service function chain(SFC)integrally in the cloud or at the edge can improve the utilization efficiency of edge resources.Then a virtual network function(VNF)performance-resource(P-R)function is proposed to repre-sent the relationship between the VNF instance computing per-formance and the allocated computing resource.To select the SFCs that are most suitable to deploy at the edge,a VNF place-ment and resource allocation model is built to configure each VNF with its particular P-R function.Moreover,a heuristic recur-sive algorithm is designed called the recursive algorithm for max edge throughput(RMET)to solve the model.Through simula-tions on two scenarios,it is verified that RMET can improve the utilization efficiency of edge computing resources.

Analysis of Commuting Modal Shift in Consideration of Social Interaction of Consciousness for Environment

It is the matter for achievement of the low carbon transport system that the excessive use of private vehicles can be controlled appropriately.Not only improvement of service level of modes except private vehicle,but also consciousness for environmental problem of individual trip maker is important for eco-commuting promotion.On the other hand,consciousness for environment would be changed by influence of other person.Accordingly,it is aimed in the study that the structure of decision-making process for modal shift to the eco-commuting mode in the local city is described considering environmental consciousness and social interaction.For the purpose,the consciousness for the environment problem and the travel behavior of the commuter at the suburban area in the local city are investigated by the questionnaire survey.The covariance structure about the eco-consciousness is analyzed with the database of the questionnaire survey by structural equation modeling.As the result,it can be confirmed with the structural equation model that the individual environmental consciousness is strongly related with the intention of self-sacrifice and is influenced with the local interaction of the individual connections.On the other hand,the intention of modal shift for the commuting mode is analyzed with the database of the questionnaire survey.It can be found out that the environmental consciousness is not statistically significant for commuting mode choice with the present poor level of service of public transport.However,the intention of self-sacrifice for the prevention of the global warming is statistically confirmed as the factor of modal shift with the operation of eco-commuting bus service with the RP/SP integrated estimation method.As the result,the multi-agent simulation system with social interaction model for eco consciousness is developed to measure the effect of the eco-commuting promotion.For the purpose,the carbon dioxide emission is estimated based on traffic demand and road network condition in the traffic environment model.On the other hand,the relation between agents is defined based on the small world network.The proposed multi-agent simulation is applied to measure the effect of the eco-commuting promotion such as improvement of level of service on the public transport or education of eco-consciousness.The effect of the promotion plan can be observed with the proposed multi-agent system.Finally,it can be concluded that the proposed multi-agent simulation with social interaction for eco-consciousness is useful for planning of eco-commuting promotion.

Construction of overlay network based on P2P technology in Grid environment

Based on the advantages of both Grid and peer-to-peer （P2P） networks, an overlay network in the Grid environment is constructed by P2P technologies by a modified version of the Chord protocol. In this mechanism, different nodes＇ accesses to different resources are determined by their contribution. Therefore, the heterogeneous resources of virtual organizations in large-scale Grid can be effectively integrated, and the key node failure as well as system bottleneck in the traditional Grid environment is eliminated. The experimental results indicate that this management mechanism can achieve better average performance in the Grid environment and maintain the P2P characteristics as well.

Data Distribution Mechanism over Opportunistic Networks with Limited Epidemic

Most of data distribution mechanism in Opportunistic Networks is derived by Epidemic data distribution,and Epidemic data distribution means that when each node meets another node,it may copy its own messages and transfer to another node.On the one hand,the copies improve the forwarding rate,and reduce the transmission delay.However,on the other hand,energy consumption increases and network survival time is reduced because the copies consume transmission resource.Therefore,copy number should be under control.In this paper,we first introduce the existing routing strategy based on Epidemic briefly,and present the Epidemic routing protocol analysis model and copy control mechanism based on the limited Epidemic in Opportunistic Networks.Then based on the limited copies scheme(LCS),we propose an energy balance scheme(EBS),the results show that EBS can improve the network survival time.

A Utility-Based Buffer Management Policy for Improving Data Dissemination in Opportunistic Networks

In opportunistic networks, most existing buffer management policies including scheduling and passive dropping policies are mainly for routing protocols. In this paper, we proposed a Utility-based Buffer Management strategy(UBM) for data dissemination in opportunistic networks. In UBM, we first design a method of computing the utility values of caching messages according to the interest of nodes and the delivery probability of messages, and then propose an overall buffer management policy based on the utility. UBM driven by receivers completely implements not only caching policies, passive and proactive dropping policies, but also scheduling policies of senders. Simulation results show that, compared with some classical dropping strategies, UBM can obtain higher delivery ratio and lower delay latency by using smaller network cost.

Risk Assessment of Marine Environments Along the South China Sea and North Indian Ocean on the Basis of a Weighted Bayesian Network

Marine environments have a considerable influence on the construction of the Chinese 21st Century Maritime Silk Road.Thus,an objective and quantitative risk assessment of marine environments has become a key problem that must be solved urgently.To deal with the uncertainty in marine environmental risks caused by complex factors and fuzzy mechanisms,a new assessment technique based on a weighted Bayesian network(BN)is proposed.Through risk factor analysis,node selection,structure construc-tion,and parameter learning,we apply the proposed weighted BN-based assessment model for the risk assessment and zonation of marine environments along the Maritime Silk Road.Results show that the model effectively fuses multisource and uncertain envi-ronmental information and provides reasonable risk assessment results,thereby offering technical support for risk prevention and disaster mitigation along the Maritime Silk Road.

POWER CONTROL BASED COOPERATIVE OPPORTUNISTIC ROUTING IN WIRELESS SENSOR NETWORKS

This paper proposes an approach called PC-CORP (Power Control based Cooperative Opportunistic Routing Protocol) for WSN (Wireless Sensor Networks), providing robustness to the random variations in network connectivity while ensuring better data forwarding efficiency in an energy efficient manner. Based on the realistic radio model, we combine the region-based routing, rendezvous scheme, sleep discipline and cooperative communication together to model data forwarding by cross layer design in WSN. At the same time, a lightweight transmission power control algorithm called PC-AIMD (Power Control Additive Increase Multiplicative Decrease) is introduced to utilize the co- operation of relay nodes to improve the forwarding efficiency performance and increase the robustness of the routing protocol. In the simulation, the performance of PC-COPR is investigated in terms of the adaptation of variations in network connectivity and satisfying the QoS requirements of application.

Study on Robust H_∞ Filtering in Networked Environments

This paper is concerned with the robust H ∞ filter problem for networked environments, which are subject to both transmission delay and packet dropouts randomly. By employing random series which have Bernoulli distributions taking value of 0 or 1, the data transmission model is obtained. Based on state augmentation and stochastic theory, the sufficient condition for robust stability with H ∞ constraints is derived for the filtering error system. The robust filter is designed in terms of feasibility of one certain linear matrix inequality （LMI）, which is formed by adopting matrix congruence transformations. A numerical example is given to show the effectiveness of the proposed filtering method.

A Trust Management Scheme Based on Behavior Feedback for Opportunistic Networks

In the harsh environment where n ode density is sparse, the slow-moving nodes cannot effectively utilize the encountering opportunities to realize the self-organized identity authentications, and do not have the chance to join the network routing. However, considering m ost of the communications in opportunistic networks are caused by forwarding operations, there is no need to establish the complete mutual authentications for each conversation. Accordingly, a novel trust management scheme is presented based on the information of behavior feedback, in order to complement the insufficiency of identity authentications. By utilizing the certificate chains based on social attributes, the mobile nodes build the local certificate graphs gradually to realize the web of "Identity Trust" relationship. Meanwhile, the successors generate Verified Feedback Packets for each positive behavior, and consequently the "Behavior Trust" relationship is formed for slow-moving nodes. Simulation result shows that, by implementing our trust scheme, the d elivery probability and trust reconstruction ratio can be effectively improved when there are large numbers of compromised nodes, and it means that our trust management scheme can efficiently explore and filter the trust nodes for secure forwarding in opportunistic networks.

A Predictive 6G Network with Environment Sensing Enhancement:From Radio Wave Propagation Perspective

In order to support the future digital society,sixth generation(6G)network faces the challenge to work efficiently and flexibly in a wider range of scenarios.The traditional way of system design is to sequentially get the electromagnetic wave propagation model of typical scenarios firstly and then do the network design by simulation offline,which obviously leads to a 6G network lacking of adaptation to dynamic environments.Recently,with the aid of sensing enhancement,more environment information can be obtained.Based on this,from radio wave propagation perspective,we propose a predictive 6G network with environment sensing enhancement,the electromagnetic wave propagation characteristics prediction enabled network(EWave Net),to further release the potential of 6G.To this end,a prediction plane is created to sense,predict and utilize the physical environment information in EWave Net to realize the electromagnetic wave propagation characteristics prediction timely.A two-level closed feedback workflow is also designed to enhance the sensing and prediction ability for EWave Net.Several promising application cases of EWave Net are analyzed and the open issues to achieve this goal are addressed finally.

Trusted Routing Based on Identity-Based Threshold Signature for Opportunistic Networks

In opportunistic Networks,compromised nodes can attack social context-based routing protocols by publishing false social attributes information.To solve this problem,we propose a security scheme based on the identity-based threshold signature which allows mobile nodes to jointly generate and distribute the secrets for social attributes in a totally self-organized way without the need of any centralized authority.New joining nodes can reconstruct their own social attribute signatures by getting enough partial signature services from encounter opportunities with the initial nodes.Mobile nodes need to testify whether the neighbors can provide valid attribute signatures for their routing advertisements in order to resist potential routing attacks.Simulation results show that:by implementing our security scheme,the network delivery probability of the social context-based routing protocol can be effectively improved when there are large numbers of compromised nodes in opportunistic networks.

SUNDER:Self-organized grouping and entrapping method for swarms in multitarget environments

For swarm robots moving in a harsh or uncharted outdoor environment without GPS guidance and global communication,algorithms that rely on global-based information are infeasible.Typically,traditional gene regulatory networks(GRNs)that achieve superior performance in forming trapping pattern towards targets require accurate global positional information to guide swarm robots.This article presents a gene regulatory network with Self-organized grouping and entrapping method for swarms(SUNDER-GRN)to achieve adequate trapping performance with a large-scale swarm in a confined multitarget environment with access to only local information.A hierarchical self-organized grouping method(HSG)is proposed to structure subswarms in a distributed way.In addition,a modified distributed controller,with a relative coordinate system that is established to relieve the need for global information,is leveraged to facilitate subswarms entrapment toward different targets,thus improving the global multi-target entrapping performance.The results demonstrate the superiority of SUNDERGRN in the performance of structuring subswarms and entrapping 10 targets with 200 robots in an environment confined by obstacles and with only local information accessible.

Opportunistic Routing with Multi-Channel Cooperative Neighbour Discovery

Due to the scattered nature of the network,data transmission in a dis-tributed Mobile Ad-hoc Network(MANET)consumes more energy resources(ER)than in a centralized network,resulting in a shorter network lifespan(NL).As a result,we build an Enhanced Opportunistic Routing(EORP)protocol architecture in order to address the issues raised before.This proposed routing protocol goal is to manage the routing cost by employing power,load,and delay to manage the routing energy consumption based on theflooding of control pack-ets from the target node.According to the goal of the proposed protocol techni-que,it is possible to manage the routing cost by applying power,load,and delay.The proposed technique also manage the routing energy consumption based on theflooding of control packets from the destination node in order to reduce the routing cost.Control packet exchange between the target and all the nodes,on the other hand,is capable of having an influence on the overall efficiency of the system.The EORP protocol and the Multi-channel Cooperative Neighbour Discovery(MCCND)protocol have been designed to detect the cooperative adja-cent nodes for each node in the routing route as part of the routing path discovery process,which occurs during control packet transmission.While control packet transmission is taking place during the routing path discovery process,the EORP protocol and the Multi-channel Cooperative Neighbour Discovery(MCCND)protocol have been designed to detect the cooperative adjacent nodes for each node in the routing.Also included is a simulation of these protocols in order to evaluate their performance across a wide range of packet speeds using Constant Bit Rate(CBR).When the packet rate of the CBR is 20 packets per second,the results reveal that the EORP-MCCND is 0.6 s quicker than the state-of-the-art protocols,according to thefindings.Assuming that the CBR packet rate is 20 packets per second,the EORP-MCCND achieves 0.6 s of End 2 End Delay,0.05 s of Routing Overhead Delay,120 s of Network Lifetime,and 20 J of Energy Consumption efficiency,which is much better than that of the state-of-the-art protocols.

Reducing energy consumption optimization selection of path transmission routing algorithm in opportunistic networks

Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy consumption optimal selection of path transmission(OSPT) routing algorithm in opportunistic networks.This algorithm designs a dynamic random network topology,creates a dynamic link,and realizes an optimized selected path.This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks.According to the simulation experiment,OSPT improves deliver ratio,and reduces energy consumption,cache time and transmission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks.

Developing Environment of Hierarchical and Distributed Real-Time Fire-Control Network

This paper introduces a hierarchical real-time environment for developing ship-bornefire-control system. Advanced computer networks are used to simulate the system with the requiredengagement scenario, including own-ship and parameters, and data processing and transmission,mission calculation, graphical supervision and gunnery ballistics outputting. The simulation systemis able to receive instruction from, or send information to the command-control center. Furthermore,the system can also be used to compare various designed schemes and analyze the accuracy andeffectiveness of the system.

High Delivery Performance Opportunistic Routing Scheme for Delay Tolerant Networks

In Delay Tolerant Networks (DTNs), establishing routing path from a source node to a destination node may not be possible, so the opportunistic routings are widely used. The energy and buffer constraints are general in DTNs composed of the mobile phones or Pads. This paper proposes a novel opportunistic routing protocol, denoted by Large Opporturioty (LAOP), for the energy and buffer constrained DTNs. The objective of LAOP is to reach many receivers of a message with a small number of transmissions. By LAOP, the sender floods a message when the number of its neighbors is not less than a threshold. We compare the delivery performance of LAOP with other four widely used Delay or Disruption Tolerant Network (DTN) routing protocols, Direct Delivery, Epidemic routing, SprayAndWait and PRoPHET and demonstrate that LAOP can improve the delivery performance and decrease the delivery latency simultaneously.

Reclaiming the Efficiency of Opportunistic Routing in Wireless Multi-Hop Networks

Opportunistic routing(OR) is an effective way to guarantee transmission reliability in wireless multi-hop networks.However,little research focuses on transmission efficiency.Thus,an analytical model based on open queuing network with Markov chains was proposed to evaluate the efficiency.By analyzing two typical ORs,we find duplicate transmission and collision avoidance overhead are the root reasons behind inefficiency.Therefore,a new scheme called dual priority cooperative opportunistic routing(DPCOR) was proposed.In DPCOR,forwarding candidates are configured with dual priority,which enables the network to classify forwarding candidates more effectively so as to reduce the back-off time and obtain more diversity gain.Theoretical analysis and simulation results show DPCOR achieves significant performance improvement with less time overhead compared with traditional routings and typical ORs.