Beaconless georouting has emerged as a viable packetforwarding technique in distributed wireless networks, particularly for applications requiring portability and scalability. In this paper, we focus on fine-tuning and developing the analytical tools associated with the study of beaconless georouting protocols. For instance, they have been traditionally analyzed and simulated from the perspective of a single hop only. However, end-to-end performance analysis is instrumental when considering practical application scenarios. Furthermore, beaconless georouting protocols have been studied in literature assuming equal communication ranges for the data and control packets. In reality, this is not true since the communication range is actually a function of the packet length (among other factors). Control packets are typically much shorter than data packets. As a consequence, a substantial discrepancy exists in practice between their respective communication ranges, causing many data packet drops. Accordingly, we introduce two simple strategies for bridging the gap between the control and data packet communication ranges. Our primary objective in this paper is to construct a realistic analysis describing the end-to-end performance of beaconless georouting protocols. Two flagship protocols are selected in this paper for further investigation. For a better perspective, the two protocols are actually compared to a hypothetical limit case, one which offers optimal energy and latency performance. Finally, we present four different application scenarios. For each scenario, we highlight the georouting protocol which performs the best and discuss the reasons behind it. © 2007-2012 IEEE.