Hierarchical Protocol Research Articles

The principal component analysis of the ring deformation in the nonadiabatic surface hopping dynamics.

The analysis of the leading active molecular motions in the on-the-fly trajectory surface hopping simulation provides the essential information to understand the geometric evolution in nonadiabatic dynamics. When the ring deformation is involved, the identification of the key active coordinates becomes challenging. A "hierarchical" protocol based on the dimensionality reduction and clustering approaches is proposed for the automatic analysis of the ring deformation in the nonadiabatic molecular dynamics. The representative system keto isocytosine is taken as the prototype to illustrate this protocol. The results indicate that the current hierarchical analysis protocol is a powerful way to clearly clarify both the major and minor active molecular motions of the ring distortion in nonadiabatic dynamics.

Performance analysis of multicast routing using multi agent zone based mechanism in MANET

Mobile Ad-Hoc Network (MANET) is a structure less and emerging technology in recent years. Generally, this structure forms a network with nodes with inherent characteristics, including resource heterogeneity, node reliability, etc. In this manuscript, we proposed a Multi-Agent-Based Zone Routing (MAZR) protocol for enhancing the performance of MANET. Our proposed MAZR is works based on the principle of packet forwarding through intermediate and zone leaders. It consists of multiple agents, which include static and dynamic mobile agents. The proposed implementation is done as follows: Initially discovering the zone leader’s .The discovered zone leaders are connected to the communication nodes. The communication nodes and zone leaders are associated for building the network backbones for achieving multicast routing .To the multicast, zone members are connected .The zone managements, backbone and highly mobile nodes are initiated. The proposed MAZR protocol comprises five types of agents: Path agent, Network control agent, Multicast control agent, Network launch agent, and Multicast control agents. The Path agent, Network control agent, and Multicast control agent are static, and Network launch agents and Multicast control agents are mobile. The future protocol's performance is determined using the experimental work based on the evaluation metrics like delay, power consumption, and network lifetime. The obtained results prove the future MAZR is far improved than the Zone-based Hierarchical Link Protocol and Zone Routing Protocol in all aspects and ensures flexibility with versatile multicast service.

An Intelligent Vice Cluster Head Election Protocol in WSN

Wireless sensor networks (WSNs) has a practical ability to link a set of sensors to build a wireless network that can be accessed remotely; this technology has become increasingly popular in recent years. Wi-Fi-enabled sensor networks (WSNs) are used to gather information from the environment in which the network operates. Many obstacles prevent wireless sensor networks from being used in a wide range of fields. This includes maintaining network stability and extending network life. In a wireless network, sensors are the most essential component. Sensors are powered by a battery that has a finite amount of power. The battery is prone to power loss, and the sensor is therefore rendered inoperative as a result. In addition, the growing number of sensor nodes off-site affects the network's stability. The transmission and reception of information between the sensors and the base consumes the most energy in the sensor. An Intelligent Vice Cluster Head Selection Protocol is proposed in this study (IVC LEACH). In order to achieve the best performance with the least amount of energy consumption, the proposed hierarchical protocol relies on a fuzzy logic algorithm using four parameters to calculate the value of each node in the network and divides them into three hierarchical levels based on their value. This improves network efficiency and reliability while extending network life by 50 percent more than the original Low Energy Adaptive Clustering Hierarchy protocol. Keywords: Wireless Sensor Networks, Sensors, Communication Protocol, Fuzzy logic, Leach protocol.

Hierarchical Clustering for Paired Watershed Experiments: Case Study in Southeastern Arizona, U.S.A.

Watershed studies are often onerous due to a lack of data available to portray baseline conditions with which to compare results of monitoring environmental effects. A paired-watershed approach is often adopted to simulate baseline conditions in an adjacent watershed that can be comparable but assumes there is a quantifiable relationship between the control and treated watersheds. Finding suitably matched pairs that can most accurately depict similar responses is challenging and attributes are rarely quantified. In southeastern Arizona, United States, researchers are investigating the effectiveness of watershed restoration techniques employed by land managers. We selected Smith Canyon to develop a rigorous and quantitatively defensible paired-watershed experimental design. The Smith Canyon watershed consists of 91 structurally similar sub-basins that have a defined basin-like structure and flow channel, allowing for consideration as replicate units. We developed a statistical approach to group sub-basins based on similar structural, biophysical, and hydrologic traits. Our geospatial database consisted of 35 environmental variables, which we reduced to 12 through a correlation analysis. We identified three primary collections of paired sub-basins within the larger watershed. These clusters are being used to inform studies actively being employed in the watershed. Overall, we propose a hierarchical clustering protocol for justification of watershed pairing experiments.

