Contention-based Geographic Forwarding strategies for position-centric routing

This contribution addresses network routing algorithms exploiting geographic forwarding strategies to enhance the performance of distributed Random Multiple-Access (RMA) schemes in autonomous multi-hop wireless scenarios. Indeed, the Relay Selection (RS) mechanism among neighbors required to define an adequate relay at hop-basis is determinant to the overall system performance. Herein, the expected advancement towards the final destination achieved by the candidate relays following a specific Contention-based Geographic Forwarding (CGF) strategy - distinct forwarding decision regions - is quantified. Stochastic geometry and non-parametric order statistics concepts are exploited so as to characterize the expected progress at each hop when selecting a suitable relay. Two geographic forwarding areas, namely, sectoral and circular lens forwarding regions are used to derive priority functions so as to map nodes positions to the replying sequence of candidate relays. Results have shown that the expected distance of the n-th nearest eligible relay is larger when the convex lens decision region is employed. Additionally, the long-hop routing strategy is less sensitive then the short-hop routing alternative to increasing number of contending relay nodes.