We investigated energy efficiency and fault tolerance for wireless sensor networks (WSNs), addressing the need to minimize the communication distances so that the energy used for communication is minimized since energ...
详细信息
ISBN:
(纸本)9781479941520
We investigated energy efficiency and fault tolerance for wireless sensor networks (WSNs), addressing the need to minimize the communication distances so that the energy used for communication is minimized since energy consumption is proportional to the 2nd to the 6th power of the distance. We also investigated the energy hole phenomenon, in which non-uniform energy usage among nodes causes some of the nodes to run out of power sooner. This in turn increases the communication distances and results in premature shutdown of the entire network. Since some sensor nodes in a WSN may be unreliable, fault tolerance is required for optimizing the communication topology. We have developed a routing algorithm, the "energy hole aware energy efficient communication routing algorithm (EHAEC)," that solves the energy hole problem to the maximum extent possible while minimizing the amount of energy used for communication by generating an energy efficient spanning tree. A variation of this algorithm, EHAEC for one-fault tolerance (EHAEC-IFT) identifies redundant communication routes by using the EHAEC tree and tolerates the failure of one node. In evaluation simulations, EHAEC outperformed direct data transmission by more than 3.4 to 4.8 times in terms of energy efficiency, thereby extending the WSN lifetime. EHAEC-1FT outperformed EHAEC in terms of energy efficiency when fault tolerance was the first priority and fault tolerance redundancy was created when or before a failure occurred.
The procedure of routing and wavelength assignment became a limiting factor for new applications in Optical Networks (ONs) due to the faster dynamic and greater unpredictability of service requests. The need for quick...
详细信息
The procedure of routing and wavelength assignment became a limiting factor for new applications in Optical Networks (ONs) due to the faster dynamic and greater unpredictability of service requests. The need for quick service recovery in the event of failures is also a crucial aspect which depends on this procedure. The present work proposes a new assignment of alternative routes able to comply to any data service request in ONs. The assignment procedure is based on the distinction by low correlation between paths, on the available bandwidth of different paths and on the latency for the establishment of communication between network nodes. In such context, an improvement of the Breadth-First Search (BFS) algorithm is proposed and tested with parameters from a real-world system, resulting in a good performance to find alternative routes and to classify them according to the best score obtainable, independently of the source or destiny nodes.
The movement of nodes in opportunistic networks exhibits characteristics of clustering and regularity. Consequently, routing algorithms based on communities have become a current research hotspot. However, existing co...
详细信息
ISBN:
(纸本)9798350349184;9798350349191
The movement of nodes in opportunistic networks exhibits characteristics of clustering and regularity. Consequently, routing algorithms based on communities have become a current research hotspot. However, existing community-based routing algorithms do not comprehensively analyze both the overlap of node communities and the impact of neighboring nodes on message transmission. To address this issue, this paper proposes a novel opportunistic routing algorithm called CWON, based on overlapping communities and communication willingness. First, we utilize the PercoMCV method to partition overlapping communities. Subsequently, we define the concept of communication willingness and design the CWON algorithm based on this concept. The CWON algorithm effectively addresses the problem of overlapping community partitioning and measures the importance of different neighboring nodes in message transmission. Our simulation results demonstrate that the CWON algorithm significantly enhances the success rate of message delivery while reducing routing overhead.
This paper proposes variability-tolerant routing algorithms for mesh-based Networks-on-Chip (NoC). Different NoC routing algorithms are modified, from variability perspective, to route flits through links with lower f...
详细信息
This paper proposes variability-tolerant routing algorithms for mesh-based Networks-on-Chip (NoC). Different NoC routing algorithms are modified, from variability perspective, to route flits through links with lower failure probability. The algorithms considered in this study are XY, West-First, Negative-First, and Odd Even routing algorithms. To evaluate our variability-tolerant routing algorithms, a cycle-accurate simulator, NoCTweak, is used to measure how tolerant the resultant NoCs are against process variations. Results reflect the efficiency of our routing algorithms to overcome the process variation problems in modern fabrication technologies. For example, variability-tolerant West-First routing algorithm achieves up to 56% reduction in NoC overall failure rate. (C) 2014 Elsevier B.V. All rights reserved.
We present BeRGeR: the first asynchronous geometric routing algorithm that guarantees delivery of a message despite a Byzantine fault without relying on cryptographic primitives or randomization. The communication gra...
详细信息
ISBN:
(数字)9783031673214
ISBN:
(纸本)9783031673207;9783031673214
We present BeRGeR: the first asynchronous geometric routing algorithm that guarantees delivery of a message despite a Byzantine fault without relying on cryptographic primitives or randomization. The communication graph is a planar embedding that remains three-connected if all edges intersecting the source-target line segment are removed. We prove the algorithm correct and estimate its message complexity.
This study presents a high-level simulator for Network-on-Chip (NoC), designed for many-core architectures, and integrated with the PlatEMO platform. The motivation for developing this tool arose from the need to eval...
详细信息
This study presents a high-level simulator for Network-on-Chip (NoC), designed for many-core architectures, and integrated with the PlatEMO platform. The motivation for developing this tool arose from the need to evaluate the behavior of application mapping algorithms and the routing, both aspects are essential in the implementation and design of NoC architectures. This analysis underscored the importance of having effective NoC simulators as tools that allow for studying and comparing various network technologies while ensuring a controlled simulation environment. During this investigation and evaluation, some simulators, such as Noxim, NoCTweak, and NoCmap, among others, offered configurable parameters for application traffic, options to synthetically define topology and packet traffic patterns. Additionally, they include mapping options that optimize latency and energy consumption, routing algorithms, technological settings such as the CMOS process, and measurement options for evaluating performance metrics such as throughput and power usage. However, while these simulators meet detailed technical demands, they are mostly restricted to analyzing the low-level elements of the architecture, thus hindering quick and easy understanding for non-specialists. This insight underscored the challenge in developing a tool that balances detailed analysis with a comprehensive learning perspective, considering the specific restrictions of each simulator analyzed. Experiments demonstrated the proposed simulator efficacy in handling algorithms like GA, PSO, and SA variant, and, surprisingly, revealed limitations of the XY algorithm in Mesh topologies, indicating the need for further investigation to confirm these findings. Future work will expand the simulator functionalities, incorporating a broader range of algorithms and performance metrics, to establish it as an indispensable tool for research and development in NoCs.
routing optimization is key to improve the performance of power OTN. To solve the unequally distributed traffic load in power OTN, this paper put forward a power OTN routing optimization algorithm based on DQN. The po...
详细信息
With the research and prospects of 6G technology, large-scale low-earth orbit satellite networks will play a crucial role in future communication frameworks. In this study, we proposed the congestion avoidance geograp...
详细信息
The current shortest path-based satellite routing algorithms do not consider the periodicity and persistence of links, resulting in high costs and unreliable maintenance of routing tables. In this regard, we propose a...
详细信息
Underwater Optical Wireless Networks (UOWNs) offer a promising solution for high-speed data transmission, yet they face significant challenges due to the demanding aquatic environment, which affects signal propagation...
详细信息
暂无评论