PROJECT TITLE :

On Stochastic Analysis of Greedy Routing in Vehicular Networks

ABSTRACT:

Even the greedy routing is widely employed in wireless networks, its theoretical study continues to be limited in vehicle environments. During this paper, we theoretically analyze the performance of the greedy routing underneath three typical vehicle scenarios, i.e., the single-lane road, the multilane road, and also the multilevel road. We have a tendency to initial propose the analytical model by analyzing characteristics of traffic environments, that contain the width and multilevel features of roads. Specifically, we have a tendency to prove that the road-width is ignorable underneath sure conditions, whereas the information measured in an out of doors experiment reveal that the multilevel feature is non-ignorable because its existence dramatically degrades the transmission vary. Based mostly on the model, we have a tendency to analyze the routing length of the greedy routing for all scenarios in the following three aspects. one) We have a tendency to derive the distribution perform for the first one-hop progress. 2) We have a tendency to prove that routing increments are history-dependent and give one sufficient condition that ensures these increments are approximately i.i.d. three) We have a tendency to calculate the routing length described by the $h$-hop coverage and hop count using the renewal theory. Finally, simulations are conducted to verify the accuracy of our analysis.