Both timers are related to the neighbour discovery function but they are applied to different actions, as hello timers state how long a router must wait for sending a hello packet
to a neighbour router, thus considering it as up, whereas dead timers state how long a router must wait for receiving a dead packet from a neighbour router prior to considering it as down.
The knowledge acquisition phase will share the information to the neighbour sensor nodes with its Hello packet
format, which consists of Sender ID, Residual Energy, and Depth.
Then, the cluster head broadcasts hello packet
, whose format is showed in Table 2.
The cluster head (CH) distributes CH Hello Packet
(CHP) to neighboring nodes periodically.
Later on, during deployment, each node was produced from the original master key and forwarded the hello packet
, which has its own identifiers to its neighbor.
(4) Factor of availability ([FAV.sub.i,j](i)): node i transmits HELLO packet
for the recognition whether this packet can be gotten by j.
(4) A HELLO packet
may be sent a bit later than expected due to some random delay in processing; thus, we take this into account by using DNT= 1.3x.
In the network layer the [delta] factor is calculated from the received information in the hello packet
. Then, both [gamma] and [delta] are used as inputs of the proposed fuzzy inference system (FIS) in order to calculate the dynamic adjustment factor [[beta].sub.rd].
In the first phase, sink assigns each floating node a dynamic HopID by broadcasting a Hello packet
. Every node received this Hello packet
updates and rebroadcasts it.
Upon receiving a hello packet
from a new neighbor, after a random delay, each node replies with its cluster key to the sender encrypted using their pair wise key which can be established by the existing method .
Initially the nodes will transmit a hello packet
to the base station.
In these models, we analytically compute the link probability success between two neighbors as well as the expected number of nodes that correctly receive a Hello packet
. Using this analysis, we show that if the neighbor discovery process is asymptotically equivalent in the three models, it offers very different behaviors locally in time.