Download - Academy Publisher

nodes will be formed one cluster, their messages will be
stored in NT[] of the fixed nodes.
The referred fixed nodes will choose greater energy
than the average energy, and the nearest node to the
cluster-head from the NT[].
Compute k value, and call the optimal schedule
algorithm inter-scheduling(), select k working nodes.
The third step: data gathering, duration TD
while carry out data collection, call TDMAscheduling()
algorithm to inner-cluster nodes with TDMA, allocate the
initial work time with parallel division approach to k
inner-cluster working nodes;
the members of inner-cluster can receive Hello_Msg
within own slot from the cluster-head, then transmit the
sensing data to cluster-head. The cluster-head will
aggregate these data and forward them to fixed nodes.
B. EDG algorithm pseudo-code description
EDG()
{while( the time (Tc) is not expired) /* Tc stage
clustering begin */
{ if ( Nd.state = ’Y’) /*only for the fixed nodes*/
{ Broadcast(Fixednode_Msg); /*transmit the
message containing its own ID and time stamp */
}
if (Nd.state ≠’Y’) /*only for mobile node*/
{ Receive(Fixednode_Msg); /*receive up to 4
Fixednode_Msg message */
Δtij=|ti1-t0|; /* compute the distance from different
fixed nodes, approximately replace with delay time*/
Mrp_ID=Choose min( Δ tij); /* select the nearest
fixed node as the referred fixed node*/
}
}/* Tc stage end*/
while(the time (TH) is not expired) /* selecting
cluster-head TH stage begin*/
{ if(Nd.state ≠ ’Y’) Broadcast(Mobilenode_Msg) to
Mrp_ID;
/*all mobile nodes broadcast messages to round fixed
nodes, including its own ID, Mrp_ID, remaining energy
Er, Δti */
if(Nd.state=’Y’) /*the referred fixed node selects
cluster-head*/
{ Receive(Mobilenode_Msg); /* continuous receive
the messages from round mobile nodes, which satisfy the
condition (Nd.ID be equal to Mrp_ID of message ). And
these messages are stored in its own NT[].*/
k=INT(lg(1-ϕ )/lg((rc*rc+2*rc*rs)/(rc+rs)(rc+rs))+0.5);
The array NT[] order from small to large by dt
properties, the previous k records will be stored in NT[].
Compute the average remaining energy Ea in NT[]. In
the conditions of Er≥ Ea, select the nearest mobile node
from itself as the cluster-head, to KeyFixed_Msg.Cid.
KeyFixed_Msg.MidLIst[1..k]=NT[1..k]; /*store the
previous k nodes in NT[] to ID list of mobile member
nodes in KeyFixed_Msg message.*/
Broadcast(KeyFixed_Msg); /*broadcast the messages
to inner-cluster members, including its own ID and the ID
list of inner-cluster mobile member nodes*/
}
if (Nd.state≠’Y’) /*only for mobile nodes*/
{ Receive(KeyFixed_Msg);
if (Nd.ID∈KeyFixed_Msg.MidList[1..k])
{ if(Nd.ID= KeyFixed_Msg.Cid) /*if it’s cluster-head */
{ Nd.state=’B’; /*store the KeyFixed_Msg
message into NT[] of the cluster-head */
}
else Nd.state=’G’; /*the k selected inner-cluster nodes*/
}else sleep; /*nodes not be selected in cluster */
}
}/* selecting cluster-head TH stage end*/
while( the time (TD) is not expired)
/*collecting data TD stage begin*/
{ for(i=1;i