This paper deals with an efficient parallel and distributed framework for intensive computation with A* algorithm based on MapReduce concept. The A* algorithm is one of the most popular graph traversal algorithm used in route guidance. It requires exponential time computation and very costly hardware to compute the shortest path on large-scale networks. Thus, it is necessary to reduce the time complexity while exploiting a low cost commodity hardwares. To cope with this situation, we propose a novel approach that reduces the A* algorithm into a set of Map and Reduce tasks for running the path computation on Hadoop MapReduce framework. An application on real road networks illustrates the feasibility and reliability of the proposed framework. The experiments performed on a 6-node Hadoop cluster proves that the proposed approach outperforms A* algorithm and achieves significant gain in terms of computation time.

Internet of Things (IoT) is composed of many IoT devices connected throughout the Internet, that collect and share information to represent the environment. IoT is currently restructuring the actual manufacturing to smart manufacturing. However, inherent characteristics of IoT lead to a number of titanic challenges such as decentralization, weak interoperability, security, etc. The artificial intelligence provides opportunities to address IoT’s challenges, e.g the agent technology. This paper presents first an overview of ML and discusses some related work. Then, we briefly present the classic IoT architecture. Then we introduce our proposed Intelligent IoT (IIoT) architecture. We next concentrate on introducing the approach using multi-agent DRL in IIoT. Finally, in this promising field, we outline the open directions of future work.

In this work we are interested in placing test components for Internet of Things (IoT) and Smart Cities. Our work is inspired by similar works aiming the placement of application components in Fog computational nodes. First we give an overview about the decision variables to consider. Then, we define several types of constraints that may be included in the placement problem. Moreover, We list a set of possible Objectives Functions to maximize or minimize. Finally, we propose some algorithms and techniques to solve the considered Test Component Placement Problem (TCPP) taken from the literature.