Finding Maximal cliques in ad-hoc networks
Publish Year: 1397
Type: Conference paper
Language: English
View: 573
This Paper With 6 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
ECMM01_080
Index date: 14 December 2018
Finding Maximal cliques in ad-hoc networks 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.
Finding Maximal cliques in ad-hoc networks Keywords:
Finding Maximal cliques in ad-hoc networks authors
Neda Mohammadi
Department of Computer science, University of Shahrekord, Shahrekord, Iran
Mehdi Kadivar
Department of Computer science, University of Shahrekord, Shahrekord, Iran