A Low Energy Uneven Cluster Protocol Design for Wireless Sensor Network

A low energy uneven cluster protocol design method is proposed. Aiming at the random choosing for cluster head of traditional Leach protocol, and the defect of the single hop from all the cluster heads to the sink node, an improved method for Leave protocol is advanced. Firstly, the election model of cluster head is improved, and the node residual energy is considered in the process of threshold and the cluster head election to improve the whole network life circle. In the multi-hop route, choosing the maximum energy and the nearest node as the next hop and a route transferring data among many clusters is formed. The experiment shows the method having great improvement compared with Leach protocol and prolonging the network life cycle.

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%.

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.

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%.

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.

A clustered routing protocol based on energy and link quality in WSNs

Influenced by the environment and nodes status,the quality of link is not always stable in actual wireless sensor networks( WSNs). Poor links result in retransmissions and more energy consumption. So link quality is an important issue in the design of routing protocol which is not considered in most traditional clustered routing protocols. A based on energy and link quality's routing protocol( EQRP) is proposed to optimize the clustering mechanism which takes into account energy balance and link quality factors. EQRP takes the advantage of high quality links to increase success rate of single communication and reduce the cost of communication. Simulation shows that,compared with traditional clustered protocol,EQRP can perform 40% better,in terms of life cycle of the whole network.

Mean Territorial Energy Based Clustering Protocol for Randomly Deployed Wireless Sensor Networks

Clustering algorithms can balance the power consumption of energy constraint wireless sensor networks. This paper proposes a new clustering protocol called Mean Territorial Energy Based Clustering Protocol (MTEP) for randomly deployed wireless sensor networks. In MTEP, cluster heads are selected according to residual energy and location information of a node in current round as well as mean territorial energy and total base station distance of node’s corresponding cluster territory in previous round. Energy consumption in conventional protocols becomes unbalanced because of clusters having different lengths. Proposed MTEP protocol addresses this problem by setting thresholds on cluster length and node to cluster head distance for producing equal length clusters. Simulation results show that MTEP protocol extends network lifetime and stability with reduction in energy dissipation compared to other clustering protocols such as LEACH and REAC.

Two-Tier Hierarchical Cluster Based Topology in Wireless Sensor Networks for Contention Based Protocol Suite

The 802.15.4 Wireless Sensor Networks (WSN) becomes more economical, feasible and sustainable for new generation communication environment, however their limited resource constraints such as limited power capacity make them difficult to detect and defend themselves against variety of attacks. The radio interference attacks that generate for WSN at the Physical Layer cannot be defeated through conventional security mechanisms proposed for 802.15.4 standards. The first section introduces the deployment model of two-tier hierarchical cluster topology architecture and investigates different jamming techniques proposed for WSN by creating specific classification of different types of jamming attacks. The following sections expose the mitigation techniques and possible built-in mechanisms to mitigate the link layer jamming attacks on proposed two-tier hierarchical clustered WSN topology. The two-tier hierarchical cluster based topology is investigated based on contention based protocol suite through OPNET simulation scenarios.

Mathematical Model with Energy and Clustering Energy Based Routing Protocols as Remediation to the Directional Source Aware Routing Protocol in Wireless Sensor Networks

In this paper, a routing protocol for wireless sensor network, baptized energy based protocol (EBP) is proposed. Wireless sensor network presents many challenges and constraints, and one of the major constraints is the routing problem. Due to the limited energy of sensor nodes, routing in this type of network shall perform efficiently to maximize the network lifetime. One of the proposed algorithms is the directional source aware routing protocol (DSAP) which, after simulation, showed a lot of limitations and drawbacks. The modified directional source aware routing protocol (MDSAP) was proposed by the authors of this paper to address some of the DSAP’s limitations but remains limited to a fixed topology, fixed source and stationary nodes. So EBP is proposed and operated under different scenarios and showed, after its simulation using TinyOS, many advantages in terms of load balancing, free looping, minimizing packet error rate and maximizing network lifetime.

ZigBee网络路由协议SS-Cluster的设计实现

为了解决AODVjr等协议在节点数不多的ZigBee网络中存在资源开销高、效率低以及ZigBee网络在小范围应用场合缺乏相应协议支持的问题,提出并设计了SS-Cluster(small-scale cluster)路由协议。基于树形ZigBee网络拓扑,结合"分簇设计思想",通过引入全新设计的两种簇类邻居表和路由缓冲表为SS-Cluster提供数据结构支持,设计了不同于其它路由协议的运行机制并详细阐述了实现算法。通过与两个典型路由协议LEACH和AODVjr在Omnet++平台上的仿真综合比较,比较结果验证了该协议的性能。

SSL在Web Cluster中的应用研究与实现

