Analyzing routing strategy NFP in multihop packet radio network on a line

Abstract- We present a one-dimensional model to analyze routing strategy N F P (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 ac-cording to a nonhomogeneous Poisson process. N F P transmits to the nearest neighbor in the desired di-rection with transmission range as small as possible, to minimize the probability of collisions. This model is ap-propriate e.g. for road traffic information systems. Our analysis is based on a complete mathematical descrip-tion, the solution of certain differential equations is one of the key points t o arrive at a closed form solution. Re-sults are presented graphically. It turns out that N F P has uniformly largest throughput, while progress be