Latency Requirements Research Articles

RaNAS: Resource-Aware Neural Architecture Search for Edge Computing

Neural architecture search (NAS) for edge devices is often time-consuming because of long-latency deploying and testing on edge devices. The ability to accurately predict the computation cost and memory requirement for convolutional neural networks (CNNs) in advance holds substantial value. Existing work primarily relies on analytical models, which can result in high prediction errors. This paper proposes a resource-aware NAS (RaNAS) model based on various features. Additionally, a new graph neural network is introduced to predict inference latency and maximum memory requirements for CNNs on edge devices. Experimental results show that, within the error bound of ±1%, RaNAS achieves an accuracy improvement of approximately 8% for inference latency prediction and about 25% for maximum memory occupancy prediction over the state-of-the-art approaches.

Energy-efficient time and cost constraint scheduling algorithm using improved multi-objective differential evolution in fog computing

The recent surge in Internet of Things (IoT) applications and smart devices has led to a substantial rise in the data generation. One of the major issues involved is to meet strict quality of service (QoS) requirements for computing these applications in terms of execution time, cost and in an energy-efficient manner. To extract useful information, fast processing and analysis of data is needed. Consequently, moving all the data to centralized cloud data centers would lead to high processing times, increased cost and energy consumption and more bandwidth usage; thus, processing of applications with strict latency requirements becomes challenging. The addition of fog layer between cloud and IoT devices has provided promising solutions to such issues. However, efficient employment of computing resources in the hybrid infrastructure of fog and cloud nodes is of great significance and demands an optimal scheduling strategy. Toward this direction, a novel Pareto-based algorithm in fog computing, namely energy-efficient time and cost (ETC) constraint scheduling algorithm, is introduced in this paper for scheduling workflow applications. ETC attempts to optimize monetary cost along with time and energy objectives. Improved multi-objective differential evolution (I-MODE) meta-heuristic is introduced and incorporated with deadline-aware stepwise frequency scaling approach that is based on our previously proposed energy makespan multi-objective optimization (EM-MOO) algorithm. Synthetic and real-world application workflows are used to conduct evaluation of the proposed work with existing well-known algorithms from the literature. The experimental results for synthetic workflows reveal that the proposed algorithm lessens energy utilization by 14–21%, execution time by almost 25% and cost consumption by 22–27%, while for real-world application workflows, energy consumption is reduced by 12–24%, execution time by 14–16% and cost consumption by 23–29%.

Enhancing Urban Surveillance with Fog Computing, Mobile Cloud, and Big Data Analytics in 5G Networks

The new emerging applications in 5G network, in the context of the Internet of Everything (IoE), will introduce high mobility, high scalability, real-time, and low latency requirements that raise new challenges on the services being provided to the users. Fortunately, Fog Computing and Cloud Computing, with their service orchestration mechanisms offer virtually unlimited dynamic resources for computation, storage and service provision, that will effectively cope with the requirements of the forthcoming services. 5G will use the benefits of centralized high performance computing cloud centers, cloud and fog RANs and distributed peer-to-peer mobile cloud that will create opportunities for companies to deploy many new real-time services that cannot be delivered over current mobile and wireless networks. This paper evaluates a model for fog and cloud hybrid environment service orchestration mechanisms for 5G network in terms of energy efficiency per user for different payloads.

Performance Analysis and Prediction of 5G Round-Trip Time Based on the VMD-LSTM Method

With the increasing level of industrial informatization, massive industrial data require real-time and high-fidelity wireless transmission. Although some industrial wireless network protocols have been designed over the last few decades, most of them have limited coverage and narrow bandwidth. They cannot always ensure the certainty of information transmission, making it especially difficult to meet the requirements of low latency in industrial manufacturing fields. The 5G technology is characterized by a high transmission rate and low latency; therefore, it has good prospects in industrial applications. To apply 5G technology to factory environments with low latency requirements for data transmission, in this study, we analyze the statistical performance of the round-trip time (RTT) in a 5G-R15 communication system. The results indicate that the average value of 5G RTT is about 11 ms, which is less than the 25 ms of WIA-FA. We then consider 5G RTT data as a group of time series, utilizing the augmented Dickey–Fuller (ADF) test method to analyze the stability of the RTT data. We conclude that the RTT data are non-stationary. Therefore, firstly, the original 5G RTT series are subjected to first-order differencing to obtain differential sequences with stronger stationarity. Then, a time series analysis-based variational mode decomposition–long short-term memory (VMD-LSTM) method is proposed to separately predict each differential sequence. Finally, the predicted results are subjected to inverse difference to obtain the predicted value of 5G RTT, and a predictive error of 4.481% indicates that the method performs better than LSTM and other methods. The prediction results could be used to evaluate network performance based on business requirements, reduce the impact of instruction packet loss, and improve the robustness of control algorithms. The proposed early warning accuracy metrics for control issues can also be used to indicate when to retrain the model and to indicate the setting of the control cycle. The field of industrial control, especially in the manufacturing industry, which requires low latency, will benefit from this analysis. It should be noted that the above analysis and prediction methods are also applicable to the R16 and R17 versions.

