Data Collecting and Energy Charging Oriented Mobile Path Design for Rechargeable Wireless Sensor Networks

Algorithm 1

Data collecting and energy charging oriented mobile path design algorithm.

INPUT

S={S1, ...Si, ..., Sn}: a set of sensor nodes to be visited.

s={s1, ...si, ..., sn}: a set sensor locations to be visited with disk-shaped R-neighborhood of sensor nodes

set S.

(σ, μ, α, r): the unsupervised learning parameters.

(Σ,P): Σ defines the order of visits to the sensors S, P are the Bezier curve based tour path to visit sensor nodes.

iter = 1;

while iter < itermax do

STEP1. winner selection

for each Si ∈S do

Determine winner and insert it to winner set

N ←− insert_winner(N,v)

STEP2. winner adaptation

Adapt v using the neighbouring function

endfor

Update the best solution found now

Remove all no competing nodes from

iter + +

if represents a shorter route than (Σ,P), then

(Σ, P) ←−

STEP3. Results output

return (Σ,P)

endwhile

STEP4. Bezier curve transform

while k < n do

T_k ←−P_k

endwhile

OUTPUT

return (Σ, T)