On the Optimum Number of Hops in a Multi-Hop Linear Network With Randomly Located Nodes
In this paper, the authors propose a novel linear network model to characterize the randomness in the node locations. Unlike most previous work which usually assumes that the nodes are uniformly distributed on a line, they consider a linear network with randomly located nodes. They model the randomness in distance and show that the proposed model is a reasonable approximation. They evaluate a performance bound on spectral efficiency, and then calculate the optimum number of hops. Simulation results verify the model.