Performance evaluation of a mathematical programming based clustering algorithm for a wireless ad hoc network operating in a threat environment
Esra Cosar · 2005
A distributed sensing network consists of more than one spatially separated sen-sors, each with possibly different characteristics and not all of them sensing the same environment. The sensors are mobile and change location with time. In this work, we evaluate the operational level performance of a mathematical programming based clustering algorithm that is developed for locating a given number of clusterheads in a wireless ad hoc sensor network such that maximum information can be gathered from the sensors under hostile conditions. This methodology is also compared with a representative approach (MOBIC) from the clustering algorithms that have been pro-posed in the literature. Both small (30 nodes) and medium sized (60 nodes) networks are used for comparison purposes. As a result of the numerical studies, it is concluded that the CG heuristic performs much better in terms of sensor coverage when compared to the original MOBIC algorithm. During 3 scenarios out of 64, MOBIC provides slightly better coverage, however the objective function values corresponding to these scenarios indicate that