A Service-Oriented Negotiation Mechanism For Ad Hoc Network

The Mobile Ad hoc Networks (MANETS) is a kind of wireless network which has no-fixed infrastructure, non-center and multi-hop, such as Wireless Sensor Networks and Mesh Networks. In recent years, MANETS has been widely used in various fields, for example military, medical, intelligent transportation, environment monitoring, disaster relief and so on.As the Ad hoc networks do not rely on fixed infrastructure, the network function must be implemented by the cooperation among nodes. And the lack of cooperation will bring serious negative effects for the system’s performance. During the process of cooperation, the nodes need consume their own battery powers and the bandwidth resources while providing the routing and forwarding functions. In these cases, some nodes are reluctant to provide network services to other nodes. Such nodes are called selfish nodes.The paper is mainly about how to incite the selfish nodes to participate in the network cooperation via negotiation mechanism. Based on the research, we propose a one-to-many negotiation mechanism. And the main research contents and innovation points are as follows:In this paper, we study and analyze the causes and behavior of selfish nodes, as well as the incentive mechanism and negotiation mechanism. And we propose a one-to-many negotiation mechanism based on price and multi-attribute negotiation.We propose a clustering algorithm based on Wasp algorithm to reduce the network throughput and prevent central node from losing their utilities.The algorithm can reduce range of negotiation. The energy consumption of providing service is mainly considered. And we add the preferences of nodes into the WASP algorithm.During the negotiation process, it would be difficult to reach the agreement if both sides only consider their own benefits. To solve this problem and speed up the rate of negotiation, we propose a strategy of generating biddings based on Genetic Algorithm (GA). The Genetic Algorithm is used by the nodes that sell services. At the same time we design and improve the algorithm to adapt to Ad hoc networks.The one-to-many negotiation mechanism in our paper can effectively reduce the network throughput. And the two sides participating in negotiation can reach an agreement through less negotiation rounds. And the mechanism effectively saves the energy consumption of nodes.