A mobile agent combination optimization routing algorithm in dual-channel wireless sensor networks

Abstract

A mobile agent combinatorial optimization routing algorithm (MACORA) is presented to solve the problems of collision and multicast suppression between mobile agents in channel competitive process. The channel converter problem in the dual-channel wireless sensor networks is simplified into a routing problem over the two-layer graph in terms of a two-layer graph model, and then searches for routes in the control plane and for transport traffic in the data plane are performed synchronously. Then, the control plane and the data plane are integrated into a two-layer network, and the route for each traffic is searched in the two-layer networks synchronously. The MACORA can make full use of the idle resource in different layers. This strategy deals with the collision between mobile agents and the multicast suppression in channel competitive process well, so the blocking probability of networks and the error rate of packet transmission can be cut down. Simulation results and comparisons with other algorithms like ADEEMA and MAWSN show that the MACORA performs better in improving success rate of packet transmission and putting down the delay of communication. The success rate of packet transmission is improved about 15%, compared with the ADEEMA and MAWSN.