This study proposes a new method for designing adaptive routing algorithms for three‐dimensional (3D) networks‐on‐chip (NoCs). This method is based on extending the existing 2D turn model adaptive routing to a 3D scenario. A 3D plane‐balanced approach with maximal degree of adaptiveness is achieved by applying a well‐defined set of rules for different strata of the 3D NoC. The proposed method is applicable to any of the turn models. In this study, the authors employ odd–even turn model as a basis for introducing the proposed strategy. Experimental results show that the new 3D odd–even turn model can achieve up to 28.5% improvement in performance over conventional 3D odd–even approach. The improvement is consistent for different traffic types and selection strategies. The proposed method enables a new avenue to explore adaptive approaches for future large‐scale 3D integration.
Electric vehicles are emerging as a sustainable alternative to conventional transportation. However, route planning in Internet of Vehicles environments remains challenging because conventional routing algorithms based on travel distance or time do not adequately consider electric vehicle-specific constraints. Existing routing strategies often overlook the combined effects of battery energy, traffic congestion, and charging requirements, resulting in inefficient routing decisions. This paper proposes an adaptive Energy, Congestion, and Charging-Aware Routing (ECCAR) protocol that uses energy-feasibility verification, cost-based charging-station selection, and route re-optimization for electric vehicles in Internet of Vehicles enviro
... Show MoreTraffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho
... Show MoreThe interaction between comet Hale-Bopp tail with the solar wind is investigated in the present paper using magneto-hydrodynamic (MHD) numerical simulation, which accounts for the presence of the interplanetary magnetic field (IMF). The simulation is based on three-dimensional Lax-Wendroff explicit scheme, providing second-order accuracy in space and time. The ions produced from the nucleus of the comet will add considerable effects on the microstructure of the solar wind, thus severely altering its physical properties. The present simulation focuses on careful analysis of these properties by means of simulating the behavior of the comet Hale-Bopp’s tail at 1 AU from the sun. These properties include the changes of the plasma density,
... Show MoreIndividual mobility is an outcome of the rapid changes in life; it is revealed in particular literary works within the end of the 19th century. Mobility is clearer in modern time as the individual has become physically freer in his movement. But the individual’s freedom is often conditioned by restrictions. Usually, change stimulates individuals to obtain new structure of feeling; the individual mocks or rages against institutions, or he would comply, suffering rapid personal deterioration as he faces effective stability or institutions. There is a continuous sense of “deadlock.” Sylvia Plath’s novel reflects the depression of an intellectual young woman who fails to find her right path muddled by an inconsistent, confusing
... Show MoreThe aim of this paper is to construct cyclic subgroups of the projective general linear group over from the companion matrix, and then form caps of various degrees in . Geometric properties of these caps as secant distributions and index distributions are given and determined if they are complete. Also, partitioned of into disjoint lines is discussed.
Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,
... Show MoreRouting protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and Quality of Service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile ad hoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyz
... Show More