On the Throughput Capacity Study for Aloha Mobile Ad Hoc Networks
| Autor: | Jinxiao Zhu, Yulong Shen, Xiaohong Jiang, Yin Chen, Hideyuki Tokuda |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
Queueing theory Computer science Wireless ad hoc network business.industry ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 020206 networking & telecommunications 020302 automobile design & engineering Throughput 02 engineering and technology Mobile ad hoc network Computer Science::Performance 0203 mechanical engineering Aloha Computer Science::Networking and Internet Architecture 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering business Throughput (business) Computer Science::Information Theory Computer network |
| Zdroj: | IEEE Transactions on Communications. 64:1646-1659 |
| ISSN: | 0090-6778 |
| Popis: | Despite extensive efforts on exploring the asymptotic capacity bounds for mobile ad hoc networks (MANETs), the general exact capacity study of such networks remains a challenge. As one step to go further in this direction, this paper considers two classes of Aloha MANETs (A-MANETs) $\mathcal{N}_{A}$ and $\mathcal{N}_{C}$ that adopt an aggressive traffic-independent Aloha and the conventional traffic-dependent Aloha, respectively. We first define a notation of successful transmission probability (STP) in $\mathcal{N}_{A}$ , and apply queuing theory analysis to derive a general formula for the capacity evaluation of $\mathcal{N}_{A}$ . We also prove that $\mathcal{N}_{C}$ actually leads to the same throughput capacity as $\mathcal{N}_{A}$ , indicating that the throughput capacity of $\mathcal{N}_{C}$ can be evaluated based on the STP of $\mathcal{N}_{A}$ as well. With the help of the capacity formula and stochastic geometry analysis on STP, we then derive closed-form expressions for the throughput capacity of an infinite A-MANET under the nearest neighbor/receiver transmission policies. Our further analysis reveals that although it is highly cumbersome to determine the exact throughput capacity expression for a finite A-MANET, it is possible to have an efficient and closed-form approximation to its throughput capacity. Finally, we explore the capacity maximization and provide extensive simulation/numerical results. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|