arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.5489cs.NI
收藏

On Delay Constrained Multicast Capacity of Large-Scale Mobile Ad-Hoc Networks

Shan Zhou, Lei Ying

备注：
12 pages,8 figures, conference
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

英文摘要：

This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET consists of $n_s$ multicast sessions. Each multicast session has one source and $p$ destinations. The wireless mobiles move according to a two-dimensional i.i.d. mobility model. Each source sends identical information to the $p$ destinations in its multicast session, and the information is required to be delivered to all the $p$ destinations within $D$ time-slots. Given the delay constraint $D,$ we first prove that the capacity per multicast session is $O(\min\{1, (\log p)(\log (n_sp)) \sqrt{\frac{D}{n_s}}\}).$ Given non-negative functions $f(n)$ and $g(n)$: $f(n)=O(g(n))$ means there exist positive constants $c$ and $m$ such that $f(n) \leq cg(n)$ for all $ n\geq m;$ $f(n)=Ω(g(n))$ means there exist positive constants $c$ and $m$ such that $f(n)\geq cg(n)$ for all $n\geq m;$ $f(n)=Θ(g(n))$ means that both $f(n)=Ω(g(n))$ and $f(n)=O(g(n))$ hold; $f(n)=o(g(n))$ means that $\lim_{n\to \infty} f(n)/g(n)=0;$ and $f(n)=ω(g(n))$ means that $\lim_{n\to \infty} g(n)/f(n)=0.$ We then propose a joint coding/scheduling algorithm achieving a throughput of $Θ(\min\{1,\sqrt{\frac{D}{n_s}}\}).$ Our simulations show that the joint coding/scheduling algorithm achieves a throughput of the same order ($Θ(\min\{1, \sqrt{\frac{D}{n_s}}\})$) under random walk model and random waypoint model.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

↑