Hierarchy sustains partial cooperation and induces a Braess-like paradox in slotted aloha-based networks

被引:8
作者
Sabir, Essaid [1 ]
El-Azouzi, Rachid [1 ]
Hayel, Yezekael [1 ]
机构
[1] Univ Avignon, LIA CERI, Avignon, France
关键词
Slotted aloha; Nash equilibrium; Stackelberg equilibrium; Throughput; Delay;
D O I
10.1016/j.comcom.2011.09.011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies a hierarchical distributed choice of retransmission probabilities in slotted aloha. In particular, we consider a wireless system composed of one central receiver and several selfish mobile users communicating via the slotted aloha protocol. The set of mobile users is split into two classes: leaders and followers. We then study the induced non-cooperative hierarchical game based on the Stackelberg equilibrium concept. Using a 4D Markovian model, we compute the steady state of the system and derive the average throughput and the expected delay as well. We start by discussing the protocol design and propose a controlled slotted aloha using a virtual controller. The virtual controller can sustain partial cooperation among concurrent mobile users when accessing the channel by making the channel lossy. This leads us to identify a Braess-like paradox in which reducing capacity to the system may improve the performance of all mobile users. We then investigate the impact of hierarchy among mobile users in such a random access protocol and discuss how to distribute leader/follower roles. We show that the global performance of the system is improved compared to standard slotted aloha system. However, slight performances slow-down may be observed for the followers group when the total number of mobile users is relatively small. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:273 / 286
页数:14
相关论文
共 25 条
  • [1] ABRAMSON N., 1970, P AFIPS C, V37, P295
  • [2] Altman E, 2005, LECT NOTES COMPUT SC, V3462, P610
  • [3] ALTMAN E, 2004, COMPUTERS OPERATIONS
  • [4] Altman E., 2004, COMPUTER NETWORKS, V45
  • [5] Bertsekas D., 1987, DATA NETWORKS
  • [6] Bloem M., 2007, P ACM ICST WORKSH GA
  • [7] A PARADOX OF CONGESTION IN A QUEUING NETWORK
    COHEN, JE
    KELLY, FP
    [J]. JOURNAL OF APPLIED PROBABILITY, 1990, 27 (03) : 730 - 734
  • [8] Dutra D., 2003, P IEEE INF
  • [9] El-Azouzi R., 2009, INT J COMPUTER SYSTE
  • [10] ELAZOUZI R, 2007, P ACM ICST VAL