Throughput Capacity Study for MANETs with Erasure Coding and Packet Replication

Bin YANG; Yin CHEN; Guilin CHEN; Xiaohong JIANG

doi:10.1587/transcom.E98.B.1537

Throughput Capacity Study for MANETs with Erasure Coding and Packet Replication

Bin YANG, Yin CHEN, Guilin CHEN, Xiaohong JIANG

Full Text Views

0

Share
Cite this

Summary :

Throughput capacity is of great importance for the design and performance optimization of mobile ad hoc networks (MANETs). We study the exact per node throughput capacity of MANETs under a general 2HR-(g, x, f) routing scheme which combines erasure coding and packet replication techniques. Under this scheme, a source node first encodes a group of g packets into x (x ≥ g) distinct coded packets, and then replicates each of the coded packets to at most f relay nodes which help to forward them to the destination node. All original packets can be recovered once the destination node receives any g distinct coded packets of the group. To study the throughput capacity, we first construct two absorbing Markov chain models to depict the complicated packet delivery process under the routing scheme. Based on these Markov models, an analytical expression of the throughput capacity is derived. Extensive simulation and numerical results are provided to verify the accuracy of theoretical results on throughput capacity and to illustrate how system parameters will affect the throughput capacity in MANETs. Interestingly, we find that the replication of coded packets can improve the throughput capacity when the parameter x is relatively small.

Publication: IEICE TRANSACTIONS on Communications Vol.E98-B No.8 pp.1537-1552

Publication Date: 2015/08/01

Publicized

Online ISSN: 1745-1345

DOI: 10.1587/transcom.E98.B.1537

Type of Manuscript: PAPER

Category: Network

Authors

Bin YANG
  Future University Hakodate,Chuzhou University
Yin CHEN
  Keio University
Guilin CHEN
  Chuzhou University
Xiaohong JIANG
  Future University Hakodate

Keyword

mobile ad hoc networks, throughput capacity, routing protocol, erasure coding, packet replication

Cite this

Copy

Bin YANG, Yin CHEN, Guilin CHEN, Xiaohong JIANG, "Throughput Capacity Study for MANETs with Erasure Coding and Packet Replication" in IEICE TRANSACTIONS on Communications, vol. E98-B, no. 8, pp. 1537-1552, August 2015, doi: 10.1587/transcom.E98.B.1537.
Abstract: Throughput capacity is of great importance for the design and performance optimization of mobile ad hoc networks (MANETs). We study the exact per node throughput capacity of MANETs under a general 2HR-(g, x, f) routing scheme which combines erasure coding and packet replication techniques. Under this scheme, a source node first encodes a group of g packets into x (x ≥ g) distinct coded packets, and then replicates each of the coded packets to at most f relay nodes which help to forward them to the destination node. All original packets can be recovered once the destination node receives any g distinct coded packets of the group. To study the throughput capacity, we first construct two absorbing Markov chain models to depict the complicated packet delivery process under the routing scheme. Based on these Markov models, an analytical expression of the throughput capacity is derived. Extensive simulation and numerical results are provided to verify the accuracy of theoretical results on throughput capacity and to illustrate how system parameters will affect the throughput capacity in MANETs. Interestingly, we find that the replication of coded packets can improve the throughput capacity when the parameter x is relatively small.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E98.B.1537/_p

Copy

@ARTICLE{e98-b_8_1537,
author={Bin YANG, Yin CHEN, Guilin CHEN, Xiaohong JIANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Throughput Capacity Study for MANETs with Erasure Coding and Packet Replication},
year={2015},
volume={E98-B},
number={8},
pages={1537-1552},
abstract={Throughput capacity is of great importance for the design and performance optimization of mobile ad hoc networks (MANETs). We study the exact per node throughput capacity of MANETs under a general 2HR-(g, x, f) routing scheme which combines erasure coding and packet replication techniques. Under this scheme, a source node first encodes a group of g packets into x (x ≥ g) distinct coded packets, and then replicates each of the coded packets to at most f relay nodes which help to forward them to the destination node. All original packets can be recovered once the destination node receives any g distinct coded packets of the group. To study the throughput capacity, we first construct two absorbing Markov chain models to depict the complicated packet delivery process under the routing scheme. Based on these Markov models, an analytical expression of the throughput capacity is derived. Extensive simulation and numerical results are provided to verify the accuracy of theoretical results on throughput capacity and to illustrate how system parameters will affect the throughput capacity in MANETs. Interestingly, we find that the replication of coded packets can improve the throughput capacity when the parameter x is relatively small.},
keywords={},
doi={10.1587/transcom.E98.B.1537},
ISSN={1745-1345},
month={August},}

Copy

TY - JOUR
TI - Throughput Capacity Study for MANETs with Erasure Coding and Packet Replication
T2 - IEICE TRANSACTIONS on Communications
SP - 1537
EP - 1552
AU - Bin YANG
AU - Yin CHEN
AU - Guilin CHEN
AU - Xiaohong JIANG
PY - 2015
DO - 10.1587/transcom.E98.B.1537
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E98-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2015
AB - Throughput capacity is of great importance for the design and performance optimization of mobile ad hoc networks (MANETs). We study the exact per node throughput capacity of MANETs under a general 2HR-(g, x, f) routing scheme which combines erasure coding and packet replication techniques. Under this scheme, a source node first encodes a group of g packets into x (x ≥ g) distinct coded packets, and then replicates each of the coded packets to at most f relay nodes which help to forward them to the destination node. All original packets can be recovered once the destination node receives any g distinct coded packets of the group. To study the throughput capacity, we first construct two absorbing Markov chain models to depict the complicated packet delivery process under the routing scheme. Based on these Markov models, an analytical expression of the throughput capacity is derived. Extensive simulation and numerical results are provided to verify the accuracy of theoretical results on throughput capacity and to illustrate how system parameters will affect the throughput capacity in MANETs. Interestingly, we find that the replication of coded packets can improve the throughput capacity when the parameter x is relatively small.
ER -