Abstract

With advances in vehicular communications technology such as Vehicle-to-Infrastructure (V2I) and Vehicle-to-Vehicle (V2V), the computation of vehicular tasks has become distributed facilitated by computation offloading from the vehicular platform to road side units (RSUs) or the cloud infrastructure. In this work, due to communication overheads, we do not consider the cloud and only consider offloading horizontally across RSU nodes. However, the advantage of offloading depends upon how the tasks are scheduled across the RSUs. Unlike existing horizontal offloading works, this work explores the benefits of online task partitioned scheduling for computation offloading from multiple vehicles to RSUs or edge nodes. Specifically, we propose a new efficient timeslot-based online hybrid partitioned scheduling algorithm, which splits some tasks into subtasks and schedules them across RSU nodes while considering vehicle flow constraints. We compared and evaluated the effectiveness of our proposed hybrid partitioned scheduling algorithm with the fully partitioned algorithm. We also compared the performance of the aforementioned algorithms with an optimal scheduling algorithm utilizing several experiments conducted on a real-world vehicular dataset.

Abstract

Urbanization, driven by technological advancements, has brought about improved connectivity and efficiency, especially with the rise of Internet of Things (IoT) devices. Smart cities use these innovations to manage resources better and enhance resident’s quality of life. However, implementing smart city projects comes with challenges like monitoring, maintaining, and testing urban infrastructure. Digital Twin(DT) entails the connection of physical facilities or devices with their digital counterparts, facilitating real-time monitoring, manipulation, and predictive analysis of their behavior. This innovative concept offers a virtual replica of assets, processes and systems, enabling insights into their real-time performance and predictive behaviors. By simulating real-world scenarios, DT aids in planning maintenance activities and conducting comprehensive testing, thereby enhancing the resilience and efficiency of Smart City Systems. Particularly in the context of managing water networks, DT technology holds significant promise. Visualization capabilities provide intuitive insights, while actuation enables control actions based on predictive analytics and optimization algorithms. To this end, in this paper, we present the architecture of WaterTwin, a DT we developed for water quality networks in smart city systems. We demonstrate our approach through the use case of a water quality network in the smart city living lab of the IIIT Hyderabad campus.

Abstract

Edge server-assisted computation offloading enables vehicles to leverage server compute resources to deliver connected services, overcoming the limitations of onboard resources. Understanding the compute workloads of edge servers is crucial for effective resource management and scheduling, yet this task is challenging due to the complex interplay of factors such as vehicle mobility and computation offloading patterns. To address this, we propose an empirical analysis framework that systematically characterizes the compute workloads of edge servers. We begin by formalizing the relationships among three key aspects: local load (generated by vehicles), composite load (imposed on edge servers), and traffic flow (vehicle mobility patterns). Our framework then uses models of the local load and traffic flow as inputs to generate the composite loads on edge servers. Experiments were conducted by injecting between 600 and 5,000 vehicles per hour in two distinct geographical areas, New York City and Tampa. We provide a quantitative analysis demonstrating how the composite loads on edge servers vary with changes in traffic flows, geographical areas, and offloading patterns.

Abstract

Lane marker identification is crucial for developing Intelligent Transportation Systems and Autonomous Vehicles. While deep learning models excel in accuracy, their high com- putational requirements make them unsuitable for low-power edge devices. While various image-processing-based algorithms are used to pre-process images at different stages, there is a lack of an efficient algorithm specifically designed to enhance the lane-modeling stage. This paper proposes a two-stage pre- processing algorithm, consisting of a static phase and a dy- namic phase, to implement a divide-and-conquer approach for enhancing existing lane-modeling algorithms. The static phase generates an initial pixel label map and seed locations, while the dynamic phase uses the pre-processed input image and seed locations to generate a dynamic pixel map for localizing lane marking zones. Focusing on the center two lanes, the proposed method improves overall accuracy and recall, which is critical for capturing smaller lane details. Experimental results demonstrate the superior performance of the proposed two-stage algorithm compared to traditional HT and PHT methods, with the two- stage algorithm outperforming the standard HT(0.88 vs 0.92) and PHT(0.89 vs 0.95) in terms of Average Accuracy and Recall. Additionally, the two-stage PHT method significantly reduces power consumption compared to the Ultra Fast Lane Detection (UFLD) model, making it ideal for low-power edge devices like the Raspberry Pi 4B and Jetson Nano.

Abstract

