Multiple Access in Ad-Hoc Wireless LANs with Noncooperative Stations

Abstract

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.

Identifying and Averting the MAC Layer Misbehavior in AD-HOC Networks

“…J. Konorski [4] designs a noncooperative game for wireless LANS which obtains a fair distribution of bandwidth via two policies namely RT/ECD and RT/ECD-1s. Pradeep Kyasanur and Nitin H. Vaidya [5] proposed a scheme in which receiver interprets that a sender can access a channel without waiting for an assigned back off which detects selfish misbehavior.…”

Attacks and Countermeasures in Sensor Networks: A Survey

“…These approaches assume that misbehaving nodes take greedy actions to gain better performance such as higher share of bandwidth, and leverage the optimal point called "Nash equilibrium". Konorski [39] proposes a misbehavior-resilient backoff algorithm for ad hoc networks in which all nodes can hear each other. By adjusting the backoff value, the network may reach a fair equilibrium for bandwidth allocation.…”

Multi-radio channel allocation in competitive wireless networks

“…One widely used method is a distributed random access method called CSMA/CA [14]. Game theory has been applied to the CSMA/CA protocol [6,10] and to the Aloha protocol [11].…”