Problem of Standardization of Configuration Data in Wireless Sensor Networks: The Case of Routing Protocols

The exploitation of Wireless Sensor Networks (WSN) is constrained by limited power, low computing power and storage and short-range radio transmission. Many routing protocols respecting these constraints were developed but, it still lacks formal and standardized solutions being able to help in their configuration. The configuration management that responds to this concern is very important in this type of network. It consists of the definition of data models to configure and is very necessary for the good network performance. Tangible results were obtained in traditional networks with the emergence of NETCONF and YANG standards, but on the best of our humble knowledge there are none yet in WSNs. We propose in this paper wsn-routing-protocol, a YANG data model for routing protocols configuration in WSNs. Following our model, we propose two YANG configuration data models based on the latter: they are respectively aodv for AODV and rpl for RPL.

Network Configuration Entity Extraction Method Based on Transformer with Multi-Head Attention Mechanism

Nowadays,ensuring thequality of networkserviceshas become increasingly vital.Experts are turning toknowledge graph technology,with a significant emphasis on entity extraction in the identification of device configurations.This research paper presents a novel entity extraction method that leverages a combination of active learning and attention mechanisms.Initially,an improved active learning approach is employed to select the most valuable unlabeled samples,which are subsequently submitted for expert labeling.This approach successfully addresses the problems of isolated points and sample redundancy within the network configuration sample set.Then the labeled samples are utilized to train the model for network configuration entity extraction.Furthermore,the multi-head self-attention of the transformer model is enhanced by introducing the Adaptive Weighting method based on the Laplace mixture distribution.This enhancement enables the transformer model to dynamically adapt its focus to words in various positions,displaying exceptional adaptability to abnormal data and further elevating the accuracy of the proposed model.Through comparisons with Random Sampling(RANDOM),Maximum Normalized Log-Probability(MNLP),Least Confidence(LC),Token Entrop(TE),and Entropy Query by Bagging(EQB),the proposed method,Entropy Query by Bagging and Maximum Influence Active Learning(EQBMIAL),achieves comparable performance with only 40% of the samples on both datasets,while other algorithms require 50% of the samples.Furthermore,the entity extraction algorithm with the Adaptive Weighted Multi-head Attention mechanism(AW-MHA)is compared with BILSTM-CRF,Mutil_Attention-Bilstm-Crf,Deep_Neural_Model_NER and BERT_Transformer,achieving precision rates of 75.98% and 98.32% on the two datasets,respectively.Statistical tests demonstrate the statistical significance and effectiveness of the proposed algorithms in this paper.

Falcon Optimization Algorithm-Based Energy Efficient Communication Protocol for Cluster-Based Vehicular Networks

Rapid development in Information Technology(IT)has allowed several novel application regions like large outdoor vehicular networks for Vehicle-to-Vehicle(V2V)transmission.Vehicular networks give a safe and more effective driving experience by presenting time-sensitive and location-aware data.The communication occurs directly between V2V and Base Station(BS)units such as the Road Side Unit(RSU),named as a Vehicle to Infrastructure(V2I).However,the frequent topology alterations in VANETs generate several problems with data transmission as the vehicle velocity differs with time.Therefore,the scheme of an effectual routing protocol for reliable and stable communications is significant.Current research demonstrates that clustering is an intelligent method for effectual routing in a mobile environment.Therefore,this article presents a Falcon Optimization Algorithm-based Energy Efficient Communication Protocol for Cluster-based Routing(FOA-EECPCR)technique in VANETS.The FOA-EECPCR technique intends to group the vehicles and determine the shortest route in the VANET.To accomplish this,the FOA-EECPCR technique initially clusters the vehicles using FOA with fitness functions comprising energy,distance,and trust level.For the routing process,the Sparrow Search Algorithm(SSA)is derived with a fitness function that encompasses two variables,namely,energy and distance.A series of experiments have been conducted to exhibit the enhanced performance of the FOA-EECPCR method.The experimental outcomes demonstrate the enhanced performance of the FOA-EECPCR approach over other current methods.

