WANG Gang, LENG Jie, YUAN Cangzhou. Repeated Inter-Session Network Coding Games with an Average Cost Share Pricing Mechanism in Congested Networks[J]. Chinese Journal of Electronics, 2015, 24(2): 398-401. doi: 10.1049/cje.2015.04.029
Citation: WANG Gang, LENG Jie, YUAN Cangzhou. Repeated Inter-Session Network Coding Games with an Average Cost Share Pricing Mechanism in Congested Networks[J]. Chinese Journal of Electronics, 2015, 24(2): 398-401. doi: 10.1049/cje.2015.04.029

Repeated Inter-Session Network Coding Games with an Average Cost Share Pricing Mechanism in Congested Networks

doi: 10.1049/cje.2015.04.029
Funds:  This work was supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (No.61221061), and the National Natural Science Foundation of China (No.61271194).
More Information
  • Corresponding author: YUAN Cangzhou currently is an associate professor of School of software at Beihang University. His research fields include embedded system security, mobile cloud computing and cyber-physical systems. (Email:yuancz@buaa.edu.cn)
  • Publish Date: 2015-04-10
  • It is important to analyze the efficiency of resource allocation with game theory in congested networks in which the users are selfish. The results are often obtained from a one-shot game, while in reality, the transmission is frequent and occurs more than once. We develop a repeated inter-session network coding game that is based on a novel Average cost share (ACS) pricing mechanism. The users choose repeated transmission rates and transmission modes between network coding and routing to maximize their own payoffs. The Price of anarchy (PoA) is adopted to analyze the efficiency of the resource allocation. Through considering different strategies for the multiusers at the next stage, we find that network coding can improve the efficiency of resource allocation in the congested networks. We discuss trigger strategies that keep players from routing at new stages.
  • loading
  • R. Ahlswede, N. Cai, S. Li and R. Yeung, “Network information flow”, IEEE Trans. Information Theory, Vol.46, No.3, pp.1204-1216, 2000.
    R. Johari and J.N. Tsitsiklis, “A scalable network resource allocation mechanism with bounded efficiency loss”, IEEE Journal on Selected Areas in Communications, Vol.24, No.5, pp.992-999, 2006.
    A.H. Mohsenian-Rad, J. Huang and V.W.S. Wong, “A gametheoretic analysis of inter-session network coding”, Proceedings of the IEEE International Conference on Communications, Dresden, Germany, pp.1690-1695, 2009.
    A.H. Mohsenian-Rad, J. Huang, V.W.S. Wong and R.Schober, “Bargaining and price-of-anarchy in repeated inter-session network coding games”, Proceedings of IEEE INFOCOM'10, San Diego, CA, USA, pp.1927-1935, 2010.
    G. Wang and X. Dai, “The price of anarchy of network coding and routing based on an ACS pricing mechanism”, Chinese Journal of Electronics, Vol.22, No.3, pp.567-571, 2013.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (201) PDF downloads(731) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return