该文深入探讨了各种Web集群架构中部署SSL的解决方案,并详细论述了各解决方案的工作原理、实现技术及其优缺点。针对具体的集群架构,提出了SSLhandoff协议和实现会话重用机制的方案。最后,结合mod_ssl开放源代码给出一个SSL在分布式Layer7型WebCluster中的具体实现。实验证明,该解决方案是可行的、高效的。

Dynamic Cluster Head for Lifetime Efficiency in WSN

Saving energy and increasing network lifetime are significant challenges in wireless sensor networks （WSNs）. In this paper, we propose a mechanism to distribute the responsibility of cluster-heads among the wireless sensor nodes in the same cluster based on the ZigBee standard, which is the latest WSN standard. ZigBee supports ad hoc on-demand vector （AODV） and cluster-tree routing protocols in its routing layer. However, none of these protocols considers the energy level of the nodes in the network establishing process or in the data routing process. The cluster-tree routing protocol supports single or multi-cluster networks. However, each single cluster in the multi-cluster network has only one node acting as a cluster head. These cluster-heads are fixed in each cluster during the network lifetime. Consequently, using these cluster-heads will cause them to die quickly, and the entire linked nodes to these cluster-heads will be disconnected from the main network. Therefore, the proposed technique to distribute the role of the cluster head among the wireless sensor nodes in the same cluster is vital to increase the lifetime of the network. Our proposed technique is better in terms of performance than the original structure of these protocols. It has increased the lifetime of the wireless sensor nodes, and increased the lifetime of the WSN by around 50% of the original network lifetime.

A Novel Energy Aware Clustering Technique for Routing in Wireless Sensor Networks

Cluster-based architectures are one of the most practical solutions in order to cope with the requirements of large-scale wireless sensor networks (WSN). Cluster-head election problem is one of the basic QoS requirements of WSNs, yet this problem has not been sufficiently explored in the context of cluster-based sensor networks. Specifically, it is not known how to select the best candidates for the cluster head roles. In this paper, we investigate the cluster head election problem, specifically concentrating on applications where the energy of full network is the main requirement, and we propose a new approach to exploit efficiently the network energy, by reducing the energy consumed for cluster forming.

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.

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.

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.

Design of an Energy - saving Routing Protocol in Wireless Sensor Networks

This paper takes energy-saving into consideration, bases on typical clustering routing protocol,combines with the optimal cluster-head selection formula,the improved threshold formula and cluster radios formulas to choose cluster-heads, applying the proportionality principle to the forming stage of cluster to make the distribution of cluster more even and reasonable; during the stable stage of cluster,the member nodes in cluster use TDMA to communicate with the cluster-head node, and cluster-head nodes communicate with base station BS via multi-hop interrupt communication manner.

Light-Weight Simple Network Management Protocol in Wireless Sensor Networks

A Light-Weight Simple Network Management Protocol (LW-SNMP) for the wireless sensor network is proposed, which is a kind of hierarchical network management system including a sink manager, cluster proxies, and node agents. Considering the resource limitations on the sensor nodes, we design new management messages, new data types and new management information base completely. The management messages between the cluster proxy and node agents are delivered as normal data packets. The experiment results show that LW-SNMP can meet the management demands in the resource-limited wireless sensor networks and has a good performance in stability, effectiveness of memory, extensibility than the traditional Simple Network Management Protocol (SNMP).

面向智能电网广域通信的可靠路由算法研究

无线传感器网络是智能电网广域通信中的基础组成单元,传统的无线传感器网络分簇路由协议虽能在一定程度上简化网络拓扑,但仍存在簇首选择不合理且系统能耗较高的问题。针对此,文中基于粒子群优化算法提出了一种改进的分簇路由协议。该协议利用粒子群算法的参数寻优特性对簇首搜寻方案加以改进,使得新方案考虑了距离、剩余能量、数据传输精度等多种因素。同时还使用粒子群自适应函数对该方案进行优化,从而提高了原算法的可靠性。在能耗实验测试中,所提算法迭代1 300次后的剩余能耗为31.2 J,在对比算法中为最优。而对路由路径的测试中,改进算法的平均运行时延为1.79 ms,平均误码率为0.212 5,在所有算法中均为最低,证明了该算法具有良好的实时性和可靠性。

A Load Balance Clustering Routing Algorism Based on SOM

In order to solve the uneven node load in the tradition clustering routing protocols, a new clustering algorism based on SOM is proposed. Firstly, the network radio model and the energy consumption model are defined. A new algorism using SOM to form the cluster and select the cluster head is defined. In the clustering node remain energy and the Euclidean distance from cluster head to the cluster member are considered. The experiment shows our method has the longer life cycle and less total energy consumption. It is an effective clustering protocol.