A Hierarchical Hybrid Locking Protocol for Parallel Real-Time Tasks

Parallel tasks have been paid growing attention in recent years, and the scheduling with shared resources is of significant importance to real-time systems. As an efficient mechanism to provide mutual exclusion for parallel processing, spin-locks are ubiquitous in multi-processor real-time systems. However, the spin-locks suffer the scalability problem, and the intra-task parallelism further exacerbates the analytical pessimism. To overcome such deficiencies, we propose a Hierarchical Hybrid Locking Protocol (H2LP) under federated scheduling. The proposed H2LP integrates the classical Multiprocessor Stack Resource Policy (MSRP) and uses a token mechanism to reduce global contentions. We provide a complete analysis framework supporting both heavy and light tasks under federated scheduling and develop a blocking analysis with the state-of-the-art linear optimization technique. Empirical evaluations showed that the H2LP outperformed the other state-of-the-art locking protocols in at least configurations when considering exclusive clustering. Furthermore, our partitioned approach for light tasks can substantially improve schedulability by mitigating the over-provisioning problem.

A Novel Hybrid Cache Coherence with Global Snooping for Many-core Architectures

Cache coherence ensures correctness of cached data in multi-core processors. Traditional implementations of existing protocols make them unscalable for many core architectures. While snoopy coherence requires unscalable ordered networks, directory coherence is weighed down by high area and energy overheads. In this work, we propose Wireless-enabled Share-aware Hybrid (WiSH) to provide scalable coherence in many core processors. WiSH implements a novel Snoopy over Directory protocol using on-chip wireless links and hierarchical, clustered Network-on-Chip to achieve low-overhead and highly efficient coherence. A local directory protocol maintains coherence within a cluster of cores, while coherence among such clusters is achieved through global snoopy protocol. The ordered network for global snooping is provided through low-latency and low-energy broadcast wireless links. The overheads are further reduced through share-aware cache segmentation to eliminate coherence for private blocks. Evaluations show that WiSH reduces traffic by and runtime by , while requiring smaller storage and lower energy as compared to existing hierarchical and hybrid coherence protocols. Owing to its modularity, WiSH provides highly efficient and scalable coherence for many core processors.

Performance evaluation of hierarchical clustering protocols with fuzzy C-means

The longevity of the network and the lack of resources are the main problems within the WSN. Minimizing energy dissipation and optimizing the lifespan of the WSN network are real challenges in the design of WSN routing protocols. Load balanced clustering increases the reliability of the system and enhances coordination between different nodes within the network. WSN is one of the main technologies dedicated to the detection, sensing, and monitoring of physical phenomena of the environment. For illustration, detection, and measurement of vibration, pressure, temperature, and sound. The WSN can be integrated into many domains, like street parking systems, smart roads, and industrial. This paper examines the efficiency of our two proposed clustering algorithms: Fuzzy C-means based hierarchical routing approach for homogeneous WSN (F-LEACH) and fuzzy distributed energy efficient clustering algorithm (F-DEEC) through a detailed comparison of WSN performance parameters such as the instability and stability duration, lifetime of the network, number of cluster heads per round and the number of alive nodes. The fuzzy C-means based on hierarchical routing approach is based on fuzzy C-means and low-energy adaptive clustering hierarchy (LEACH) protocol. The fuzzy distributed energy efficient clustering algorithm is based on fuzzy C-means and design of a distributed energy efficient clustering (DEEC) protocol. The technical capability of each protocol is measured according to the studied parameters.

Enhanced Auxiliary Cluster Head Selection Routing Algorithm in Wireless Sensor Networks

Background & Objective: Wireless sensor networks are made up of a huge amount of less powered small sensor nodes that can audit the surroundings, collect meaningful data, and send it to the base station. Various energy management plans that pursue to lengthen the endurance of overall network have been proposed over the years, but energy conservation remains the major challenge as the sensor nodes have finite battery and low computational capabilities. Cluster based routing is the most fitting system to help in burden adjusting, adaptation to internal failure, and solid correspondence to draw out execution parameters of wireless sensor network. Low energy adaptive clustering hierarchy is an efficient clustering based hierarchical protocol that is used to enhance the lifetime of sensor nodes in wireless sensor network. It has some basic flaws that need to be overwhelmed in order to reduce the energy utilization and inflating the nodes lifetime. Methods: In this paper, an effective auxiliary cluster head selection is used to propose a new enhanced GC-LEACH algorithm in order to minimize the energy utilization and prolong the lifespan of wireless sensor network. Results & Conclusion: Simulation is performed in NS-2 and the outcomes show that the GCLEACH outperforms conventional LEACH and its existing versions in the context of frequent cluster head rotation in various rounds, number of data packets collected at base station, as well as reduces the energy consumption 14% - 19% and prolongs the system lifetime 8% - 15%.

