On the fundamental limits of topology control in ad hoc networks

DOI10.1007/S00453-007-9078-6zbMath1187.68341OpenAlexW2122282263MaRDI QIDQ2471707

Andras Farago

Publication date: 18 February 2008

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9078-6

zbMATH Keywords

ConnectivityAd hoc networkRandom graph modelTopology control

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• The longest edge of the random minimal spanning tree
• A strong law for the longest edge of the minimal spanning tree
• The Minimum Vertex Degree of a Graph on Uniform Points in [0, 1^d]
• The capacity of wireless networks
• The limit distribution of the largest nearest-neighbour link in the unit d-cube
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the fundamental limits of topology control in ad hoc networks