Aproximating Size of Maximal Clique in a Node's Neighbourhood in the Ad Hoc Networks

Free registration required

Executive Summary

A wireless ad-hoc network consists of a collection of nodes which can be static or mobile. The nodes communicate among themselves over a wireless medium, without a fixed or predefined backbone infrastructure. In order to avoid or minimize effects of the Broadcast Storm Problem, a kind of virtual backbone needs to be established in the network. This paper presents an algorithm for approximating 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.

  • Format: PDF
  • Size: 296.92 KB