Analyzing routing strategy NFP in multihop packet radio networks on a line
- 1 February 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 43 (2/3/4) , 977-988
- https://doi.org/10.1109/26.380130
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Transmission range control for packet radio networks or why magic numbers are distance dependentPublished by Springer Nature ,2005
- Stochastik für InformatikerPublished by Springer Nature ,1990
- Transmission Range Control in Multihop Packet Radio NetworksIEEE Transactions on Communications, 1986
- Optimal Transmission Ranges for Randomly Distributed Packet Radio TerminalsIEEE Transactions on Communications, 1984
- ALOHA packet system with and without slots and captureACM SIGCOMM Computer Communication Review, 1975