摘要
This paper proposes a negotiation-based TDMA scheme for ad hoc networks, which was modeled as an asynchronous myopic repeated game. Compared to the traditional centralized TDMA schemes, our scheme operates in a decentralized manner and is scalable to topology changes. Simulation results show that, with respect to the coloring quality, the performance of our scheme is close to that of the classical centralized algorithms with much lower complexity.
This paper proposes a negotiation-based TDMA scheme for ad hoc networks, which was modeled as an asynchronous myopic repeated game. Compared to the traditional centralized TDMA schemes, our scheme operates in a decentralized manner and is scalable to topology changes. Simulation results show that, with respect to the coloring quality, the performance of our scheme is close to that of the classical centralized algorithms with much lower complexity.
基金
supported in part by National Science Fund for Distinguished Young Scholars under Grant No.60725105
National Key Basic Research Program of China ( 973 Program ) under Grant No.2009CB320404
Program for Changjiang Scholars and Innovative Research Team in University under Grant No.IRT0852
National Natural Science Foundation of China under Grants No.60972047, 61072068
111 Project under Grant No.B08038
