Here I am Trying to find the status of node but unable to resolve what error every node is just printing void - unetstack

Question

Here i first find all the neighbours of node and then find depth of all neighbours and then send a rangereq to sink(node-1) if node directly connected to sink then node is normal or if not connected then its status is void.if its void the the node which are below to current node then they are void.i unable to figure what wrong i have done.
import org.arl.unet.*
import org.arl.unet.localization.RangeNtf
import org.arl.unet.localization.RangeReq
import org.arl.unet.net.RouteDiscoveryProtocol
import org.arl.unet.net.RouteDiscoveryReq
import org.arl.unet.net.RouteDiscoveryNtf
import org.arl.unet.UnetAgent
class status extends UnetAgent{
def router,ranging,rdp,addr,z1;
def neighbour=[];
def dep=[];
def locat=new double[3];
def status=1;
void neigh()
{
neighbour.clear();
def ntf;
int attempts = 1;
int phantom =130 ;
int timeout = 10000;
rdp << new RouteDiscoveryReq(to: phantom, count: attempts);
while (ntf = receive(RouteDiscoveryNtf, timeout)) {
neighbour << ntf.nextHop ;
}
neighbour = neighbour.unique();
log.info("Discovered Neighbours: ${neighbour} for Node-{$addr}}");
}
void Finddepth()
{
dep.clear();
def n=neighbour.size(),i=0,k;
while(i<n)
{
k=neighbour[i];
i++;
ranging << new RangeReq(to:k,requestLocation:true);
}
}
void NodefuncVoid()
{
def i=0,n=neighbour.size(),k;
while(i<n)
{
k=neighbour[i];
def z2 = dep[i];
i++;
if(z2<=z1)
{
router << new DatagramNtf(to:k,from:addr);
}
}
}
void NodefuncNormal()
{
def i=0,n=neighbour.size(),k;
while(i<n)
{
k=neighbour[i];
def z2 = dep[i];
i++;
if(z2<=z1)
{
router << new DatagramReq(to:k);
}
}
}
public void startup()
{
rdp = agentForService Services.ROUTE_MAINTENANCE;
subscribe topic(rdp);
router = agentForService Services.ROUTING;
subscribe topic(router);
ranging = agentForService Services.RANGING;
subscribe topic(ranging);
def nodeInfo = agentForService Services.NODE_INFO;
subscribe topic(nodeInfo);
addr = nodeInfo.address;
z1 = nodeInfo.location[2]
neigh();
Finddepth();
ranging << new RangeReq(to:1);
}
public void processMessage(Message msg) {
if (msg instanceof RangeNtf){
double z2;
locat = msg.getPeerLocation();
z2=locat[2];
dep << z2;
}
if (msg instanceof RangeNtf && msg.from==1 || msg instanceof DatagramReq)
{
//status is Normal
log.info("Node-{$addr} is Normal");
//send below nodes noraml
NodefuncNormal();
}
else if(msg instanceof DatagramNtf)
{
//trap node
log.info("Node-{$addr} is Trap node if it chooses Node-{$msg.from}");
}
else
{
log.info("Node-{$addr} is Void Node");
NodefuncVoid();
}
}
}