Simulation-based Implementation Research Articles

Moisture Computing-Based Internet of Vehicles (IoV) Architecture for Smart Cities.

Recently, the concept of combining ‘things’ on the Internet to provide various services has gained tremendous momentum. Such a concept has also impacted the automotive industry, giving rise to the Internet of Vehicles (IoV). IoV enables Internet connectivity and communication between smart vehicles and other devices on the network. Shifting the computing towards the edge of the network reduces communication delays and provides various services instantly. However, both distributed (i.e., edge computing) and central computing (i.e., cloud computing) architectures suffer from several inherent issues, such as high latency, high infrastructure cost, and performance degradation. We propose a novel concept of computation, which we call moisture computing (MC) to be deployed slightly away from the edge of the network but below the cloud infrastructure. The MC-based IoV architecture can be used to assist smart vehicles in collaborating to solve traffic monitoring, road safety, and management issues. Moreover, the MC can be used to dispatch emergency and roadside assistance in case of incidents and accidents. In contrast to the cloud which covers a broader area, the MC provides smart vehicles with critical information with fewer delays. We argue that the MC can help reduce infrastructure costs efficiently since it requires a medium-scale data center with moderate resources to cover a wider area compared to small-scale data centers in edge computing and large-scale data centers in cloud computing. We performed mathematical analyses to demonstrate that the MC reduces network delays and enhances the response time in contrast to the edge and cloud infrastructure. Moreover, we present a simulation-based implementation to evaluate the computational performance of the MC. Our simulation results show that the total processing time (computation delay and communication delay) is optimized, and delays are minimized in the MC as apposed to the traditional approaches.

A Heuristics-Based Cost Model for Scientific Workflow Scheduling in Cloud

Scientific Workflow Applications (SWFAs) can deliver collaborative tools useful to researchers in executing large and complex scientific processes. Particularly, Scientific Workflow Scheduling (SWFS) accelerates the computational procedures between the available computational resources and the dependent workflow jobs based on the researchers’ requirements. However, cost optimization is one of the SWFS challenges in handling massive and complicated tasks and requires determining an approximate (near-optimal) solution within polynomial computational time. Motivated by this, current work proposes a novel SWFS cost optimization model effective in solving this challenge. The proposed model contains three main stages: (i) scientific workflow application, (ii) targeted computational environment, and (iii) cost optimization criteria. The model has been used to optimize completion time (makespan) and overall computational cost of SWFS in cloud computing for all considered scenarios in this research context. This will ultimately reduce the cost for service consumers. At the same time, reducing the cost has a positive impact on the profitability of service providers towards utilizing all computational resources to achieve a competitive advantage over other cloud service providers. To evaluate the effectiveness of this proposed model, an empirical comparison was conducted by employing three core types of heuristic approaches, including Single-based (i.e., Genetic Algorithm (GA), Particle Swarm Optimization (PSO), and Invasive Weed Optimization (IWO)), Hybrid-based (i.e., Hybrid-based Heuristics Algorithms (HIWO)), and Hyper-based (i.e., Dynamic Hyper-Heuristic Algorithm (DHHA)). Additionally, a simulation-based implementation was used for SIPHT SWFA by considering three different sizes of datasets. The proposed model provides an efficient platform to optimally schedule workflow tasks by handling data-intensiveness and computational-intensiveness of SWFAs. The results reveal that the proposed cost optimization model attained an optimal Job completion time (makespan) and total computational cost for small and large sizes of the considered dataset. In contrast, hybrid and hyper-based approaches consistently achieved better results for the medium-sized dataset.

Online Path Generation and Navigation for Swarms of UAVs

With the growing popularity of unmanned aerial vehicles (UAVs) for consumer applications, the number of accidents involving UAVs is also increasing rapidly. Therefore, motion safety of UAVs has become a prime concern for UAV operators. For a swarm of UAVs, a safe operation cannot be guaranteed without preventing the UAVs from colliding with one another and with static and dynamically appearing, moving obstacles in the flying zone. In this paper, we present an online, collision-free path generation and navigation system for swarms of UAVs. The proposed system uses geographical locations of the UAVs and of the successfully detected, static, and moving obstacles to predict and avoid the following: (1) UAV-to-UAV collisions, (2) UAV-to-static-obstacle collisions, and (3) UAV-to-moving-obstacle collisions. Our collision prediction approach leverages efficient runtime monitoring and complex event processing (CEP) to make timely predictions. A distinctive feature of the proposed system is its ability to foresee potential collisions and proactively find best ways to avoid predicted collisions in order to ensure safety of the entire swarm. We also present a simulation-based implementation of the proposed system along with an experimental evaluation involving a series of experiments and compare our results with the results of four existing approaches. The results show that the proposed system successfully predicts and avoids all three kinds of collisions in an online manner. Moreover, it generates safe and efficient UAV routes, efficiently scales to large-sized problem instances, and is suitable for cluttered flying zones and for scenarios involving high risks of UAV collisions.

Infective flooding in low-duty-cycle networks, properties and bounds