A Multi-Token Sector Antenna Neighbor Discovery Protocol for Directional Ad Hoc Networks

In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.

Priority Based Energy Efficient MAC Protocol by Varying Data Ratefor Wireless Body Area Network

Wireless Body Area Network(WBAN)is a cutting-edge technology that is being used in healthcare applications to monitor critical events in the human body.WBAN is a collection of in-body and on-body sensors that monitor human physical parameters such as temperature,blood pressure,pulse rate,oxygen level,body motion,and so on.They sense the data and communicate it to the Body Area Network(BAN)Coordinator.The main challenge for the WBAN is energy consumption.These issues can be addressed by implementing an effective Medium Access Control(MAC)protocol that reduces energy consumption and increases network lifetime.The purpose of the study is to minimize the energy consumption and minimize the delay using IEEE 802.15.4 standard.In our proposed work,if any critical events have occurred the proposed work is to classify and prioritize the data.We gave priority to the highly critical data to get the Guarantee Tine Slots(GTS)in IEEE 802.15.4 standard superframe to achieve greater energy efficiency.The proposed MAC provides higher data rates for critical data based on the history and current condition and also provides the best reliable service to high critical data and critical data by predicting node similarity.As an outcome,we proposed a MAC protocol for Variable Data Rates(MVDR).When compared to existing MAC protocols,the MVDR performed very well with low energy intake,less interruption,and an enhanced packet-sharing ratio.

Fast Verification of Network Configuration Updates

With the expansion of network services,large-scale networks have progressively become common.The network status changes rapidly in response to customer needs and configuration changes,so network configuration changes are also very frequent.However,no matter what changes,the network must ensure the correct conditions,such as isolating tenants from each other or guaranteeing essential services.Once changes occur,it is necessary to verify the after-changed network.Whereas,for the verification of large-scale network configuration changes,many current verifiers show poor efficiency.In order to solve the problem ofmultiple global verifications caused by frequent updates of local configurations in large networks,we present a fast configuration updates verification tool,FastCUV,for distributed control planes.FastCUV aims to enhance the efficiency of distributed control plane verification for medium and large networks while ensuring correctness.This paper presents a method to determine the network range affected by the configuration change.We present a flow model and graph structure to facilitate the design of verification algorithms and speed up verification.Our scheme verifies the network area affected by obtaining the change of the Forwarding Information Base(FIB)before and after.FastCUV supports rich network attributes,meanwhile,has high efficiency and correctness performance.After experimental verification and result analysis,our method outperforms the state-of-the-art method to a certain extent.

Configuration Synthesis and Lightweight Networking of Deployable Mechanism Based on a Novel Pyramid Module

Deployable mechanism with preferable deployable performance,strong expansibility,and lightweight has attracted much attention because of their potential in aerospace.A basic deployable pyramid unit with good deployability and expandability is proposed to construct a sizeable deployable mechanism.Firstly,the basic unit folding principle and expansion method is proposed.The configuration synthesis method of adding constraint chains of spatial closed-loop mechanism is used to synthesize the basic unit.Then,the degree of freedom of the basic unit is analyzed using the screw theory and the link dismantling method.Next,the three-dimensional models of the pyramid unit,expansion unit,and array unit are established,and the folding motion simulation analysis is carried out.Based on the number of components,weight reduction rate,and deployable rate,the performance characteristics of the three types of mechanisms are described in detail.Finally,prototypes of the pyramid unit,combination unit,and expansion unit are developed to verify further the correctness of the configuration synthesis based on the pyramid.The proposed deployable mechanism provides aference for the design and application of antennas with a large aperture,high deployable rate,and lightweight.It has a good application prospect in the aerospace field.

PSAP-WSN:A Provably Secure Authentication Protocol for 5G-Based Wireless Sensor Networks

