1996
DOI: 10.1017/s0001867800027506
|View full text |Cite
|
Sign up to set email alerts
|

On a Voronoi aggregative process related to a bivariate Poisson process

Abstract: We consider two independent homogeneous Poisson processes Π0 and Π1 in the plane with intensities λ0 and λ1, respectively. We study additive functionals of the set of Π0-particles within a typical Voronoi Π1-cell. We find the first and the second moments of these variables as well as upper and lower bounds on their distribution functions, implying an exponential asymptotic behavior of their tails. Explicit formulae are given for the number and the sum of distances from Π0-particles to the nucleus within a typi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
95
0

Year Published

2006
2006
2016
2016

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 61 publications
(96 citation statements)
references
References 2 publications
1
95
0
Order By: Relevance
“…In this section, we verify the optimal p opt deduced in Section III does minimize the energy costs in the system via simulations. Without loss of generality, we simulated two clustering algorithms, LEACH [11] and HEED [12], on networks of nodes distributed uniformly in square areas. LEACH and HEED are two typical clustering algorithms employed in single-hop routing and multi-hop routing respectively.…”
Section: ) Multi-hop Communicationmentioning
confidence: 99%
“…In this section, we verify the optimal p opt deduced in Section III does minimize the energy costs in the system via simulations. Without loss of generality, we simulated two clustering algorithms, LEACH [11] and HEED [12], on networks of nodes distributed uniformly in square areas. LEACH and HEED are two typical clustering algorithms employed in single-hop routing and multi-hop routing respectively.…”
Section: ) Multi-hop Communicationmentioning
confidence: 99%
“…Since we use the data collected by the nearest sensor node to estimate the data at points around it, the field can be divided into Voronoi cells [7] with one representative node in each cell. Data at any point in the cell is estimated using the data collected by the representative node in the cell.…”
Section: Distortion Analysismentioning
confidence: 99%
“…Since each type 0 node chooses the nearest type 1 node as its cluster head, the data field is actually divided into Voronoi cells [10] with each cell serving as a cluster. Since nodes are randomly deployed in the field following uniform distribution, the number of type 0 and type 1 nodes within a certain area can be viewed as following Poisson process with density λ 0 = n0 πA 2 and λ 1 = n1 πA 2 , respectively.…”
Section: Theoretical Analysismentioning
confidence: 99%
“…Since nodes are randomly deployed in the field following uniform distribution, the number of type 0 and type 1 nodes within a certain area can be viewed as following Poisson process with density λ 0 = n0 πA 2 and λ 1 = n1 πA 2 , respectively. With the help of Voronoi cell analysis in [10], we can determine the expected value of this distance as:…”
Section: Theoretical Analysismentioning
confidence: 99%