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.

Cluster DetectionMethod of Endogenous Security Abnormal Attack Behavior in Air Traffic Control Network

In order to enhance the accuracy of Air Traffic Control(ATC)cybersecurity attack detection,in this paper,a new clustering detection method is designed for air traffic control network security attacks.The feature set for ATC cybersecurity attacks is constructed by setting the feature states,adding recursive features,and determining the feature criticality.The expected information gain and entropy of the feature data are computed to determine the information gain of the feature data and reduce the interference of similar feature data.An autoencoder is introduced into the AI(artificial intelligence)algorithm to encode and decode the characteristics of ATC network security attack behavior to reduce the dimensionality of the ATC network security attack behavior data.Based on the above processing,an unsupervised learning algorithm for clustering detection of ATC network security attacks is designed.First,determine the distance between the clustering clusters of ATC network security attack behavior characteristics,calculate the clustering threshold,and construct the initial clustering center.Then,the new average value of all feature objects in each cluster is recalculated as the new cluster center.Second,it traverses all objects in a cluster of ATC network security attack behavior feature data.Finally,the cluster detection of ATC network security attack behavior is completed by the computation of objective functions.The experiment took three groups of experimental attack behavior data sets as the test object,and took the detection rate,false detection rate and recall rate as the test indicators,and selected three similar methods for comparative test.The experimental results show that the detection rate of this method is about 98%,the false positive rate is below 1%,and the recall rate is above 97%.Research shows that this method can improve the detection performance of security attacks in air traffic control network.

Hybrid Seagull and Whale Optimization Algorithm-Based Dynamic Clustering Protocol for Improving Network Longevity in Wireless Sensor Networks

Energy efficiency is the prime concern in Wireless Sensor Networks(WSNs) as maximized energy consumption without essentially limits the energy stability and network lifetime. Clustering is the significant approach essential for minimizing unnecessary transmission energy consumption with sustained network lifetime. This clustering process is identified as the Non-deterministic Polynomial(NP)-hard optimization problems which has the maximized probability of being solved through metaheuristic algorithms.This adoption of hybrid metaheuristic algorithm concentrates on the identification of the optimal or nearoptimal solutions which aids in better energy stability during Cluster Head(CH) selection. In this paper,Hybrid Seagull and Whale Optimization Algorithmbased Dynamic Clustering Protocol(HSWOA-DCP)is proposed with the exploitation benefits of WOA and exploration merits of SEOA to optimal CH selection for maintaining energy stability with prolonged network lifetime. This HSWOA-DCP adopted the modified version of SEagull Optimization Algorithm(SEOA) to handle the problem of premature convergence and computational accuracy which is maximally possible during CH selection. The inclusion of SEOA into WOA improved the global searching capability during the selection of CH and prevents worst fitness nodes from being selected as CH, since the spiral attacking behavior of SEOA is similar to the bubble-net characteristics of WOA. This CH selection integrates the spiral attacking principles of SEOA and contraction surrounding mechanism of WOA for improving computation accuracy to prevent frequent election process. It also included the strategy of levy flight strategy into SEOA for potentially avoiding premature convergence to attain better trade-off between the rate of exploration and exploitation in a more effective manner. The simulation results of the proposed HSWOADCP confirmed better network survivability rate, network residual energy and network overall throughput on par with the competitive CH selection schemes under different number of data transmission rounds.The statistical analysis of the proposed HSWOA-DCP scheme also confirmed its energy stability with respect to ANOVA test.

Structural Characteristics and Influencing Factors of Carbon Emission Spatial Association Network:A Case Study of Yangtze River Delta City Cluster,China