Fuzzy-based task offloading in Internet of Vehicles (IoV) edge computing for latency-sensitive applications

As vehicular applications continue to evolve, the computational capabilities of individual vehicles alone are no longer sufficient to meet the increasing demands. This has led to the integration of edge computing in the Internet of Vehicles (IoV) as an essential solution. Due to the limited resources within vehicles, there is often a need to offload tasks to edge nodes. However, task offloading in IoV environments presents several challenges, including high mobility, dynamic network topology, and varying node density. Traditional offloading methods fail to effectively address these challenges. Moreover, tasks differ in importance, necessitating a mechanism for edge nodes to prioritize tasks based on their urgency. To overcome these challenges, we propose a Vehicle-to-Vehicle (V2V) fuzzy-based task offloading scheme. In this scheme, fuzzy logic plays a critical role by enabling dynamic prioritization of tasks based on their urgency and the available computational resources at edge nodes, ensuring intelligent, context-aware decision-making. The user vehicle selects an appropriate edge node using an edge selection mechanism, which guarantees prolonged connection time and sufficient computational resources. Tasks at the edge are then organized based on their latency requirements and evaluated using a fuzzy rule-based inference system. Our simulation results demonstrate improved task execution rates, reduced overall system delay, and minimized queuing delays.

Optimizing Key Value Indicators in Intent-Based Networks through Digital Twins aided service orchestration mechanisms

For many years, the orchestration of network resources and services has been addressed by considering homogeneous communication infrastructures and simple Service Level Agreements (SLAs), generally defined through a list of traditional Key Performance Indicators (KPIs). Unfortunately, state-of-the-art solutions risk being quite ineffective for future telecommunication systems. Beyond 5G networks, for instance, are emerging as complex and heterogeneous ecosystems where resources belonging to diverse network domains with evolving capabilities can be dynamically exposed to support much more complex and cross-domain services and applications. At the same time, SLAs will be defined by also considering novel performance demands, including security, economic, and environmental needs. Based on these premises, this work proposes a novel orchestration strategy designed to fulfill service requirements expressed through Key Value Indicators (KVIs), while combining the potentials of both Network Digital Twins and Intent-Based Networking. Leveraging insights from Network Digital Twins, multiple service orchestration options are explored to optimize resource utilization. Simultaneously, Intent-Based Networking is adopted to streamline network management via intents, specifying Beyond 5G requirements through KPIs and KVIs. An optimal orchestration scheme has been conceived through a multi-criteria decision-making algorithm and a many-to-many matching game between domains and service requests mapped into intents, aiming to minimize SLA violations over time. The performance of the conceived solution has been investigated through computer simulations in realistic scenarios. The obtained results clearly highlight its effectiveness and demonstrate that it is able to reduce SLA violations (related to latency, throughput, costs, and cyber risk requirements) by up to 22.44% compared to other baseline techniques.

Dynamic Resource Allocation and Offloading Optimization for Network Slicing in B5G Multi-tier Multi-tenant Systems

For differentiating and customizing different types of flows guaranteeing individual 5QI QoS requirements, 5G and Beyond 5G (B5G) first specify several key technologies, e.g., 1) virtualizing radio resources, network functions and network servers, 2) network slicing, 3) Service Function Chaining (SFC) and flow steering, etc. Furthermore, for reducing E2E delay and path/link traffic congestion for diverse flowing while accessing cloud computing, Multi-access Edge Computing (MEC) is specified in 5G/B5G ETSI. Although several extensively related studies discussed network slicing, SFC and MEC, they seldom consider both resource allocation and traffic offloading in a tenant efficiently, simultaneously. Thus, for efficiently addressing above critical issues, three motivations are proposed, including 1) to dynamically allocate resource for B5G with multi-tier multi-tenant networking, 2) to propose adaptively vertical and horizontal offloading to the computing node for diverse types of flows, and 3) to minimize the blocking rate while guaranteeing the delay constraint. Two novel efficient algorithms are proposed: Fast Latency Decrease Resource Allocation (FLDRA) and Minimum Cost Resource Allocation (MCRA). These two proposed algorithms achieve dynamic E2E resource allocation and optimal vertical and horizontal offloading to the computing node while guaranteeing the E2E latency and 5QI QoS requirements for different types of flows. Numerical results demonstrate that FLDRA minimizes resource allocation while MCRA balances the loading of resource availability. The proposed algorithms of FLDRA and MCRA significantly outperform the compared approaches in blocking rates. Moreover, the proposed MCRA algorithm yields the highest resource utilization, the least network delay, etc.