A Novel Static Cluster-Based Hierarchical Protocol for Wireless Sensor Networks

Wireless sensor networks have recently gained a lot of attention from the scientific community due to their very wide spectrum of applications. In such networks, the sensor nodes have limited resources. These constraints impose many challenges to the design of related protocols. Especially, routing protocols should be energy-efficient for the prolonged network lifetime. The LEACH protocol is the most popular energy-efficient hierarchical clustering protocol for WSNs that was proposed for reducing power consumption. However, LEACH suffers from several drawbacks such as the non uniform distribution of Cluster Head nodes, the possibility of choosing a low energy node as Cluster Head, etc. In this paper, an attempt is made to overcome this shortcoming by introducing a new hierarchical clustering protocol, called SCHP (Static Cluster-based Hierarchical Protocol). The SCHP protocol is based on a static cluster creation and an optimal cluster head selection. Simulation results show that the proposal guarantees better performance than the LEACH Protocol that is considered as the baseline in the literature. We used many metrics, as packet loss rate, end-to-end delay, and energy consumption to evaluate the efficiency of our proposal. We show also that the SCHP protocol can improve the network lifetime.

Enhancement of Clustering Techniques Efficiency for WSN using LEACH Algorithm

The Low Energy Adaptive Hierarchy is perhaps the most popular hierarchical protocol (LEACH). LEACH is a hierarchical structure that implements the creation of a disseminated cluster; nodes select themselves as the head node with any probability at any point in it. In view of the fact that a wireless node may only be configured with a restricted power supply, energy consumption is considered to be the key design target. In many implementations, it is not feasible to substitute energy sources, and therefore the life cycle of the node shows a heavy dependency on the battery life. With the aim of leveraging the network life cycle by applying clustering designs, several algorithms have been published. The paper presents numerous routing protocol definitions to save resources and prolong the existence of the sensor network. WSN applications, such as communication architectures, security and management, still have several problems to be resolved. We will close the distance between technology and implementation by addressing these problems.

A Hierarchical Multicast Key Distribution Protocol

In secure group communication, group keys (GK) are used to ensure the confidentiality of communication. The group key distribution (GKD) is responsible for updating and distributing new group keys when the group membership changes. Most well-known GKD protocols are based on a logical key hierarchy (LKH), where only one group controller (GC) is used. These protocols have various issues, including a single point of failure, meaning that the GC often has a huge workload and can be easily overwhelmed. In this paper, we propose a hierarchical multicast key distribution protocol that supports multi-level controllers to manage a group. Each controller just needs to manage the next-level nodes, and if one fails, the superior controller can replace it with minimal work. The proposed protocol effectively balances the work of controllers, greatly improves the reliability of the group key distribution, and also allows group members to build dynamic conferences without controllers. We provide a security proof of the proposed protocol in a symbolic security model and compare it to other protocols in terms of efficiency, functionality, and security.

Discovery of potent Covid-19 main protease inhibitors using integrated drug-repurposing strategy.

The emergence and rapid spreading of novel SARS‐CoV‐2 across the globe represent an imminent threat to public health. Novel antiviral therapies are urgently needed to overcome this pandemic. Given the significant role of the main protease of Covid‐19 for virus replication, we performed a drug‐repurposing study using the recently deposited main protease structure, 6LU7. For instance, pharmacophore‐ and e‐pharmacophore‐based hypotheses such as AARRH and AARR, respectively, were developed using available small molecule inhibitors and utilized in the screening of the DrugBank repository. Further, a hierarchical docking protocol was implemented with the support of the Glide algorithm. The resultant compounds were then examined for their binding free energy against the main protease of Covid‐19 by means of the Prime‐MM/GBSA algorithm. Most importantly, the machine learning‐based AutoQSAR algorithm was used to predict the antiviral activities of resultant compounds. The hit molecules were also examined for their drug‐likeness and toxicity parameters through the QikProp algorithm. Finally, the hit compounds activity against the main protease was validated using molecular dynamics simulation studies. Overall, the present analysis yielded two potential inhibitors (DB02986 and DB08573) that are predicted to bind with the main protease of Covid‐19 better than currently used drug molecules such as N3 (cocrystallized native ligand), lopinavir, and ritonavir.

