PROJECT TITLE :

COMO: A Game-Theoretic Approach for Joint Multirate Opportunistic Routing and Forwarding in Non-Cooperative Wireless Networks

ABSTRACT:

Multirate opportunistic routing was proposed to achieve high throughput by exploiting multi-user diversity and transmission rate diversity in wireless networks. But, the performance of multirate opportunistic routing still can't be guaranteed when participating nodes are contributed by totally different parties and thus have selfish behaviors. During this paper, we present the primary Cooperation-Optimal protocol for Multirate Opportunistic routing and forwarding, particularly COMO, which guarantee the faithfulness of every player, and so achieve the social efficiency and strongly Pareto economical Nash equilibrium with the faithfulness as a given property. Here, social efficiency means that the top-to-end throughput should be maximized, while in a very strongly Pareto efficient Nash equilibrium, no one can improve her utility while not decreasing the utility of a minimum of one different player. We tend to not solely rigorously prove the game-theoretic properties of our incentive protocol, but also extensively evaluate its performance on the ORBIT wireless testbed. Experiment results show that our protocol will forestall taking part nodes' selfish behaviors and guarantee high performance of the multirate opportunistic routing protocol with a low Communication overhead.