Finding Maximal cliques in ad-hoc networks

Publish Year: 1397
نوع سند: مقاله کنفرانسی
زبان: English
View: 483

This Paper With 6 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ECMM01_080

تاریخ نمایه سازی: 23 آذر 1397

Abstract:

The phenomenon of interference is one of the main challenges in wireless communication, and particularly in ad-hoc networks. The amount of interference experienced by a node v corresponds to the number of other nodes whose transmission range covers v. The capacity of an ad-hoc network is affected by interference, and several efforts to model this effect make use of clique structures. In this paper, we propose an algorithm to find maximal cliques in this networks.

Authors

Neda Mohammadi

Department of Computer science, University of Shahrekord, Shahrekord, Iran

Mehdi Kadivar

Department of Computer science, University of Shahrekord, Shahrekord, Iran