Subramanian, AnanthSayed, Ali H.2017-12-192017-12-192017-12-19200410.1109/VETECS.2004.1390662https://infoscience.epfl.ch/handle/20.500.14299/143048We propose a probabilistic routing algorithm for wireless ad-hoc networks. The focus is on applications that can tolerate end-to-end delays and those for which the final destination for the packets is a small region. The nodes are assumed stationary and establish connections with a master node according to a priority scheme that relates to their distances from the master node. Simulation results illustrate the performance of the proposed algorithm.text::conference output::conference proceedings::conference paper