Student paper: network decomposition in wireless communication

Ad-hoc network features high mobility of network nodes, a large number of nodes and a large network span. In some applications of large scale ad hoc network, the grouping of different sets of nodes is extremely helpful in achieving efficient and scalable routing. The study focuses on how the size of each zone (cluster) can be determined such that it promotes efficient and optimum routing protocol for any function index. The added value of current research makes the cluster-based approach more universal and applicable both, at the physical layer and network layer. The study's implementation is based on minimum cost flow and uses the available optimized package developed in Fortran by Bertsekas (Dimitri, P et al., 1988) and later implemented in C by Frangioni and Gentile from the University of Pisa, Italy.