A systematic node placement strategy for multi tier heterogeneous network graphs
The problem of connectivity in heterogeneous networks constitutes an important yet challenging topic in the literature of communication networks. A heterogeneous network contains nodes with different communication radii and degrees of connectivity. This paper addresses the problem of connectivity in multi tier heterogeneous network graphs through systematic placement of advantaged nodes. The node placement method is based on a so called hexagonal coordinate system (HCS) in which we develop an extended algebra. Relying on the HCS, we formulate and solve a class of geometric distance optimization problems aiming at guaranteeing the connectivity of a graph of multiple clusters of nodes. We show the effectiveness of our approach through experimental results in comparison with minimum spanning tree (MST) algorithms.
2016 IEEE Wireless Communications and Networking Conference