Preferred Language
Articles
/
ijs-2966
A Genetic Algorithm for Task Allocation Problem in the Internet of Things
...Show More Authors

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonical definition for network lifetime in the IoT is to increase the period of cooperation between objects to carry out all the assigned tasks. The main contribution in this paper is to address the problem of task allocation in the IoT as an optimization problem with a lifetime-aware model. A genetic algorithm is proposed as a task allocation protocol. For the proposed algorithm, a problem-tailored individual representation and a modified uniform crossover are designed. Further, the individual initialization and perturbation operators (crossover and mutation) are designed so as to remedy the infeasibility of any solution located or reached by the proposed genetic algorithm. The results showed reasonable performance for the proposed genetic-based task allocation protocol. Further, the results prove the necessity for designing problem-specific operators instead of adopting the canonical counterparts.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Fri Apr 30 2021
Journal Name
Iraqi Journal Of Science
A Genetic Algorithm for Task Allocation Problem in the Internet of Things
...Show More Authors

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

... Show More
Scopus (3)
Crossref (4)
Scopus Crossref
Publication Date
Thu Apr 01 2021
Journal Name
Applied Soft Computing
Evolutionary multi-objective set cover problem for task allocation in the Internet of Things
...Show More Authors

Scopus (5)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Thu Apr 01 2021
Journal Name
Applied Soft Computing
Evolutionary multi-objective set cover problem for task allocation in the Internet of Things
...Show More Authors

View Publication
Scopus (5)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Thu Aug 01 2019
Journal Name
Ieee Internet Of Things Journal
A New Task Allocation Protocol for Extending Stability and Operational Periods in Internet of Things
...Show More Authors

Scopus (15)
Crossref (9)
Scopus Clarivate Crossref
Publication Date
Thu Jul 01 2021
Journal Name
Journal Of Physics: Conference Series
An Evolutionary Algorithm for Task scheduling Problem in the Cloud-Fog environment
...Show More Authors
Abstract<p>The rapid and enormous growth of the Internet of Things, as well as its widespread adoption, has resulted in the production of massive quantities of data that must be processed and sent to the cloud, but the delay in processing the data and the time it takes to send it to the cloud has resulted in the emergence of fog, a new generation of cloud in which the fog serves as an extension of cloud services at the edge of the network, reducing latency and traffic. The distribution of computational resources to minimize makespan and running costs is one of the disadvantages of fog computing. This paper provides a new approach for improving the task scheduling problem in a Cloud-Fog environme</p> ... Show More
View Publication
Scopus (7)
Crossref (1)
Scopus Crossref
Publication Date
Wed May 25 2022
Journal Name
Iraqi Journal Of Science
Developing a Heuristic Algorithm to Solve Uncertainty Problem of Resource Allocation in a Software Project Scheduling
...Show More Authors

     In project management process, the objective is to define and develop a model for planning, scheduling, controlling, and monitoring different activities of a particular project. Time scheduling plays an important role in successful implementation of various activities and general outcome of project. In practice, various factors cause projects to suffer from time delay in accomplishing the activities. One important reason is imprecise knowledge about time duration of activities. This study addresses the problem of project scheduling in uncertain resource environments, which are defined by uncertain activity durations.  The study presents a solution of the levelling and allocation problems for projects that have some uncertain ac

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
A Parallel Adaptive Genetic Algorithm for Job Shop Scheduling Problem
...Show More Authors

Publication Date
Fri Dec 08 2023
Journal Name
Iraqi Journal Of Science
A Genetic Algorithm for Minimum Set Covering Problem in Reliable and Efficient Wireless Sensor Networks
...Show More Authors

Densely deployment of sensors is generally employed in wireless sensor networks (WSNs) to ensure energy-efficient covering of a target area. Many sensors scheduling techniques have been recently proposed for designing such energy-efficient WSNs. Sensors scheduling has been modeled, in the literature, as a generalization of minimum set covering problem (MSCP) problem. MSCP is a well-known NP-hard optimization problem used to model a large range of problems arising from scheduling, manufacturing, service planning, information retrieval, etc. In this paper, the MSCP is modeled to design an energy-efficient wireless sensor networks (WSNs) that can reliably cover a target area. Unlike other attempts in the literature, which consider only a si

... Show More
View Publication Preview PDF
Publication Date
Sun May 28 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
On-Line Navigational Problem of a Mobile Robot Using Genetic Algorithm
...Show More Authors

  Manufacturing systems of the future foresee the use of intelligent vehicles, optimizing and navigating. The navigational problem is an important and challenging problem in the field of robotics. The robots often find themselves in a situation where they must find a trajectory to another position in their environment, subject to constraints posed by obstacles and the capabilities of the robot itself. On-line navigation is a set of algorithms that plans and executes a trajectory at the same time.         The system adopted in this research searches for a robot collision-free trajectory in a dynamic environment in which obstacles can move while the robot was moving toward the target. So, the ro

... Show More
View Publication Preview PDF
Publication Date
Sun May 28 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Science
On-Line Navigational Problem of a Mobile Robot Using Genetic Algorithm
...Show More Authors