1. What contributions have the authors mentioned in the paper "Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios" ?
The authors investigate the performance of different protocol stacks under various application scenarios.. The authors show that the Parametric Probabilistic Protocols, which they generalize from their original definition, can outperform standard routing protocols, such as AODV or Gossiping or Shortest-Path, in a variety of realistic scenarios.
read more
2. What is the effect of k1 on the shortest-path packet?
When the k1 parameter is very high, there are very few simultaneous packet copies, so the chance of a ”not-shortest-path” packet arriving at a node before a ”shortest-path-packet” is very low.
read more
3. What is the reason why AODV performs better than Flooding?
In this subset of parameter space, the data/control ratio necessary for AODV to maintain its paths surpasses that produced by simple Flooding because the discovered paths are breaking too frequently.
read more
4. What is the closely related work to ours?
The work most closely related to ours is [3], where Parametric Probabilistic Sensor Network Routing was proposed and tested in a light-weight simulation environment, not taking into account issues of dissemination of global data or protocol layers other than routing.
read more
