A research on connectivity in communication networks

MaRDI QIDQ3052012zbMATH OpenFDO

Authors Yan Wang, Mingzhi Mao, Dongfang Zhao

Publication date 5 November 2010

zbMATH Keywords

communication networksconnectivity\(k\)-component

Mathematics Subject Classification ID

Communication theory (94A05) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 1254188
• Connectivity of soft random geometric graphs
• On the theta-coverage and connectivity of large random networks
• Connectivity of random k-nearest-neighbour graphs
• One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity

Cited in

(7)

• On secure communication in a sensor network
• A note on the 2-connectivity in one-dimensional ad hoc networks
• The specific connectivity number of random networks
• On the theta-coverage and connectivity of large random networks
• Connectivity of communication networks
• Critical node lifetimes in random networks via the Chen-Stein method
• Connectivity in finite ad-hoc networks

This page was built for publication: A research on connectivity in communication networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3052012)