Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ADHOCNOW

2004

Springer

2004

Springer

We consider a wireless sensor network in which each sensor is able to transmit within a disk of radius one. We show with elementary techniques that there exists a constant c such that if we throw cN sensors into an n × n square (of area N) independently at random, then with high probability there will be exactly one connected component which reaches all sides of the square. Its expected size is a constant fraction of the total number of sensors, and it covers a constant fraction of the area of the square. Furthermore, the other connected components of sensors and uncovered contiguous portions of the square are each very small (O(log2 n) and O(log N) respectively), so that their relative size grows smaller as N increases. We also discuss some algorithmic implications.

Related Content

Added |
30 Jun 2010 |

Updated |
30 Jun 2010 |

Type |
Conference |

Year |
2004 |

Where |
ADHOCNOW |

Authors |
Sarah Carruthers, Valerie King |

Comments (0)