The Actual Maximum Throughput of Mobile Ad Hoc Networks with Reed-Solomon Coding

Maximum throughput serves as a fundamental metric for evaluating the performance of mobile ad hoc networks. However, the actual maximum throughput still remains significantly unknown in such networks. This paper studies the actual maximum throughput of mobile ad hoc networks under a general routing scheme with reed-solomon coding, where a source node first encodes a group of g packets into w (w >= g) code blocks, and then these code blocks are transmitted to distinct relay nodes, which forward them to destination node. The original g packets can be decoded once the destination node receives any g code blocks. To explore the actual maximum throughput, we first establish two Markov chain models to capture the fastest packet sending and receiving processes at source and destination nodes under the considered routing scheme. Based on the Markov chain models, we then derive a closed-form expression for the maximum throughput in such networks. Finally, extensive simulations and theoretical results are presented to validate the accuracy of our theoretical maximum throughput analysis in mobile ad hoc networks and to illustrate how network parameters influence the maximum throughput performance.