2009/07/31 by Shan Zhou, Lei Ying, Zhou, Shan +1
Computer Science · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks
paper · pdf · doi:10.48550/arxiv.0907.5489
openalex publication_date 2009/07/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper studies the delay constrained multicast capacity of large scale mobile ad hoc networks (MANETs). We consider a MANET consists of ns 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 (nsp)) √((D)/(ns))\). 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) ≤ cg(n) for all n≥ m; f(n)=Ω(g(n)) means there exist positive constants c and m such that f(n)≥ cg(n) for all n≥ 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 limn→ ∞ f(n)/g(n)=0; and f(n)=ω(g(n)) means that limn→ ∞ g(n)/f(n)=0. We then propose a joint coding/scheduling algorithm achieving a throughput of Θ(min\1,√((D)/(ns))\). Our simulations show that the joint coding/scheduling algorithm achieves a throughput of the same order (Θ(min\1, √((D)/(ns))\)) under random walk model and random waypoint model.