Existing localized routing algorithms include greedy routing and GFG (with guaranteed delivery) for the unit disk graph model and expected progress routing for a physical layer model. In a physical layer model, the packet reception probability depends on the distance between nodes. We propose to ...
With compass algorithms, a packet can not get stuck anymore, but they do only guarantee loop-freedom for certain kind of network graphs. GFG [11], GPSR [12], AFR [15] and GRA [31] try to overcome these drawbacks by applying greedy loop-free forwarding combined with a re- covery ...
Please note that GFG relies on an external location service like GPS. We tested two different network densities for all the algorithms and we show the results in figure 5. As Figure 5 shows, our RTP...Tejeda, H., Chávez, E., Sánchez, J., Ruiz, P. Energy-efficient face routing on...
Please note that GFG relies on an external location service like GPS. We tested two different network densities for all the algorithms and we show the results in figure 5. As Figure 5 shows, our RTP...Tejeda, H., Chavez, E., Sanchez, J.A., Ruiz, P.M.: Energy-Efficient Face ...