عندي سؤالين بال ad hoc ولازم اعرف الحل لانه الاستاذ طلبها منا كتحدي ولم يذكر طريقو او قانون لكيفية الحل
ومطلوب في الامتحان فأتمنى احد يساعدني نشرت السؤال في اكثر من منتدي ولم احصل اي جواب ...واملي بكم كبير : السؤالين هما :
Q1/ Assumming a 60 X 60 grid connected ad hoc network is given to you ,and
address of each node is given by (i,j ), with 0=<i/j<60. Node (k,l) need to communicate with the mode(m,n).
a- what path is followed if each node has information about their neighbors at distance d(number of hops? ).
b-What would be the size of the routing table?
c- How many tables need to be updated if one
node(p,q) is removed from the network?
d- Route table /shortest route for cost(i,j)= f(i,j),e.g cost(i,j)=j2+i
Q2/In Q1 node (k,l) need to communicate with node (m,n) each node
Maintains a routing table of all those nodes which are at a maximum distance
Of d hops .what is the optimal value of d if maintaining 10 entries in
A routing table is equivalent to one message transmission among
Adjacent nodes?