【WSN】基于蚁群算法的WSN路由协议(最短路径)消耗节点能量研究（Matlab代码实现）

function [pile, intermediate_piles] = resolvePeaks(pile, peak_pos, nbr_pos)%resolvePeaks - Resolve all peaks in a pile%% Syntax:  [pile, intermediate_piles] = resolvePeaks(pile, peak_pos)%% Inputs:%    pile - Matrix of shape (pile width, pile width,%       no. of history time steps), with integer values from 0 to 4%    peak_pos - Vector containing positions of all peaks%% Outputs:%    pile - Matrix of shape (pile width, pile width), with integer values %       from 0 to 4, with peaks in initial pile resolved (might now contain%       peaks resulting from resolving the initial peaks)%    intermediate_piles - Matrix of shape (pile width, pile width, no. of%    intermediate time steps), with integer values from 0 to 4, containing %    all intermediate steps taken in resolving the peaks%% Example:%    [pile, intermediate_piles] = resolvePeaks([4 1;3 2], 1)%% Other m-files required: none% Subfunctions: none% MAT-files required: none%% See also: scanPileForPeaks%% Author: Florian Roscheck% Website: http://github.com/flrs/visual_sandpile% January 2017; Last revision: 27-January-2017%------------- BEGIN CODE --------------%% initializepile_width = size(pile,1);prealloc_size = round(pile_width^1.3); % preallocate empty array depending                                       % on pile side length, it is                                       % expected that no. of piles                                       % increases exponentially with pile                                       % side length, exponent 1.3 is                                       % arbitrary and a tradeoff between                                       % unneccessarily slow intialization                                       % and unneccessary overhead when                                        % expanding the array later in the                                       % codeintermediate_piles = zeros(pile_width,pile_width,prealloc_size);intermediate_pile_ct = 1;peak_pattern = [0 1 0;1 -4 1;0 1 0;]; % pattern for resolving peaks,                                       % characteristic of Abelian sandpilepile_frame = zeros(pile_width+2); % construct frame around pile to catch                                  % falling off the gridpile_frame(2:end-1,2:end-1) = pile; % insert pile into frame%% process peaks% resolve peaks one by onefor peak = 1:numel(peak_pos)    % fast ind2sub (see http://tipstrickshowtos.blogspot.com/2011/09/fast-r    % eplacement-for-ind2sub.html, checked on 2017-01-26)    peakY = rem(peak_pos(peak)-1, pile_width)+1;    peakX = (peak_pos(peak)-peakY)/pile_width + 1;%寻找雪崩点的坐标        % resolve peaks    z = zeros(3);    index = peak_pos(peak);    nbr = nbr_pos(index);    z(5) = -1;    z(nbr) = 1;    peak_pattern = z;    pile_frame(peakY:peakY+2, peakX:peakX+2) = ...        pile_frame(peakY:peakY+2, peakX:peakX+2)+z;        % extract new pile from frame    pile = pile_frame(2:end-1, 2:end-1);        % expand intermediate pile array when it has reached its size limit    if intermediate_pile_ct>size(intermediate_piles, 3)        intermediate_piles = ...            cat(3, intermediate_piles, ...            zeros(pile_width, pile_width, prealloc_size));    end        % append new pile to intermediate pile array    intermediate_piles(:, :, intermediate_pile_ct) = pile;        intermediate_pile_ct = intermediate_pile_ct+1;endif intermediate_pile_ct>1    % eliminate unused, preallocated entries from intermediate pile array    intermediate_piles = ...        intermediate_piles(:, :, 1:intermediate_pile_ct-1);else    % no piles resolved    intermediate_piles = [];endend