Aproximating size of maximal clique in a node's neighbourhood in the ad hoc networks

Authors:
Nihad Borovina;Sead Kreso
Affiliations:
Faculty of Electrical Engineering, University of Sarajevo;Faculty of Electrical Engineering, University of Sarajevo
Venue:
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Year:
2009

Citing 7
Cited 0

Finding a maximum clique in an arbitrary graph

SIAM Journal on Computing
On generating all maximal independent sets

Information Processing Letters
Unit disk graphs

Discrete Mathematics - Topics on domination
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Optimal Resource Allocation in Wireless Ad Hoc Networks: A Price-Based Approach

IEEE Transactions on Mobile Computing
A study of ACO capabilities for solving the maximum clique problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an algorithm for aproximating the size of the maximal clique containing a given node in the ad-hoc network. The size of the maximal clique of a node can be used while deciding whether or not the node will be a part of a virtual backbone. An algorithm is distributed, based on 2-hop neighbourhood information, and works in O(Δ5) time, where Δ is the maximum node degree in the node's neighbourhood. The simulation results show that the algorithm makes an accurate result in over 95% cases for the maximal clique consisting of up to 10 nodes. In many cases the structure of a clique can be identified.