Research Article

A Secure Truth Discovery for Data Aggregation in Mobile Crowd Sensing

Algorithm 3

Node join.
(1)Denoting is the number of nodes in the cluster Cy;
(2)Pj ⟶ S; //Pj sends a request to join message to server S
(3)if ()
(4)S selects Cy;
(5)S ⟶ CHy; //S forwards the join request to the cluster head node CHy
(6) CHy ⟶ Pi;
(7) CHy ⟶ Pi+1;
(8)Denoting is the number of nodes in the cluster Cy;
(9)Pj ⟶ S; //Pj sends a request to join message to server S
(10)if ()
(11)S selects Cy;
(12)S ⟶ CHy; //S forwards the join request to the cluster head node CHy
(13) CHy ⟶ Pi;
(14) CHy ⟶ Pi+1;
(15)uj = random(), ; //Pj randomly generates an integer
(16), , ; //updating the public parameters
(17), , ; //updating secret random numbers
(18)else
(19) establish a new cluster Ny;
(20)Ny : ;
(21)Ny : ;
(22)end if