Routing method based on coalition game

Abstract

The invention provides a routing method based on a coalition game. The routing method belongs to the technical field of wireless sensor networks, and comprises the steps of: step 1, establishing a coalition game model for all nodes of a wireless sensor network, establishing a coalition feature function based on node performance indexes, defining a fair coalition member income distribution method, and designing a rapid converging coalition forming algorithm so as to form a stable coalition in the network; step 2, proceeding a routing process based on the coalition formed in the network, calculating path coalition cost values fR at a route discovery stage, and selecting a path with the minimum path coalition cost fR for transmitting data from destination node cache by means of a source node; and step 3, completing and perfecting a path energy residual ratio ER monitoring mechanism for carrying out route maintenance on the basis of an AODV routing protocol link failure detection mechanism, so as to prevent a path transmission failure caused by node energy exhaustion. The routing method has the advantages of high adaptability to topology, good stability, minimal routing cost, balanced energy consumption and the like, and effectively improves the routing performance.

Description

[0001] (1) Technical field [0002] The invention relates to a routing method based on alliance game, and belongs to the technical field of wireless sensor networks. [0003] (2) Background technology [0004] Wireless sensor networks are mostly used in unattended harsh environments, using a large number of cheap smart micro-sensor nodes with data perception, collection and processing capabilities to implement a variety of monitoring tasks. As a dynamic optimization process, routing aims to provide a data transmission path from source nodes to destination nodes for wireless sensor networks. Since the topology of wireless sensor networks may change dynamically due to node failure or link disconnection, and sensor nodes have limited energy and processing capabilities, it is urgent to meet the needs of routing stability and cost saving when designing routing protocols for wireless sensor networks. [0005] Traditional routing protocols, such as Ad Hoc Network On-demand Distance V...

AI Technical Summary

Problems solved by technology

These alliance game-based routing methods provide a theoretical basis for subsequent research, but the following issues are still unresolved: 1) In order to optimize the routing performance, it is necessary to evaluate the path alliance cost to achieve path selection; 2) due to the Node failure and disconnection of communication connections may lead to dynamic changes in the network topology. Therefore, in order to ensure the stable transmission of data packets in the routing process, the convergence speed of the alliance formation process must be accelerated; 3) The energy consumption of paths with heavy data transmission tasks is faster , in order to balance the energy consumption of the network and prevent the failure of nodes due to energy depletion, the path energy remaining rate monitoring is used to supplement and improve the routing maintenance mechanism

Images