Computational Intelligence based Clustering Algorithms for Wireless Sensor Networks: Trends and Possible Solutions

A wireless sensor network (WSN) is a state-of-the-art technology for radio communication. A WSN includes several sensors that are arbitrarily distributed in a particular region to detect and track physical characteristics that are hard for humans to observe, like temperature, humidity, and pressure. Because of the nature of WSNs, many issues may arise, including information routing, power consumption, clustering, and cluster head (CH) selection. Although there are still some difficulties in the WSN, owing to its versatility and robustness, it has gained considerable attention among scientists and technologists despite the shortcomings. Various protocols were designed to solve these problems. Low energy adaptive clustering hierarchy (LEACH) is one of the significant hierarchical protocols used to reduce energy consumption in WSNs. This article provides an extensive analysis of LEACH-variant clustering protocols for WSNs. Recent research on Machine Learning, Computational Intelligence, and WSNs has highlighted the optimized WSN clustering algorithms. However, the selection of a suitable paradigm for a clustering solution continues an issue owing to the diversity of WSN applications. In this paper, a comprehensive review of suggested optimized clustering alternatives has been conducted and a comparison of these optimized clustering methods has been suggested based on various performance parameters. The centralized clustering approaches based on the Swarm Intelligence paradigm are observed to be more suitable for the applications in which low energy is required, high information delivery rate, or elevated scalability than algorithms that are based on the other paradigms described.

Outperforming RPL with scalable routing based on meaningful MAC addressing

RPL is the de-facto IPv6-based routing protocol for the Internet of Things (IoT), where networks are mainly formed by sensors and other low capacity devices. However, RPL lacks scalability and is inefficient in any-to-any communications. In this article, we present IoTorii, a hierarchical protocol that creates routes based on a probe frame, instead of the computation of a distance vector, as in RPL. We implemented a proof-of-concept of IoTorii and compared it with RPL, proving lower number of table entries, decreased exchanged control messages and faster convergence time, with similar path hop count, which is particularly promising in the IoT field.

Implementation of Improved TOPSIS Method for Congestion Control in WSN

In wireless sensor networks, sensor nodes are limited in memory, battery power and computational power. Wireless Sensor Networks (WSN) are a specific category of wireless adhoc networks where their performance is highly affected by application, lifetime, storage capacity, topology changes and the communication medium and bandwidth. Whenever the traffic load in the network increases, buffer at a node becomes full and it cannot handle any more data packets. This causes packet loss and retransmission which affects delivery ratio, energy and decreases network lifetime. Congestion is an important issue in wireless networks. Congestion in WSN severely affects loss rate, channel quality, the number of retransmissions, traffic flow, network lifetime, delay, energy as well as throughput. The congestion can be resolved in WSN either by reducing the data rate or by increasing the resources to form alternative paths. In this paper, an Implementation of Improved TOPSIS Method for congestion control in WSN known as Improved Hierarchical tree Alternative path protocol has been proposed which provides an improved performance over the basic HTAP protocol.

Probabilistic and Hierarchical Quantum Information Splitting Based on the Non-Maximally Entangled Cluster State

With the emergence of classical communication security problems, quantum communication has been studied more extensively. In this paper, a novel probabilistic hierarchical quantum information splitting protocol is designed by using a non-maximally entangled four-qubit cluster state. Firstly, the sender Alice splits and teleports an arbitrary one-qubit secret state invisibly to three remote agents Bob, Charlie, and David. One agent David is in high grade, the other two agents Bob and Charlie are in low grade. Secondly, the receiver in high grade needs the assistance of one agent in low grade, while the receiver in low grade needs the aid of all agents. While introducing an ancillary qubit, the receiver’s state can be inferred from the POVM measurement result of the ancillary qubit. Finally, with the help of other agents, the receiver can recover the secret state probabilistically by performing certain unitary operation on his own qubit. In addition, the security of the protocol under eavesdropping attacks is analyzed. In this proposed protocol, the agents need only single-qubit measurements to achieve probabilistic hierarchical quantum information splitting, which has appealing advantages in actual experiments. Such a probabilistic hierarchical quantum information splitting protocol hierarchical is expected to be more practical in multipartite quantum cryptography.

Performance analysis of two layer leach algorithm based on area partition (tl-leach-p) for wsn

