A Routing Algorithm for Wireless Ad-hoc Networks Based on an Opportunistic Model

This article intends to offer an opportunistic routing algorithms for multi-hop wireless Ad-hoc Networks.The proposed algorithms comprise such a strong and desirable framework that it provides an optimal performance even when it lacks sufficient information about channel statistics and network model. Given the expected average per packet cost criterion, this algorithm has optimal performance. The proposed algorithms simultaneously address such issues as learning and routing in an opportunistic model in which the network structure has the property of transmission success probabilities. Generally, this learning trend results in a random routing algorithms which efficiently explores and exploits the opportunities in the network

کلیدواژه ها:

routing ، opportunistic ، transmission ، explores