Generalized Cooperative Multicast in Mobile Ad Hoc Networks

Research output: Contribution to journalArticleScientificpeer-review

Researchers

Research units

  • Xidian University
  • Tohoku University
  • NEC Corporation
  • Chuzhou University
  • Shaanxi Normal University

Abstract

Cooperative multicast has been an efecient communication paradigm for mobile ad hoc networks (MANETs) to support multicast-intensive applications. Available studies on cooperative multicast in MANETs mainly focus on either the full cooperation or noncooperation among destination nodes, which fails to capture the general and more practical node cooperation behaviors. To address this issue, this paper proposes a general cooperative multicast algorithm with cooperative probability p and packet lifetime τ, replication factor f and multicast fanout g. Under such algorithm, the multicast source node can replicate a packet to at most f distinct relay nodes, which help to forward the packet to its g multicast destination nodes before expires, and with cooperative probability p these destination nodes may forward the packet for each other. The algorithm is flexible and general, and it covers full cooperation (p=1) and noncooperation (p=0) as special cases. A theoretical framework is further developed to capture the packet delivery process under the cooperative multicast algorithm and to help us understand the corresponding performance in terms of the expected packet delivery probability and packet delivery cost. Finally, extensive simulation and numerical results are provided for discussions.

Details

Original languageEnglish
Pages (from-to)2631 - 2643
Number of pages14
JournalIEEE Transactions on Vehicular Technology
Volume67
Issue number3
Early online date7 Nov 2017
Publication statusPublished - Mar 2018
MoE publication typeA1 Journal article-refereed

    Research areas

  • Ad hoc networks, Analytical models, cooperative multicast, Electronic mail, Markov processes, Mobile Ad Hoc Network, Mobile computing, Numerical models, packet delivery probability/cost, Relays, two-hop relay

ID: 16836682