scientific article; zbMATH DE number 1254188
From MaRDI portal
Publication:4227226
zbMath0916.90101MaRDI QIDQ4227226
Publication date: 23 February 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (49)
Consensus dynamics on random rectangular graphs ⋮ Connectivity of soft random geometric graphs ⋮ Critical Density Thresholds in Distributed Wireless Networks ⋮ On the cover time and mixing time of random geometric graphs ⋮ Fast flooding over Manhattan ⋮ Fast message dissemination in random geometric networks ⋮ A location-free algorithm of energy-efficient connected coverage for high density wireless sensor networks ⋮ On the probability of the existence of fixed-size components in random geometric graphs ⋮ Multiple Round Random Ball Placement: Power of Second Chance ⋮ Size of the giant component in a random geometric graph ⋮ Connectivity and stochastic robustness of synchronized multi-drone systems ⋮ Smooth movement and Manhattan path based random waypoint mobility ⋮ Stretch and diameter in random geometric graphs ⋮ Covering algorithms, continuum percolation and the geometry of wireless networks ⋮ Mobile geometric graphs: detection, coverage and percolation ⋮ On the connectivity threshold for general uniform metric spaces ⋮ Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks ⋮ Asymptotic distribution of isolated nodes in secure wireless sensor networks under transmission constraints ⋮ On rumour propagation among sceptics ⋮ Theoretical Aspects of Graph Models for MANETs ⋮ Information Spreading in Dynamic Networks: An Analytical Approach ⋮ Stable Consensus Decision Making for Spatially Distributed Multiagent Systems with Multiple Leaders ⋮ Convergence of a class of multi-agent systems in probabilistic framework ⋮ On Trust Evaluation in Mobile Ad Hoc Networks ⋮ Minimum spanning trees of random geometric graphs with location dependent weights ⋮ Super-Exponential Extinction Time of the Contact Process on Random Geometric Graphs ⋮ On the fundamental limits of topology control in ad hoc networks ⋮ In-network estimation of frequency moments ⋮ Second-order consensus protocols based on transformed \(d\)-path Laplacians ⋮ Synchronization of multi-agent systems without connectivity assumptions ⋮ Monotone properties of random geometric graphs have sharp thresholds ⋮ Thresholding random geometric graph properties motivated by ad hoc sensor networks ⋮ On the connectivity and diameter of small-world networks ⋮ Inhomogeneous random graphs, isolated vertices, and Poisson approximation ⋮ Isolation and connectivity in random geometric graphs with self-similar intensity measures ⋮ A variational approach to the consistency of spectral clustering ⋮ Flocking with general local interaction and large population ⋮ On the universal computing power of amorphous computing systems ⋮ Connectivity in finite ad-hoc networks ⋮ On the equivalence between random graph models ⋮ Plane and planarity thresholds for random geometric graphs ⋮ On a random directed spanning tree ⋮ A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter ⋮ Spatial Node Distribution of Manhattan Path Based Random Waypoint Mobility Models with Applications ⋮ Infection Spread in Random Geometric Graphs ⋮ Some properties for the largest component of random geometric graphs with applications in sensor networks ⋮ The acquaintance time of (percolated) random geometric graphs ⋮ Self-organization scheme for balanced routing in large-scale multi-hop networks ⋮ Continuum limit of total variation on point clouds
This page was built for publication:
