OLSR protocol

1. OLSR protocol is used - For each node, determine the list of its 1-hop neighbors and 2-hops neighbors.

2. To select its MPRs, a node can choose a minimum set of 1-hop neighbors which are necessary to reach all 2-hop neighbors. By using this algorithm of MPR selection, determine for each node its set of MPRs (Notice that MPR sets are not necessarily unique).

3. In OLSR, each node needs to have a partial knowledge of the network. To do that, each MPR will broadcast throughout the network the identifiers of nodes that have chosen it as MPR. How many transmissions are necessary for a single MPR to disseminate this information throughout the network?

4. How many transmissions in total are required in the network such that each node can have a partial topographical map of the network? 2

5. Once this partial knowledge is acquired, determine the routing table of E. Assume a shortest path algorithm is used for that.

6. Determine the route from E to H

7. If we assume that the size of a data packet is the same as a control packet, how many data packets need to be transmitted from E to H to have OLSR more efficient than classic flooding?

8. If we assume that the size of a data packet is the same as a control packet, how many data packets need to be transmitted from E to H to have OLSR more efficient than DSR?

H D B F. A G . L- J H D B F. A G . L- J