Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{145105,
        author = {S SRIKANTH},
        title = { Enhanced Routing with Congestion Diversity in Wireless Ad Hoc Networks },
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {7},
        pages = {303-306},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=145105},
        abstract = {A wireless ad hoc network is a decentralized type of wireless network. If the network is adhoc since it does not rely on a pre accessible infrastructure, such as routers in wired networks and access points in managed wireless networks. As a alternate for, each node contribute in routing by forwarding data for remaining nodes, so the determination of which nodes forward data is made energetically on the basis of network connectivity. In adding together to the characteristic routing, ad hoc networks can use flooding for forwarding the data. A distributed adaptive opportunistic routing design for multihop wireless adhoc networks is projected. The projected scheme makes use of a support learning framework to opportunistically route the packets even in the absence of dependable information about channel statistics and network model. The proposed scheme is to be most select with respect to an expected average per-packet recompense criterion. The proposed routing scheme in cooperation addresses the issues of knowledge and routing in an opportunistic background, where the network structure is characterized by the transmission success probabilities. In exacting, this knowledge framework leads to a stochastic routing scheme that optimally “explores” and “exploits” the opportunities in the network. },
        keywords = {Wireless Ad Hoc Networks, Opportunistic Routing, Reward Maximization, Routing Algorithm},
        month = {},
        }