Flooding information is an important function in many networking applications. In some networks, as wireless sensor networks or some ad-hoc networks it is so essential as to dominate the performance of the entire system. Exploiting some recent results based on the distributed computation of the eigenvector centrality of nodes in the network graph and classical dynamic diffusion models on graphs, this paper derives a novel theoretical framework for efficient resource allocation to flood information in mesh networks with low duty-cycling without the need to build a distribution tree or any other distribution overlay. Furthermore, the method requires only local computations based on each node neighborhood. The model provides lower and upper stochastic bounds on the flooding delay averages on all possible sources with high probability. We show that the lower bound is very close to the theoretical optimum. A simulation-based implementation allows the study of specific topologies and graph models as well as scheduling heuristics and packet losses. Simulation experiments show that simple protocols based on our resource allocation strategy can easily achieve results that are very close to the theoretical minimum obtained building optimized overlays on the network.

A Probabilistic Traffic-Theoretic Network Loading Model Suitable for Large-Scale Network Analysis

This paper formulates an analytical stochastic network loading model. It is a stochastic formulation of the link transmission model (LTM), which itself is an operational formulation of Newell’s simplified theory of kinematic waves. The proposed model builds on an existing initial model. It proposes a formulation with enhanced scalability. In particular, compared with the initial model, it has a complexity that is linear rather than cubic in the link’s space capacity. This makes it suitable for large-scale network analysis. The model is validated versus a simulation-based implementation of the stochastic LTM. The proposed model yields significant gains in computational efficiency while preserving accuracy. The validation experiments illustrate how computational run times of the proposed model increase linearly with the link’s space capacity, while the initial model has an exponential increase in run times. The proposed model yields accurate distributional approximations of the link’s boundary conditions. It is used to address a probabilistic formulation of a citywide signal control problem. The model is shown to be robust to the quality of the initial signal plans. It yields signal plans that systematically outperform both initial plans, as well as a plan derived by widely used commercial signal control software. The model is suitable for large-scale network optimization. The online appendix is available at https://doi.org/10.1287/trsc.2017.0804 .

Gap-based transit assignment algorithm with vehicle capacity constraints: Simulation-based implementation and large-scale application

This paper presents a gap-based solution method for the time-dependent transit assignment problem with vehicle capacity constraints. A two-level, simulation-based methodology is proposed, which finds the least cost hyperpaths at the upper level and performs the assignment of transit travelers on the hyperpaths at the lower level. The detailed simulation of travelers and vehicles at the lower level allows modelers to capture transit network complexities such as transfers/missed connections, receiving a seat/standing and boarding/being rejected to board. This ‘hard’ implementation of vehicle capacity constraints at the lower level is aggregated into ‘soft constraints’ at the upper level for the least cost hyperpath calculation. Using a gap-based assignment procedure, user equilibrium is reached on large-scale networks in a computationally efficient manner. The algorithm is tested on the large-scale Chicago Transit Authority network. The gap-based approach outperforms the commonly used method of successive averages approach in terms of rate of convergence and quality of results. Furthermore, sensitivity analyses with respect to network parameters illustrate the robustness of the proposed two-level solution procedure.

Self-Adaptive Context Data Distribution with Quality Guarantees in Mobile P2P Networks

Recent advances in wireless technologies and mobile computing are opening brand new opportunities for context-aware services, namely services able to tailor their behavior according to current execution context. Starting from the core assumption that only effective and efficient context distribution can pave the way to the deployment of truly context-aware services, this paper proposes a novel Peer-to-Peer (P2P) model and distributed architecture for context distribution in densely populated mobile systems. The primary guideline is to exploit agreed quality parameters on context distribution (mainly, delivery time and context freshness) and system-level monitoring information dynamically gathered, to take proper management decisions able to foster high scalability and low additional overhead. Our solution monitors both its own local components status and distributed run-time conditions to introduce two main self-adaptive capabilities, namely self-configuration and self-optimization. While the former lets our system automatically select data sending rates with no user intervention, the latter allows to reach better run-time performance by dynamically adjusting system components. The paper reports also several significant results, based on both a simulation-based implementation and a real-world prototype, showing that our solution can grant timely and efficient context delivery and dynamically achieves agreed quality levels with good quality-overhead tradeoff.

Modelling of a self-led critical friend topology in inter-cooperative grid communities

For decades, much work has been done to increase the effectiveness and efficiency of job sharing amongst available computational resources. Resources can be organized into a variety of topologies, and recent work has shown that a decentralized distributed resource topology is a crucial but complicated scenario. This is because decentralized resources are normally grouped into independent virtual organizations (VOs) and isolated from each other by VO boundaries. To convey jobs across gaps between various virtual organizations, a novel resource topology called the self-led critical friend model (CFM) is proposed in this work. The CFM deals with trust credits between resources according to their historical collaboration records. This trust reveals a feasible, realistic, and transferable correlation to facilitate the resource selection process for job delegation between arbitrarily connected physical resources. Consequently, the CFM is able to overcome the constraints caused by virtual organization boundaries. Besides the theoretical model, a simulation-based implementation is carried out together with a complementary high-level community-aware scheduling protocol. After evaluating a number of compositional scenarios and criteria objectives, the observed results show the benefit of job scheduling across multiple VOs, as well as the capability of the self-led critical friend model as a novel cross-VO resource topology to represent and interconnect resources.