Wireless Sensor Networks (WSN) is designed to collect information across a large number of limited battery sensor nodes. Therefore, it is important to minimize the energy consumption of each node, which leads to the extension of the network life. Our goal is to design an intelligent WSN that collects as much information as possible to process it intelligently. To achieve this goal, an agent has been migrated to each node in order to process the information and to cooperate with these neighboring nodes while Mobile Agents (MA) can be used to reduce information between nodes and send those to the base station (Sink). This work proposes to use communication architecture for wireless sensor networks based on the Multi Agent System (MAS) to ensure optimal information collection. The collaboration of these agents generates a simple message that summarizes the important information in order to transmit it by a mobile agent. To reduce the size of the MA, the nodes of the network have been grouped into sector. As for each MA, we have established an optimal itinerary, consuming a minimum amount of energy with the data aggregation efficiency in a minimum time. Successive simulations in large scale wireless sensor networks through the SINALGO simulator show the performance of our proposal, in terms of energy consumption and package delivery rate.

Bandung and Lembang are the cities that are chosen by many tourists (local and foreign) as their destinations. Geographically, these cities are placed side-by-side and each city has its own characteristics. As in Bandung, there are many hotels and culinary spots, meanwhile, in Lembang, there are many scenery tourism spots. Tourists usually have limited time to visit all the destinations on holiday, which makes them choose several tourist destinations to visit. In this paper, the tourism itinerary recommendation system is proposed by calculating the most optimal route between destinations and approaching the Vehicle Routing Problem with Time Windows. The optimal route is defined by using Dijkstra the shortest path algorithm by using the collaboration between the road information (road length, traffic condition, travel time, and weather condition) and criteria weight that is determined using the Analytics Hierarchy Process as the graph weights. According to the simulation results, the criteria weights are 6.9%, 62.7%, 18.6%, and 11.9% for Route Length, Traffic Condition, Travel Time, and Weather Condition respectively. Moreover, the optimal number of tourism itinerary plans for the tourist in this research is 4 destinations. As the usage of computational resources, it takes 31.8% of CPU and 61.9% of Memory usage. For the time processing, it increases exponentially as the increment of number of requested stops. The output of this research is expected to be a solution to the tourist itinerary plan, especially in Bandung and Lembang.