Graph Theoretic Approach to IOT Applications

Certain difficulties in the use of computing through fog and edge clubbed with the IoT controllers in the sense of performance and memory size. So, demand increases for computing at higher levels due to the increase in the number of IoT-oriented procedural systems required for negotiating the problem. The transformation from the cloud poses major worries about the recognition of location proper for nodes at the corner and the within distribution of services. It is concerned with the placement of the selected nodes to act as hosts for the security services. This task can be visualized as a graph where vertices stand for the devices and the edges stand for the connections between devices. Direct access from a given vertex to a security vertex implies that chosen vertices become a dominating set of minimal cardinalities and support heavier nodes. Here we discuss some greedy procedures that find for a given graph with allotted weights, a dominating set obeying certain optimization criteria, and the quality of the graph partition solution.