Adaptive routing algorithms that opportunistically route the packets in the absence of reliable knowledge about channel statistics and the network model. In this paper, design adaptive routing algorithms, Distributed Opportunistic Routing (d-AdaptOR), which minimizes the expected number of transmissions and thus improving the throughput. The remainder of the dissertation concerns with the design routing algorithms to avoid congestion in the network. Describe a Distributed Opportunistic Routing algorithm with Congestion Diversity (ORCD) which employs receiver diversity and minimizes end-end delay.
Keywords
Mobile Ad Hoc Networks
Opportunistic Routing
Diversity Protocols
Authors
J.Angelamary
P.Balamurugan
How to Cite this Article
J.Angelamary, P.Balamurugan (2017).
"OPPORTUNISTIC ROUTING WITH PARTIAL DIVERSITY IN MOBILE AD HOC NETWORKS".
International Journal of Contemporary Research in Computer Science and Technology,
3(11), pp. 1-6.