Self-aware collaborative edge inference with embedded devices for IIoT

Edge inference and other compute-intensive industrial Internet of Things (IIoT) applications suffer from a bad quality of experience due to the limited and heterogeneous computing and communication resources of embedded devices. To tackle these issues, we propose a model partitioning-based self-aware collaborative edge inference framework. Specifically, the device can adaptively adjust the local model inference scheme by sensing the available computing and communication resources of surrounding devices. When the inference latency requirement cannot be met by local computation, the model should be partitioned for collaborative computation on other devices to improve the inference efficiency. Furthermore, for two typical IIoT scenarios, i.e., bursting and stacking tasks, the latency-aware and throughput-aware collaborative inference algorithms are designed, respectively. Via jointly optimizing the partition layer and collaborative device selection, the optimal inference efficiency, characterized by minimum inference latency and maximum inference throughput, can be obtained. Finally, the performance of our proposal is validated through extensive simulations and tests conducted on 10 Raspberry Pi 4Bs using popular models. Specifically, in the case of two collaborative devices, our platform reaches up to 92.59% latency reduction for bursting tasks and 16.19× throughput growth for stacking tasks. In addition, the divergence between simulations and tests ranges from 1.64% to 9.56% for bursting tasks and from 3.24% to 11.24% for stacking tasks, which indicates that the theoretical performance analyses are solid. For the general case where the data privacy is not considered and the number of collaborative devices is optimally determined, up to 14.76× throughput speed up and 84.04% latency reduction can be obtained.

Canalis: A Throughput-Optimized Framework for Real-Time Stream Processing of Wireless Communication

Stream processing, which involves real-time computation of data as it is created or received, is vital for various applications, specifically wireless communication. The evolving protocols, the requirement for high-throughput, and the challenges of handling diverse processing patterns make it demanding. Traditional platforms grapple with meeting real-time throughput and latency requirements due to large data volume, sequential and indeterministic data arrival, and variable data rates, leading to inefficiencies in memory access and parallel processing. We present Canalis, a throughput-optimized framework designed to address these challenges, ensuring high-performance while achieving low energy consumption. Canalis is a hardware-software co-designed system. It includes a programmable spatial architecture, FluxSPU (Flux Stream Processing Unit), proposed by this work to enhance data throughput and energy efficiency. FluxSPU is accompanied by a software stack that eases the programming process. We evaluated Canalis with eight distinct benchmarks. When compared to CPU and GPU in mobile SoC to demonstrate the effectiveness of domain specialization, Canalis achieves an average speedup of 13.4× and 6.6×, and energy savings of 189.8× and 283.9×, respectively. In contrast to equivalent ASICs of the benchmarks, the average energy overhead of Canalis is within 2.4×, successfully maintaining generalizations without incurring significant overhead.

RL-based mobile edge computing scheme for high reliability low latency services in UAV-aided IIoT networks

The prevailing adoption of Internet of Things paradigm is giving rise to a wide range of use cases in various vertical industries including remote health, industrial automation, and smart agriculture. However, the realization of such use cases is mainly challenged due to their stringent service requirements of high reliability and low latency. This challenge grows further when the service entails processing collected data for informed decision making. In this work, we consider a field of industrial Internet of Things devices that generate computational tasks and are covered by a nearby base station equipped with an edge server. The edge server offers fast processing to the devices’ tasks to help in meeting their latency requirement. Due to statistical wireless variability, the task data may not be correctly delivered in time for processing. To this end, we utilize an unmanned aerial vehicle as a supplemental edge server that tailors its trajectory and flies closer to the IIoT devices to ensure a highly reliable task delivery based on the given task reliability constraints. We formulate the problem as a Markov Decision Process, and propose a deep reinforcement learning-based approach using proximal policy optimization to optimize the unmanned aerial vehicle trajectory and scheduling devices to offload their data for processing. We present simulation results for various system scenarios to illustrate the effectiveness of the proposed solution as compared to several baseline approaches.

