Fundamental characteristics of multi-hop wireless communication networks

This paper discusses stochastic characteristics of hierarchical multi-hop wireless networks. It is assumed that terminals and base stations are distributed according to specific distributions, respectively. It is also assumed that a multi-hop wireless network is logically divided into clusters by a clustering algorithm. In this paper, the Lowest ID Cluster algorithm and another simple clustering algorithm are considered. Using theoretical techniques based on the stochastic geometry, this paper analyzes fundamental characteristics of the multi-hop wireless networks with the clustering algorithms.