(k,m)-connectivity in Mobile Clustered Wireless Networks
Jun Zhao, Xinbing Wang

TL;DR
This paper introduces the concept of $(k,m)$-connectivity in mobile clustered wireless networks, analyzing the critical transmission range for ensuring connectivity under different mobility models and parameter conditions.
Contribution
It proposes a novel $(k,m)$-connectivity model, defines weak and strong parameter conditions, and derives bounds and asymptotic probabilities for network connectivity under various mobility scenarios.
Findings
Bounds on the probability of $(k,m)$-connectivity under weak parameters.
Critical transmission range for asymptotic $(k,m)$-connectivity.
Asymptotic probability distribution under strong parameters.
Abstract
This paper has been withdrawn by the author due to a crucial error in the calculation of Equation (28). We propose a novel concept of -connectivity in mobile clustered wireless networks, in which there are mobile cluster members and static cluster heads, where are all positive constants and . -connectivity signifies that in a time period consisting of time slots, there exist at least time slots for each cluster member and in any one of these time slots the cluster member can directly communicate with at least one cluster head. We investigate the critical transmission range of asymptotic -connectivity when cluster members move according to random walk or i.i.d. mobility model. Under random walk mobility, we propose two general heterogeneous velocity models in which cluster members may move with different velocities. Under both…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks · Cooperative Communication and Network Coding
