抄録
This paper discusses dynamically controlled network segmentation for the purpose of adapting flexibly to unpredictably variable and unevenly distributed traffic and also utilizing network resources efficiently over radio frequencies, for application to a wireless ad-hoc community network (WACNet). This paper formulates the optimization criterion for the network segmentation as a graph partitioning problem and presents a heuristic computation method to obtain the optimum solution in a limited time range. The results computed by employing the heuristic method show that even if loss due to the segmentation is counted, a considerably high level of effects can be expected.
