Please answer the following questions using the research paper:
1) Section 3.1:
If the distance between the sender and receiver is L and the ceiling height is h derive the expression of the propagation path length.
It is given as
in the paper in section 3.1. Please show how this expression is achieved. You can draw a triangle to show your work.
2) Section 4.2
Suppose the set of already scheduled links is {L1, L2, L3, L4, L5, L6} (same channel)
Using equation (3) how can we determine is link L7 can be added to the above set?
Show how the equation will be used step by step and explain each step verbally.
3) Section 4.2
Draw a simple graph to show conflict degree. Use channels as colors and show the algorithm step by step to color the graph. Explain what does thismean i.e. what have you constructed?
4) Give one idea how routing can be carried out in this research idea.
5) Give one idea how wired/wireless scheduling can be carried out in this research idea.
Attachment:- Mirror-Mirror.pdf