An Adaptive Opportunistic Routing Scheme for Wireless Ad-hoc Networks- projects 2012
projects 2012, Networking , February 2012
A distributed adaptive opportunistic routing scheme for multi-hop wireless ad-hoc networks is proposed. The proposed scheme utilizes a reinforcement learning framework to opportunistically route the packets even in the absence of reliable knowledge about channel statistics and network model. This scheme is shown to be optimal with respect to an expected average per packet reward criterion. The proposed routing scheme jointly addresses the issues of learning and routing in an opportunistic context, where the network structure is characterized by the transmission success probabilities. In particular, this learning framework leads to a stochastic routing scheme which optimally ÃƒÂ¢Ã¢â€šÂ¬Ã…â€œexploresÃƒÂ¢Ã¢â€šÂ¬Ã‚Â and ÃƒÂ¢Ã¢â€šÂ¬Ã…â€œexploitsÃƒÂ¢Ã¢â€šÂ¬Ã‚Â the opportunities in the network.
In this application, we try to implement Adhoc network with opportunistic routing. We use Mysql 5.0 as database for this application. We are going to develop this network in Java Swing for which JDK 1.6 or higher version can be used. Socket connection will be established between the router and nodes. Number of node in the network can be any as of our interest. Number of nodes to be created will be given as the first input. As this is considered to be wireless adhoc network, the topology can be any as it changes in the wireless adhoc network dynamically. The aim of the work is to implement adaptive opportunistic routing scheme.
While making the routing decision, three schemes have been implemented namely relay, re-transmission, all dropped.Ãƒâ€šÃ‚Â 1) Relay is the normal case, where the source node chooses neighbor nodes as relay to transmit the data packets. 2) All-dropped is the case, when a node intentionally drops the entire packet received by it, in such case data will not be delivered to destination. 3) Re-transmission is the case, when the source node chooses the dropping node as one of its relay, then the data will not the delivered to the destination, thus the source node re-transmits the data again using the path, which excludes the dropping node.