City cluster is an effective platform for encouraging regionally coordinated development.Coordinated reduction of carbon emissions within city cluster via the spatial association network between cities can help coordinate the regional carbon emission management,realize sustainable development,and assist China in achieving the carbon peaking and carbon neutrality goals.This paper applies the improved gravity model and social network analysis(SNA)to the study of spatial correlation of carbon emissions in city clusters and analyzes the structural characteristics of the spatial correlation network of carbon emissions in the Yangtze River Delta(YRD)city cluster in China and its influencing factors.The results demonstrate that:1)the spatial association of carbon emissions in the YRD city cluster exhibits a typical and complex multi-threaded network structure.The network association number and density show an upward trend,indicating closer spatial association between cities,but their values remain generally low.Meanwhile,the network hierarchy and network efficiency show a downward trend but remain high.2)The spatial association network of carbon emissions in the YRD city cluster shows an obvious‘core-edge’distribution pattern.The network is centered around Shanghai,Suzhou and Wuxi,all of which play the role of‘bridges’,while cities such as Zhoushan,Ma'anshan,Tongling and other cities characterized by the remote location,single transportation mode or lower economic level are positioned at the edge of the network.3)Geographic proximity,varying levels of economic development,different industrial structures,degrees of urbanization,levels of technological innovation,energy intensities and environmental regulation are important influencing factors on the spatial association of within the YRD city cluster.Finally,policy implications are provided from four aspects:government macro-control and market mechanism guidance,structural characteristics of the‘core-edge’network,reconfiguration and optimization of the spatial layout of the YRD city cluster,and the application of advanced technologies.

Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm-Based Clustering Scheme for Augmenting Network Lifetime in WSNs

In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending network lifetime,but most of them failed in handling the problem of fixed clustering,static rounds,and inadequate Cluster Head(CH)selection criteria which consumes more energy.In this paper,Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm(SRITL-AGOA)-based Clustering Scheme for energy stabilization and extending network lifespan.This SRITL-AGOA selected CH depending on the weightage of factors such as node mobility degree,neighbour's density distance to sink,single-hop or multihop communication and Residual Energy(RE)that directly influences the energy consumption of sensor nodes.In specific,Grasshopper Optimization Algorithm(GOA)is improved through tangent-based nonlinear strategy for enhancing the ability of global optimization.On the other hand,stochastic ranking and violation constraint handling strategies are embedded into Teaching-Learning-based Optimization Algorithm(TLOA)for improving its exploitation tendencies.Then,SR and VCH improved TLOA is embedded into the exploitation phase of AGOA for selecting better CH by maintaining better balance amid exploration and exploitation.Simulation results confirmed that the proposed SRITL-AGOA improved throughput by 21.86%,network stability by 18.94%,load balancing by 16.14%with minimized energy depletion by19.21%,compared to the competitive CH selection approaches.

A Convolutional Deep Neural Network Approach for miRNA Clustering

The regulatory role of the Micro-RNAs (miRNAs) in the messenger RNAs (mRNAs) gene expression is well understood by the biologists since some decades, even though the delving into specific aspects is in progress. Clustering is a cornerstone in bioinformatics research, offering a potent computational tool for analyzing diverse types of data encountered in genomics and related fields. MiRNA clustering plays a pivotal role in deciphering the intricate regulatory roles of miRNAs in biological systems. It uncovers novel biomarkers for disease diagnosis and prognosis and advances our understanding of gene regulatory networks and pathways implicated in health and disease, as well as drug discovery. Namely, we have implemented clustering procedure to find interrelations among miRNAs within clusters, and their relations to diseases. Deep clustering (DC) algorithms signify a departure from traditional clustering methods towards more sophisticated techniques, that can uncover intricate patterns and relationships within gene expression data. Deep learning (DL) models have shown remarkable success in various domains, and their application in genomics, especially for tasks like clustering, holding immense promise. The deep convolutional clustering procedure used is different from other traditional methods, demonstrating unbiased clustering results. In the paper, we implement the procedure on a Multiple Myeloma miRNA dataset publicly available on GEO platform, as a template of a cancer instance analysis, and hazard some biological issues.

Dynamic Vehicular Clustering Enhancing Video on Demand Services Over Vehicular Ad-hoc Networks

Nowadays,video streaming applications are becoming one of the tendencies driving vehicular network users.In this work,considering the unpredictable vehicle density,the unexpected acceleration or deceleration of the different vehicles included in the vehicular traffic load,and the limited radio range of the employed communication scheme,we introduce the“Dynamic Vehicular Clustering”(DVC)algorithm as a new scheme for video streaming systems over vehicular ad-hoc networks(VANET).The proposed algorithm takes advantage of the small cells concept and the introduction of wireless backhauls,inspired by the different features and the performance of the Long Term Evolution(LTE)-Advanced network.Vehicles are clustered together to form dynamically ad-hoc sub-networks included in the vehicular network.The goal of our clustering algorithm is to take into account several characteristics,such as the vehicle’s position and acceleration to reduce latency and packet loss.Therefore,each cluster is counted as a small cell containing vehicular nodes and an access point that is elected regarding some particular specifications.Based on the exceptional features of the LTE-Advanced network(small cells and wireless backhauls)the DVC algorithm is a promising scheme for video streaming services over VANET systems.Experiments were carried out with a virtual topology of the VANET network created with four clusters to implement the DVC algorithm.The results were compared with other algorithms such as Virtual Trust-ability Data transmission(VTD),Named Data Networking(NDN),and Socially Aware Security Message Forwarding(SASMF).Our algorithm can effectively improve the transmission rate of data packets at the expense of a slight increase in end-to-end delay and control overhead.

