Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Geometrically aware communication in random wireless networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
VCGG: a varying cone distributed topology-control algorithm for wireless ad hoc networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Energy scaling laws for distributed inference in random fusion networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Approximating Mexican highways with slime mould
Natural Computing: an international journal
Journal of Parallel and Distributed Computing
On growing connected β-skeletons
Computational Geometry: Theory and Applications
How β-skeletons lose their edges
Information Sciences: an International Journal
| Hi-index | 0.00 |
In wireless ad hoc networks, without fixed infrastructures, virtual backbones are constructed and maintained to efficiently operate such networks. The Gabriel graph (GG) is one of widely used geometric structures for topology control in wireless ad hoc networks. If all nodes have the same maximal transmission radii, the length of the longest edge of the GG is the critical transmission radius such that the GG can be constructed by localized and distributed algorithms using only 1-hop neighbor information. In this paper, we assume a wireless ad hoc network is represented by a Poisson point process with mean n on a unit-area disk, and nodes have the same maximal transmission radii. We give three asymptotic results on the length of the longest edge of the GG. First, we show that the ratio of the length of the longest edge to \sqrt{{\frac{\ln n}{\pi n}}} is asymptotically almost surely equal to 2. Next, we show that for any \xi, the expected number of GG edges whose lengths are at least 2\sqrt{{\frac{\ln n + \xi}{\pi n}}} is asymptotically equal to 2e^{-\xi}. This implies that \xi\rightarrow\infty is an asymptotically almost sure sufficient condition for constructing the GG by 1-hop information. Last, we prove that the number of long edges is asymptotically Poisson with mean 2e^{-\xi}. Therefore, the probability of the event that the length of the longest edge is less than 2\sqrt{{\frac{\ln n + \xi}{\pi n}}} is asymptotically equal to \exp\left(-2e^{-\xi}\right).