Mobile Ad Hoc Networks (MANETs) are gaining increasing popularity in recent years because of their ease of deployment. They are distributed, dynamic, and self-configurable without infrastructure support. Routing in ad hoc networks is a challenging task because of the MANET dynamic nature. Hence, researchers were focused in designing best-effort distributed and dynamic routing protocols to ensure optimum network operations in an unpredictable wireless environment. Nowadays, there is an increased demand on multimedia applications (stringent delay and reliability requirements), which makes a shift from best-effort services to Quality of Services.ududActually, the challenge in wireless ad hoc networks is that neighbor nodes share the same channel and they take part in forwarding packets. Therefore, the total effective channel capacity is not only limited by the raw channel capacity but is also limited by the interactions and interferences among neighboring nodes. Thus, such factors should be taken in consideration in order to offer QoS routing. While, some of the distributed QoS route selection algorithms assume the availability of such information, others propose mechanisms to estimate them.ududThe goals of this thesis are: (i) to analyze the performance of IEEE 802.11 MAC mechanism in non-saturation conditions, (ii) to use the analysis in the context of multi-hop ad hoc networks, (iii) to derive theoretical limits for nodes performance in multi-hop ad hoc networks, (iv) to use the multi-hop analysis in QoS route selection.ududWe start the thesis by proposing a discrete-time 3D Markov chain model to analyze the saturation performance of the RTS/CTS access mode. This model integrates the backoff countdown process, retransmission retry limits, and transmission errors into one model. The impact of system parameters (e.g., number of nodes, packet size, retry limits, and BERs) are analyzed. Next, we extend the 3D model to analyze the performance under non-saturation conditions and finite buffer capacity using two different approaches. First, we extend the 3D model into a 4D model to integrate the transmission buffer behavior. Second, we replace the 4D model by an M/G/1/K queueing system model with independent samples from the saturation analysis. The latter model gives similar results as the former but with a reduction in the analysis complexity. Next and by means of the non-saturation analysis, we proposed an approximate mathematical model for multi-hop ad hoc networks. Furthermore, we proposed an iterative mechanism to estimate the throughput in the presence of multiple flows. Finally, we used the multi-hop analysis to propose a QoS route selection algorithm. In this algorithm, we concentrate on the throughput as a QoS parameter. However, the proposed algorithm is valid to be used with other QoS parameters, such as packet delay, packet loss probability, and fairness. Analytical and simulation results show the deficiency of the current route selection algorithm in AODV and at the same time verifies the need for QoS route selection algorithms.ud
展开▼
机译:近年来,由于移动自组织网络(MANET)易于部署,因此越来越受欢迎。它们是分布式的,动态的且可自行配置的,无需基础架构支持。由于MANET具有动态特性,因此在ad hoc网络中进行路由是一项具有挑战性的任务。因此,研究人员致力于设计尽力而为的分布式和动态路由协议,以确保在不可预测的无线环境中实现最佳的网络运行。如今,对多媒体应用的需求不断增加(严格的延迟和可靠性要求),这使得从尽力而为的服务向服务质量的转变。相同的渠道,他们参与转发数据包。因此,总有效信道容量不仅受到原始信道容量的限制,而且还受到相邻节点之间的交互和干扰的限制。因此,为了提供QoS路由,应该考虑这些因素。虽然某些分布式QoS路由选择算法假设此类信息可用,但另一些提出了估算信息的机制。 ud ud本文的目标是:(i)分析非饱和状态下IEEE 802.11 MAC机制的性能条件,(ii)在多跳ad hoc网络中使用分析,(iii)得出多跳ad hoc网络中节点性能的理论极限,(iv)在QoS中使用多跳分析 ud ud我们通过提出离散时间3D马尔可夫链模型来分析RTS / CTS访问模式的饱和性能来开始本文。该模型将退避倒计时过程,重传重试限制和传输错误集成到一个模型中。分析了系统参数(例如,节点数,分组大小,重试限制和BER)的影响。接下来,我们扩展3D模型以使用两种不同的方法来分析非饱和条件下的性能和有限的缓冲区容量。首先,我们将3D模型扩展为4D模型以集成传输缓冲区行为。其次,我们用M / G / 1 / K排队系统模型替换4D模型,并使用来自饱和度分析的独立样本。后一种模型的结果与前一种模型相似,但分析复杂度降低了。接下来,通过非饱和分析,我们为多跳自组织网络提出了一种近似的数学模型。此外,我们提出了一种迭代机制来估计存在多个流时的吞吐量。最后,我们使用多跳分析提出了QoS路由选择算法。在该算法中,我们将吞吐量作为QoS参数。但是,提出的算法与其他QoS参数(如数据包延迟,数据包丢失概率和公平性)一起使用是有效的。分析和仿真结果表明,AODV中当前路由选择算法的不足,同时验证了对QoS路由选择算法的需求。
展开▼