T-Bitmap is a bit string type, which is used to record what descendant nodes are beneath a current node
To conveniently broadcast the next hop node ID selected by the current node
, a new packet format is designed in the proposed method.
It means that the label of current node
is decided by its neighbour which has the biggest impact of node.
If the current node
in the cluster to another cluster period will end.
Each potential destination, not already in the path, from the current node
is explored in turn.
In , two heuristic algorithms are proposed: (i) Local Closest First (LCF), which seeks the next node with the shortest distance to the current node
, and (ii) Global Closest First (GCF) that seeks the other closer node to the sink.
Secondary, direction-based strategy selects a neighbor node, deviation angle from the line connecting the current node
and the sink whose is the minimum between all neighbors .
And from (3) and (5), it can be concluded that, when regarding node voltage limit as the main factor that affects node loadability, the node voltage drop at current node
load power can reflect the potential node loadability to some extent.
Note that the spatio-temporal discretization alternating voltage node and current node
separated by [DELTA]x/2 in space and [DELTA]t/2 in time.
Where l: current connection, X: set of total incoming connections, c: current node
[member of] path, P: all nodes along the path, D(l): all data through the current connection, I(c) : incoming buffer of the current node
Best-first search algorithm doesn't give up nodes except they are dead nodes and compare score of current node
with score of previous node in each evaluation to get a better node, which is in order to avoid losing the best search node effectively.
where the member variable m depth is used to save the depth value of current node
; m_parent is the pointer which points to the parent node; m_Width, mHeight, m_Level are used to save the resolution of current node
, respectively; m_MaxGray and m_MinGray are used to save the maximal and minimal gray level of current node
, respectively; and the pointer array m_pOctreeNodes points to the eight child nodes, respectively.