Papers by muteb alshammari
Engineering, Technology and Applied science research/Engineering, Technology and Applied Science Research, Apr 2, 2024
International journal of interactive mobile technologies, Apr 23, 2024
Energy and environmental concerns have fostered the era of electric vehicles (EVs) to take over a... more Energy and environmental concerns have fostered the era of electric vehicles (EVs) to take over and be welcomed more than ever. Fuel-powered vehicles are still predominant; however, this trend appears to be changing sooner than we might expect. Countries in Europe, Asia, and many states in America have already made the decision to transition to a fully EV industry in the next few years. This looks promising; however, drivers still have concerns about the battery mileage of such vehicles and the anxiety that such driving experiences! Indeed, driving with the probability of having insufficient battery charge that may be involved in guaranteeing the delivery to the trip destination imposes a level of anxiety on the vehicle drivers. Therefore, for an alternative to traditional fuel-powered vehicles to be convincing, there needs to be sufficient coverage of charging stations to serve cities in the same way that fuel stations serve traditional vehicles. The current navigation models select routes based solely on distance and traffic metrics, without taking into account the coverage of fuel service stations that these routes may offer. This assumption is made under the belief that all routes are adequately covered. This might be true for fuel-powered vehicles, but not for EVs. Hence, in this work, we are presenting AFARM, a routing model that enables a smart navigation system specifically designed for EVs. This model routes the EVs via paths that are lined with charging stations that align with the EV's current charge requirements. Different from the other models proposed in the literature, AFARM is autonomous in the sense that it determines navigation paths for each vehicle based on its make, model, and current battery status. Moreover, it employs Dijkstra's algorithm to accommodate varying least-cost navigation preferences, ranging from shortest-distance routes to routes with the shortest trip time and routes with maximum residual battery capacities as well. According to the EV driver's preference, AFARM checks the set of candidate paths at the source point and selects the appropriate path for the vehicle to drive based on its current status. Consequently, AFARM provides an anxiety-free navigation model that allows for a reliable and environmentally friendly driving experience, promoting this alternative mode of transportation.
AKCE International Journal of Graphs and Combinatorics, May 6, 2020
Graphs are mathematical structures used in many applications. In recent years, many applications ... more Graphs are mathematical structures used in many applications. In recent years, many applications emerged that require the processing of large dynamic graphs where the graph's structure and properties change constantly over time. Examples include social networks, communication networks, transportation networks, etc. One of the most challenging problems in large scale dynamic graphs is the single-source shortest path (SSSP) problem. Traditional solutions (based on Dijkstra's algorithms) to the SSSP problem do not scale to large dynamic graphs with a high change frequency. In this paper, we propose an efficient SSSP algorithm for large dynamic graphs. We first present our algorithm and give a formal proof of its correctness. Then, we give an analytical evaluation of the proposed solution.
Routing in SDNs exploits the controller's global view and computes paths either using a singl... more Routing in SDNs exploits the controller's global view and computes paths either using a single-source shortest path algorithm (e.g., Dijkstra, Bellman-Ford) or an all-pairs shortest path (APSP) algorithm (e.g., Floyd-Warshall). Existing APSP routing algorithms for SDNs have substantial performance limitations in handling changes in the routes due to link deletion (failure) and link insertion (recovery). In this paper, we present POX-PLUS, a new SDN controller based on the popular POX controller. POX-PLUS includes a new routing module called DR-APSP (Dynamic Routing based on All Pairs Shortest Paths) that computes and efficiently maintains shortest paths between nodes in the SDN.
Graphs are mathematical structures used in many applications. In recent years, many applications ... more Graphs are mathematical structures used in many applications. In recent years, many applications emerged that require the processing of large dynamic graphs where the graph’s structure and properties change constantly over time. Examples include social networks, communication networks, transportation networks, etc. One of the most challenging problems in large scale dynamic graphs is the all-pairs, shortest path (APSP) problem. Traditional solutions (based on Dijkstra’s algorithms) to the APSP problem do not scale to large dynamic graphs with a high change frequency. In this paper, we propose an efficient APSP algorithm for large sparse dynamic graphs. We first present our algorithm and then we give an analytical evaluation of the proposed solution. We also present a thorough experimental study of our solution and compare it to two of the best known algorithms in the literature.
AKCE International Journal of Graphs and Combinatorics
Graphs are mathematical structures used in many applications. In recent years, many applications ... more Graphs are mathematical structures used in many applications. In recent years, many applications emerged that require the processing of large dynamic graphs where the graph's structure and properties change constantly over time. Examples include social networks, communication networks, transportation networks, etc. One of the most challenging problems in large scale dynamic graphs is the single-source shortest path (SSSP) problem. Traditional solutions (based on Dijkstra's algorithms) to the SSSP problem do not scale to large dynamic graphs with a high change frequency. In this paper, we propose an efficient SSSP algorithm for large dynamic graphs. We first present our algorithm and give a formal proof of its correctness. Then, we give an analytical evaluation of the proposed solution.
2020 IEEE 9th International Conference on Cloud Networking (CloudNet)
Routing in SDNs exploits the controller's global view and computes paths either using a singl... more Routing in SDNs exploits the controller's global view and computes paths either using a single-source shortest path algorithm (e.g., Dijkstra, Bellman-Ford) or an all-pairs shortest path (APSP) algorithm (e.g., Floyd-Warshall). Existing APSP routing algorithms for SDNs have substantial performance limitations in handling changes in the routes due to link deletion (failure) and link insertion (recovery). In this paper, we present POX-PLUS, a new SDN controller based on the popular POX controller. POX-PLUS includes a new routing module called DR-APSP (Dynamic Routing based on All Pairs Shortest Paths) that computes and efficiently maintains shortest paths between nodes in the SDN.
Uploads
Papers by muteb alshammari