Currently, much research has been done to develop routing algorithms to improve the lifetime of sensors from Wireless Sensor Network (WSN). Routing protocols based on the network structure can be classified into two categories: flat protocols and hierarchical protocols. One of the most popular hierarchical protocols is the Low Energy Adaptive Clustering Hierarchy (LEACH) algorithm. However, LEACH routing has a high packet loss in a busy network. This research propose Two Layer LEACH based on area Partition (TL-LEACH-P) routing algorithm based on the LEACH routing algorithm where the cave layer is done to prioritize the node that can become Cluster Head to decrease energy consumption. LEACH and TL-LEACH-P algorithms are simulated using MATLAB. The results show that the TL-LEACH-P algorithm has a better performance of 60% reaching LEACH in terms of network lifetime. The TL-LEACH-P algorithm has a 50% increase in the round where 50% of the nodes are dead from LEACH. Best TL-LEACH-P algorithm performance is when the k cluster value = 5. And best performance for LEACH algorithm is when the k cluster value = 15.

A Scalable Software Defined Network Orchestrator for Photonic Network on Chips

Photonic networks and software-defined networks are two promising technologies to improve network-on-chips performance, scalability, and resource utilization. Several architectures suffer from scaling limitations, high-power consumption, and noise interference drawbacks. In this paper, an enhanced photonic network-on-chip architecture called (SD-PNoC) is presented. The proposed architecture based on a hybrid hardware-software approach, and a Software-Defined Management Orchestrator (SDMO) to separate the network control and data forwarding planes. This orchestrator has hosted on the upper hardware router as a virtual layer capable of dynamic management. It reconfigures data forwarding paths and allows dynamic execution of different algorithms in real-time, as it scales the proposed topology based on both applications and the network requirements. The proposed SD-PNoC architecture, hierarchical communication protocols, and orchestrator management policies were implemented, simulated, and tested using a customized Phoenix-SIM framework in the OMNIT++ simulation environment. Numerous simulation experiments under different conditions have been performed and have proven that the performance of the proposed architecture is better than that of the conventional electronic network on chip (ENoC). Furthermore, simulation results without using the management policies showed that the latency is reduced by 46% and 25.5% for the $4\times 4$ and $8\times 8$ network structures, respectively. While the power consumption is reduced by 76.5% and 78.5% for the $4\times 4$ and $8\times 8$ network structures, respectively. Besides, the chip area is reduced by 33.4%. Moreover, simulation results of SDMO with using the management policies for the $8\times 8$ network structures increased the enhancement of latency from 25.5% to 37.3% and the power consumption from 78.5% to approximately 80%, which assure the ability of the proposed architecture to remarkably enhance the overall performance of complex network-on-chip structures.

RBM: Region‐Based Mobile Routing Protocol for Wireless Sensor Networks

Wireless sensor networks (WSNs) are employed for different applications for the reason of small‐sized and low‐cost sensor nodes. However, several challenges that include a low powered battery of the sensor nodes restrict their functionality. Therefore, saving energy in the routing process to extend network life is a serious concern while deploying applications on WSN. To this end, the key technology is clustering, which helps maximize scalability and network lifecycle. Base station (BS) collects data, aggregates it, and extracts the required information. To obtain the maximum outcome, the lifetime of the network is maximized by the use of different techniques and protocols. Data transmissions consume most of the network energy, and the transmissions over normal ranges require less energy as compared to transmissions over long ranges. Moreover, the nodes closer to the BS deplete their energy faster as compared to distant nodes because of traffic overload. The proposed protocol is aimed at reducing energy consumption and increasing the network lifetime. For this purpose, the network is divided into two regions: region 1 closer to the BS communicating directly, whereas region 2 farther away from the BS having routing nodes to communicate with the BS. Routing nodes do not take part in sensing function but will only move in region 2 collecting data and forwarding it to BS. MATLAB is used as the simulation tool for evaluation, and the results are compared with the existing optimized region‐based efficient routing (AORED) and low‐energy adaptive clustering hierarchical protocol (LEACH) techniques. The comparison showed that energy conservation and lifetime increased by 15%, and throughput is increased by more than 5% approximately.

Hierarchical Group-key Management for NoC-Based MPSoCs Protection

Group keys can be used in order to communicate secretly sensitive data among IP cores. However, the flexibility and dynamic nature of MPSoCs force reshaping the security zones at runtime. Members of a zone must be able to efficiently compute the new group key while former members must be prevented for data disclosure. Efficiently creating security zones for achieving sensitive traffic isolation in MPSoC environments is a challenging problem. In this work we present the implementation of hierarchical group-key management for NoC-based systems in order to efficiently perform the rekeying process. We implement three hierarchical protocols and we show that by decentralizing the security management of the rekeying process, it is possible to achieve an improvement of the performance when compared to the previous flat approaches.