Search Results (189)

The Network-on-Chip applications’ performance and efficiency depend on task allocation and message routing, which are complex problems. The existing solutions assign priorities to messages in order to regulate their transmission. Unfortunately, this message classification can lead to routings that block the best global solution. In this work, we propose to use the Hungarian algorithm to dynamically route messages with the minimal cost, i.e., minimizing the communication times while consuming the least energy possible. To meet the real-time constraints coming from requiring results at each flit transmission, we also suggest a hardware version of it, which reduces the processing time by an average of 42.5% with respect to its software implementation. Full article

Multi-hop routing over low-power wide-area networks (LPWANs) has emerged as a promising technology for extending network coverage. However, existing protocols face high transmission disruption risks due to factors such as dynamic topology driven by stochastic events, dynamic link quality, and coverage holes induced by imbalanced energy consumption. To address this issue, we propose a failure risk-aware deep Q-network-based multi-hop routing (FRDR) protocol, aiming to reduce transmission disruption probability. First, we design a power regulation mechanism (PRM) that works in conjunction with pre-selection rules to optimize end-device node (EN) activations and candidate relay selection. Second, we introduce the concept of routing failure risk value (RFRV) to quantify the potential failure risk posed by each candidate next-hop EN, which correlates with its neighborhood state characteristics (i.e., the number of neighbors, the residual energy level, and link quality). Third, a deep Q-network (DQN)-based routing decision mechanism is proposed, where a multi-objective reward function incorporating RFRV, residual energy, distance to the gateway, and transmission hops is utilized to determine the optimal next-hop. Simulation results demonstrate that FRDR outperforms existing protocols in terms of packet delivery rate and network lifetime while maintaining comparable transmission delay. Full article

Low Earth orbit (LEO) satellite networks deliver superior real-time performance and responsiveness compared to conventional satellite networks, despite technical and economic challenges such as high deployment costs and operational complexity. Nevertheless, rapid topology changes and severe energy constraints of LEO satellites make real-time routing a persistent challenge. In this paper, we employ field-programmable gate arrays (FPGAs) to overcome the resource limitations of on-board computers (OBCs) and to manage energy consumption effectively using the Eclipse-Aware Routing (EAR) algorithm, and we implement the K-Shortest Paths (KSP) algorithm directly on the FPGA. Our method first generates multiple routes from the source to the destination using KSP, then selects the optimal path based on energy consumption rate, eclipse duration, and estimated transmission load as evaluated by EAR. In large-scale LEO networks, the computational burden of KSP grows substantially as connectivity data become more voluminous and complex. To enhance performance, we accelerate complex computations in the programmable logic (PL) via pipelining and design a collaborative architecture between the processing system (PS) and PL, achieving approximately a 3.83× speedup compared to a PS-only implementation. We validate the feasibility of the proposed approach by successfully performing remote routing-table updates on the SpaceWire-based SpaceWire Brick MK4 network system. Full article

Routing in flying ad hoc networks (FANETs) is hindered by high mobility, trajectory-induced topology dynamics, and energy constraints. Conventional topology-based or position-based protocols often fail due to stale link information and limited neighbor awareness. This paper proposes a trajectory-informed routing protocol enhanced by Q-learning: Traj-Q-GPSR, tailored for mission-oriented UAV swarm networks. By leveraging mission-planned flight trajectories, the protocol builds time-aware two-hop neighbor tables, enabling routing decisions based on both current connectivity and predicted link availability. This spatiotemporal information is integrated into a reinforcement learning framework that dynamically optimizes next-hop selection based on link stability, queue length, and node mobility patterns. To further enhance adaptability, the learning parameters are adjusted in real time according to network dynamics. Additionally, a delay-aware queuing model is introduced to forecast optimal transmission timing, thereby reducing buffering overhead and mitigating redundant retransmissions. Extensive ns-3 simulations across diverse mobility, density, and CBR connections demonstrate that the proposed protocol consistently outperforms GPSR, achieving up to 23% lower packet loss, over 80% reduction in average end-to-end delay, and improvements of up to 37% and 52% in throughput and routing efficiency, respectively. Full article

As an emerging information technology, Wireless Body Area Networks (WBANs) provide a lot of convenience for the development of the medical field. A WBAN is composed of many miniature sensor nodes in the form of an ad hoc network, which can realize remote medical monitoring. However, the data transmission between sensor nodes in the WBAN not only consumes the energy of the node but also causes the temperature of the node to rise, thereby causing human tissue damage. Therefore, in response to the energy consumption problem in the Wireless Body Area Network and the hot node problem in the transmission path, this paper proposes a temperature state awareness-based energy-saving routing protocol (TSAER). The protocol senses the temperature state of nodes and then calculates the data receiving probability of nodes in different temperature state intervals. A benefit function based on several parameters such as the residual energy of the node, the distance to sink, and the probability of receiving data was constructed. The neighbor node with the maximum benefit function was selected as the best forwarding node, and the data was forwarded. The simulation results show that compared with the existing M-ATTEPMT and iM-SIMPLE protocols, TSAER effectively prolongs the network lifetime and controls the formation of hot nodes in the network. Full article

