Wireless MAC Protocol based on Crowd-Anticrowd Theory
01 Jun 2020-
TL;DR: A Medium Access Control (MAC) protocol based on Minority Game (MG) theory is proposed for channel supporting Multipacket Reception (MPR) and several performance metrics of the protocol are studied through extensive simulation.
Abstract: In the domain of wireless networking, there have been several attempts to design, and analyze resource allocation problems using Game theoretic techniques (such as, random access game for contention control). In the current paper, a Medium Access Control (MAC) protocol based on Minority Game(MG) theory is proposed for channel supporting Multipacket Reception (MPR). Several performance metrics of the protocol (like, mean of Attendance, Volatility, System Throughput and Energy Expenditure) are studied through extensive simulation. The behaviour of the protocol is also analyzed from the perspective of Crowd-Anticrowd Theory, a popular tool from econophysics literature.
Citations
More filters
TL;DR: In this paper, a model of a competing population of N adaptive agents, with similar capabilities, repeatedly deciding whether to attend a bar with an arbitrary cutoff L. Decisions are based upon past outcomes.
Abstract: We study a model of a competing population of N adaptive agents, with similar capabilities, repeatedly deciding whether to attend a bar with an arbitrary cutoff L. Decisions are based upon past outcomes. The agents are only told whether the actual attendance is above or below L. For L-> N/2, the game reproduces the main features of Challet and Zhang's minority game. As L is lowered, however, the mean attendances in different runs tend to divide into two groups. The corresponding standard deviations for these two groups are very different. This grouping effect results from the dynamical feedback governing the game's time-evolution, and is not reproduced if the agents are fed a random history.
48 citations
4 citations
References
More filters
Posted Content•
TL;DR: The type of rationality we assume in economics, perfect, logical, deductive rationality, is extremely useful in generating solutions to theoretical problems as mentioned in this paper. But it demands much of human behavior, much more in fact than it can usually deliver.
Abstract: The type of rationality we assume in economics--perfect, logical, deductive rationality--is extremely useful in generating solutions to theoretical problems. But it demands much of human behavior--much more in fact than it can usually deliver. If we were to imagine the vast collection of decision problems economic agents might conceivably deal with as a sea or an ocean, with the easier problems on top and more complicated ones at increasing depth, then deductive rationality would describe human behavior accurately only within a few feet of the surface. For example, the game Tic-Tac-Toe is simple, and we can readily find a perfectly rational, minimax solution to it. But we do not find rational "solutions" at the depth of Checkers; and certainly not at the still modest depths of Chess and Go.
1,544 citations
"Wireless MAC Protocol based on Crow..." refers methods in this paper
...The mathematical formalism of MG was first coined by Challet and Zhang [4], being inspired by the famous El Farol bar problem of Arthur [5]....
[...]
TL;DR: Interesting cooperation and competition patterns of the society seem to arise and to be responsive to the payoff function.
Abstract: A binary game is introduced and analysed. N players have to choose one of the two sides independently and those on the minority side win. Players use a finite set of ad hoc strategies to make their decision, based on the past record. The analysing power is limited and can adapt when necessary. Interesting cooperation and competition patterns of the society seem to arise and to be responsive to the payoff function.
1,123 citations
"Wireless MAC Protocol based on Crow..." refers methods in this paper
...The mathematical formalism of MG was first coined by Challet and Zhang [4], being inspired by the famous El Farol bar problem of Arthur [5]....
[...]
TL;DR: The stability of the Aloha random-access algorithm in an infinite-user slotted channel with multipacket-reception capability is considered and it is shown that the channel backlog Markov chain is ergodic if the packet-arrival rate is less than the expected number of packets successfully received in a collision of n as n goes to infinity.
Abstract: The stability of the Aloha random-access algorithm in an infinite-user slotted channel with multipacket-reception capability is considered. This channel is a generalization of the usual collision channel, in that it allows the correct reception of one or more packets involved in a collision. The number of successfully received packets in each slot is modeled as a random variable which depends exclusively on the number of simultaneously attempted transmissions. This general model includes as special cases channels with capture, noise, and code-division multiplexing. It is shown by drift analysis that the channel backlog Markov chain is ergodic if the packet-arrival rate is less than the expected number of packets successfully received in a collision of n as n goes to infinity. The properties of the backlog in the nonergodicity region are examined. >
547 citations
"Wireless MAC Protocol based on Crow..." refers background in this paper
...Recent technological advancements, such as antenna arrays, code division multiple access (CDMA), Successive Interference Cancellation (SIC), Orthogonal Frequency Division Multiple Access (OFDMA), MU-MIMO (Multi-User MIMO), have equipped current wireless receivers with the ability to simultaneously receive, and successfully decode multiple packet transmissions from more than one station at a time, popularly known in literature as Multipacket Reception (MPR) [1]....
[...]
TL;DR: This work analyzes a simple model that incorporates fundamental features of social and biological systems that simultaneously and adaptively compete for limited resources, thereby altering their environment.
Abstract: In many social and biological systems agents simultaneously and adaptively compete for limited resources, thereby altering their environment. We analyze a simple model that incorporates fundamental features of such systems. If the space of strategies available to the agents is small, the system is in a phase in which all information available to the agents' strategies is traded away, and agents' choices are maladaptive, resulting in a poor collective utilization of resources. For larger strategy spaces, the system is in a phase in which the agents are able to coordinate their actions to achieve a better utilization of resources. The best utilization of resources occurs at a critical point, when the dimension of the strategy space is on the order of the number of agents.
330 citations
"Wireless MAC Protocol based on Crow..." refers background in this paper
...[7], and subsequently Crowd-Anticrowd theory came into existence to explain such observation....
[...]
...It is important to note that macroscopic behaviour of MG (such as, volatility) can be articulated in the best possible manner using the ratio φ = 2 m N [7]....
[...]
Book•
03 Oct 2011TL;DR: Game Theory and Learning for Wireless Networks covers how theory can be used to solve prevalent problems in wireless networks such as power control, resource allocation or medium access control and bridges the gap between theory and practice.
Abstract: * The first tutorial-style book that gives all the relevant theory at the right level of rigor, for the wireless communications engineer. * Bridges the gap between theory and practice by giving examples and case studies showing how game theory can solve real-word problems. * Contains algorithms and techniques to implement game theory in wireless terminals. Written by leading experts in the field, Game Theory and Learning for Wireless Networks Covers how theory can be used to solve prevalent problems in wireless networks such as power control, resource allocation or medium access control. With the emphasis now on promoting 'green' solutions in the wireless field where power consumption is minimized, there is an added focus on developing network solutions that maximizes the use of the spectrum available. With the growth of distributed wireless networks such as Wi-Fi and the Internet; the push to develop ad hoc and cognitive networks has led to a considerable interest in applying game theory to wireless communication systems. Game Theory and Learning for Wireless Networks is the first comprehensive resource of its kind, and is ideal for wireless communications R&D engineers and graduate students. Samson Lasaulce is a senior CNRS researcher at the Laboratory of Signals and Systems (LSS) at Suplec, Gif-sur-Yvette, France. He is also a part-time professor in the Department of Physics at cole Polytechnique, Palaiseau, France. Hamidou Tembine is a professor in the Department of Telecommunications at Suplec, Gif-sur-Yvette, France. Merouane Debbah is a professor at Suplec, Gif-sur-Yvette, France. He is the holder of the Alcatel-Lucent chair in flexible radio since 2007. The first tutorial style book that gives all the relevant theory, at the right level of rigour, for the wireless communications engineer Bridges the gap between theory and practice by giving examples and case studies showing how game theory can solve real world resource allocation problems Contains algorithms and techniques to implement game theory in wireless terminals
244 citations