1 / 1

Zanella Andrea – Pierobon Gianfranco – Merlin Simone - PowerPoint PPT Presentation

Aim: mathematical characterization of the MCDS-broadcast propagation dynamic with inhomogeneous density of nodes. Notations. Hypothesis. w k = distance reached by the k -th rebroadcast P k = probability of the existence of the k -th rebroadcast

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

PowerPoint Slideshow about ' Zanella Andrea – Pierobon Gianfranco – Merlin Simone' - zia

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

Aim: mathematical characterization of the MCDS-broadcast propagation dynamic with inhomogeneous density of nodes

Notations

Hypothesis

wk = distance reached by the k-th rebroadcast

Pk = probability of the existence of the k-th rebroadcast

fk (x ) = probability density function of wk, given that wk exists

l(x ) = nodes density function

• Ideal channel

Theorem

The dynamic of the MCDS-broadcast propagation along the network is statistically determined by the family of functions fk(x), which can be recursively obtained as follows:

Performance metrics

Ck(x) = Connection probability of x in k hops

NkC= Mean number of nodes reached in k hop

Results: Connection probability, Propagation statistics, …

where Pk can, in turn, be recursively derived as

On the limiting performance of broadcast algorithms

Zanella Andrea – Pierobon Gianfranco – Merlin Simone

Dept. of Information Engineering, University of Padova, {zanella,pierobon,merlo}@dei.unipd.it

• Sensor networks

• Car Networks

• Limiting performance:

• Minimum latency

• Minimum traffic

• Maximum reliability

• minimized redundancy

• preserved connectivity

MCDS

(Only nodes in a connected

set of minimum cardinality

• Drawback:

• Needed topologic information

= Silent node

= Transmitting node

Linear nodes deployment modeled as

an inhomogeneous Poisson arrivals

x

{ } = MCDS

s0

s2

s3

s4

s5

s6

s7

s8

s1

x

x=0

Inhomogeneous (general) Case

Homogeneous Case

Example: nodes reached at each hop

Connection Probability

Asymp. value*

Number of hops

variable

node density

* O. Dousse,et. al. “Connectivity in ad-hoc and hybrid networks”Proc. IEEE Infocom02

This work was supported by MIUR within the framework of the

”PRIMO” project FIRB RBNE018RFY (http://primo.ismb.it/firb/index.jsp).