Multiple Access in Ad-Hoc Wireless LANs with Noncooperative Stations
暂无分享,去创建一个
A class of contention-type MAC protocols (e.g., CSMA/CA) relies on random deferment of packet transmission, and subsumes a deferment selection strategy and a scheduling policy that determines the winner of each contention cycle. This paper examines contention-type protocols in a noncooperative an ad-hoc wireless LAN setting, where a number of stations self-optimise their strategies to obtain a more-than-fair bandwidth share. Two scheduling policies, called RT/ECD and RT/ECD-1s, are evaluated via simulation It is concluded that a well-designed scheduling policy should invoke a noncooperative game whose outcome, in terms of the resulting bandwidth distribution, is fair to non-self-optimising stations.
[1] Stephen B. Wicker,et al. Game theory and the design of self-configuring, adaptive wireless networks , 2001, IEEE Commun. Mag..
[2] E. Kalai,et al. Rational Learning Leads to Nash Equilibrium , 1993 .
[3] Tiina Heikkinen,et al. On Learning and the Quality of Service in a Wireless Network , 2000, NETWORKING.
[4] Paul R. Milgrom,et al. Adaptive and sophisticated learning in normal form games , 1991 .