Study on Pests Forecasting Using the Method of Neural Network Based on Fuzzy Clustering

Aimed to the characters of pests forecast such as fuzziness, correlation, nonlinear and real-time as well as decline of generalization capacity of neural network in prediction with few observations, a method of pests forecasting using the method of neural network based on fuzzy clustering was proposed in this experiment. The simulation results demonstrated that the method was simple and practical and could forecast pests fast and accurately, particularly, the method could obtain good results with few samples and samples correlation.

Dynamic Event-Triggered Scheduling and Platooning Control Co-Design for Automated Vehicles Over Vehicular Ad-Hoc Networks

This paper deals with the co-design problem of event-triggered communication scheduling and platooning control over vehicular ad-hoc networks(VANETs)subject to finite communication resource.First,a unified model is presented to describe the coordinated platoon behavior of leader-follower vehicles in the simultaneous presence of unknown external disturbances and an unknown leader control input.Under such a platoon model,the central aim is to achieve robust platoon formation tracking with desired inter-vehicle spacing and same velocities and accelerations guided by the leader,while attaining improved communication efficiency.Toward this aim,a novel bandwidth-aware dynamic event-triggered scheduling mechanism is developed.One salient feature of the scheduling mechanism is that the threshold parameter in the triggering law is dynamically adjusted over time based on both vehicular state variations and bandwidth status.Then,a sufficient condition for platoon control system stability and performance analysis as well as a co-design criterion of the admissible event-triggered platooning control law and the desired scheduling mechanism are derived.Finally,simulation results are provided to substantiate the effectiveness and merits of the proposed co-design approach for guaranteeing a trade-off between robust platooning control performance and communication efficiency.

Clustering routing algorithm of wireless sensor networks based on Bayesian game

To avoid uneven energy consuming in wireless sen- sor networks, a clustering routing model is proposed based on a Bayesian game. In the model, Harsanyi transformation is introduced to convert a static game of incomplete information to the static game of complete but imperfect information. In addition, the existence of Bayesian nash equilibrium is proved. A clustering routing algorithm is also designed according to the proposed model, both cluster head distribution and residual energy are considered in the design of the algorithm. Simulation results show that the algorithm can balance network load, save energy and prolong network lifetime effectively.

A Clustering-tree Topology Control Based on the Energy Forecast for Heterogeneous Wireless Sensor Networks

How to design an energy-efficient algorithm to maximize the network lifetime in complicated scenarios is a critical problem for heterogeneous wireless sensor networks (HWSN). In this paper, a clustering-tree topology control algorithm based on the energy forecast (CTEF) is proposed for saving energy and ensuring network load balancing, while considering the link quality, packet loss rate, etc. In CTEF, the average energy of the network is accurately predicted per round (the lifetime of the network is denoted by rounds) in terms of the difference between the ideal and actual average residual energy using central limit theorem and normal distribution mechanism, simultaneously. On this basis, cluster heads are selected by cost function (including the energy, link quality and packet loss rate) and their distance. The non-cluster heads are determined to join the cluster through the energy, distance and link quality. Furthermore, several non-cluster heads in each cluster are chosen as the relay nodes for transmitting data through multi-hop communication to decrease the load of each cluster-head and prolong the lifetime of the network. The simulation results show the efficiency of CTEF. Compared with low-energy adaptive clustering hierarchy (LEACH), energy dissipation forecast and clustering management (EDFCM) and efficient and dynamic clustering scheme (EDCS) protocols, CTEF has longer network lifetime and receives more data packets at base station. © 2014 Chinese Association of Automation.

Relationships and Evolving Networks of Rural Manufacturing Clusters: A Case Study in Yucheng County, Henan Province of China

