Multi-objective Optimization using NSGA II for service composition in IoT

Internet of Things (IoT) provides an innovative worldwide view to the things which are fit for communicating with one another. Each thing like temperature sensor, pressure sensor provides its functionality in the form of web service on the Internet. As the number of things connecting to the IoT netw...

Full description

Saved in:
Bibliographic Details
Published in:Procedia computer science 2020, Vol.167, p.1928-1933
Main Authors: Kashyap, Neeti, Kumari, A. Charan, Chhikara, Rita
Format: Article
Language:English
Subjects:
composition
Internet of Things
multi-objective
NSGA II
optimization
service
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Internet of Things (IoT) provides an innovative worldwide view to the things which are fit for communicating with one another. Each thing like temperature sensor, pressure sensor provides its functionality in the form of web service on the Internet. As the number of things connecting to the IoT network are increasing, thus one of the important challenges is to address the optimal selection of the web service to fulfil the user request. As the user requirements cannot be fulfilled using a single service so various services are composed to serve the IoT based system applications. This paper presents the usage of multi-objective metaheuristic search algorithm to provide optimal solution to Service Composition Problem (SCP) in IoT. Furthermore, this paper illustrates the use of one of the popular algorithms namely Non-dominated Sorting Genetic Algorithm (NSGA II). This paper looks at the way and methodology utilized to solve SCP in IoT. QoS parameters have become an important criterion for optimization. This algorithm is utilized to solve Quality of Service (QoS) based SCP. The results obtained are evaluated by analysing the no. of points plotted by pareto optimal curve. NSGA II is used to obtain the pareto fronts.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2020.03.214