Exploring the energy-latency tradeoff of geographic random forwarding for ad hoc and sensor networks

Abstract

In this paper, we consider a novel forwarding technique based on collision avoidance and on knowledge of the geographical location of the nodes involved. Selection of the relaying nodes is made randomly via contention among receivers. We consider a simplified performance analysis and provide analytical parameter optimization. Comparisons giving evidence of the accuracy of our approximate approach are also provided. The scheme is compared with STEM, and is shown to perform significantly better for sufficient node density.