where k i is the degree of node i and a is the adjacency matrix element.
ki is the degree of node i, and is the set of nodes at distance from node i.
Through the use of appropriate design parameters the impact on blocking probability, wavelengths assignment, LSP connection requests, degree of node connectivity and network utilization can be minimized while also achieving energy savings.
The (local) clustering coefficient4 ci of a node is defined as where ei is the number of neighbors of i which are mutual neighbors, and ki is the degree of node i. Therefore the (local) clustering coefficient of a node i is the ratio between the number of neighbors of i which are mutual neighbors and the maximal possible number of edges between neighbors of i.
The degree of node v is denoted as D v).
Let (d_mathrm{min}) denote degree of node v.
T(_i) indicates the whole trust degree of node i.
Let (k_{a}) be the degree of node a, so that (k_{a}=left| N_{a}right|).
where κ i s is the number of links of node i to nodes in modules s, and k i is the total degree of node i.
Priority factor of cluster head, backup node, and newly arrived cluster head is calculated by adding sum of degree of node and the remaining battery life.
As a result of being in the lower bound, the degree of node e is not large and there is not a big difference between ORS and FAST_PPR.