Nowadays,the widespread application of 5G has promoted rapid development in different areas,particularly in the Internet of Things(IoT),where 5G provides the advantages of higher data transfer rate,lower latency,and widespread connections.Wireless sensor networks(WSNs),which comprise various sensors,are crucial components of IoT.The main functions of WSN include providing users with real-time monitoring information,deploying regional information collection,and synchronizing with the Internet.Security in WSNs is becoming increasingly essential because of the across-the-board nature of wireless technology in many fields.Recently,Yu et al.proposed a user authentication protocol forWSN.However,their design is vulnerable to sensor capture and temporary information disclosure attacks.Thus,in this study,an improved protocol called PSAP-WSNis proposed.The security of PSAP-WSN is demonstrated by employing the ROR model,BAN logic,and ProVerif tool for the analysis.The experimental evaluation shows that our design is more efficient and suitable forWSN environments.

Dynamic channel estimation-aware routing protocol in mobile cognitive radio networks for smart IIoT applications

Cognitive Radio Networks(CRNs)have become a successful platform in recent years for a diverse range of future systems,in particularly,industrial internet of things(IIoT)applications.In order to provide an efficient connection among IIoT devices,CRNs enhance spectrum utilization by using licensed spectrum.However,the routing protocol in these networks is considered one of the main problems due to node mobility and time-variant channel selection.Specifically,the channel selection for routing protocol is indispensable in CRNs to provide an adequate adaptation to the Primary User(PU)activity and create a robust routing path.This study aims to construct a robust routing path by minimizing PU interference and routing delay to maximize throughput within the IIoT domain.Thus,a generic routing framework from a cross-layer perspective is investigated that intends to share the information resources by exploiting a recently proposed method,namely,Channel Availability Probability.Moreover,a novel cross-layer-oriented routing protocol is proposed by using a time-variant channel estimation technique.This protocol combines lower layer(Physical layer and Data Link layer)sensing that is derived from the channel estimation model.Also,it periodically updates and stores the routing table for optimal route decision-making.Moreover,in order to achieve higher throughput and lower delay,a new routing metric is presented.To evaluate the performance of the proposed protocol,network simulations have been conducted and also compared to the widely used routing protocols,as a benchmark.The simulation results of different routing scenarios demonstrate that our proposed solution outperforms the existing protocols in terms of the standard network performance metrics involving packet delivery ratio(with an improved margin of around 5–20%approximately)under varying numbers of PUs and cognitive users in Mobile Cognitive Radio Networks(MCRNs).Moreover,the cross-layer routing protocol successfully achieves high routing performance in finding a robust route,selecting the high channel stability,and reducing the probability of PU interference for continued communication.

Fast and scalable routing protocols for data center networks

Data center networks may comprise tens or hundreds of thousands of nodes,and,naturally,suffer from frequent software and hardware failures as well as link congestions.Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays.In such dynamic networks,links frequently fail or get congested,making the recalculation of the shortest paths a computationally intensive problem.Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed.Surprisingly,the design of fast shortest-path algorithms for data centers was largely neglected,though they are universal components of routing protocols.Moreover,parallelization techniques were mostly deployed for random network topologies,and not for regular topologies that are often found in data centers.The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware.We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.

Energy-Efficient Routing Protocol with Multi-Hop Fuzzy Logic for Wireless Networks

