A Service Negotiation Mechanism in Mobile Ad Hoc Network

This paper studies the incentive mechanism for selfish nodes in Ad Hoc network. We propose a service negotiation mechanism based on WASP algorithm and genetic algorithm (GA). The mechanism has been improved in two areas, first it presents a filtering strategy to select the negotiation nodes, and in addition, it adopts an improved genetic algorithm to generate the offers. In filtering strategy, the nodes that are closer to the negotiating opponents and have more residual energy are selected. And in the bidding strategy, the offers are generated by improved genetic algorithm. We improve the genetic algorithm by adding learning ability to the fitness function and adopt an adaptive crossover probability. Experimental analysis shows that agents using the mechanism based on WASP algorithm and genetic algorithm reach an agreement in a short time, and the energy consumption has been reduced.