Efficient Data Collection Method in Sensor Networks

Algorithm 6

ELM-based efficient data gathering algorithm.

	Function: Select the next hop node of the random path in the mobile network environment
	Input: Current node on random path, node set
	Output: Next hop of random path
	Algorithm Description:
(1)	();  //Get the current node predicted position by ELM
(2)	foreach node n in N
(3)	();  //Get the predicted position of the nodes in the sensor network through ELM
(4)	;  //Add new node to new node position combined with
(5)	end foreach
(6)	;
(7)	;  //Get the length of unlabeled nodes in the
(8)	;
(9)	foreach node in
(10)	if p not exits Route then
(11)	;
(12)	;
(13)	end if
(14)	end foreach
(15)	;
(16)	foreach node in
(17)	if then
(18)	;
(19)	end if
(20)	end foreach
(21)	;  //Randomly select node from
(22)	while exists in Route or do
(23)	;
(24)	end while
(25)	;  //Node data overlay
(26)	;  //Current path length plus 1
(27)	;  //Current node is marked as passed
(28)	return ;  //Returns the next hop node