Dynamic Fog Federation Scheme Using Vertex Cover Problem and Shapley Value-Based Approach

The Internet of Vehicles (IoV) has progressed remarkably, leading to a heightened dependence on applications that require low latency and high bandwidth. In light of the growing computational demands, fog computing has surfaced as a vital strategy for offloading tasks from centralized cloud infrastructures. Nevertheless, traditional fog resource allocation techniques face considerable obstacles in dynamic environments defined by vehicle mobility and the diversity of fog nodes. This research introduces a new Dynamic Fog Federation Scheme (DFFS) designed for IoV settings, which integrates the Vertex Cover problem with a resource allocation framework based on the Shapley value. The proposed scheme is analyzed for its efficiency, fairness, and computational complexity, revealing significant enhancements in load balancing and resource utilization within dynamic IoV ecosystems.