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


R. Mathar, J. Mattfeldt,


        We present 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. Our 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 comparable to other routing strategies proposed in the literature.

BibTEX Reference Entry 

	author = {Rudolf Mathar and J{\"u}rgen Mattfeldt},
	title = "Analyzing routing strategy NFP in multihop packet radio networks on a line",
	pages = "977-988",
	journal = "{IEEE} Transactions on Communications",
	volume = "43",
	number = "2/3/4",
	month = Mar,
	year = 1995,
	hsb = RWTH-CONV-223144,


 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.