A Novel Marko Vain Random Walk approach for Ad Hoc Multi-Hop Networks
Syoban Ajumal · International Journal for Research in Applied Science and Engineering Technology · 2018
In ad hoc multi-hop wireless network proposed novel Marko vain random walk approach to improve the performance in terms of end-to-end throughput, where each link is affected by interference coming from other multi-hop paths nearby. The approach captures the mutual impact of each path on all others. It can be applied to both, contention-based and scheduled, medium access control (MAC) protocols. Sources have data to send to destination nodes through n relays. A random walk on a directed graph consists of a sequence of vertices generated from a start vertex by selecting an edge, traversing the edge to a new vertex, and repeating the process. We will see that if the graph is strongly connected, then the fraction of time the walk spends at the various vertices of the graph converges to a stationary probability distribution. The Node assumed like Markovian randomwalk movement strategies moving over a graph (or network), while each sensor node, the impact on the end-to-end throughput and data arrival rates are increased over different sensor nodes. In particular, from the analysis, obtain the optimal movement strategy among a class of Markovian strategies so as to minimize the data loss rate over all sensor nodes, Unlike most previous approaches, the mathematical tool proposed appears to be scalable, allowing easy extension to any number of hops. The proposed approach outperforms good compared with existing approaches in terms of accuracy with very similar end to end delay and energy consumption.