Search

Currently, underwater sensor networks are extensively applied for environmental monitoring, disaster prediction, etc. Nevertheless, owing to the complicacy of the underwater environment, the limited energy of underwater sensor nodes, and the high latency of hydroacoustic channels, the energy-efficient operation of underwater sensor networks has become an important challenge. In this paper, a high-efficiency clustering routing protocol in AUV-assisted underwater sensor networks (HECRA) is proposed to address the energy limitations and low data transmission reliability in underwater sensor networks. The protocol optimizes the cluster head selection strategy of the traditional low-energy adaptive clustering hierarchy (LEACH) protocol by introducing the residual energy and node degree in the cluster head selection phase and performs some optimizations in the cluster formation and data transmission phases, including selecting clusters for joining by ordinary nodes based on the residual energy of the cluster head nodes and weight computation based on the depth and residual energy of the cluster head nodes to select the optimal message forwarding nodes. In addition, this paper introduces an autonomous underwater vehicle (AUV) as a dynamic relay node to improve network transmission efficiency. According to the simulation results, compared with the existing LEACH, the energy efficient routing protocol based on layers and unequal clusters in underwater wireless sensor networks (EERBLC) and energy-efficient clustering multi-hop routing protocol in a UWSN (EECMR), the HECRA significantly improves network lifetime, the residual node energy, and the number of successfully transmitted packets, which can effectively prolong network lifetime and ensure efficient data transmission.

Delay tolerant networks (DTNs), are characterized by their difficulty in establishing end-to-end paths and and large message propagation delays. To control network overhead costs, reduce message delays, and improve delivery rates in DTNs, it is essential to not only delete messages that have reached their destination but also to more precisely determine appropriate relay nodes. Based on the above goals, this paper constructs a multi-copy relay node selection router algorithm based on Q-lambda reinforcement learning with reference to the idea of community division (QLCR). In community division, if a node has the highestdegree, it is considered the core node, and nodes with similar interests and structural properties are divided into a community. Node degree refers to the number of nodes associated with the node, indicating its importance in the network. Structural similarity determines the distance between nodes. The selection of relay nodes considers node degree, interests, and structural similarity. The Q-lambda reinforcement learning algorithm enables each node to learn from the entire network, setting corresponding reward values based on encountered nodes meeting the specified conditions. Through iterative processes, the node with the most cumulative reward value is chosen as the final relay node. Experimental results demonstrate that the proposed algorithm achieves a high delivery rate while maintaining low network overhead and delay.

Drug-resistant epilepsy can be most limiting for patients, and surgery represents a viable therapy option. With the growing research on the human connectome and the evidence of epilepsy being a network disorder, connectivity analysis may be able to contribute to our understanding of epilepsy and may be potentially developed into clinical applications. In this magnetoencephalographic study, we determined the whole-brain node degree of connectivity levels in patients and controls. Resting-state activity was measured at five frequency bands in 15 healthy controls and 15 patients with focal epilepsy of different etiologies. The whole-brain all-to-all imaginary part of coherence in source space was then calculated. Node degree was determined and parcellated and was used for further statistical evaluation. In comparison to controls, we found a significantly higher overall node degree in patients with lesional and non-lesional epilepsy. Furthermore, we examined the conditions of high/reduced vigilance and open/closed eyes in controls, to analyze whether patient node degree levels can be achieved. We evaluated intraclass-correlation statistics (ICC) to evaluate the reproducibility. Connectivity and specifically node degree analysis could present new tools for one of the most common neurological diseases, with potential applications in epilepsy diagnostics.

Refined topological relations play an important role in spatial database quality control. Currently, there is no unified and reasonable method to represent refined line/region and line/line topological relations in two-dimensional (2D) space. In addition, the existing independent line/region and line/line models have some drawbacks such as incomplete type discrimination and too many topological invariants. In this paper, a refined line/region and line/line topological relations are represented uniformly by the sequence, dimension, and topological type of the intersection components. To make the relevant definitions conform to the traditional cognitions in 2D Euclidean space, the (simple) spatial object is defined based on manifold topology, and the spatial intersection components are defined based on the whole-whole object intersection set. Then the topological invariant of node degree is introduced, and the adjacent point kinds (e.g., “Null”, “On”, “In”, and “Out”) are defined to distinguish the intersection component types. Excluding impossible and symmetrical types, 29 types of intersection-lines (including 21 between lines/regions and 8 between lines/lines), and 6 types of intersection-points (including 2 between lines/regions and 4 between lines/lines) are classified. On this basis, a node degree-based whole-whole object intersection sets (N-WWIS) model for refined line/region and line/line topological relations is presented, and it can be combined with the Euler number-based whole object intersection and difference (E-WID) model (coarse level) to form a hierarchical representation method of topological relations. Furthermore, a prototype system based on the N-WWIS model for automatic topological integrity checking is developed and some evaluation experiments are conducted with OpenStreetMap (OSM) data is presented based on the classification of intersection components. The experimental results show that the N-WWIS model will enable the geographic information systems (GIS) community to develop automated topological conflict checking and dealing tools for spatial data updates and quality control.

Social networking has been a feature of human society. From the early hunter-gatherer tribes, medieval guilds, the twentieth century workplaces, up to online entities like Facebook and Twitter, it is difficult to think of a time or place where all people did not belong to at least one cooperative group. It follows that social network formation has been studied extensively in the past decades and will continue to be a popular area of research. Past research has primarily confined itself to considering cases in which new members are introduced into the networks by making a constant number of connections to those who are already present in the networks. Our study aims to fill the glaring gap in the variety of network formation modelling. Most notably, we want to consider scenarios in which the number of connections new members make to those already present in the networks is determined by chance. More specifically, the number of connections made to existing members when a new one is introduced into the network is characterized by a positive integer-valued random variable. The objective of the study is to determine the distribution of degree of a node in this kind of social networks. It is determined that the node degree distribution is a mixture of geometric distributions. Three numerical examples are provided in the study to demonstrate the validity of our findings.