Earticle

초록

영어

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. This paper evaluates the proposed algorithm through simulation and the simulation results shows that the algorithm can accurately detect greedy nodes in the congestion condition.

목차

Abstract
 1. Introduction
  1.1. Frame Level Approaches
  1.2. Statistically Analyzing Approaches
 2. Kolmogorov-Smirnov Test
 3. A Group Based Algorithm using Transmission Interval Distribution
 4. Performance Test
 5. Conclusion
 Acknowledgements
 References

키워드

저자

• Yuhun Han [ Dpt. of Computer Engineering Kyungnam University ]
• Seung-Joon Seok [ Dpt. of Computer Engineering Kyungnam University ] Corresponding author
• Wang-Cheol Song [ Dpt. of Computer Engineering Jeju Nat’l University ]
• Duckae Choi [ School of Electronics and Computer Engineering Chonnam Nat’l University ]
• Jee-Wan Huh [ Future Internet Research Team Nat’l Institute for Mathematical Sciences ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605