Full duplex based collision detection to enhance the V2X sidelink autonomous mode

The Third Generation Partnership Project (3GPP) recently introduced the fifth-generation (5G) new radio (NR) sidelink to enable vehicle-to-everything (V2X) communications supporting advanced safety services. Nevertheless, improvements over the previous generation still pose challenges to meet the reliability and latency requirements of V2X communications, particularly in the allocation of distributed resources, i.e., Mode 2. In Mode 2, vehicles autonomously select radio resources for their message transmissions and can maintain the selected resources for a given reservation period to efficiently handle periodic data traffic. However, potential collisions during this period may remain undetected due to half-duplex communications and unacknowledged broadcast transmissions, resulting in persistent message losses and posing a threat to road safety. This paper aims to improve the 5G NR-V2X sidelink for systems beyond 5G-Advanced by exploiting full-duplex transceivers. We propose a novel medium access control (MAC) scheme where vehicles can detect collisions while transmitting, dynamically adapt the collision detection threshold according to the measured channel load, and react to detected collisions through appropriate resource reselection and retransmission procedures. Extensive simulations conducted under various settings show that this MAC scheme brings substantial performance gains in terms of reliability and latency, compared to the current legacy Mode 2 procedure and a benchmark full-duplex scheme from the literature.

Analyzing AWS Edge Computing Solutions to Enhance IoT Deployments

This paper explores integrating Internet of Things (IoT) deployments with edge computing, focusing on Amazon Web Services (AWS) as a key facilitator. It provides an analysis of AWS IoT services and their integration with edge computing technologies, addressing challenges, and practical applications across industries, and outlining future research directions. IoT and edge computing revolutionize data processing by enabling real-time analytics, reduced latency, and enhanced operational efficiency. IoT involves interconnected devices autonomously gathering and exchanging data, while edge computing processes data near its source, decentralizing data processing and minimizing data transmission to centralized servers. AWS facilitates scalable and secure infrastructures for IoT and edge computing. AWS IoT Core manages IoT device connectivity and data ingestion, AWS Greengrass extends AWS capabilities to edge devices, and AWS Lambda enables serverless computing, empowering efficient deployment and scaling of IoT applications. Centralized cloud architectures often struggle with vast IoT data. Edge computing decentralizes data processing, reducing latency, enhancing real-time capabilities, and minimizing bandwidth. AWS ensures secure device connectivity through AWS IoT Core, supporting various protocols for seamless integration with IoT devices. AWS Greengrass allows local data processing and machine learning at the edge, vital for environments with limited connectivity or stringent latency requirements. AWS Lambda supports serverless computing, enabling scalable, event-driven architectures without server management, crucial for fluctuating IoT workloads. In conclusion, AWS advances IoT capabilities at the edge, with practical implementations across industries. As IoT evolves, AWS remains pivotal, innovating to meet dynamic IoT deployment demands.

Enhancing Visual Homing in Robotics: A Study on Blockchain Integration and Consensus Algorithms

Creating an immutable repository for vital robot and environmental data, ensuring long-term accessibility, and functioning in the absence of GPS or mapping are crucial for visual homing navigation systems. We focus on the intersection of blockchain and robotics, particularly in visual homing. Our research involves an in-depth analysis of various blockchain consensus mechanisms, highlighting their suitability for visual homing applications. The heart of blockchain functionality lies in its consensus mechanism, which facilitates agreement among network nodes. In our first study part, we conduct a comprehensive comparative analysis of key consensus algorithms, emphasizing visual homing's decentralization, fault tolerance, latency, and throughput requirements. This analysis serves as a valuable reference for researchers and developers, emphasizing the importance of aligning the chosen consensus mechanism with specific blockchain application needs. The second part of our work involves extensive experiments exploring the connection between blockchain and visual homing. We assess prominent consensus mechanisms like Proof of Work (PoW), Proof of Stake (PoS), Delegated Proof of Stake (DPoS), and Proof of Authority (PoA) within a virtual environment in Gazebo, leveraging Wide Area Visual Navigation (WAVN). Our research implementation is grounded in the ROS framework and the Gazebo simulation environment.

Joint computation offloading and resource allocation for end-edge collaboration in internet of vehicles via multi-agent reinforcement learning

