routing technology is an indispensable part of wireless sensor networks (WSNs) in contemporary studies. Considerable attention is being given to the energy problem and the delay of data transmission. However, a few st...
详细信息
routing technology is an indispensable part of wireless sensor networks (WSNs) in contemporary studies. Considerable attention is being given to the energy problem and the delay of data transmission. However, a few studies have explored routingalgorithms in wireless rechargeable sensor networks (WRSNs) using mobile charging equipment. In this paper, we propose a clustering hierarchical routing algorithm for WRSNs based on K-means method (K-CHRA), which takes the energy distribution and data transmission into consideration under the influence of mobile equipment (ME) while combining mobile sink and mobile charger in WRSNs. The mobile sink is responsible for data collection and mobile charger replenishes energy for sensor nodes. The simulations demonstrate that K-CHRA can reduce energy consumption and the data transmission delay. Thus, K-CHRA has excellent equilibrium characteristics with balanced energy dissipation throughout all sensor nodes in the networks. Finally, a large number of experiments demonstrate that our proposed algorithm K-CHRA suits for many kinds of scenarios of networks.
In recent years, the capsule network has significantly impacted deep learning with its unique structure that robustly handles spatial relationships and image deformations like rotation and scaling. While previous rese...
详细信息
In recent years, the capsule network has significantly impacted deep learning with its unique structure that robustly handles spatial relationships and image deformations like rotation and scaling. While previous research has primarily focused on enhancing the structural network of capsule networks to process complex images, little attention has been given to the rich semantic information contained within the capsules themselves. We recognize this gap and propose the Multi-Order Descartes Expansion Capsule Network (MODE-CapsNet). By introducing the Multi-Order Descartes Expansion Transformation (MODET), this innovative architecture enhances the expressiveness of a single capsule by enabling its projection into a higher-dimensional space. As far as we know, this is the first significant enhancement at the single-capsule granularity level, providing a new perspective for improving capsule networks. Additionally, we proposed a hierarchical routing algorithm designed explicitly for the MODE capsules, significantly optimizing computational efficiency and performance. Experimental results on datasets (MNIST, Fashion-MNIST, SVHN, CIFAR-10, tiny-ImageNet) showed that MODE capsules exhibited improved separability and expressiveness, contributing to overall network accuracy, robustness, and computational efficiency.
Clustering is a promising and popular approach to organize sensor nodes into a hierarchical structure, reduce transmitting data to the base station by aggregation methods, and prolong the network lifetime. However, a ...
详细信息
Clustering is a promising and popular approach to organize sensor nodes into a hierarchical structure, reduce transmitting data to the base station by aggregation methods, and prolong the network lifetime. However, a heavy traffic load may cause the sudden death of nodes due to energy resource depletion in some network regions, i.e., hot spots that lead to network service disruption. This problem is very critical, especially for data-gathering scenarios in which Cluster Heads (CHs) are responsible for collecting and forwarding sensed data to the base station. To avoid hot spot problem, the network workload must be uniformly distributed among nodes. This is achieved by rotating the CH role among all network nodes and tuning cluster size according to CH conditions. In this paper, a clustering algorithm is proposed that selects nodes with the highest remaining energy in each region as candidate CHs, among which the best nodes shall be picked as the final CHs. In addition, to mitigate the hot spot problem, this clustering algorithm employs fuzzy logic to adjust the cluster radius of CH nodes;this is based on some local information, including distance to the base station and local density. Simulation results demonstrate that, by mitigating the hot spot problem, the proposed approach achieves an improvement in terms of both network lifetime and energy conservation.
The hierarchical routing algorithm is categorized as a kind of routing method using node clustering to create a hierarchical structure in large-scale mobile ad hoc network (LMANET). In this paper, we proposed a new hi...
详细信息
The hierarchical routing algorithm is categorized as a kind of routing method using node clustering to create a hierarchical structure in large-scale mobile ad hoc network (LMANET). In this paper, we proposed a new hierarchical clustering algorithm (HCAL) and a corresponded protocol for hierarchicalrouting in LMANET. The HCAL is designed based on a cost metric in the form of the link expiration time and node's relative degree. Correspondingly, the routing protocol for HCAL adopts a reactive protocol to control the existing cluster head (CH) nodes and handle proactive nodes to be considered as a cluster in LMANET. hierarchical clustering algorithm jointly utilizes table-driven and on-demand routing by using a combined weight metric to search dominant set of nodes. This set is composed by link expiration time and node's relative degree to establish the intra/intercommunication paths in LMANET. The performance of the proposed algorithm and protocol is numerically evaluated in average end-to-end delay, number of CH per round, iteration count between the CHs, average CH keeping time, normalized routing overhead, and packet delivery ratio over a number of randomly generated benchmark scenarios. Furthermore, to corroborate the actual effectiveness of the HCAL algorithm, extensive performance comparisons are carried out with some state-of-the-art routingalgorithms, namely, Dynamic Doppler Velocity Clustering, Signal Characteristic-Based Clustering, Dynamic Link Duration Clustering, and mobility-based clustering algorithms.
A better routing scheme becomes more significant with the quantum key distribution network developing. This paper makes use of pre-relay, parallel work and shortest path first strategy and proposes a hierarchical rout...
详细信息
ISBN:
(纸本)9781467390262
A better routing scheme becomes more significant with the quantum key distribution network developing. This paper makes use of pre-relay, parallel work and shortest path first strategy and proposes a hierarchicalrouting scheme with the perspective of parallel processing on wide-area quantum key distribution network based on trusted relay. Then the paper proposes the hierarchical routing algorithm. Through theoretical analysis and experiment result, it shows that the hierarchicalrouting scheme can effectively shorten the key transmission time and improve the efficiency of key transmission, which is better than the single layer routing scheme.
In Wireless Sensor Networks (WSNs), energy efficiency is one of the most important factors influencing the networks' performance. Through a well designed routingalgorithm, WSNs' energy efficiency can be impro...
详细信息
In Wireless Sensor Networks (WSNs), energy efficiency is one of the most important factors influencing the networks' performance. Through a well designed routingalgorithm, WSNs' energy efficiency can be improved evidently. Among various routingalgorithms, hierarchical routing algorithms have advantages in improving nets' robustness and flexibility, and it is more appropriate for large scale of networks. In this paper, some typical hierarchical routing algorithms are introduced, and their advantages and defects are analyzed. Based on these analyses, a new hierarchical routing algorithm with high energy efficiency named EESSC is proposed which is based on the improved HAC clustering approach. In EESSC, the sensor nodes' residual energy would be taken into account in clustering operation, and a special packet head is defined to help update nodes' energy information when transmitting message among the nodes. When the clusters have been formed, the nodes in cluster would be arrayed in a list and cluster head would be rotated automatically by the order of list. And a re-cluster mechanism is designed to dynamic adjust the result of clustering to make sensor nodes organization more reasonable. At last, EESSC is compared to other typical hierarchical routing algorithms in a series of experiments, and the experiments' result which proves that EESSC has obviously improved the WSNs' energy efficiency has been analyzed. Crown Copyright (C) 2013 Published by Elsevier B.V. All rights reserved.
In this paper, existing hierarchical routing algorithms are introduced, and according to these algorithms a new energy efficient algorithm named EASSC is proposedIn EASSC, the nodes' residual energy and cost of co...
详细信息
In this paper, existing hierarchical routing algorithms are introduced, and according to these algorithms a new energy efficient algorithm named EASSC is proposedIn EASSC, the nodes' residual energy and cost of communication would be considered when clusteringA special packet head is defined to update nodes' energy information when transmitting message;to rotate cluster head automatically, a member management scheme is designed too;and a re-cluster mechanism is used to dynamic adjust the clusters distribution in WSNsAt last, EASSC is analyzed with other typical algorithms and it is proved that EASSC has obviously improved WSNs' energy efficiency.
暂无评论