{"id":22612,"date":"2026-08-07T20:33:35","date_gmt":"2026-08-07T17:33:35","guid":{"rendered":"https:\/\/su.edu.ye\/fcit\/?p=22612"},"modified":"2026-08-07T20:33:35","modified_gmt":"2026-08-07T17:33:35","slug":"phd-degree-awarded-to-researcher-asrar-baqtyan-in-information-technology","status":"publish","type":"post","link":"https:\/\/su.edu.ye\/fcit\/en\/22612\/","title":{"rendered":"PhD Degree Awarded to Researcher Asrar Baqtyan in Information Technology"},"content":{"rendered":"

 <\/p>\n

Researcher Asrar Ahmed Awadh Baqtyan \u200e<\/strong>was awarded a PhD<\/strong> degree in Information Technology \u200e<\/strong>for her dissertation titled: A Blockchain-Based Approach for Enhancing Data Execution Offloading in Unmanned Aerial Vehicle Swarms<\/em><\/strong>, which was submitted to the Department of Computer and Information Technology, Faculty of Computer and Information Technology\u2013Sana\u2019a University. The dissertation defense was held on Sunday, August 2, 2026.<\/strong><\/p>\n

The PhD Viva-Voce Committee, which was formed based on a resolution issued by the Graduate Studies and Scientific Research Council, consisted of the following:<\/p>\n

\u00a0<\/em><\/strong><\/p>\n\n\n\n\n\n\n
#<\/strong><\/td>\nCommittee Members<\/strong><\/td>\nDesignation<\/strong><\/td>\nPosition<\/strong><\/td>\n<\/tr>\n
1<\/td>\nProf. Sharaf Abdulhaq Mahyoub Al-Hamdi<\/strong><\/td>\nInternal Examiner<\/td>\nChair<\/td>\n<\/tr>\n
2<\/td>\nProf. Ammar Thabet Abdullah Zahari<\/strong><\/td>\nMain Supervisor<\/td>\nMember<\/td>\n<\/tr>\n
3<\/td>\nProf. Farouq Abdu Kamel Al-Fuhaidi<\/strong><\/td>\nExternal Examiner<\/td>\nMember<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n

The dissertation aimed to improve task offloading and resource allocation in UAV swarm networks by integrating blockchain and artificial intelligence technologies. The researcher proposed two complementary models. The first model employs dynamic clustering, a Contextual Bandit algorithm, and the Ganache blockchain platform to support 5G network slicing. The second model, PA-COBRA, integrates Federated Proximal Policy Optimization (FPPO), dynamic pricing, and the Hyperledger Fabric blockchain platform to manage collaborative operations in 6G networks.<\/p>\n

 <\/p>\n

The findings demonstrated the superior technical performance of both models compared with benchmark systems. The first model achieved a 27.2% increase in cumulative reward and a 91.1% decision-selection accuracy. Meanwhile, the PA-COBRA model attained a 98% task completion rate, improved UAV resource utilization by 144%, and reduced transaction failure rates. The evaluation was based on key performance indicators, including response time, battery consumption, and compliance with network slicing requirements.<\/p>\n

 <\/p>\n

The study recommended further development of intelligent clustering mechanisms, broader adoption of federated learning techniques, and joint optimization of routing and energy management to enhance blockchain scalability. It also emphasized strengthening security and practical deployment through the adoption of advanced, resilient cryptographic algorithms.<\/p>\n

 <\/p>\n

The dissertation defense was attended by a number of academics, postgraduate students, researchers, as well as the researcher’s colleagues and family members.<\/p>\n

 <\/p>\n

\"\" \"\" \"\"<\/p>\n\n

\n\n\t\t\n
    \n\t\t\t <\/ul>\n <\/div> \n","protected":false},"excerpt":{"rendered":"

      Researcher Asrar Ahmed Awadh Baqtyan \u200ewas awarded a PhD degree in Information Technology \u200efor her dissertation titled: A Blockchain-Based … <\/p>\n","protected":false},"author":128,"featured_media":22609,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"footnotes":""},"categories":[121],"tags":[],"class_list":["post-22612","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-news-2"],"aioseo_notices":[],"aioseo_head":"\n\t\t\n\t\n\t\n\t\n\t\n\t\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t