Please use this identifier to cite or link to this item:
Title: On range matrices and wireless networks in d dimensions
Authors: DESAI, MP
Keywords: Ad Hoc Network
Graph Theory
Matrix Algebra
Issue Date: 2005
Publisher: IEEE
Citation: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, Trentino, Italy, 3-7 April 2005, 190-196.
Abstract: Suppose that V = {v1, v2,} is a set of nodes randomly (uniformly) distributed in the d dimensional cube [0, x0]d, and W = {w(i, j) > 0 : 1 ≤ i, j ≤ n} is a set of numbers chosen so that w(i, j) = w(j, i) = w(j, i). Construct a graph Gn,d,W whose vertex set is V, and whose edge set consists of all pairs {ui, uj} with || ui - uj || ≤ w(i, j). In the wireless network context, the set V is a set of labeled nodes in the network and W represents the maximum distances between the node pairs for them to be connected. We essentially address the following question: "if G is a graph with vertex set V, what is the probability that G appears as a subgraph in Gn,d,W?" Our main contribution is a closed form expression for this probability under the l∞ norm for any dimension d and a suitably defined probability density function. As a corollary to the above answer, we also answer the question, "what is the probability that Qn,d,W is connected?".
URI: 10.1109/WIOPT.2005.33
ISBN: 0-7695-2267-X
Appears in Collections:Proceedings papers

Files in This Item:
File Description SizeFormat 
1421106.pdf324.5 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.