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.
The Ant System Algorithm (ASA) is a member of the ant colony algorithms family in swarm intelligence methods (part of the Artificial Intelligence field), which is based on the behavior of ants seeking a path and a source of food in their colonies. The aim of This algorithm is to search for an optimal solution for Combinational Optimization Problems (COP) for which is extremely difficult to find solution using the classical methods like linear and non-linear programming methods.
The Ant System Algorithm was used in the management of water resources field in Iraq, specifically for Haditha dam which is one of the most important dams in Iraq. The target is to find out an efficient management system for
... Show MoreThe financial statements must accurately, clearly and fairly present the financial situation and financial statements should be reliable as well. Pursuant to Board Decision No. (74) 2020, CBI obliges banks, according to the Banking Law No. (94) for the year 2004, Article (33) paragraph 2 concerning real estate owned from previous years and expropriated as a result debt settlement , to apply a real estate liquidation provision at a rate of 20% for each property expropriated and at a rate of 100% for each year of delay up to (5) years .also from the significance of the issue of real estates that become a property of banks as a result of debt settlement and the pr
... Show MoreThe objective of the research was to evaluate consumer purchasing behavior through the Internet, such as consumer behavior, reasons for buying online, purchasing advantages over the Internet, personal variables (gender, age, marital status, education level, income, and income and job type). The questionnaire was adopted as a main tool in the survey of the views of a sample of consumers in Baghdad governorate (100) people and analyzed their answers using the statistical program SPSS in calculating the mean and standard deviation Centigrade, correlation coefficient (R) and test ( ). The main findings of the research were:
- There is a positive and positive relationship between consumer purchasing behavior via the Internet and
In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons
... Show More