2.1 Maximum Neighbor Priority Routing Algorithm
This section adopts the strategy of preferentially selecting the node with the largest
neighbor set and controls the selection range of the node. The improved heuristic
maximum neighbor priority routing algorithm (MNR) is proposed. Different from the
HyperDRouter algorithm, Eq. (2.1) further controls the range of selected nodes, which
makes it more likely to find the best path.
Path MNR ¼
X v
t¼u
maxfNeisðpÞjp 2 All minfminfdifferenceðl t ; l v Þggg
ð2:1Þ
2.2 Multipath Minimum Routing Algorithm
The multipath minimum routing algorithm (MMNR) uses the enumeration search
strategy to find the path from the starting point to the destination node by finding all the
nodes that meet the conditions, and finally finds the optimal path through statistics. The
path formula is shown in Eq. 2.2.
Path MMNR ¼ minð
X v
t¼u
All maxfNeisðpÞjp 2 All minfminfdifferenceðl t; l v ÞgggÞ: ð2:2Þ
Algorithm 1 selects all nodes that satisfy the cyclic iteration condition (lines 7–11).
When the target node is found (lines 3–5), the path is stored in the path of statistical
path set. If the path is divided into m 1 paths, the time complexity is O m 1 Â k
2
ð
Þ .
436
X. Tao et al.