ETOR-Efficient Token based Opportunistic Routing
A. SAICHAND, Aysha Naseer · International journal of Computer Networks & Communications · 2013
This paper proposes an Efficient Token based Opportunistic Routing called ETOR, which is an improvement to the token based coordination approach for opportunistic routing proposed by Economy [1].In Economy, method used for finding the connected candidate order chooses neighbor as the next candidate by considering ETX of that neighbor towards the source but it does not consider the link probability between the relay candidate and neighbor to be selected.ETOR proposes variant methods for finding the connected candidate order in token based opportunistic routing by considering both the ETX of the neighbor towards source as well as ETX of the relay towards sending candidate which avoids weaker links between its intermediate nodes thereby improving the throughput and reducing the AA Ratio.We also propose a solution for reducing the number of hops traversed by the token, which in turn increases the token generation speed.Simulation results show that the proposed ETOR approaches perform better than Economy approach in terms of AA Ratio, number of hops traversed by the token and number of token traversals.