Abstract
Extensive efforts on capacity studies for the mobile ad hoc networks (MANETs) mainly focus on either the unicast traffic or the asymptotic results under multicast traffic. However, the former ones cannot support future multicast-intensive applications, and the latter ones cannot reveal the real achievable non-asymptotic capacity, such that it still remains largely unknown in such networks. This paper, for the first time, investigates the non-asymptotic capacity in MANETs under a general packet routing scheme with multicast traffic, where each source has multiple destinations. Under the routing scheme, when the destinations move into the communication range of their source, a packet at source will be directly sent to destinations; otherwise, it can be replicated to multiple different relays, which help to forward it to destinations. To study the non-asymptotic capacity in the MANETs, we first develop the two Markov chain theoretical frameworks to characterize the fastest packet propagation process at source and the fastest packet reception process at destinations under the routing scheme. Based on these two theoretical frameworks, we then derive an analytical expression for the capacity. Finally, the simulation and numerical results are conducted to validate our theoretical capacity and also to explore the impact of system parameters on the capacity performance.
Highlights
Mobile ad hoc networks (MANETs) have been widely applied in tactical networks, device-to-device communications and personal area networks [1]–[3]
On exploring either the capacity of MANETs under unicast traffic, i.e., one source is associated with only one destination, or the asymptotic capacity under multicast traffic, the non-asymptotic capacity performance of MANETs has not been fully explored under multicast traffic so far
As the first step towards the study of non-asymptotic capacity under multicast traffic, this paper proposes two novel Markov chain theoretical frameworks for the non-asymptotic capacity study of MANETs under a general packet routing scheme with multicast traffic
Summary
Mobile ad hoc networks (MANETs) have been widely applied in tactical networks, device-to-device communications and personal area networks [1]–[3]. As the first step towards the study of non-asymptotic capacity under multicast traffic, this paper proposes two novel Markov chain theoretical frameworks for the non-asymptotic capacity study of MANETs under a general packet routing scheme with multicast traffic. The previous work in [14] develops two Markov chain theoretical frameworks to analyze the non-asymptotic one under unicast traffic, which cannot be applied to the scenario of multicast traffic. Our Markov chain theoretical frameworks under multicast traffic can be used to analyze the capacity performance under unicast traffic only if the number of destinations is set to one. The results of our work in non-asymptotic analysis represent the achievable capacity of MANETs, while the ones in asymptotic analysis represent the trend of the capacity performance as the number of nodes in the networks goes to infinity.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
