Presents a one-dimensional model to analyze routing strategy NFP (nearest with forward progress) for a multihop packet radio network. It is assumed that each station has adjustable transmission range to address target nodes, distributed on a line according to a nonhomogeneous Poisson process. NFP transmits to the nearest neighbor in the desired direction with transmission range as small as possible, to minimize the probability of collisions. This model is appropriate e.g. for road traffic information systems. The analysis is based on a complete mathematical description, the solution of certain differential equations is one of the key points to arrive at a closed form solution. Results are presented. Graphically, it turns out that NFP has uniformly largest throughput, while progress behaves comparably to other routing strategies proposed in the literature.>