Detection of Greedy Nodes in Wireless LAN through Comparing of Probability Distributions of Transmission Intervals

Date Added: Jan 2013
Format: PDF

IEEE 802.11x CSMA/CA DCF MAC protocol supports that wireless nodes have statistically impartial probabilities of wireless channel access through fair competition. However, there is greedy node problem that maliciously increasing the transmission rates of mobile nodes altering their MAC operation disturbs fair transmissions between wireless nodes. This paper addresses how to find misbehavior greedy nodes. Previous works inspect the operation of DCF MAC protocol by the MAC frame to detect greedy nodes. In this paper, a greedy node detection algorithm using Kolmogorov-Smirnov test is proposed. The algorithm classifies wireless nodes with similar probability distributions of transmission intervals and draws a comparison between groups to find a group of greedy nodes.