Vehicular edge computing (VEC), a promising paradigm for the development of emerging intelligent transportation systems, can provide lower service latency for vehicular applications. However, it is still a challenge to fulfill the requirements of such applications with stringent latency requirements in the VEC system with limited resources. In addition, existing methods focus on handling the offloading task in a certain time slot with statically allocated resources, but ignore the heterogeneous tasks’ different resource requirements, resulting in resource wastage. To solve the real-time task offloading and heterogeneous resource allocation problem in VEC system, we propose a decentralized solution based on the attention mechanism and recurrent neural networks (RNN) with a multi-agent distributed deep deterministic policy gradient (AR-MAD4PG). First, to address the partial observability of agents, we construct a shared agent graph and propose a periodic communication mechanism that enables edge nodes to aggregate information from other edge nodes. Second, to help agents better understand the current system state, we design an RNN-based feature extraction network to capture the historical state and resource allocation information of the VEC system. Thirdly, to tackle the challenges of excessive joint observation-action space and ineffective information interference, we adopt the multi-head attention mechanism to compress the dimension of the observation-action space of agents. Finally, we build a simulation model based on the actual vehicle trajectories, and the experimental results show that our proposed method outperforms the existing approaches.

Towards Collaborative Edge Intelligence: Blockchain-Based Data Valuation and Scheduling for Improved Quality of Service

Collaborative edge intelligence, a distributed computing paradigm, refers to a system where multiple edge devices work together to process data and perform distributed machine learning (DML) tasks locally. Decentralized Internet of Things (IoT) devices share knowledge and resources to improve the quality of service (QoS) of the system with reduced reliance on centralized cloud infrastructure. However, the paradigm is vulnerable to free-riding attacks, where some devices benefit from the collective intelligence without contributing their fair share, potentially disincentivizing collaboration and undermining the system’s effectiveness. Moreover, data collected from heterogeneous IoT devices may contain biased information that decreases the prediction accuracy of DML models. To address these challenges, we propose a novel incentive mechanism that relies on time-dependent blockchain records and multi-access edge computing (MEC). We formulate the QoS problem as an unbounded multiple knapsack problem at the network edge. Furthermore, a decentralized valuation protocol is introduced atop blockchain to incentivize contributors and disincentivize free-riders. To improve model prediction accuracy within latency requirements, a data scheduling algorithm is given based on a curriculum learning framework. Based on our computer simulations using heterogeneous datasets, we identify two critical factors for enhancing the QoS in collaborative edge intelligence systems: (1) mitigating the impact of information loss and free-riders via decentralized data valuation and (2) optimizing the marginal utility of individual data samples by adaptive data scheduling.

Optimizing energy efficiency in mobile edge computing: Leveraging latency-aware offloading, clustering, and UAV placement strategies

In the context of next-generation 5G and beyond communication networks, integrating Unmanned Aerial Vehicles (UAVs) with Mobile Edge Computing (MEC) is crucial. Hybrid Non-orthogonal Multiple Access (H-NOMA) has been recognized as a prominent technique for reducing energy consumption during data offloading. However, the literature assumes that all users in the cluster have latency requirements and interference levels such that implementing H-NOMA is optimal, overlooking other scenarios. Furthermore, the position of UAV-hosted MEC is not optimized. To address these constraints, we propose an adaptive offloading method where users can utilize either H-NOMA or OMA for data offloading in designated time slots based on their conditions. We substantiate this proposal through a comparative analysis of energy consumption between H-NOMA and OMA. Additionally, we introduce a novel Maximum Latency Difference Clustering and Power Allocation (MLDC & PA) algorithm for organizing smart terminals (STs) and allocating power. Furthermore, we propose a heuristic-based optimization approach for UAV positioning to minimize offloading energy and enhance network efficiency. Simulation results confirm that the proposed approach has superior energy consumption reduction capabilities compared to state-of-the-art techniques.

Joint optimization of offloading strategy and resource allocation for multi-user in dynamic vehicular edge computing systems

Internet of Vehicles (IoV) relies heavily on its computing capability to facilitate various vehicular applications. Since the cloud computing or mobile edge computing (MEC) only cannot satisfy the latency requirement due to the limitation of the resource coverage, the cloud–edge-end cooperative computing has become an emerging paradigm. A comprehensive IoV architecture is considered and a joint optimization problem is formulated to minimize the system function value. To optimize the resource allocation and the task offloading strategy, the simulated spring system algorithm (SSSA) is designed where the initial problem is decoupled into two sub-problems with priority. The first one is to allocate computing resources based on KKT conditions, thus the individual optimal solution is achieved. The second one is solved based on the idea of simulated spring system such that the task offloading strategy is obtained. Two sub-problems iterate mutually to update each other until finishing the binary tree traversal. Thus, the proposed solution adapts to various conditions and the computational complexity is also reduced compared with traditional methods. Simulation verifies that the proposed algorithm reduces the maximum system function value by about 31% compared with the benchmark methods and performs efficiently in various road conditions.

