Multicast Trusted Routing with QoS Multi-constraints in Wireless Ad Hoc Networks

The wireless ad hoc networks has been attracting increasing attention of researchers owing to its good performance and special applications. Multicast routing with QoS multi-constraints problem in this network has drawn wide spread attention from researchers who have been using different methods to solve it. One solution to this problem is to merge paths in accordance with a swarm intelligence algorithm after finding paths from source node to destination nodes in order to obtain a multicast tree that satisfies QoS multi-constraints. However, the security of routing paths is not guaranteed. To overcome this shortcoming, in this paper, we introduce the concept of trust into multicast routing problem which is made as another QoS constraint, and finally we propose a multicast trusted routing algorithm with QoS multi-constraints based on a modified ant colony algorithm. In this new algorithm, ants move constantly on the network to find an optimal constrained multicast security tree. Simulation results indicate that our algorithm can quickly find the feasible solution to solve constrained multicast security routing issues. Compared to CSTMAN, the packet delivery ratio of new algorithm is improved.