Fog Load Balancing for Massive Machine Type Communications: A Game and Transport Theoretic Approach
The emerging fog computing and narrow-band Internet of Things (NB-IoT) wireless technologies are indispensable for the next-generation massive machine-type communication (mMTC) applications. However, the communication capacity of NB-IoT is limited compared with the ever-growing number of NB-IoT devi...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8590702/ |
| _version_ | 1819174719106056192 |
|---|---|
| author | Sarder Fakhrul Abedin Anupam Kumar Bairagi Md. Shirajum Munir Nguyen H. Tran Choong Seon Hong |
| author_facet | Sarder Fakhrul Abedin Anupam Kumar Bairagi Md. Shirajum Munir Nguyen H. Tran Choong Seon Hong |
| author_sort | Sarder Fakhrul Abedin |
| collection | DOAJ |
| description | The emerging fog computing and narrow-band Internet of Things (NB-IoT) wireless technologies are indispensable for the next-generation massive machine-type communication (mMTC) applications. However, the communication capacity of NB-IoT is limited compared with the ever-growing number of NB-IoT devices. Furthermore, the optimal assignment of different computational jobs ignites the issue of load balancing in the fog network to ensure a well-balanced computational resource allocation. Therefore, in this paper, we formulate a fog load balancing problem considering the communication and computation constraints, where the objective is to minimize the load balancing cost of the fog computing network empowered with the NB-IoT. First, we model the time resource scheduling problem in NB-IoT as a bankruptcy game. Within the game framework, we enforce the Shapley value-based strategic policy for the NB-IoT devices to perform uplink scheduling for mMTC applications while calculating the transmission costs of the computational jobs. We also propose greedy iterative time scheduling (GITS), complementary to the Shapley value-based scheduling but with less computational complexity. Second, we decompose the fog load balancing problem into a Hitchcock–Koopmans transportation problem that defines the overutilized and underutilized fog computing nodes based on the computational resource utilization. Subsequently, we solve the transportation problem by applying Vogel’s approximation method (VAM), which finds a feasible load balancing solution to ensure optimal job assignment in the fog computing network. The simulation results illustrate that the average job load balancing cost with our approach is significantly reduced compared with the baseline methods. |
| first_indexed | 2024-12-22T20:43:26Z |
| format | Article |
| id | doaj.art-b75c273fe5264c3191f35bbc0f2aa413 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-22T20:43:26Z |
| publishDate | 2019-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-b75c273fe5264c3191f35bbc0f2aa4132022-12-21T18:13:17ZengIEEEIEEE Access2169-35362019-01-0174204421810.1109/ACCESS.2018.28888698590702Fog Load Balancing for Massive Machine Type Communications: A Game and Transport Theoretic ApproachSarder Fakhrul Abedin0Anupam Kumar Bairagi1Md. Shirajum Munir2Nguyen H. Tran3Choong Seon Hong4Department of Computer Science and Engineering, Kyung Hee University, Yongin-si, South KoreaDepartment of Computer Science and Engineering, Kyung Hee University, Yongin-si, South KoreaDepartment of Computer Science and Engineering, Kyung Hee University, Yongin-si, South KoreaSchool of Computer Science, The University of Sydney, Sydney, NSW, AustraliaDepartment of Computer Science and Engineering, Kyung Hee University, Yongin-si, South KoreaThe emerging fog computing and narrow-band Internet of Things (NB-IoT) wireless technologies are indispensable for the next-generation massive machine-type communication (mMTC) applications. However, the communication capacity of NB-IoT is limited compared with the ever-growing number of NB-IoT devices. Furthermore, the optimal assignment of different computational jobs ignites the issue of load balancing in the fog network to ensure a well-balanced computational resource allocation. Therefore, in this paper, we formulate a fog load balancing problem considering the communication and computation constraints, where the objective is to minimize the load balancing cost of the fog computing network empowered with the NB-IoT. First, we model the time resource scheduling problem in NB-IoT as a bankruptcy game. Within the game framework, we enforce the Shapley value-based strategic policy for the NB-IoT devices to perform uplink scheduling for mMTC applications while calculating the transmission costs of the computational jobs. We also propose greedy iterative time scheduling (GITS), complementary to the Shapley value-based scheduling but with less computational complexity. Second, we decompose the fog load balancing problem into a Hitchcock–Koopmans transportation problem that defines the overutilized and underutilized fog computing nodes based on the computational resource utilization. Subsequently, we solve the transportation problem by applying Vogel’s approximation method (VAM), which finds a feasible load balancing solution to ensure optimal job assignment in the fog computing network. The simulation results illustrate that the average job load balancing cost with our approach is significantly reduced compared with the baseline methods.https://ieeexplore.ieee.org/document/8590702/Load balancingbankruptcy gametransport theoryHitchcock-Koopmans transportation problemmMTCfog computing |
| spellingShingle | Sarder Fakhrul Abedin Anupam Kumar Bairagi Md. Shirajum Munir Nguyen H. Tran Choong Seon Hong Fog Load Balancing for Massive Machine Type Communications: A Game and Transport Theoretic Approach IEEE Access Load balancing bankruptcy game transport theory Hitchcock-Koopmans transportation problem mMTC fog computing |
| title | Fog Load Balancing for Massive Machine Type Communications: A Game and Transport Theoretic Approach |
| title_full | Fog Load Balancing for Massive Machine Type Communications: A Game and Transport Theoretic Approach |
| title_fullStr | Fog Load Balancing for Massive Machine Type Communications: A Game and Transport Theoretic Approach |
| title_full_unstemmed | Fog Load Balancing for Massive Machine Type Communications: A Game and Transport Theoretic Approach |
| title_short | Fog Load Balancing for Massive Machine Type Communications: A Game and Transport Theoretic Approach |
| title_sort | fog load balancing for massive machine type communications a game and transport theoretic approach |
| topic | Load balancing bankruptcy game transport theory Hitchcock-Koopmans transportation problem mMTC fog computing |
| url | https://ieeexplore.ieee.org/document/8590702/ |
| work_keys_str_mv | AT sarderfakhrulabedin fogloadbalancingformassivemachinetypecommunicationsagameandtransporttheoreticapproach AT anupamkumarbairagi fogloadbalancingformassivemachinetypecommunicationsagameandtransporttheoreticapproach AT mdshirajummunir fogloadbalancingformassivemachinetypecommunicationsagameandtransporttheoreticapproach AT nguyenhtran fogloadbalancingformassivemachinetypecommunicationsagameandtransporttheoreticapproach AT choongseonhong fogloadbalancingformassivemachinetypecommunicationsagameandtransporttheoreticapproach |