Parallel Implementation of K-Best Quadrature Amplitude Modulation Detection for Massive Multiple Input Multiple Output Systems

Massive MIMO (Multiple Input Multiple Output) systems impose significant processing burdens along with strict latency requirements. The combination of large-scale antenna arrays and wide bandwidth requirements for next-generation wireless systems creates an exponential increase in frontend to backend data. Balancing the processing latency and reliability is critical for baseband processing tasks such as QAM detection. While linear detection algorithms have low computational complexity, their use in Massive MIMO scenario has heavy degradation in error performance. Nonlinear detection methods such as Maximum Likelihood and Sphere Decoding have good error performance, but they suffer from high, variable, and uncontrollable computational complexity. For such cases, the K-best QAM detection algorithm can provide required control over the system performance while maintaining near-ML error performance. In this paper, hard-output, as well as soft-output K-best QAM detection, is implemented in a CPU by utilizing the multiple cores combined with vector processing. Similarly, hard-output detection in a GPU is implemented by leveraging the SIMD (Single Instruction, Multiple Data) architecture and Warp-based execution model. The processing time per bit and the energy consumption per bit are compared for CPU and GPU implementations for QAM constellation density and MIMO array size. The GPU implementation shows up to 5× processing latency per bit improvement and up to 120× energy consumption per bit improvement over the CPU implementation for typical QAM constellations such as 4, 16, and 64 QAM. GPU implementation also shows up to 125× improvement over CPU implementation in energy consumption per bit for larger MIMO configurations such as 24 × 24 and 32 × 32. Finally, the soft-output detector is combined with a LDPC (Low-Density Parity Check) decoder to obtain the FER (Frame Error Rate) performance for CPU implementation. The FER is then combined with frame processing latency to form a Goodput metric to demonstrate the latency and reliability tradeoff.

EDGE AI BASED OBJECT DETECTION SYSTEM USING TFLITE

Edge computing has gained prominence in recent years due to its ability to process data closer to the source, reducing latency and bandwidth requirements. In this paper, we propose an Edge AI Based Object Detection System using TensorFlow Lite (TFLite), designed to perform real-time object detection on resource-constrained edge devices. The system leverages the efficiency and portability of TFLite, a lightweight framework for deploying machine learning models on edge devices, to enable efficient inference without relying on cloud connectivity. Our proposed system integrates state-of-the-art object detection models, such as SSD (Single Shot Multibox Detector) and YOLO (You Only Look Once), into the TFLite runtime environment. Through optimization techniques such as model quantization, pruning, and architecture modifications, we tailor these models to meet the computational and memory constraints of edge devices while maintaining high detection accuracy. Furthermore, we explore hardware acceleration options, including GPU and DSP (Digital Signal Processor), to further enhance inference speed and energy efficiency. We evaluate the performance of the Edge AI Based Object Detection System on various edge devices, including smartphones, IoT (Internet of Things) devices, and embedded systems. Real-world deployment scenarios are considered, encompassing applications such as smart surveillance, industrial automation, and autonomous vehicles. The results demonstrate the system's ability to achieve real-time object detection with low latency and minimal resource consumption, making it well-suited for edge computing environments where real-time responsiveness and privacy are paramount concerns. Keywords: object Detection, Machine Learning, Tensor Flow lite, deep learning.

Provision for Energy: A Resource Allocation Problem in Federated Learning for Edge Systems

The article explores an energy-efficient method for allocating transmission and computation resources for federated learning (FL) on wireless communication networks. The model being considered involves each user training a local FL model using their limited local computing resources and the data they have collected. These local models are then transmitted to a base station, where they are aggregated and broadcast back to all users. The level of accuracy in learning, as well as computation and communication latency, are determined by the exchange of models between users and the base station. Throughout the FL process, energy consumption for both local computation and transmission must be taken into account. Given the limited energy resources of wireless users, the communication problem is formulated as an optimization problem with the goal of minimizing overall system energy consumption while meeting a latency requirement. To address this problem, we propose an iterative algorithm that takes into account factors such as bandwidth, power, and computational resources. Results from numerical simulations demonstrate that the proposed algorithm can reduce energy consumption compared to traditional FL methods up to 51% reduction.