Coordination Mechanisms for Selfish Routing in Multi-Channel Wireless Mesh Networks
In selfish routing, k transmissions are managed by k different agents. All the agents are selfish; their goals are to minimize their own costs without considering the overall performance of the network. Meanwhile, the agents are rational, they always meet the embarrassment that whether they face the probability of causing interference for routing flow by a short cut or they route flow by a longer way steadily. We introduce the game theoretic tools to direct the agents to make feasible choices and the coordination mechanism to improve the system performance which has been deteriorated for the lack of coordination. We yield a sufficient condition of the existence of pure strategy Nash equilibria and proof it in this paper. Some simulations reveal the feasibility of our proposition.
Wireless Mesh Networks Game Theory Nash Equilibrium Coordination Mechanism Selfish Routing
Jun Xiao Yanxiang He
College of Computer,Wuhan University,Wuhan,P.R.China
国际会议
武汉
英文
2006-09-01（万方平台首次上网日期，不代表论文的发表时间）