ELEN E6951 - Wireless & Mobile Networking II

Problem Set #3

Problem 1
Consider the DSR routing protocol (described in detail in the book Ad Hoc Networking and in the
paper D. B. Johnson and D. A. Maltz, Dynamic source routing in ad hoc wireless networks, In T.
Imielinski and H. Korth, editors, Mobile Computing, pages 153181. Kluwer, 1996).
When using the protocol, it is possible for the route received in an RREP (route reply) message
to be stale (or broken) at the time the RREP is received by the source performing the route discovery.
Provide 2 possible reasons for this.
Problem 2
Consider the AODV routing protocol (described in detail in the book Ad Hoc Networking and in
the paper: C. Perkins and E. Royer, Ad hoc on-demand distance-vector routing, Proc. WMCSA99,
Feb. 1999 - http://www.cs.ucsb.edu/ebelding/txt/aodv.ps).
The protocol contains a path maintenance routine that has nodes monitor their local connectivity.
When a node detects a break in a link to a next hop contained in its routing table, it propagates a
special RREP message upstream on this route to trigger a repair.
Section 4.2 of the paper mentions the possibility of allowing the intermediate node that detects the
link breakage to seek out a new path on its own, thus repairing the break locally. Imagine instead, that
we want to try to eliminate even this delay by having nodes on an active route maintain back-up
next hops that they can instantly switch to if they detect that the link to their primary next hop has
been broken.
1. Provide a high-level description of what modifications to AODV would be necessary to facilitate this functionality. It is recommended to use pseudo-code.
2. What are the downsides of these modifications?
Problem 3

Figure 1:

Consider the 3X3 grid network shown in figure 1 in which the node in the lowest left corner has to
send 5 data packets to the node at the top right corner.
Assume that the time is slotted and that in every time slot nodes can send at most a single packet
to each of their neighbors (there are no collisions).
A Answer the following questions for both DSR and AODV.
1 How many packets of each type will be sent during the operation of the network?
2 How much information is maintained at each of the nodes?
3 How much information has to be transmitted in the data packet header?
B Discuss how the removal of the assumption that there are no collisions will affect the performance.
Problem 4
Consider a model in which:
k spatially distributed nodes transmit to an access point.
A distance between node i and the access point is di
A node transmits with a constant power level PT .
The power attenuates as a function of the distance. Namely the received power of the transmission by node i is PR (i) = PT /d4i
Packets are received according to an SNR reception model. Namely a packet transmitted from
node i is correctly received if
PR (i)
>z
(1)
Pk
j=1,j6=i PR (j)
where z is a constant.
Show that for z > 1 only one packet can be received simultaneously.
Problem 5

(a)

(b)

Figure 2:

1. Draw the one hop interference graph for the graph shown in figure 2(a)?
2. Draw the two hop interference graph for the graph shown in figure 2(a)?
3. What is the maximum weight matching in the graph shown in figure 2(b)?
4. What is the maximal (greedy) weight matching in the graph shown in figure 2(b)?