A Spanning-Tree-Based Connectivity Model in Finite Wireless Networks and Performance under Correlated Shadowing

A novel methodology for connectivity calculation in finite wireless multi-hop networks is presented. The main idea of this new model is the association of the connected probability with the probability of the existence of at least one connected spanning tree inside the network's graph. A general close form expression for the calculation of the connected probability under correlated fading channels is derived. Finally, we investigate the performance of the connectivity model under lognormal correlated shadowing channels. Significant conclusions are drawn.