The evolution of networks in rural industrial clusters,in particular in the context of China has been paid more attention to in the world.Applying the theory and techniques of social network analysis (SNA),this study is with particular regard to the business network relationships and their evolutionary dynamics of steel measuring tape manufacturing clustered in Nanzhuang Village,Yucheng County of Henan Province,China,which is important for better understanding the industrial and regional development in less developed rural areas.From data collected by comprehensive questionnaire survey in 2002 and mass interviews with 60 enterprises and assembling families and several government authorities in 2002,2003,2004,2005 and 2008,four types of networks are identified: spin-off,consulting,communication and cooperative.The characteristic of these networks is outlined in detail.Compared with the high-tech clusters of typical developed areas,the networks that have evolved in traditional manufacturing clusters are more affected by emotive linkages.The cluster networks are shown to exhibit a polycentric hierarchical structure.The family relationships are the dominate spin-off channels of enterprises,while the supply and demand relationships and the mobility of the skilled workers are also important paths of network learning,and the cooperation relationships are comparatively stable.Besides the root enterprises,the middle-sized enterprises are comparatively more active than small-sized enterprises,and the intermediary agencies and the service institutions act as bridges of the inter-enterprises cooperation.By analysis of the structure of networks and the interactions between the networks,the four stages of network evolution are also identified.The four stages are dominated by the family networks,the internal division production networks,the local innovation networks and the global supply networks respectively,and they play different roles in cluster development.

Improved Clustering and Resource Allocation for Ultra-Dense Networks

To reduce the interference among small cells of Ultra-Dense Networks(UDN),an improved Clustering-Assisted Resource Allocation(CARA)scheme is proposed in this paper.The proposed scheme is divided into three steps.First,an Interference-Limited Clustering Algorithm(ILCA)based on interference graph corresponding to the interference relationship between Femtocell Base Stations(FBSs),is proposed to group FBSs into disjoint clusters,in which a pre-threshold is set to constrain the sum of interference in each cluster,and a Cluster Head(CH)is selected for each cluster.Then,CH performs a twostage sub-channel allocation within its associated cluster,where the first stage assigns one sub-channel to each user of the cluster and the second stage assigns a second sub-channel to some users.Finally,a power allocation method is designed to maximize throughput for a given clustering and sub-channel configuration.Simulation results indicate that the proposed scheme distributes FBSs into each cluster more evenly,and significantly improves the system throughput compared with the existing schemes in the same scenario.

Quality of Service Improvement with Optimal Software-Defined Networking Controller and Control Plane Clustering

The controller is indispensable in software-defined networking(SDN).With several features,controllers monitor the network and respond promptly to dynamic changes.Their performance affects the quality-of-service(QoS)in SDN.Every controller supports a set of features.However,the support of the features may be more prominent in one controller.Moreover,a single controller leads to performance,single-point-of-failure(SPOF),and scalability problems.To overcome this,a controller with an optimum feature set must be available for SDN.Furthermore,a cluster of optimum feature set controllers will overcome an SPOF and improve the QoS in SDN.Herein,leveraging an analytical network process(ANP),we rank SDN controllers regarding their supporting features and create a hierarchical control plane based cluster(HCPC)of the highly ranked controller computed using the ANP,evaluating their performance for the OS3E topology.The results demonstrated in Mininet reveal that a HCPC environment with an optimum controller achieves an improved QoS.Moreover,the experimental results validated in Mininet show that our proposed approach surpasses the existing distributed controller clustering(DCC)schemes in terms of several performance metrics i.e.,delay,jitter,throughput,load balancing,scalability and CPU(central processing unit)utilization.

Method of neural network modulation recognition based on clustering and Polak-Ribiere algorithm

To improve the recognition rate of signal modulation recognition methods based on the clustering algorithm under the low SNR, a modulation recognition method is proposed. The characteristic parameter of the signal is extracted by using a clustering algorithm, the neural network is trained by using the algorithm of variable gradient correction （Polak-Ribiere） so as to enhance the rate of convergence, improve the performance of recognition under the low SNR and realize modulation recognition of the signal based on the modulation system of the constellation diagram. Simulation results show that the recognition rate based on this algorithm is enhanced over 30% compared with the methods that adopt clustering algorithm or neural network based on the back propagation algorithm alone under the low SNR. The recognition rate can reach 90% when the SNR is 4 dB, and the method is easy to be achieved so that it has a broad application prospect in the modulating recognition.

