HRNCHartman Reserve Nature Center (Cedar Falls, IA)
Copyright 1988-2018, All rights reserved.
References in periodicals archive ?
HRNC Algorithm: Input: T ={[t.sub.1],[t.sub.2],..,[t.sub.p]}; //Position of targets S={[s.sub.1],[s.sub.2],..,[s.sub.q]}; //Number of sensor nodes [r.sub.s]; //Coverage radius Condition and IP address of the nodes Output: [Node.sub.Identify_Neighbor] //Identification of nearest nodes 1 Deployment of sensors 2 Determine d between each node 3 Find the n 4 Calculate the D from received packets D [d.sub.proc] + [d.sub.queue] + [d.sub.trans] + [d.sub.prop] 5 Send the packet to receiver in its own time slot 6 check BER and noise to every packet 7 if conflict occurs; then 8 Records conflict message 9 return to 6 10 else 11 Send packet to all neighbor nodes 12 Process and send to base station 13 return [Node.sub.Identify_Neighbor] [FIGURE 2 OMITTED]
Figure 4.2 (a) shows that the overall latency for simulated MSN, which shows minimum performance for proposed algorithm HRNC than the BTS.
The simulation results of HRNC shows better performance than the existing algorithm.