Hybrid beamforming plays a critical role in evaluating wireless communication technology, particularly for millimeter-wave (mmWave) multiple-input multiple-out (MIMO) communication. Several hybrid beamforming systems are investigated for millimeter-wave multiple-input multiple-output (MIMO) communication. The deployment of huge grant-free transmission in the millimeter-wave (mmWave) band is required due to the growing demands for spectrum resources in upcoming enormous machine-type communication applications. Ultra-high data speed, reduced latency, and improved connection are all promised by the development of 5G mmWave networks. Yet, due to severe route loss and directional communication requirements, there are substantial obstacles to transmission reliability and energy efficiency. To address this limitation in this research we present an intelligent transmission control scheme tailored to 5G mmWave networks. Transport control protocol (TCP) performance over mmWave links can be enhanced for network protocols by utilizing the mmWave scalable (mmS)-TCP. To ensure that users have the stronger average power, we suggest a novel method called row compression two-stage learning-based accurate multi-path processing network with received signal strength indicator-based association strategy (RCTS-AMP-RSSI-AS) for an estimate of both the direct and indirect channels. To change user scenarios and maintain effective communication constantly, we utilize the innovative method known as multi-user scenario-based MATD3 (Mu-MATD3). To improve performance, we introduce the novel method of “digital and analog beam training with long-short term memory (DAH-BT-LSTM)”. Finally, as optimizing network performance requires bottleneck-aware congestion reduction, the low-latency congestion control schemes (LLCCS) are proposed. The overall proposed method improves the performance of 5G mmWave networks. Full article

Industry 4.0 has transformed manufacturing and automation by integrating cyber–physical systems with the Industrial Internet of Things (IIoT) for real-time monitoring, intelligent control, and data-driven decision making. The IIoT increasingly relies on IEEE 802.15.4e Time-Slotted Channel Hopping (TSCH) to achieve reliable, low-latency, and energy-efficient industrial communications. The 6TiSCH protocol stack integrates scheduling and routing to optimize transmissions for resource-constrained devices, enhancing Quality of Service (QoS) in IIoT deployments. This paper proposes an innovative adaptive and cross-layer slotframe allocation technique for 6TiSCH networks, dynamically scheduling cells based on node hop distance, queue backlog, predicted traffic load, and link quality metrics. By dynamically adapting to these parameters, the proposed method significantly improves key QoS metrics, including end-to-end latency, packet delivery ratio, and network lifetime. The mechanism integrates real-time queue backlog monitoring, link performance analysis, and energy harvesting awareness to optimize cell scheduling decisions proactively. The results demonstrate that the proposed strategy reduces end-to-end latency by up to 32%, enhances PDR by up to 27%, and extends network lifetime by up to 10% compared to state-of-the-art adaptive scheduling solutions. Full article

This article introduces a novel hybrid database architecture that combines graph and time-series databases to enhance the storage and management of transportation data, particularly for electric vehicles (EVs). This model addresses a critical challenge in modern mobility: handling large-scale, high-velocity, and highly interconnected datasets while maintaining query efficiency and scalability. By comparing a naive graph-only approach with our hybrid solution, we demonstrate a significant reduction in query response times for large data contexts-up to 64% faster in the XL scenario. The scientific contribution of this research lies in its practical implementation of a dual-layer storage framework that aligns with FAIR data principles and real-time mobility needs. Moreover, the hybrid model supports complex analytics, such as EV battery health monitoring, dynamic route optimization, and charging behavior analysis. These capabilities offer a multiplier effect, enabling broader applications across urban mobility systems, fleet management platforms, and energy-aware transport planning. By explicitly considering the interconnected nature of transport and energy data, this work contributes to both carbon emission reduction and smart city efficiency on a global scale. Full article

Low-Earth-Orbit (LEO) satellite networks offer a promising avenue for achieving global connectivity, despite certain technical and economic challenges such as high implementation costs and the complexity of network management. Nonetheless, real-time routing remains challenging because of rapid topology changes and strict energy constraints. This paper proposes a GPU-accelerated Eclipse-Aware Routing (EAR) method that simultaneously minimizes hop count and balances energy consumption for real-time routing on an onboard computer (OBC). The approach first employs a Breadth-First Search (BFS)–based K-Shortest Paths (KSP) algorithm to generate candidate routes and then evaluates battery usage to select the most efficient path. In large-scale networks, the computational load of the KSP search increases substantially. Therefore, CUDA-based parallel processing was integrated to enhance performance, resulting in a speedup of approximately 3.081 times over the conventional CPU-based method. The practical applicability of the proposed method is further validated by successfully updating routing tables in a SpaceWire network. Full article

