Notices
Trang chủ   >  News & Events  >   Notices  >  
Information on Doctoral thesis of Fellows Le Minh Tuan

1. Full name: Le Minh Tuan                                2. Sex: Male

3. Date of birth: April 1st, 1975                           4. Place of birth: Phu Tho

5. Admission decision number: Decision no 91/QĐ-VCNTT dated December 3, 2018 of the Director of the Information Technology Institute, Vietnam National University, Hanoi.

6. Changes in academic process: Extension of the study period according to Decision No. 90a dated 26th Nov, 2021 of the Director of the Information Technology Institute, Vietnam National University, Hanoi.

7. Official thesis title:

Research and proposal an improvement of scheduling algorithm
and its application

8. Major: Management of Information Systems               9. Code: 9480205.01 QTD

10. Supervisors:

- Supervisor 1: Assoc. Prof. Dr. Le Hoang Son

- Supervisor 2: Dr. Vu Nhu Lan

11. Summary of the new findings of the thesis:

With the goal of researching and proposing an improvement the scheduling algorithms, the research results have made the specific contributions of the topic as follows:

A scheduling algorithm for downlink in time domain and frequency domain (ITFDS) multi-service mobile network. The proposed scheduling algorithm distributes resources to all users in the time domain and in the frequency domain. Simulation results of the proposed method are compared with QuAS and PSS algorithms on parameters such as delay, packet loss rate, throughput, and fairness index.

A resource allocation scheduling algorithm for mobile computational grid based on meta-heuristic search. Experiments on the proposed method are compared with other heuristic algorithm as MIN-MIN, MAX-MIN and HEFT on quality-of-service parameters such as speedup, throughput, and localization ratio.

12. Practical applicability, if any:

The results of the thesis serve as an important premise in applying a new scheduling algorithm for multi-service mobile networks to improve service quality to users and for mobile computing grids with dynamically changing nodes by the time

13. Further research directions:

With the initial results obtained from these researches, some further research directions include improving the scheduling algorithm in multi-service mobile networks on the 5G environment, reducing the energy consumption of the mobile computational grid by using compressed sensing method.

14. Thesis-related publications:

[CT1] Ishaani Priyadarshini, Raghvendra Kumar, Le Minh Tuan, Le Hoang Son, Hoang Viet Long, Rohit Sharma, Sakshi Rai (2019), “A New Enhanced Cyber Security Framework for Medical Cyber Physical Systems”, SICS Software-Intensive Cyber-Physical Systems 35(3), pp.159-183.

[CT2] Lê Minh Tuấn, Lê Hoàng Sơn, Phạm Thị Minh Phương, Vũ Như Lân, Đặng Thanh Hải, Đinh Thu Khánh (2019), “Nghiên cứu đề xuất mô hình mạng động cho bài toán lập lịch tài nguyên trong mạng Long Term Evolution (LTE)”, Kỷ yếu Hội nghị Quốc gia lần thứ XII về Nghiên cứu cơ bản và ứng dụng Công Nghệ thông tin (FAIR), pp. 345-352.

[CT3] Le Minh Tuan, Le Hoang Son, Hoang Viet Long, Rajaretnam Priya, Ruba Soundar, Harold Robinson, Raghvendra Kumar (2020), “ITFDS: Channel-Aware Integrated Time and Frequency-Based Downlink LTE Scheduling in MANET”, Sensors 20(12), pp.3394.

[CT4] Dinesh Prasad Sahu, Karan Singh, Manisha Manju, David Taniar, Le Minh Tuan, Le Hoang Son, Mohamed Abdel Basset, Hoang Viet Long (2019), “Heuristic Search Based Localization in Mobile Computational Grid”, IEEE Access 7, pp.78652-78664.

 
  In bài viết     Gửi cho bạn bè
  Từ khóa :
Thông tin liên quan
Trang: 1   | 2   | 3   | 4   | 5   | 6   | 7   | 8   | 9   | 10   | 11   | 12   | 13   | 14   | 15   | 16   | 17   | 18   | 19   | 20   | 21   | 22   | 23   | 24   | 25   | 26   | 27   | 28   | 29   | 30   | 31   | 32   | 33   | 34   | 35   | 36   | 37   | 38   | 39   | 40   | 41   | 42   | 43   | 44   | 45   | 46   | 47   | 48   | 49   | 50   | 51   | 52   | 53   | 54   | 55   | 56   | 57   | 58   | 59   | 60   | 61   | 62   | 63   | 64   | 65   | 66   | 67   | 68   | 69   | 70   | 71   | 72   | 73   | 74   | 75   | 76   | 77   | 78   | 79   | 80   | 81   | 82   | 83   | 84   | 85   | 86   | 87   | 88   | 89   | 90   | 91   | 92   | 93   | 94   | 95   | 96   | 97   | 98   | 99   | 100   | 101   | 102   | 103   | 104   | 105   | 106   | 107   | 108   | 109   | 110   | 111   | 112   | 113   | 114   | 115   | 116   | 117   | 118   | 119   | 120   | 121   | 122   | 123   | 124   | 125   | 126   | 127   | 128   | 129   | 130   | 131   | 132   | 133   | 134   | 135   | 136   | 137   | 138   | 139   | 140   | 141   | 142   | 143   | 144   | 145   | 146   | 147   | 148   | 149   | 150   | 151   |