If node j has a higher probability to encounter D than the
current node i, then node i will bargain with node j so as to incentivize selfish node j to forward message m; otherwise, node i will continue carry the message m, and look for new relay nodes.
The aggregation operation will begin from the second source node, the MA compares the data collected from the
current node and the previous crossed nodes and eliminates the redundancy .The size of MA packet increases from one source node to another, and it is possible to calculate the size of the MA at a source node j with this formula:
This problem comes out because there is no guarantee that the cost function value of the next node to be evaluated is less than the cost function value of the
current node. In contrast, our field-sensitive pathfinders guarantee that their cost functions monotonically decrease from the start node to the goal node.
The HopID of node represents hop count from
current node to sink nodes.
Different from the classic A* algorithm, g(v) in this algorithm is not the real path length but an estimated path length from the start position to the
current node. gn represents g(v) and it is calculated as
Based on the information specified in the received packet, the
current node learns the address of the destination node and forwards the packets to its next 1-hop neighbour.
APS Pseudocode 0 1 N=number of adjacent nodes; 2 for n in range (0:N){ 3 Pn=1/N; #probability of n being selected 4 5 Receive search message; 6 Search the resource in
current node; 7 8 if(this node has the resource){ 9 Reply to originator to increase possibility; 10 } 11 else{ 12 Forward the message randomly using Pn 13 } 14 The selection of the forwarding node is done randomly.
Set the grid number of one path to be Ln; calculate the allowed nodes set for the
current node. If the next nodes (except the first next node of the
current node) after
current node are in the allowed nodes set, you can delete the nodes between the
current node and the next node directly from the circuitous path, and then the quality of the path will be improved.