Search In this Thesis
   Search In this Thesis  
العنوان
Optimized monitoring of internet of things networks /
الناشر
Basma Mostafa Abdelghany Hassan ,
المؤلف
Basma Mostafa Abdelghany Hassan
هيئة الاعداد
باحث / Basma Mostafa Abdelghany Hassan
مشرف / Mohamed Mo?afa Saleh
مشرف / Miklos Molnar
مشرف / Sally Saad Kassem
تاريخ النشر
2019
عدد الصفحات
104 P. :
اللغة
الإنجليزية
الدرجة
الدكتوراه
التخصص
Management Science and Operations Research
تاريخ الإجازة
30/9/2019
مكان الإجازة
جامعة القاهرة - كلية الدراسات الإفريقية العليا - Operations Research and Decision Support
الفهرس
Only 14 pages are availabe for public view

from 130

from 130

Abstract

The research of this Ph.D. is fulfilled in the context of the optimized monitoring of Internet of Things (IoT) networks. The IoT enables the interconnection of billions of sensors, actuators, even humans to the Internet, creating a wide range of services, some of which are mission-critical. However, IoT networks are faulty in nature; Things are resource-constrained in terms of energy and computational capabilities. Moreover, they are connected via lossy links. For IoT systems performing a critical mission, it is crucial to ensure connectivity, availability, and network reliability, which requires proactive network monitoring. The idea is to oversee the network state and functioning of the nodes and links; to ensure the early detection of faults and decrease in node unreachability times. It is imperative to minimize the resulting monitoring energy consumption to allow the IoT network to perform its primary function. Furthermore, to realize the integration of the monitoring mechanism with IoT services, the proposed models should work in tandem with the IoT standardized protocols, especially the IPv6 for Low-power Wireless Personal Area Networks (6LoWPAN) and the Routing Protocol for Low-power and lossy networks (RPL). In this challenging context, the first step of analysis is to ensure the (optimal) placement of monitoring nodes (monitors) to cover the given domain. Leveraging the graph built by RPL (the DODAG), the monitoring coverage can be modeled as the classic Minimum Vertex Cover (MVC) on the DODAG. MVC is NP-hard on general graphs and polynomial-time solvable on trees