A Wireless Sensor Network(WSN)becomes a newer type of real-time embedded device that can be utilized for a wide range of applications that make regular networking which appears impracticable.Concerning the energy produc-tion of the nodes,WSN has major issues that may influence the stability of the system.As a result,constructing WSN requires devising protocols and standards that make the most use of constrained capacity,especially the energy resources.WSN faces some issues with increased power utilization and an on going devel-opment due to the uneven energy usage between the nodes.Clustering has proven to be a more effective strategy in this series.In the proposed work,a hybrid meth-od is used for reducing the energy consumption among CHs.A Fuzzy Logic-based clustering protocol FLUC(unequally clustered)and Fuzzy Clustering with Energy-Efficient Routing Protocol(FCERP)are used.A Fuzzy Clustering with Energy Efficient Routing Protocol(FCERP)reduces the WSN power usage and increases the lifespan of the network.FCERP has created a novel cluster-based fuzzy routing mechanism that uses a limit value to combine the clustering and multi-hop routing capabilities.The technique creates uneven groups by using fuz-zy logic with a competitive range to choose the Cluster Head(CH).The input variables include the distance of the nodes from the ground station,concentra-tions,and remaining energy.The proposed FLUC-FCERP reduces the power usage and improves the lifetime of the network compared with the existing algorithms.

Grid Side Distributed Energy Storage Cloud Group End Region Hierarchical Time-Sharing Configuration Algorithm Based onMulti-Scale and Multi Feature Convolution Neural Network

There is instability in the distributed energy storage cloud group end region on the power grid side.In order to avoid large-scale fluctuating charging and discharging in the power grid environment and make the capacitor components showa continuous and stable charging and discharging state,a hierarchical time-sharing configuration algorithm of distributed energy storage cloud group end region on the power grid side based on multi-scale and multi feature convolution neural network is proposed.Firstly,a voltage stability analysis model based onmulti-scale and multi feature convolution neural network is constructed,and the multi-scale and multi feature convolution neural network is optimized based on Self-OrganizingMaps(SOM)algorithm to analyze the voltage stability of the cloud group end region of distributed energy storage on the grid side under the framework of credibility.According to the optimal scheduling objectives and network size,the distributed robust optimal configuration control model is solved under the framework of coordinated optimal scheduling at multiple time scales;Finally,the time series characteristics of regional power grid load and distributed generation are analyzed.According to the regional hierarchical time-sharing configuration model of“cloud”,“group”and“end”layer,the grid side distributed energy storage cloud group end regional hierarchical time-sharing configuration algorithm is realized.The experimental results show that after applying this algorithm,the best grid side distributed energy storage configuration scheme can be determined,and the stability of grid side distributed energy storage cloud group end region layered timesharing configuration can be improved.

A Contention-Based MAC and Routing Protocol for Wireless Sensor Network

Advance development of wireless technologies and micro-sensor systems have enabled Wireless Sensor Network (WSN) to emerge as a leading solution in many crucial sensor-based applications. WSN deploys numerous resource-constrained sensor nodes which have limited power supply, memory and computation capability in a harsh environment. Inefficient routing strategy results in degraded network performance in terms of reliability, latency and energy efficiency. In this paper, a cross-layer design, Contention-based MAC and Routing protocol is proposed, termed Contention/SNIR-Based Forwarding (CSBF) protocol. CSBF utilizes the geographical information of sensor nodes to effectively guide the routing direction towards destination node, thereby enhancing reliability. Furthermore, Signal-to-Noise-plus-Interference Ratio (SNIR) metric is used as a routing parameter to guarantee high quality link for data transmission. A Contention-Winner Relay scheme is utilized to reduce the delays caused by the contention procedure. Energy efficiency is also improved by introducing sleep mode technique in CSBF. The simulation work is carried out via OMNeT++ network simulator. The performance of CSBF is compared with other existing routing protocols such as AODV and DSDV in terms of packet delivery ratio (PDR), average end-to-end (ETE) delay and energy consumption per packet. Simulation results highlight that CSBF outperforms AODV and DSDV protocols in respect of PDR and energy efficiency. CSBF also has the most consistent overall network performance.

LOA-RPL:Novel Energy-Efficient Routing Protocol for the Internet of Things Using Lion Optimization Algorithm to Maximize Network Lifetime

