Topological properties of random wireless networks

DOI10.1007/BF02719777zbMath1121.05109MaRDI QIDQ2371220

D. Manjunath, Srikanth K. Iyer

Publication date: 2 July 2007

Published in: Sādhanā (Search for Journal in Brave)

zbMATH Keywords

wireless networksgeometric random graphstopology properties

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A tutorial survey of topics in wireless networking. II

Cites Work

• Unnamed Item
• Unnamed Item
• The longest edge of the random minimal spanning tree
• Towards an information theory of large networks: an achievable rate region
• A Network Information Theory for Wireless Communication: Scaling Laws and Optimal Operation
• Sharp thresholds For monotone properties in random geometric graphs
• The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1^d]
• The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1^d]
• The capacity of wireless networks
• Every monotone graph property has a sharp threshold
• Threshold Functions for Random Graphs on a Line Segment
• On the connectivity of a random interval graph
• Topological properties of the one dimensional exponential random geometric graph
• Scan statistics