Narrow Results

Wireless Sensor Networks (WSNs) have come across several things which include collecting data, handling data and distribution for super visioning specific applications such as the services needed, managing anything that occurred naturally, etc. They totally rely on applications. Therefore, the WSNs are classified under major networks. This is very essential. It can be defined as a network of networks that helps in proper flow of data. The main characteristics of WSN include its continuous changes in topologies, connected nodes with several chips and tunic routing protocol. There should be the better utilization of the available resources so that its life span may exceed. There should be an effective usage of available assets to avoid the waste. In our research, we propose a hybrid approach, namely, the Power Control Tree-Based Cluster (PCTBC) to identify the Sybil attacks in WSNs. It employs several stages structured clustering of nodes based on position and identity verification. This approach is utilized for the usage of energy consumption, effectiveness of detecting Sybil attacks inside clusters. The main aspects put into consideration are the efficient routing protocol of the distance between the hops and the energy power remains, where the distance between the hops is being computed using the Received Signal Strength Indication (RSSI) and also the packet transmission can be properly tuned on the basis of the distance. Also, the proposed approach considers the energy consumption for the transmission of the defined packet.

Recent research indicates the presence of increased vascular density and irregularity on oral mucosal vascular networks in extracellular matrix (ECM)-related illness or conditions. Here, we estimated the frequency of occurrence of nodes of various degrees (K3, K4 and K5, where Kn designates a node with n connections) in patients with proven or suspected ECM-related conditions and in controls. Subjects with ECM-related conditions exhibited lower K3 and higher K4 frequency than controls (p < 0.0001) in their vascular networks. Inverse statistical correlations between the local fractal dimension and L-Z values and percentage of K3 (Pearson's r values range: -0.91 to -0.81; p values range: 0.0013 to < 0.0001), together with a positive relationship with K4 were observed (r values range: 0.81 to 0.86; p values range: 0.0015 to 0.0003). A positive correlation coefficient between D(1–46) and K5 frequency was also found (r = 0.6334, p = 0.027). K3 ≥ 52% or K4 <28% discriminated ECM patients from controls with 100% sensitivity (true positive cases to true positive + false negative ratio) and specificity (true negative cases to true negative + false positive ratio). These findings suggest that node degree distribution in oral vascular networks could be a helpful new marker of pathological conditions associated with proven or suspected ECM abnormalities.

Misiurewicz points are essential points of the Mandelbrot set. External arguments are the most useful tool in order to analyze these points; therefore, it is important to go deeper in the study of the external arguments' calculation of these points. In this paper we introduce an algorithm to calculate the external arguments of the branch points, or nodes, of a shrub, since such nodes are the most outstanding Misiurewicz points of the chaotic region of the Mandelbrot set. Devaney and Moreno-Rocha had already presented a paper where they calculated the external arguments of one of these Misiurewicz points, the main node of a shrub. Our algorithm widens the study of Devaney and Moreno-Rocha because it allows one to calculate the external arguments of any node of the shrub.

Let $\mathrm{\Psi }=\mathrm{\Psi }(𝕍,𝔼)$ be an undirected (i.e., all the edges are bidirectional), simple (i.e., no loops and multiple edges are allowed), and connected (i.e., between every pair of nodes, there exists a path) graph. Let $d_{\mathrm{\Psi }}({\varrho }_i,{\varrho }_j)$ denotes the number of edges in the shortest path or geodesic distance between two vertices ${\varrho }_i,{\varrho }_j\in 𝕍$. The metric dimension (or the location number) of some families of plane graphs have been obtained in [M. Imran, S. A. Bokhary and A. Q. Baig, Families of rotationally-symmetric plane graphs with constant metric dimension, Southeast Asian Bull. Math.36 (2012) 663–675] and an open problem regarding these graphs was raised that: Characterize those families of plane graphs $\mathrm{\Phi }$ which are obtained from the graph $\mathrm{\Psi }$ by adding new edges in $\mathrm{\Psi }$ such that $\beta (\mathrm{\Psi })=\beta (\mathrm{\Phi })$ and $𝕍(\mathrm{\Phi })=𝕍(\mathrm{\Psi })$. In this paper, by answering this problem, we characterize some families of plane graphs ${\mathrm{\Gamma }}_n$, which possesses the radial symmetry and has a constant metric dimension. We also prove that some families of plane graphs which are obtained from the plane graphs, ${\mathrm{\Gamma }}_n$ by the addition of new edges in ${\mathrm{\Gamma }}_n$ have the same metric dimension and vertices set as ${\mathrm{\Gamma }}_n$, and only 3 nodes appropriately selected are sufficient to resolve all the nodes of these families of plane graphs.