Energy conservation is a significant task in the Internet of Things(IoT)because IoT involves highly resource-constrained devices.Clustering is an effective technique for saving energy by reducing duplicate data.In a clustering protocol,the selection of a cluster head(CH)plays a key role in prolonging the lifetime of a network.However,most cluster-based protocols,including routing protocols for low-power and lossy networks(RPLs),have used fuzzy logic and probabilistic approaches to select the CH node.Consequently,early battery depletion is produced near the sink.To overcome this issue,a lion optimization algorithm(LOA)for selecting CH in RPL is proposed in this study.LOA-RPL comprises three processes:cluster formation,CH selection,and route establishment.A cluster is formed using the Euclidean distance.CH selection is performed using LOA.Route establishment is implemented using residual energy information.An extensive simulation is conducted in the network simulator ns-3 on various parameters,such as network lifetime,power consumption,packet delivery ratio(PDR),and throughput.The performance of LOA-RPL is also compared with those of RPL,fuzzy rule-based energyefficient clustering and immune-inspired routing(FEEC-IIR),and the routing scheme for IoT that uses shuffled frog-leaping optimization algorithm(RISARPL).The performance evaluation metrics used in this study are network lifetime,power consumption,PDR,and throughput.The proposed LOARPL increases network lifetime by 20%and PDR by 5%–10%compared with RPL,FEEC-IIR,and RISA-RPL.LOA-RPL is also highly energy-efficient compared with other similar routing protocols.

Self-organization of Reconfigurable Protocol Stack for Networked Control Systems

In networked control systems （NCS）,the control performance depends on not only the control algorithm but also the communication protocol stack.The performance degradation introduced by the heterogeneous and dynamic communication environment has intensified the need for the reconfigurable protocol stack.In this paper,a novel architecture for the reconfigurable protocol stack is proposed,which is a unified specification of the protocol components and service interfaces supporting both static and dynamic reconfiguration for existing industrial communication standards.Within the architecture,a triple-level self-organization structure is designed to manage the dynamic reconfiguration procedure based on information exchanges inside and outside the protocol stack.Especially,the protocol stack can be self-adaptive to various environment and system requirements through the reconfiguration of working mode,routing and scheduling table.Finally,the study on the protocol of dynamic address management is conducted for the system of controller area network （CAN）.The results show the efficiency of our self-organizing architecture for the implementation of a reconfigurable protocol stack.

Performance Evaluation of an Internet Protocol Security (IPSec) Based Multiprotocol Label Switching (MPLS) Virtual Private Network

This paper evaluates the performance of Internet Protocol Security (IPSec) based Multiprotocol Label Switching (MPLS) virtual private network (VPN) in a small to medium sized organization. The demand for security in data networks has been increasing owing to the high cyber attacks and potential risks associated with networks spread over distant geographical locations. The MPLS networks ride on the public network backbone that is porous and highly susceptible to attacks and so the need for reliable security mechanisms to be part of the deployment plan. The evaluation criteria concentrated on Voice over Internet Protocol (VoIP) and Video conferencing with keen interest in jitter, end to end delivery and general data flow. This study used both structured questionnaire and observation methods. The structured questionnaire was administered to a group of 70 VPN users in a company. This provided the study with precise responses. The observation method was used in data simulations using OPNET Version 14.5 Simulation software. The results show that the IPSec features increase the size of data packets by approximately 9.98% translating into approximately 90.02% effectiveness. The tests showed that the performance metrics are all well within the recommended standards. The IPSec Based MPLS Virtual private network is more stable and secure than one without IPSec.

Mathematical Model Validation of Search Protocols in MP2P Networks

