### 摘要

A range assignment to the nodes in a wireless ad hoc network induces a topology in which there is an edge between two nodes if and only if both of them are within each other's transmission range. The critical transmission radius for k-connectivity is the smallest r such that if all nodes have the transmission radius r, the induced topology is k-connected. The critical neighbor number for k-connectivity is the smallest integer l such that if every node sets its transmission radius equal to the distance between itself and its l-th nearest neighbor, the induced topology is k-connected. In this paper, we study the asymptotic critical transmission radius for k-connectivity and asymptotic critical neighbor number for k-connectivity in a wireless ad hoc network whose nodes are uniformly and independently distributed in a unit-area square or disk. We provide a precise asymptotic distribution of the critical transmission radius for k-connectivity and an improved asymptotic almost sure upper bound on the critical neighbor number for k-connectivity.

原文 | English |
---|---|

頁面 | 1-8 |

頁數 | 8 |

出版狀態 | Published - 20 九月 2004 |

事件 | Proceedings of the Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MoBiHoc 2004 - Tokyo, Japan 持續時間: 24 五月 2004 → 26 五月 2004 |

### Conference

Conference | Proceedings of the Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MoBiHoc 2004 |
---|---|

國家 | Japan |

城市 | Tokyo |

期間 | 24/05/04 → 26/05/04 |

## 指紋 深入研究「Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks」主題。共同形成了獨特的指紋。

## 引用此

*Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks*. 1-8. 論文發表於 Proceedings of the Fifth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MoBiHoc 2004, Tokyo, Japan.