A fixed clustering protocol based on random relay strategy for EHWSN

In Energy Harvesting Wireless Sensor Networks(EHWSN),the communication protocol will directly affect the final performance of the network,so it is necessary to study the communication protocol based on EHWSN.In this paper,for the low-cost fixed clustering problem,a fixed clustering protocol RRCEH is based on random relaying.Our proposed RRCEH abandons the inefficient inter-cluster communication method of the traditional fixed clustering protocol.To coordinate the data upload of the cluster head,RRCEH allocates different random relay vectors to each ring area of the network,and combines all the random relay vectors into a random relay matrix of RRCEH.In each communication round,the cluster head node randomly selects its relay target node to send data according to the probability distribution in the random relay vector in the area.For two different cluster head configuration scenarios,by optimizing the random relay matrix,RRCEH can effectively reduce the network's configuration requirements for cluster head energy harvesting capability,thus reducing the deployment cost of EHWSN.

MADCR:Mobility Aware Dynamic Clustering-Based Routing Protocol in Internet of Vehicles

Internet of Vehicles(IoV)is an evolution of the Internet of Things(IoT)to improve the capabilities of vehicular ad-hoc networks(VANETs)in intelligence transport systems.The network topology in IoV paradigm is highly dynamic.Clustering is one of the promising solutions to maintain the route stability in the dynamic network.However,existing algorithms consume a considerable amount of time in the cluster head(CH)selection process.Thus,this study proposes a mobility aware dynamic clustering-based routing(MADCR)protocol in IoV to maximize the lifespan of networks and reduce the end-to-end delay of vehicles.The MADCR protocol consists of cluster formation and CH selection processes.A cluster is formed on the basis of Euclidean distance.The CH is then chosen using the mayfly optimization algorithm(MOA).The CH subsequently receives vehicle data and forwards such data to the Road Side Unit(RSU).The performance of the MADCR protocol is compared with that ofAnt Colony Optimization(ACO),Comprehensive Learning Particle Swarm Optimization(CLPSO),and Clustering Algorithm for Internet of Vehicles based on Dragonfly Optimizer(CAVDO).The proposed MADCR protocol decreases the end-toend delay by 5–80 ms and increases the packet delivery ratio by 5%–15%.

Energy-balanced unequal clustering protocol for wireless sensor networks

Clustering provides an effective way to prolong the lifetime of wireless sensor networks. One of the major issues of a clustering protocol is selecting an optimal group of sensor nodes as the cluster heads to divide the network. Another is the mode of inter-cluster communication. In this paper, an energy-balanced unequal clustering （EBUC） protocol is proposed and evaluated. By using the particle swarm optimization （PSO） algorithm, EBUC partitions all nodes into clusters of unequal size, in which the clusters closer to the base station have smaller size. The cluster heads of these clusters can preserve some more energy for the inter-cluster relay traffic and the ＇hot-spots＇ problem can be avoided. For inter-cluster communication, EBUC adopts an energy-aware multihop routing to reduce the energy consumption of the cluster heads. Simulation results demonstrate that the protocol can efficiently decrease the dead speed of the nodes and prolong the network lifetime.

Unsupervised Binary Protocol Clustering Based on Maximum Sequential Patterns

With the rapid development of the Internet,a large number of private protocols emerge on the network.However,some of them are constructed by attackers to avoid being analyzed,posing a threat to computer network security.The blockchain uses the P2P protocol to implement various functions across the network.Furthermore,the P2P protocol format of blockchain may differ from the standard format specification,which leads to sniffing tools such as Wireshark and Fiddler not being able to recognize them.Therefore,the ability to distinguish different types of unknown network protocols is vital for network security.In this paper,we propose an unsupervised clustering algorithm based on maximum frequent sequences for binary protocols,which can distinguish various unknown protocols to provide support for analyzing unknown protocol formats.We mine the maximum frequent sequences of protocolmessage sets in bytes.Andwe calculate the fuzzymembership of the protocolmessage to each maximum frequent sequence,which is based on fuzzy set theory.Then we construct the fuzzy membership vector for each protocol message.Finally,we adopt K-means++to split different types of protocol messages into several clusters and evaluate the performance by calculating homogeneity,integrity,and Fowlkes and Mallows Index(FMI).Besides,the clustering algorithms based onNeedleman–Wunsch and the fixed-length prefix are compared with the algorithm presented in this paper.Compared with these traditional clustering methods,we demonstrate a certain improvement in the clustering performance of our work.

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.

