Improved distributed auction Ik-SAAP algorithm for task distribution in WSAN

Abstract

The invention discloses an improved distributed auction Ik-SAAP algorithm for task distribution in a WSAN, and the method comprises the following steps: 1), building an executor cooperation task distribution mathematic model; 2), initializing network parameters; 3), selecting a decision node, and initiating an auction node; 4), setting a leapfrogging number; 5), calculating a utility value of the auction node, and returning the utility value to the decision node; 6), judging whether the decision node meets an optimal executor node condition or not: returning to step 4) if the decision node does not meet the optimal executor node condition, or else, finishing the one-time task distribution; 7), carrying out a current task through a selected executor node; 8), executing the Ik-SAAP algorithm for 200 times, obtaining a data package forwarding number comparison diagram, a remaining energy variance comparison diagram and a mean task completion time comparison diagram through simulation. The method can reduce the forwarding number of data packages of the executor node under the condition of guaranteeing the high task distribution rate, shortens the task completing time, and balances the energy consumption of the WSAN.

Description

technical field [0001] The invention relates to the fields of distributed information processing technology, collaborative cooperation technology and intelligent computing technology, specifically the problem of task allocation in WSAN actuators and actuator cooperation, and belongs to the technical field of wireless sensor networks. Background technique [0002] Wireless Sensor And Actor Networks (Wireless Sensor And Actor Networks, WSAN) is composed of a large number of sensor nodes and a small number of mobile actuator nodes, which are interconnected through a wireless network to sense the real world, process perception data, and Make decisions and take action. Among them, collaboration and real-time performance are two unique requirements that WSAN should meet, and the main purpose of Actor-to-Actor Coordination is to complete the effective assignment of tasks. Wireless channel data transmission consumes a lot of energy. Therefore, when a task occurs in WSAN, selecting ...

AI Technical Summary

Problems solved by technology

Tommaso Melodia et al. proposed a distributed bidding algorithm to solve the cooperation problem between executor nodes, but this algorithm is only applicable to executor nodes in overlapping areas, and executor nodes in non-overlapping areas will perform existing tasks before It will respond to events in the overlapping area, so it will inevitably affect the real-time performance of the network

Ivan Mezei and others proposed the k-SAAP (k-hop Simple Auction Aggregation Protocol) algorithm. k-SAAP obtains the information of local k-hop neighbors by constructing a response tree, so as to determine which executor node will perform the current task. This algorithm does not consider the status of the executor nodes, which will increase the number of data packets forwarded between the executor nodes, unbalance the load between the executor nodes, and shorten the network life.

Images