Abstract

The connectivity of distributed network within buildings depends critically on the shape of the operating environment. We propose the mean blockage as a new measure for concave shapes. The formal definition and an analytical evaluation of this measure will be shown. An algorithm has been developed to facilitate the evaluation of this measure for complicated concave polygons. The inadequacies of a couple of existing shape measures will be discussed and contrasted with the mean blockage measure for a variety of concave polygons. A possible general relationship between the blockage measure and the number of distributed sensors required to maintain high connectivity probability in concave regions will be presented.

This work is licensed under a Creative Commons Attribution 4.0 License.