By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Pitsiladis, G.T. ; Sch. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens (NTUA), Athens, Greece ; Panagopoulos, A.D. ; Constantinou, Philip

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.

Published in:

Communications Letters, IEEE  (Volume:16 ,  Issue: 6 )