Broadcasting is a basic technique in Mobile ad-hoc network(MANET),and it refers to sending a packet from one node to every other node within the transmission range.Flooding is a type of broadcast where the received packet is retransmitted once by every node.The naive flooding technique,floods the network with query messages,while the random walk technique operates by contacting the subsets of every node’s neighbors at each step,thereby restricting the search space.One of the key challenges in an ad-hoc network is the resource or content discovery problem which is about locating the queried resource.Many earlier works have mainly focused on the simulation-based analysis of flooding,and its variants under a wired network.Although,there have been some empirical studies in peer-to-peer(P2P)networks,the analytical results are still lacking,especially in the context of P2P systems running over MANET.In this paper,we describe how P2P resource discovery protocols perform badly over MANETs.To address the limitations,we propose a new protocol named ABRW(Address Broadcast Random Walk),which is a lightweight search approach,designed considering the underlay topology aimed to better suit the unstructured architecture.We provide the mathematical model,measuring the performance of our proposed search scheme with different widely popular benchmarked search techniques.Further,we also derive three relevant search performance metrics,i.e.,mean no.of steps needed to find a resource,the probability of finding a resource,and the mean no.of message overhead.We validated the analytical expressions through simulations.The simulation results closely matched with our analyticalmodel,justifying our findings.Our proposed search algorithm under such highly dynamic self-evolving networks performed better,as it reduced the search latency,decreased the overall message overhead,and still equally had a good success rate.

A Dynamic Resource-Aware Routing Protocol in Resource-Constrained Opportunistic Networks

Recently,Opportunistic Networks(OppNets)are considered to be one of the most attractive developments of Mobile Ad Hoc Networks that have arisen thanks to the development of intelligent devices.OppNets are characterized by a rough and dynamic topology as well as unpredictable contacts and contact times.Data is forwarded and stored in intermediate nodes until the next opportunity occurs.Therefore,achieving a high delivery ratio in OppNets is a challenging issue.It is imperative that any routing protocol use network resources,as far as they are available,in order to achieve higher network performance.In this article,we introduce the Resource-Aware Routing(ReAR)protocol which dynamically controls the buffer usage with the aim of balancing the load in resource-constrained,stateless and non-social OppNets.The ReAR protocol invokes our recently introduced mutual informationbased weighting approach to estimate the impact of the buffer size on the network performance and ultimately to regulate the buffer consumption in real time.The proposed routing protocol is proofed conceptually and simulated using the Opportunistic Network Environment simulator.Experiments show that the ReAR protocol outperforms a set of well-known routing protocols such as EBR,Epidemic MaxProp,energy-aware Spray and Wait and energy-aware PRoPHETin terms of message delivery ratio and overhead ratio.

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years,with the rapid development of the Internet and wireless communication technology,wireless Ad hoc networks have received more attention.Due to the limited transmission range and energy of nodes in Ad hoc networks,it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks.This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol,which has the following two aspects of improvement:(1)In the route discovery process,a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a“Mark”bit that representing remaining energy of a node.(2)Based on(1),a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively.Simulation results demonstrate that compared with AODV and other existing routing protocols,proposed algorithm can reduce network energy consumption and balance node energy,thus extending the network lifetime.

Network Evaluation and Protocol Deployment for Complex Deep-Space Networks Based on DTN

Previous research on deep-space networks based on delay-tolerant networking(DTN)has mainly focused on the performance of DTN protocols in simple networks;hence,research on complex networks is lacking.In this paper,we focus on network evaluation and protocol deployment for complex DTNbased deep-space networks and apply the results to a novel complex deep-space network based on the Universal Interplanetary Communication Network(UNICON-CDSN)proposed by the National Space Science Center(NSSC)for simulation and verification.A network evaluation method based on network capacity and memory analysis is proposed.Based on a performance comparison between the Licklider Transmission Protocol(LTP)and the Transmission Control Protocol(TCP)with the Bundle Protocol(BP)in various communication scenarios,a transport protocol configuration proposal is developed and used to construct an LTP deployment scheme for UNICON-CDSN.For the LTP deployment scheme,a theoretical model of file delivery time over complex deep-space networks is built.A network evaluation with the method proposed in this paper proves that UNICONCDSN satisfies the requirements for the 2020 Mars exploration mission Curiosity.Moreover,simulation results from a universal space communication network testbed(USCNT)designed by us show that the LTP deployment scheme is suitable for UNICON-CDSN.