NDLI: On range matrices and wireless networks in d dimensions

Content Provider	IEEE Xplore Digital Library
Author	Desai, M. Manjunath, D.
Copyright Year	2005
Description	Author affiliation: Dept. of Electr. Eng., Indian Inst. of Technol., Bombay, India (Desai, M.; Manjunath, D.)
Abstract	Suppose that V = {v/sub 1/, v/sub 2/, ...v/sub n/} is a set of nodes randomly (uniformly) distributed in the d dimensional cube [0, x/sub 0/]/sup d/, and W = {w(i, j) > 0 : 1 /spl les/ i, j /spl les/ n} is a set of numbers chosen so that w(i, j) = w(j, i) = w(j, i). Construct a graph G/sub n,d,W/ whose vertex set is V, and whose edge set consists of all pairs {u/sub i/, u/sub j/} with /spl par/ u/sub i/ - u/sub j/ /spl par/ /spl les/ 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 G/sub n,d,W/?" Our main contribution is a closed form expression for this probability under the l/sub /spl infin// 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 Q/sub n,d,W/ is connected?".
Sponsorship	Create-Net INRIA IFIP acm IEEE
Starting Page	190
Ending Page	196
File Size	342463
Page Count	7
File Format	PDF
ISBN	076952267X
DOI	10.1109/WIOPT.2005.33
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2005-04-03
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Intelligent networks Solid modeling Upper bound Wireless networks Ad Hoc Networks Probability density function Geometric Random Graphs Ad hoc networks Range Matrices
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the Dynamic Behavior of the Min-Cut in Random Geometric Graphs

Evolving Random Geometric Graph Models for Mobile Wireless Networks

Evolving Random Geometric Graph Models for Mobile Wireless Networks

Stationary Properties of Random Direction Models

A solution to the upper and lower bound of outage probability in ad hoc networks

A simple upper bound on random access transport capacity

A Generalized geometry-inclusive fading model for ad hoc wireless networks

Results on finite wireless networks on a line

On upper bound and heuristics for multicast lifetime maximization using dynamic routing in energy-limited wireless ad hoc networks

On range matrices and wireless networks in d dimensions

Similar Documents

On the Dynamic Behavior of the Min-Cut in Random Geometric Graphs

Evolving Random Geometric Graph Models for Mobile Wireless Networks

Evolving Random Geometric Graph Models for Mobile Wireless Networks

Stationary Properties of Random Direction Models

A solution to the upper and lower bound of outage probability in ad hoc networks

A simple upper bound on random access transport capacity

A Generalized geometry-inclusive fading model for ad hoc wireless networks

Results on finite wireless networks on a line

On upper bound and heuristics for multicast lifetime maximization using dynamic routing in energy-limited wireless ad hoc networks

On range matrices and wireless networks in d dimensions