A routing algorithm based on clusters and balanced use of energy for wireless sensor networks

In a sensor network, data collected by different sensors are often correlated because they are observations of related phenomena. Efficient sensor data fusion is one of the most important issues in building real sensor networks. To balance energy cost, how to select a cluster head is a key problem that must be addressed. In this paper, we use a compression-centric data collection algorithm for use in wireless sensor networks. Also, we propose a balanced cluster head selection algorithm in each cluster. Simulation results are used to investigate the performance of the algorithm. Compared to the exhaustive search solutions, the proposed algorithm shows a significant improvement in power consumption.

Survey of Clustering Schemes in Mobile Ad hoc Networks

Mobile ad-hoc networks (MANETs) are a specific kind of wireless networks that can be quickly deployed without pre- existing infrastructures. They are used in different contexts such as collaborative, medical, military or embedded applications. However, MANETs raise new challenges when they are used in large scale network that contain a large number of nodes. Subsequently, many clustering algorithms have emerged. In fact, these clustering algorithms allow the structuring of the network into groups of entities called clusters creating a hierarchical structure. Each cluster contains a particular node called cluster head elected as cluster head according to a specific metric or a combination of metrics such as identity, degree, mobility, weight, density, etc. MANETs has drawbacks due to both the characteristics of the transmission medium (transmission medium sharing, low bandwidth, etc.) and the routing protocols (information diffusion, path finding, etc.). Clustering in mobile ad hoc networks plays a vital role in improving resource management and network performance (routing delay, bandwidth consumption and throughput). In this paper, we present a study and analyze of some existing clustering approaches for MANETs that recently appeared in literature, which we classify as: Identifier Neighbor based clustering, Topology based clustering, Mobility based clustering, Energy based clustering, and Weight based clustering. We also include clustering definition, review existing clustering approaches, evaluate their performance and cost, discuss their advantages, disadvantages, features and suggest a best clustering approach.

An Asynchronous Clustering and Mobile Data Gathering Schema Based on Timer Mechanism in Wireless Sensor Networks

Recently,Wireless sensor networks(WSNs)have become very popular research topics which are applied to many applications.They provide pervasive computing services and techniques in various potential applications for the Internet of Things(IoT).An Asynchronous Clustering and Mobile Data Gathering based on Timer Mechanism(ACMDGTM)algorithm is proposed which would mitigate the problem of“hot spots”among sensors to enhance the lifetime of networks.The clustering process takes sensors’location and residual energy into consideration to elect suitable cluster heads.Furthermore,one mobile sink node is employed to access cluster heads in accordance with the data overflow time and moving time from cluster heads to itself.Related experimental results display that the presented method can avoid long distance communicate between sensor nodes.Furthermore,this algorithm reduces energy consumption effectively and improves package delivery rate.

Quantitative Survivability Analysis Using Probability Model Checking: A Study of Cluster-Based Vehicle Networks with Dual Cluster Heads

As an important part of future 5G wireless networks,a vehicular network demands safety,reliability and connectivity.In this context,networking survivability is usually considered an important metric to evaluate network performance.In this paper,we propose a survivability model for vehicle communication networking based on dual cluster heads,wherein a backup cluster head(CH)will be activated if the primary CH fails,thereby effectively enhancing the network lifetime.Additionally,we introduce a software rejuvenation strategy for the prime CH to further improve the survivability of the entire network.Using the Probabilistic Symbolic Model Checker(PRISM),we verify and discuss the proposed survivability model via numerical simulations.The results show that network survivability can be effectively improved by introducing an additional CH and further enhanced by adopting the software rejuvenation technique.

Energy efficient clustering algorithm based on neighbors for wireless sensor networks

In this paper, an energy efficient clustering algorithm based on neighbors （EECABN） for wireless sensor networks is proposed. In the algorithm, an optimized weight of nodes is introduced to determine the priority of clustering procedure. As improvement, the weight is a measurement of energy and degree as usual, and even associates with distance from neighbors, distance to the sink node, and other factors. To prevent the low energy nodes being exhausted with energy, the strong nodes should have more opportunities to act as cluster heads during the clustering procedure. The simulation results show that the algorithm can effectively prolong whole the network lifetime. Especially at the early stage that some nodes in the network begin to die, the process can be postponed by using the algorithm.