Negotiation-Based TDMA Scheme for Ad Hoc Networks from Game Theoretical Perspective  

自组织网络中一种基于博弈论的协商TDMA机制(英文)

作　　者：惠蕾放 李建东 李红艳 马英红 

机构地区：[1]Broadband Wireless Communications Laboratory, Information Science Institute, State Key Laboratory of Integrated Service Networks, Xidian University

出　　处：《China Communications》2011年第7期66-74,共9页中国通信（英文版）

基　　金：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

摘　　要：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.

关 键 词：TDMA scheme asynchronous myopic repeated game coloring quality classical centralized algorithms 

分 类 号：TN929.5[电子电信—通信与信息系统]