The Wireless Sensor Network (WSN), is constructed out of teeny-tiny sensor nodes that are very low-cost, have a low impact on the environment in terms of the amount of power they consume, and are able to successfully ...
详细信息
The Wireless Sensor Network (WSN), is constructed out of teeny-tiny sensor nodes that are very low-cost, have a low impact on the environment in terms of the amount of power they consume, and are able to successfully transmit data to the base station. The primary challenges that are presented by WSN are those that are posed by the distance between nodes, the amount of energy that is consumed, and the delay in time. The sensor node's source of power supply is a battery, and this particular battery is not capable of being recharged. In this scenario, the amount of energy that is consumed rises in direct proportion to the distance that separates the nodes. Here, we present a Hybrid Firefly Glow-Worm Swarm Optimization (HF-GSO) guided routing strategy for preserving WSNs' low power footprint. An efficient fitness function based on firefly optimization is used to select the Cluster Head (CH) in this procedure. It aids in minimising power consumption and the occurrence of dead sensor nodes. After a cluster head (CH) has been chosen, the Glow-Worm Swarm Optimization (GSO) algorithm is used to figure out the best path for sending data to the sink node. Power consumption, throughput, packet delivery ratio, and network lifetime are just some of the metrics measured and compared between the proposed method and methods that are conceptually similar to those already in use. Simulation results showed that the proposed method significantly reduced energy consumption compared to the state-of-the-art methods, while simultaneously increasing the number of functioning sensor nodes by 2.4%. Proposed method produces superior outcomes compared to alternative optimization-based methods.
This article considers the usage of circulant topologies as a promising deadlock-free topology for networks-on-chip (NoCs). A new high-level model, Newxim, for the exploration of NoCs with any topology is presented. T...
详细信息
This article considers the usage of circulant topologies as a promising deadlock-free topology for networks-on-chip (NoCs). A new high-level model, Newxim, for the exploration of NoCs with any topology is presented. Two methods for solving the problem of cyclic dependencies in circulant topologies, which limit their applications for NoCs due to the increased possibility of deadlocks, are proposed. The first method of dealing with deadlocks is universal and applicable to any topology;it is based on the idea of bypassing blocked sections of the network on an acyclic subnetwork. The second method-Ring-Split-takes into account the features of circulant topologies. The results of high-level modeling and comparison of the peak throughput of NoCs for circulant and mesh topologies using deadlock-free routing algorithms are presented. It was shown that a new approach for routing in circulants (compared to mesh topology) shows up to 59% better network throughput with a uniform distribution of network load.
Payment Channel Network (PCN) is a scaling solution for Cryptocurrency networks. We advance the PCN multi-path routing by better modeling the system and incorporating the cost of routing fee and the privacy requiremen...
详细信息
Payment Channel Network (PCN) is a scaling solution for Cryptocurrency networks. We advance the PCN multi-path routing by better modeling the system and incorporating the cost of routing fee and the privacy requirement of the channel balance. We design an autonomous routing algorithm, Auto-Tune, optimizing the routing concerning the success rate and the routing fee and utilizing the limited channel capacity information. The simulation result shows a significant performance gain in the success rate of Auto-Tune over the current PCN implementation based on single-path routing. To analyze the performance cost from the system requirement of the channel balance privacy, we compare Auto-Tune against the state-of-the-art Flash algorithm assuming the availability of the channel-balance information (such channel-balance information violates the PCN privacy requirement and does not comply with the current PCN implementations and practices). The simulation results show that the success rate and fee obtained by Auto-Tune are close to that obtained by Flash (which achieves the optimal fee result by using the exact channel-balance information).
Existing opportunistic network routing algorithms usually have two main problems: excessive calculation of key nodes leads to the uneven energy consumption of nodes, and limited remaining cache of nodes leads to the l...
详细信息
ISBN:
(纸本)9781728195056
Existing opportunistic network routing algorithms usually have two main problems: excessive calculation of key nodes leads to the uneven energy consumption of nodes, and limited remaining cache of nodes leads to the loss of important messages. To solve the above problems, this paper proposed a new opportunistic network routing algorithm-EC-CW, which forwards messages according to the multi-copy mechanism and the communication willingness between nodes. The simulation results show that EC-CW reduces the average latency and the overhead rate in the nodes-sparse opportunistic network scenarios composed of high-cache nodes;EC-CW improves the delivery rate and reduces the overhead rate in the nodes-intensive opportunistic network scenarios composed of low-cache nodes.
With the development of space technology, many LEO microsatellites system, such as Starlink, provide the possibility of providing global communication service. At the same time, the new network architecture provides o...
详细信息
ISBN:
(纸本)9781665415064
With the development of space technology, many LEO microsatellites system, such as Starlink, provide the possibility of providing global communication service. At the same time, the new network architecture provides opportunities and challenges for the design of routing algorithm. This paper discusses the self-organized location assisted on-demand routing (LAOR) and directional penetration routing (DPR), and proposes a directed percolation routing algorithm based on self-organization for LEO satellite (DPRSO). It aims to provide low latency and low overhead communication services.
Machine Learning (ML) is seen as a promising application that offers autonomous learning and provides optimized solutions to complex problems. The current Multiprotocol Label Switching (MPLS)-based communication syste...
详细信息
Machine Learning (ML) is seen as a promising application that offers autonomous learning and provides optimized solutions to complex problems. The current Multiprotocol Label Switching (MPLS)-based communication system is packed with exponentially increasing applications and different Quality-of-Services (QoS) requirements. As the network is getting complex and congested, it will become challenging to satisfy the QoS requirements in the MPLS network. This study proposes a hybrid ML-based intrusion detection system (ML-IDS) and ML-based intelligent routing algorithm (ML-RA) for MPLS network. The research is divided into three parts, which are (1) dataset development, (2) algorithm development, and (3) algorithm performance evaluation. The dataset development for both algorithms is carried out via simulations in Graphical Network Simulator 3 (GNS3). The datasets are then fed into MATLAB to train ML classifiers and regression models to classify the incoming traffic as normal or attack and predict traffic delays for all available routes, respectively. Only the normal traffic predicted by the ML-IDS algorithm will be allowed to enter the network domain, and the route with the fastest delay predicted by the ML-RA is assigned for routing. The ML-based routing algorithm is compared to the conventional routing algorithm, routing Information Protocol version 2 (RIPv2). From the performance evaluations, the ML-RA shows 100 percent accuracy in predicting the fastest route in the network. During network congestion, the proposed ML outperforms the RIPv2 in terms of delay and throughput on average by 57.61 percent and 46.57 percent, respectively.
An important application domain for the Internet of Things (IoT) is the area of industry and manufacturing where the production may be spread in different sites and hostile environments, even geographically. This pape...
详细信息
ISBN:
(纸本)9781728180175
An important application domain for the Internet of Things (IoT) is the area of industry and manufacturing where the production may be spread in different sites and hostile environments, even geographically. This paper studies an industrial application where nodes, not necessarily Internet connected, must forward their data to an IoT gateway in a multi/hop fashion adopting a swarm intelligence-based routing algorithm. In order to deal with the issues raised by the industrial domain, a mobile gateway-sink is adopted. The reliability of the communication system is investigated by a case study on a factory taken as example. A Markovian Agent Model is developed, demonstrating the effectiveness of the swarm intelligent routing protocol coupled with the mobile sink, especially when resource constrained devices (e.g. battery powered) or particularly stressing conditions (e.g. shocks, fatigue) have to be considered. Preliminary experiments show that the proposed solution is quite effective in ensuring high communication reliability in such industrial contexts.
Recently, the vehicular ad hoc network (VANET) has attracted the attention of researchers with the development of the internet of things (IoT) and the intelligent transport system (ITS). One of the major application s...
详细信息
ISBN:
(纸本)9781728186160
Recently, the vehicular ad hoc network (VANET) has attracted the attention of researchers with the development of the internet of things (IoT) and the intelligent transport system (ITS). One of the major application scenarios of the fifth generation wireless communication is massive machine type communication (mMTC). In order to aggregate the data recorded by machines, information packets need to be delivered to bureaus in the network. However, some packets are not very urgent and they don't have to be transferred by the cellular communication due to the fact that the spectrum source is scarce. With the increasing number of vehicles and the increasing computing power of on board units (OBUs), vehicle-to-vehicle (V2V) communications are better to deliver data packets. In order to transfer the packets effectively, it is important to find a reliable vehicular communication route. As the topology and the vehicles velocity change much more rapidly, the existing routing algorithms in other kinds of ad hoc networks are not suitable for the VANET. In this paper, we propose a vehicular routing algorithm based on graph theory. We consider the network situations more comprehensively and the simulation results show that the algorithm proposed is superior to the traditional routing algorithm.
With the continuous improvement of IC manufacturing technology, the interconnection scale of network on chip is expanding constantly, which puts forward higher requirements for system reliability. Based on the analysi...
详细信息
ISBN:
(纸本)9781665435741
With the continuous improvement of IC manufacturing technology, the interconnection scale of network on chip is expanding constantly, which puts forward higher requirements for system reliability. Based on the analysis of the NoC's fault models, and the analysis of the fault-tolerant design method, this paper proposes a spatial redundancy technology to overcome the permanent or transient errors on links. If three links in the none-edge node fail at the same time, or two links in the edge node fail at the same time, we backtrack and switch the routing policy between XY routing and YX routing to bypass the failed node. The experimental results show that compared with the original XY-YX fault-tolerant routing algorithm, the network throughput is increased and the global average packet delay is reduced.
With low latency and wide coverage, Low Earth Orbit (LEO) satellite networks can provide network services for places that cannot be reached by the terrestrial network and become a critical supplement to the traditiona...
详细信息
ISBN:
(纸本)9781728186160
With low latency and wide coverage, Low Earth Orbit (LEO) satellite networks can provide network services for places that cannot be reached by the terrestrial network and become a critical supplement to the traditional network, playing an increasingly important role. While the wide coverage and broadcasting enable LEO satellite networks (LSNs) accessible to more devices, this also raises the risk of being attacked by potential adversaries. Previous research on secure routing is either mainly based on the design of encryption-based algorithms or is only suitable for the relative static topology of the traditional terrestrial networks. However, given limited computational resources and the highly dynamic changes of the LEO satellite, encryption-based algorithms can hardly meet the demands of LSNs. Unlike these works, this paper proposes a lightweight risk-avoidance routing algorithm (LRAR). It allows users' data packets to be forwarded by avoiding specified high-risk areas to reduce the risk of user data being attacked. As can be seen in extensive simulation experiments, the LRAR implements results close to the optimal path with little overhead. Also, it enhances security and flexible extensibility.
暂无评论