ELEN E6951 - Wireless & Mobile Networking II

Problem Set #3

Problem 1 (10 pts.)

Some node(s) along the route moved, after the RREP was received by the source node, and the
link is broken.
The RREP message was replied by an intermediate node based on the routing information in
its route cache. The information was invalid (outdated) since it included a broken link that the
intermediate node was not aware.

Problem 2 (20 pts.)
1 (10 pts.) This pseudo code is based on the description in the Section 2 of the paper - C. Perkins
and E. Royer, Ad hoc on-demand distance-vector routing, Proc. WMCSA99, Feb. 1999. (Some of
the details, such as Sequence number, Broadcast ID, Expiration time, and Hop counts are
omitted.)
M ODIFIED -AODV
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

(route cache initialization)

while receive RREP from a downstream neighbor
link = active
if first RREP
update current route
elseif second RREP
update backup route
(during operation)
while being on the active path
if no broadcast message || no hello message || no reply to hello message,
from downstream neighbor along the active path within hello interval
then
link = broken
current route backup route
broadcast RREQ
if receive RREP from a downstream neighbor
if the RREP suggests better route than current route
update current route
elseif the RREP suggests better route than backup route
update backup route


2 (10 pts.)

These are the examples of potential side effects.

The data size of the route cache increases.

The backup route could be a suboptimal route from the source to the destination. In other
words, if Path Discovery (RREQ) was initiated from the source, there may be better (shorter)
path found.
While RREQ was initiated by the intermediate node to look for a backup route, since neighboring node(s) may not be aware of the broken link (at the downstream of the intermediate node),
such neighboring node(s) may suggest a route that could cause loop(s) in the new route(s).
By the time RREQ was issued by the intermediate node, the source node may have finished its
data transmission. Thus the RREQ was not necessary.

Problem 3 (40 pts.) One example of the packet propagation is captured as below. (Note that RREQ
messages are sent in broadcast manner. The message will be forwarded back to the sender and will
be ignored.)
t=0

t=1

t=2

t=3

t=4

t=5

t=6

t=7

t=8
3

t=9

t = 10

t = 11

D
p1
p2

p1

p1
p1

p4

p4

p4

t = 15

p3

p3

p4

2
t = 14

p2

t = 13

4
p3

p3

t = 12
3

p2

p2

D
p5

p5

p5

p5

RREQ
RREP
Data

Figure 1: Packet Propagation in 3x3 Grid Network

A-1 (10 pts.) There are total of 8 RREQ, 4 RREP and 20 data packets for both DSR and AODV.
(The broadcasted RREQ messages from the same node at the same time are counted as 1 packet.)

A-2 (10 pts.) In A-2 and A-3, detailed parameters such as broadcast id, hop counts, sequence numbers,
and expiration time are omitted.
In the case of DSR, the entire path information to the Source and to the Destination are stored at
the node, if the node is on the active path. For the nodes that are not on the active path, only the path
information to the Source are stored.
In the case of AODV, the next hop information to the Source and to the Destination are stored
at the node, if the node is on the active path. If the node is not on the active path, temporary path
information (to the Source only) maybe stored, but will time out eventually.
Node
S
1
2
3
4
5
6
7
D

DSR
[S,1,4,6,D]
[S,1],[1,4,6,D]
[S,2]
[S,1,3]
[S,1,4][4,6,D]
[S,2,5]
[S,1,4,6][6,D]
[S,2,5,7]
[S,1,4,6,D]

AODV
[D,1]
[S,S],[D,4]
[S,1],[D,6]
[S,4],[D,D]
[S,6]

Table 1: Route information maintained at each node


A-3 (10 pts.) In the case of DSR, all the routing information (hops) are put in the data packet
header. In the case of AODV, the data packet header only includes the destination and the next hop
information.
Node
S
1
2
3
4
5
6
7
D

DSR
[S,1,4,6,D]
[S,1,4,6,D]
[S,1,4,6,D]
[S,1,4,6,D]
-

AODV
[D,1]
[D,4]
[D,6]
[D,D]
-

Table 2: Data packet header


B (10 pts.) From the figure, it appears the distances between the neighboring nodes are equal, thus
in the process of Path Discovery, RREQ messages might collide at all intersections. (For example, at
time t = 1 in Figure 1, RREQ messages sent from node 1 and node 2 will collide at node S and node
4.) Thus the performance of the Path Discovery phase will be drastically degraded.

3

Problem 4 (10 pts.)

PR (i)
>z
k
X
PR (j)

PR (i) > z

k
X

PR (j)

j=1,j6=i

j=1,j6=i

PR (i) > z

k
X


PR (j) PR (i)

j=1

PR (i)(1 + z) > z

k
X

PR (j)

(1)

j=1

Suppose you have two nodes located at the same distance from the access point and packets are
received from both nodes. Then:
PR (i)(1 + z) > 2zPR (i)

1 + z > 2z

(2)

(2) will hold if z < 1.


Extra: If the access point receives packets from all k nodes, then by summing (1) for all k nodes,
you will get:
k
X

PR (i)(1 + z) >

k
k
X
X
PR (j)
z
j=1

i=1

1 + z > zk

j=1

1+z
>k
z

(3)

This is the bound for the maximum number of packets received simultaneously.

Problem 5 (20 pts.)

(a)

(b)

Figure 2:

1. One hop interference graph is shown in figure 2(a).

2. One hop interference graph is shown in figure 2(b).
3. Edges {AC,BD,EF} yield maximum weight matching with a total weight of 27.
4. Maximal (greedy) weight matching algorithm will select links in the following order (1) CD
(2) EF and (3) AB. However, greedy matching will have a total weight of 20.