On the fundamental limits of topology control in ad hoc networks

DOI10.1007/S00453-007-9078-6MaRDI QIDQ2471707zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Topology control and routing in ad hoc networks
• Topology control in wireless multihop networks

Cites work

• scientific article; zbMATH DE number 4208167 (Why is no real title available?)
• scientific article; zbMATH DE number 3638844 (Why is no real title available?)
• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• scientific article; zbMATH DE number 1340281 (Why is no real title available?)
• A strong law for the longest edge of the minimal spanning tree
• Random graphs.
• 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
• The longest edge of the random minimal spanning tree

Cited in

(3)

• Low degree connectivity of ad-hoc networks via percolation
• Principles of Distributed Systems
• Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation

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

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