EACR-LEACH:Energy-Aware Cluster-based Routing Protocol for WSN Based IoT

Internet of Things(IoT)is a recent paradigm to improve human lifestyle.Nowadays,number devices are connected to the Internet drastically.Thus,the people can control and monitor the physical things in real-time without delay.The IoT plays a vital role in all kind of fields in our world such as agriculture,livestock,transport,and healthcare,grid system,connected home,elderly people carrying system,cypher physical system,retail,and intelligent systems.In IoT energy conservation is a challenging task,as the devices are made up of low-cost and low-power sensing devices and local processing.IoT networks have significant challenges in two areas:network lifespan and energy usage.Therefore,the clustering is a right choice to prolong the energy in the network.In LEACH clustering protocol,sometimes the same node acts as CH again and again probabilistically.To overcome these issues,this paper proposes the Energy-Aware Cluster-based Routing(EACRLEACH)protocol in WSN based IoT.The Cluster Head(CH)selection is a crucial task in clustering protocol inWSN based IoT.In EACR-LEACH,the CH is selected by using the routing metrics,Residual Energy(RER),Number of Neighbors(NoN),Distance between Sensor Node and Sink(Distance)and Number of Time Node Act as CH(NTNACH).An extensive simulation is conducted on MATLAB 2019a.The accomplishment of EACR-LEACH is compared to LEACH and SE-LEACH.The proposed EACR-LEACH protocol extends the network’s lifetime by 4%-8%and boosts throughput by 16%–24%.

A NEW PRIVACY-PRESERVING EUCLID-DISTANCE PROTOCOL AND ITS APPLICATIONS IN WSNS

Recently, privacy concerns become an increasingly critical issue. Secure multi-party computation plays an important role in privacy-preserving. Secure multi-party computational geometry is a new field of secure multi-party computation. In this paper, we devote to investigating the solutions to some secure geometric problems in a cooperative environment. The problem is collaboratively computing the Euclid-distance between two private vectors without disclosing the private input to each other. A general privacy-preserving Euclid-distance protocol is firstly presented as a building block and is proved to be secure and efficient in the comparison with the previous methods. And we proposed a new protocol for the application in Wireless Sensor Networks (WSNs), based on the novel Euclid-distance protocol and Density-Based Clustering Protocol (DBCP), so that the nodes from two sides can compute cooperatively to divide them into clusters without disclosing their location information to the opposite side.

Energy-Efficient Routing Algorithm Based on Small-World Characteristics

Water quality sensor networks are widely used in water resource monitoring.However,due to the fact that the energy of these networks cannot be supplemented in time,it is necessary to study effective routing protocols to extend their lifecycle.To address the problem of limited resources,a routing optimization algorithm based on a small-world network model is proposed.In this paper,a small-world network model is introduced for water quality sensor networks,in which the short average path and large clustering coefficient of the model are used to construct a super link.A short average path can reduce the network’s energy consumption,and a large coefficient can improve its fault-tolerance ability.However,the energy consumption of the relay nodes near the heterogeneous node is too great,and as such the energy threshold and non-uniform clustering are constructed to improve the lifecycle of the network.Simulation results show that,compared with the low-energy adaptive clustering hierarchy routing algorithm and the best sink location clustering heterogeneous network routing algorithm,the proposed improved routing model can effectively enhance the energy-utilization.The lifecycle of the network can be extended and the data transmission amount can be greatly increased.