Wireless sensor networks (WSNs) face a fundamental challenge: their sensors run on batteries, making energy efficiency crucial. While researchers have tried to extend network lifespans by improving routing and access control protocols across different layers, this remains a complex issue. One promising solution is opportunistic routing (OR), which uses multiple nodes to relay data. This approach reduces how long senders must wait for a specific next-hop node and helps prevent data loss from collisions. That said, choosing which nodes should act as forwarders can greatly affect how well the network performs. To tackle this problem, we developed a new approach called FCM-OR, a local density-based forwarder selection algorithm for opportunistic routing in WSNs. Our algorithm is particularly effective in networks where sensors are not evenly spread out and are densely packed. It uses fuzzy c-means (FCM) clustering to smartly pick the best forwarders based on how many nodes are nearby. By focusing on the sender’s immediate surroundings, FCM-OR helps solve the problems that arise when different parts of the network have varying densities of nodes. We also created a new way to measure routing effectiveness called “forwarding rank”. To test how well our protocol works, we ran extensive simulations comparing it to existing methods, including opportunistic routing with duty-cycled WSNs and load-balanced opportunistic routing. The results are clear: FCM-OR significantly improves both network performance and energy efficiency, especially in networks where nodes are not uniformly distributed. Full article

These days, wireless sensor networks (WSNs) are expanding fast and are used in many fields such as healthcare, battlefields, etc. Depending upon the type of sensor, they are transmitting a considerable amount of data in a short duration, so security is a significant issue while transferring the data. So, it is essential to solve security concerns while transferring data by secure routing in wireless sensor networks. We address this challenge by proposing Trusted Energy-Aware Hierarchical Routing (TEAHR), a new framework for a multi-level trust assessment that raises the security level in WSNs. TEAHR introduces a variety of trust metrics ranging from energy trust to forwarding trust to consistency trust to behavioral trust to anomaly detection, unlike existing models, enabling it to effectively address the challenges of dynamic network topologies and evolving cyber threats. Trust-based routing mechanisms are usually associated with high computation and storage complexity and susceptibility to collusive attacks such as spoofing. The mechanism in TEAHR overcomes these challenges by placing an adaptive trust assessment mechanism that adapts to the background network conditions and real-time activities of the nodes. We show through empirical analysis in this paper that TEAHR not only uses computational and storage resources efficiently but also enhances network performance and security. Our experimental setup presents the simulation approach to prove our proposed protocol of TEAHR in comparison with typical trust models under different scenarios of node mobility, variable node density, and sophisticated security attacks such as Sybil, wormhole, and replay attacks. TEAHR keeps the network connected, even when the nodes are isolated due to trust misbehavior, and demonstrates that widely it reduces the chances of misjudgment in trust evaluation. Moreover, we explore the scalability of TEAHR across large networks as well as its performance in computationally constrained contexts. We have verified through our detailed investigation that the energy metrics used uniquely in TEAHR extend the life of the network while increasing data routing trust and trustworthiness. The comparisons of TEAHR with conventional techniques show that the proposed algorithm reduces total latency by 15%, enhances energy efficiency by around 20%, and maintains a stable packet forwarding rate, which is highly desirable for accurate operation in adversarial environments, as demonstrated through comparative analysis. Through in-depth theoretical and practical analysis, TEAHR is confirmed as a high-performance framework that outperforms currently existing studies for WSN security, making TEAHR a strong candidate for use in industrial IoT applications and urban sensor networks. Full article

Fumigation effectively manages pests, yet manual spraying poses long-term health risks to operators, making autonomous fumigation robots safer and more efficient. Path planning is a crucial aspect of deploying autonomous robots; it primarily focuses on minimizing energy consumption and maximizing operational time. The Payload and Energy-aware Tactical Allocation Loop (PETAL) algorithm integrates a genetic algorithm to search for waypoint permutations, applies a 2-OPT (two-edge exchange) local search to refine those routes, and leverages an energy cost function that reflects payload weight changes during spraying. This combined strategy minimizes travel distance and reduces energy consumption across extended fumigation missions. To evaluate its effectiveness, a comparative study was performed between PETAL and prominent algorithms such as A*, a hybrid Dijkstra with A*, random search, and a greedy distance-first approach, using both randomly generated environments and a real-time map from an actual deployment site. The PETAL algorithm consistently performed better than baseline algorithms in simulations, demonstrating significant savings in energy usage and distance traveled. On a randomly generated map, the PETAL algorithm achieved 6.05% higher energy efficiency and 23.58% shorter travel distance than the baseline path-planning algorithm. It achieved 15.69% and 31.66% in energy efficiency and distance traveled saved on a real-time map, respectively. Such improvements can diminish operator exposure, extend mission durations, and foster safer, more efficient urban pest control. Full article

