Question

The links of a wireless network are labeled as depicted in the Figure below. Moreover there is a source node S and a destination node T. 8 11 19 20 27 10 1 C9 13 D 31 21 28 12 30 G H 22 AS T 7 29 1 2 E 26 6 14 18 B 23 4 15 F 25 5 24 16 17 1. [2 pts] List the faces traversed when using face routing from node S to node T in order.. 2. [4 pts] Apply the left-hand rule in face routing algorithm to give a path from node S to node T. In each case list the face and the edges of this face traversed in order. 3. [4 pts] Alternate righthand and lefthand rules as you change face starting with the righthand rule. In each case list the face and the edges of this face traversed in order. Note that if e = (u, v) is the last edge you discover (which is crossing the line ST) during the traversal of a face then start the traversal of the next face from the vertex u: you must list this edge but do not have to repeat this edge in your traversal. In your answer you must list all the links being traversed including the last one crossed and the paths formed must use the corresponding face routing algorithm!

          The links of a wireless network are labeled as depicted in the Figure below. Moreover there
is a source node S and a destination node T.
8
11
19
20
27
10
1
C9
13
D
31
21
28
12
30
G
H 22
AS
T
7
29
1
2
E
26
6
14
18
B
23
4
15
F
25
5
24
16
17
1. [2 pts] List the faces traversed when using face routing from node S to node T in
order..
2. [4 pts] Apply the left-hand rule in face routing algorithm to give a path from node
S to node T. In each case list the face and the edges of this face traversed in order.
3. [4 pts] Alternate righthand and lefthand rules as you change face starting with the
righthand rule. In each case list the face and the edges of this face traversed in order.
Note that if e = (u, v) is the last edge you discover (which is crossing the line ST) during
the traversal of a face then start the traversal of the next face from the vertex u: you must
list this edge but do not have to repeat this edge in your traversal. In your answer you
must list all the links being traversed including the last one crossed and the paths formed
must use the corresponding face routing algorithm!

The links of a wireless network are labeled as depicted in the Figure below. Moreover there
is a source node S and a destination node T.
8
11
19
20
27
10
1
C9
13
D
31
21
28
12
30
G
H 22
AS
T
7
29
1
2
E
26
6
14
18
B
23
4
15
F
25
5
24
16
17
1. [2 pts] List the faces traversed when using face routing from node S to node T in
order..
2. [4 pts] Apply the left-hand rule in face routing algorithm to give a path from node
S to node T. In each case list the face and the edges of this face traversed in order.
3. [4 pts] Alternate righthand and lefthand rules as you change face starting with the
righthand rule. In each case list the face and the edges of this face traversed in order.
Note that if e = (u, v) is the last edge you discover (which is crossing the line ST) during
the traversal of a face then start the traversal of the next face from the vertex u: you must
list this edge but do not have to repeat this edge in your traversal. In your answer you
must list all the links being traversed including the last one crossed and the paths formed
must use the corresponding face routing algorithm!

Added by Patricia M.

Question

Please give Ace some feedback