Solving the Clustering Problem in MANETs using SAT & ILP techniques

Recently there have been several improvements in the performance of Integer Linear Programming (ILP) and Boolean Satisfiability (SAT) solvers. These improvements have encouraged the modeling of complex engineering problems as ILP problems. One such problem is the Clustering Problem in Mobile Ad-Hoc Networks (MANETs). The Clustering Problem in MANETs consists of selecting the most suitable nodes of a given MANET topology as clusterheads (CH), and ensuring that regular nodes are connected to clusterheads such that the lifetime of the network is maximized. This paper focuses on developing an improved ILP formulation for the Clustering Problem, and assessing the feasibility of using such a formulation, together with state-of-the art Generic ILP and SAT solvers, in a real-life practical environment.