Throughput Capacity of Hierarchical Wireless Sensor Networks.

In this paper, we investigate throughput capacity theories of Hierarchical Wireless Sensor Networks (H-WSN). Firstly, we introduce the structural protocol model, node mobility tracking model and conflict graph model of H-WSN. Secondly, we give some fundamental definitions about conflict graph and conflict event. Thirdly, a fundamental theorem about graph theory is given, and then the throughput capacity is turned to the problem that can be translated into linear constraints system, and can be gotten by finding the feasible solution of linear system. Finally, we propose and prove a critical inequality of throughput capacity of H-WSN. We also propose and prove a gradual probabilistic quality and the specific expression of expectant availability of throughput capacity of H-WSN. The results enrich the theory of some famous conclusions about throughput capacity and the information theory of wireless networks. [ABSTRACT FROM AUTHOR]