Multi-camera target tracking is a critical technology for continuous monitoring in large-scale environments, with applications in smart cities, security surveillance, and emergency response. However, existing tracking systems often suffer from high computational costs and energy inefficiencies, particularly in resource-constrained edge computing environments. Traditional methods typically rely on static or heuristic-based camera selection, leading to redundant computations and suboptimal resource allocation. This paper introduces a novel framework for efficient single-target tracking using edge-based distributed smart cameras with dynamic camera selection. The proposed framework employs context-aware dynamic camera selection, activating only the cameras most likely to detect the target based on its predicted trajectory. This approach is designed for resource-constrained environments and significantly reduces computational load and energy consumption while maintaining high tracking accuracy. The framework was evaluated through two experiments. In the first, single-person tracking was conducted across multiple routes with various target behaviors, demonstrating the framework’s effectiveness in optimizing resource utilization. In the second, the framework was applied to a simulated urban traffic light adjustment system for emergency vehicles, achieving significant reductions in computational load while maintaining equivalent tracking accuracy compared to an always-on camera system. These findings highlight the robustness, scalability, and energy efficiency of the framework in edge-based camera networks. Furthermore, the framework enables future advancements in dynamic resource management and scalable tracking technologies. Full article

This research presents an intelligent, environment-aware navigation framework for smart electric vehicles (EVs), focusing on multi-agent mapping, real-time obstacle recognition, and adaptive route optimization. Unlike traditional navigation systems that primarily minimize cost and distance, this research emphasizes how EVs perceive, map, and interact with their surroundings. Using a distributed mapping approach, multiple EVs collaboratively construct a topological representation of their environment, enhancing spatial awareness and adaptive path planning. Neural Radiance Fields (NeRFs) and machine learning models are employed to improve situational awareness, reduce positional tracking errors, and increase mapping accuracy by integrating real-time traffic conditions, battery levels, and environmental constraints. The system intelligently balances delivery speed and energy efficiency by dynamically adjusting routes based on urgency, congestion, and battery constraints. When rapid deliveries are required, the algorithm prioritizes faster routes, whereas, for flexible schedules, it optimizes energy conservation. This dynamic decision making ensures optimal fleet performance by minimizing energy waste and reducing emissions. The framework further enhances sustainability by integrating an adaptive optimization model that continuously refines EV paths in response to real-time changes in traffic flow and charging station availability. By seamlessly combining real-time route adaptation with energy-efficient decision making, the proposed system supports scalable and sustainable EV fleet operations. The ability to dynamically optimize travel paths ensures minimal energy consumption while maintaining high operational efficiency. Experimental validation confirms that this approach not only improves EV navigation and obstacle avoidance but also significantly contributes to reducing emissions and enhancing the long-term viability of smart EV fleets in rapidly changing environments. Full article

Coal gangue (CG) is one of the most frequent solid wastes in the world, and it poses a severe hazard to both human society and natural ecosystems. In light of the progressive increase in environmental awareness and the unavoidable trend of the requirements of a sustainable development plan, how to efficiently use these vast quantities of CG has become an important subject in China. Concrete aggregate, which can not only solve environmental pollution but also compensate for the scarcity of natural gravel and sand resources, is the most cost-effective and eco-friendly way to utilize CG resources in accordance with the strategic requirements of green and sustainable development. However, how to deal with the preparation of high-quality gangue aggregate needs to be targeted research; blindly using gangue for concrete may bring some safety hazards. This requires that based on the source, distribution, storage, chemical composition, mineral composition of the gangue and the problems in the utilization process, efforts are made to open up the key routes of gangue concrete utilization, and to provide theoretical guidance for the high-value and environmentally friendly utilization of the CG. This paper summarizes the CG aggregate characteristics and its impact on concrete performance, discusses the technical means to improve the performance of CG aggregate concrete, and analyzes if the current CG aggregate in the concrete application of the problem still exists, with a view to gradually realize the CG of low-energy consumption bulk utilization. The popularization and application of CG aggregate will accelerate the solution of the environmental pollution problem it brings, and can to a certain extent alleviate the current situation in that the supply of natural sand and gravel resources is insufficient to meet the demand; the sustainable development of today’s research on CG aggregate for concrete has important environmental and economic significance. Full article