DADC: A Novel Duty-cycling Scheme for IEEE 802.15.4 Cluster-tree-based IoT Applications

The IEEE 802.15.4 standard is one of the widely adopted specifications for realizing different applications of the Internet of Things. It defines several physical layer options and Medium Access Control (MAC) sub-layer for devices with low-power operating at low data rates. As devices implementing this standard are primarily battery-powered, minimizing their power consumption is a significant concern. Duty-cycling is one such power conserving mechanism that allows a device to schedule its active and inactive radio periods effectively, thus preventing energy drain due to idle listening. The standard specifies two parameters, beacon order and superframe order, which define the active and inactive period of a device. However, it does not specify a duty-cycling scheme to adapt these parameters for varying network conditions. Existing works in this direction are either based on superframe occupation ratio or buffer/queue length of devices. In this article, the particular limitations of both the approaches mentioned above are presented. Later, a novel duty-cycling mechanism based on MAC parameters is proposed. Also, we analyze the role of synchronization schemes in achieving efficient duty-cycles in synchronized cluster-tree network topologies. A Markov model has also been developed for the MAC protocol to estimate the delay and energy consumption during frame transmission.

MiA-CODER: A Multi-Intelligent Agent-Enabled Reinforcement Learning for Accurate Coverage Hole Detection and Recovery in Unequal Cluster-Tree-Based QoSensing WSN

Coverage is an important factor for the effective transmission of data in the wireless sensor networks. Normally, the formation of coverage holes in the network deprives its performance and reduces the lifetime of the network. In this paper, a multi-intelligent agent enabled reinforcement learning-based coverage hole detection and recovery (MiA-CODER) is proposed in order to overcome the existing challenges related to coverage of the network. Initially, the formation of coverage holes is prevented by optimizing the energy consumption in the network. This is performed by constructing the unequal Sierpinski cluster-tree topology (USCT) and the cluster head is selected by implementing multi-objective black widow optimization (MoBWo) to facilitate the effective transmission of data. Further, the energy consumption of the nodes is minimized by performing dynamic sleep scheduling in which Tsallis entropy enabled Bayesian probability (TE2BP) is implemented to switch the nodes between active and sleep mode. Then, the coverage hole detection and repair are carried out in which the detection of coverage holes if any, both inside the cluster and between the clusters, is completed by using the virtual sector-based hole detection (ViSHD) protocol. Once the detection is over, the BS starts the hole repair process by using a multi-agent SARSA algorithm which selects the optimal mobile node and replaces it to cover the hole. By doing so, the coverage of the network is enhanced and better QoSensing is achieved. The proposed approach is simulated in NS 3.26 and evaluated in terms of coverage rate, number of dead nodes, average energy consumption and throughput.

Comparative Study of Clustering-Based Outliers Detection Methods in Circular-Circular Regression Model

This paper is a comparative study of several algorithms for detecting multiple outliers in circular-circular regression model based on the clustering algorithms. Three measures of similarity based on the circular distance were used to obtain a cluster tree using the agglomerative hierarchical methods. A stopping rule for the cluster tree based on the mean direction and circular standard deviation of the tree height was used as the cutoff point and classifier to the cluster group that exceeded the stopping rule as potential outliers. The performances of the algorithms have been demonstrated using the simulation studies that consider several outlier scenarios with a certain degree of contamination. Application to real data using wind data and a simulated data set are given for illustrative purposes. Thus, it has been found that Satari’s algorithm (S-SL algorithm) performs well for any values of sample size n and error concentration parameter. The algorithms are good in identifying outliers which are not limited to one or few outliers only, but the presence of multiple outliers at one time.

Improved energy efficient hierarchical cluster tree based routing to prolong network lifetime

Wireless sensor networks (WSN) play a key role in enabling wireless communication technology among several nodes to remotely communicate and exchange information. WSN consists of tiny sensor nodes equipped with battery, scattered in an area to gather information around an environment and send to data collection node known as sink or base station (BS). WSN have been widely used in various applications like agriculture, fire detection, health care and military and has become imperative necessity for future revolutionary area like UAV (unmanned aerial vehicles), IoT (Internet of things) and smart cities which employs large scale sensor nodes. However sensor nodes are limited to battery, memory, low computational power, resource and bandwidth. Continues sensing of events, makes node to drain its battery faster and goes dead fast. For resource constrained WSN, hierarchical cluster based approaches are considered as energy efficient and improves network performance for large scale WSN. Minimizing energy consumption and extending network lifetime are major challenging issues of WSN, clustering methods with optimized routing have offered solution to optimize energy utilization. To balance energy consumption and improve network lifetime many existing hierarchical clustering approaches have been proposed, however existing method does not consider rotation of cluster head (CH) and considers cluster head selection based on residual energy and distance parameter. In this paper we propose an improved energy efficient cluster tree (IEECT) based routing to improve energy efficiency of hierarchical cluster. IEECT considers modification of existing LEACH (Low energy adaptive clustering hierarchy) protocol to improved energy efficient LEACH by considering energy parameters like residual node energy and average network energy. IEECT accounts optimal number of cluster head (CH) and selection of CH is done using threshold value among sensor nodes. Proposed IEECT combines tree based routing and data aggregation scheme to maintain desirable quality of service. Simulation experiments are carried out by using network simulator. Performance of IEECT is evaluated in terms of PDR, delay, energy consumption, network lifetime and overhead.

Cell Type Hierarchy Reconstruction via Reconciliation of Multi-resolution Cluster Tree

A wealth of clustering algorithms are available for Single-cell RNA sequencing (scRNA-seq), but it remains challenging to compare and characterize the features across different scales of resolution. To resolve this challenge Multi-resolution Reconciled Tree (MRtree), builds a hierarchical tree structure based on multi-resolution partitions that is highly flexible and can be coupled with most scRNA-seq clustering algorithms. MRtree out-performs bottom-up or divisive hierarchical clustering approaches because it inherits the robustness and versatility of a flat clustering approach, while maintaining the hierarchical structure of cells. Application to fetal brain cells yields insight into subtypes of cells that can be reliably estimated.