Computing Subgraph Probability of Random Geometric Graphs: Quantitative Analyses of Wireless Ad Hoc Networks
نویسندگان
چکیده
This paper undergoes quantitative analyses on fundamental properties of ad hoc networks including estimating the number of hiddenterminal pairs and the number of exposed-terminal sets. To obtain these results, we propose a paradigm to systematically derive exact formulas for a great deal of subgraph probabilities of random geometric graphs. In contrast to previous work, which established asymptotic bounds or approximation, we obtain closed-form formulas that are fairly accurate and of practical value.
منابع مشابه
Frugal Routing on Wireless Ad-Hoc Networks
We study game-theoretic mechanisms for routing in ad-hoc networks. Game-theoretic mechanisms capture the non-cooperative and selfish behavior of nodes in a resource-constrained environment. There have been some recent proposals to use incentive-based mechanisms (in particular, VCG) for routing in wireless ad-hoc networks, and some frugality bounds are known when the connectivity graph is essent...
متن کاملDegree distribution and hopcount in wireless ad-hoc networks
This article is a contribution to mathematical modeling and better understanding of fundamental properties of wireless ad-hoc networks. Our focus in this article is on the degree distribution and hopcount in these networks. The results presented here are useful in the study of connectivity and estimation of the capacity in ad-hoc networks. We model a wireless ad-hoc network as an undirected geo...
متن کاملBalanced Cut Approximation in Random Geometric Graphs
A random geometric graph G(n, r) is obtained by spreading n points uniformly at random in a unit square, and by associating a vertex to each point and an edge to each pair of points at Euclidian distance at most r. Such graphs are extensively used to model wireless ad-hoc networks, and in particular sensor networks. It is well known that, over a critical value of r, the graph is connected with ...
متن کاملQuantitative Analysis of Multi-hop Wireless Networks Using a Novel Paradigm
Random geometric graphs (RGG) contain vertices whose points are uniformly distributed in a given plane and an edge between two distinct nodes exists when their distance is less than a given positive value. RGGs are appropriate for modeling multi-hop wireless networks consisting of n mobile devices with transmission radius r unit length that are independently and uniformly distributed randomly i...
متن کاملStudy of Connectivity in Wireless Ad-hoc Networks with an Improved Radio Model
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding the link probability between nodes we use a radio model that takes into account statistical variations of the radio signal power around its mean value. We show that these variations, that are unavoidably caused by the ...
متن کامل