Skip to main content

Table 1 The results of algorithms for tandem nine-node network

From: An initial analysis of packet function-aware extension to Dijkstra algorithm for wireless networks

Node Interval D(x) N H 1(x) N H 2(x) N H 3(x)
1 [ 0.0,1500.0) 1.06+0.0008x S S S
2 [ 0.0,1500.0) 1.04+0.0016x S S S
3 [ 0.0,365.2) 1.26+0.0047x S S 1
  [ 365.2,1500.0) 2.10+0.0024x 1   
4 [ 0.0,62.9) 1.69+0.0094x S S 2
  [ 62.9,1500.0) 2.08+0.0032x 2   
5 [ 0.0,365.2) 2.30+0.0063x 2 1 3
  [ 365.2,1500.0) 3.14+0.0040x 3   
6 [ 0.0,130.4) 2.52+0.0094x 3 2 4
  [ 130.4,1500.0) 3.12+0.0048x 4   
7 [ 0.0,62.9) 2.95+0.0141x 3 3 5
  [ 62.9,365.2) 3.34+0.0079x 4   
  [ 365.2,1500.0) 4.18+0.0056x 5   
8 [ 0.0,23.1) 3.38+0.0188x 4 4 6
  [ 23.1,130.4) 3.56+0.0110x 5   
  [ 130.4,1500.0) 4.16+0.0064x 6