This paper explores the critical issue of enhancing cybersecurity measures for low-cost, Wi-Fi-based Unmanned Aerial Vehicles (UAVs) against Distributed Denial of Service (DDoS) attacks. In the current work, we have explored three variants of DDoS attacks, namely Transmission Control Proto col (TCP), Internet Control Message Protocol (ICMP), and TCP + ICMPflooding attacks, and developed a detection mechanism that runs on the companion computer of the UAV system. As a part of the detection mechanism, we have evaluated various machine learning, and deep learning algorithms, such as XGBoost, Isolation Forest, Long Short-Term Memory (LSTM), Bidirectional-LSTM (Bi-LSTM), LSTM with attention, Bi LSTM with attention, and Time Series Transformer (TST) in terms of various classification metrics. Our evaluation reveals that algorithms with attention mechanisms outperform their counterparts in general, and TST stands out as the most efficient model with a run time of ∼0.1 seconds. TST has demonstrated an F1 score of 0.999, 0.997, and 0.943 for TCP, ICMP, and TCP + ICMP flooding attacks respectively. In this work, we present the necessary steps required to build an on board DDoS detection mechanism. Further, we also present the ablation study to identify the best TST hyperparameters for DDoS detection, and we have also underscored the advantage of adapting learnable positional embeddings in TST for DDoS detection with an improvement in F1 score from 0.94 to 0.99.

Abstract

Abstract—Safety-critical real-time systems are conventionally designed to meet specific hard real-time deadline requirements. Many applications in such systems consist of task chains, which exhibit complex temporal dependencies based on the activation rates of the tasks. As a result, there has been an increasing interest in analyzing the age of data (i.e., the time elapsed since the data was first updated) that propagates through the task chains as an important system performance parameter. Transient faults in safety-critical systems can lead to undesirable consequences. One of the most common methods used for fault tolerance in such systems is checkpointing. However, the interference due to checkpointing can significantly impact the data age, reducing the predictability of the system’s performance. This paper proposes an analytical framework for calculating the data age in real-time task chains with checkpointing for transient faults in both single-core and multi-core platforms. The proposed analysis has been validated by comparing it with extensive simulations of the execution of real-time task chain- based systems under faults. It shows comparable data age values with low time complexity.

Abstract

The advent of the Internet of Things (IoT) has ushered in transformative possibilities for smart cities, with the potential to revolutionize urban living through enhanced connectivity and data-driven decision-making. However, the effective realization of IoT in smart cities hinges upon the seamless interoperability of diverse devices and systems. To address this critical need, the oneM2M standards initiative has emerged as a foundational framework for IoT interoperability. In this research paper, we perform an exploratory analysis of three prominent open-source oneM2M based interoperability systems—Mobius, OM2M, and ACME. We leverage an existing large-scale system provided by our Smart City Living Lab deployed at IIIT Hyderabad, sprawling a 66-acre campus featuring over 370 nodes across eight verticals. We investigate the architectural characteristics of each solution, considering their strengths and limitations in facilitating IoT interoperability. Through this analysis, our paper aims to provide valuable insights for stakeholders seeking to implement IoT interoperability solutions in the context of smart cities. By evaluating the strengths and limitations of Mobius, OM2M, and ACME, we seek to offer guidance for selecting the most suitable solution. Our analysis reveals that the optimal framework choice depends on specific quality constraints: Mobius excels in performance, while ACME offers advantages in ease of setup for smaller-scale implementations.

Abstract

This paper introduces a novel approach for fault detection and localization in a motor of a Hexacopter UAV. The proposed two-stage architecture leverages Long Short-Term Memory (LSTM) networks for latent temporal feature extraction and Random Forest for localization. By combining them, we see improved fault detection and isolation performance. Our evaluations show the robustness of this approach in varying noise levels and real-world-like environments. Analysis of computational efficiency in rapid detection shows that the model identified faults within 2-5 time steps of the flight. Finally, we show that the proposed method surpasses classical statistical models and deep learning techniques in terms of overall accuracy (96.78%).

Abstract

Driving event recognition plays a crucial role in understanding and enhancing road safety. This research focuses on developing efficient time-series based models for Fall detection in two-wheelers. Traditional machine learning models proved inadequate in accurately classifying Fall scenarios due to their inability to capture temporal transitions in kinematic states. To address this limitation, time-series based Deep Learning (DL) models are proposed, utilizing Long Short-Term Memory (LSTM) networks. These networks enable direct learning from raw time series data, eliminating the need for manual feature engineering. Additionally, Bi-LSTMs were employed to capture contextual information from both past and future timesteps, further improving the model’s understanding of driving events. The architecture was enhanced with an attention mechanism to boost accuracy. Experimental results showcased that the proposed Bi-LSTM model achieved an overall accuracy of 97%, with a specific accuracy of approximately 92% in detecting Fall scenarios. This research contributes to the development of an accurate Time- series based system for Fall detection, facilitating improved road safety in the context of two-wheelers.

Abstract

With increasing connectivity and sophisticated software, modern vehicles are able to leverage different kinds of services provided by the environment. One such service recommended by the Automotive Edge Computing Consortium (AECC) is downloading high-definition map data by vehicles. This high volume of data can be provided to the vehicles when moving by pre-allocating resources on edge server nodes or roadside units if the routes are known apriori. However, this is not a realistic assumption to make in general. Therefore, in this work, we propose a two-stage optimization framework for efficient data delivery to connected vehicles via edge nodes while considering dynamic route changes. We have evaluated the efficiency of this proposed approach (considering a real-world dataset) with respect to (a) offline optimization strategies considering fixed routes and (b) a greedy approach considering route changes. Our proposed approach works considerably better than the existing approaches in the context of dynamic route changes.