Research on intelligent transportation wireless sensor networks (ITWSNs) plays a very important role in an intelligent transportation system. ITWSNs deploy high-yield and low-energy-consumption traffic remote sensing sensor nodes with complex traffic parameter coordination on both sides of the road and use the self-organizing capabilities of each node to automatically establish the entire network. In the large-scale self-organization process, the importance of tasks undertaken by each node is different. It is not difficult to prove that the task allocation of traffic remote sensing sensors is an NP-hard problem, and an efficient task allocation strategy is necessary for the ITWSNs. This paper proposes an improved adaptive clone genetic algorithm (IACGA) to solve the problem of task allocation in ITWSNs. The algorithm uses a clonal expansion operator to speed up the convergence rate and uses an adaptive operator to improve the global search capability. To verify the performance of the IACGA for task allocation optimization in ITWSNs, the algorithm is compared with the elite genetic algorithm (EGA), the simulated annealing (SA), and the shuffled frog leaping algorithm (SFLA). The simulation results show that the execution performance of the IACGA is higher than EGA, SA, and SFLA. Moreover, the convergence speed of the IACGA is faster. In addition, the revenue of ITWSNs using IACGA is higher than those of EGA, SA, and SFLA. Therefore, the proposed algorithm can effectively improve the revenue of the entire ITWSN system.
Anonymous Hedonic Game for Task Allocation in a Large-Scale Multiple Agent System
