On Delay Constrained Multicast Capacity of Large-Scale Mobile Ad-Hoc Networks - Computer Science > Networking and Internet Architecture

On Delay Constrained Multicast Capacity of Large-Scale Mobile Ad-Hoc Networks - Computer Science > Networking and Internet Architecture - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: This paper studies the delay constrained multicast capacity of large scalemobile 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 itsmulticast session, and the information is required to be delivered to all the$p$ destinations within $D$ time-slots. Given the delay constraint $D,$ wefirst prove that the capacity per multicast session is $O\min\{1, \logp\log n sp \sqrt{\frac{D}{n s}}\}.$ Given non-negative functions $fn$and $gn$: $fn=Ogn$ means there exist positive constants $c$ and $m$such that $fn \leq cgn$ for all $n\geq m;$ $fn=\Omegagn$ means thereexist positive constants $c$ and $m$ such that $fn\geq cgn$ for all $n\geqm;$ $fn=\Thetagn$ means that both $fn=\Omegagn$ and $fn=Ogn$hold; $fn=ogn$ means that $\lim {n\to \infty} fn-gn=0;$ and$fn=\omegagn$ means that $\lim {n\to \infty} gn-fn=0.$ We thenpropose a joint coding-scheduling algorithm achieving a throughput of$\Theta\min\{1,\sqrt{\frac{D}{n s}}\}.$ Our simulations show that the jointcoding-scheduling algorithm achieves a throughput of the same order$\Theta\min\{1, \sqrt{\frac{D}{n s}}\}$ under random walk model and randomwaypoint model.

Autor: Shan Zhou, Lei Ying

Fuente: https://arxiv.org/