Ad Hoc网络性能分析及路由技术研究

发布时间：2018-07-07 10:53

本文选题：Ad + Hoc网络　；参考：《西安电子科技大学》2014年博士论文

【摘要】：Ad Hoc网络是一种自组织的无线网络,由不依赖于基础设施支持和控制的自由通信节点组成。因其可以实现快速组网并具有强鲁棒性的特点,Ad Hoc网络已逐渐应用到许多关键场景中,例如战场通信,抢险救灾,增大现有蜂窝网络的覆盖率,等等。因此,Ad Hoc网络被认为是下一代无线通信网络体系的重要组成部分之一。网络性能评估是研究Ad Hoc网络的核心课题,对实际的组网和网络优化具有重要的指导意义,是推动Ad Hoc网络发展、实用化以及商业化的决定性因素。路由协议设计是Ad Hoc网络的关键技术,直接影响Ad Hoc网络的数据传输。良好的路由协议设计可以提高Ad Hoc网络的整体性能。在国家科技重大专项“广域覆盖低成本宽带接入组网技术与应用示范网络开发国”(2012ZX03004002-003),863项目“大规模无线自组织网络的新型路由协议”(2007AA012217),国家自然科学基金项目“基于网络最大流量统计容量的无线自组织网络性能优化技术”(61172079),国家自然科学基金项目,“基于MIMO和协同通信技术的大规模移动自组织网络路由技术”(60972048)的支持下,本文首先对Ad Hoc网络的时延、吞吐量以及开销等主要性能指标进行理论分析,然后基于理论分析结果,提出了几种适用于Ad Hoc网络的路由协议。本文的主要内容和贡献包括以下几个方面：第一部分分析了跳数受限(L≤2)移动Ad Hoc网络的时延性能。在此Ad Hoc网络中,源节点发送多个数据包副本到不同中继节点,利用这些节点的移动性,当其移动到目的节点附近时再将数据包传递给目的节点。首先,将数据包的传递过程建模为一个离散随机过程,计算其状态之间的平均转移步数,得到了数据包从源节点队首传递到目的节点所需时延(即传递时延)上界的闭合表达式,并给出了在传递时延最优条件下的发送副本数f与网络节点数N的关系f=O((?)N)。进一步,基于平均剩余服务时间,对数据包在源节点的排队时延进行了理论分析,从而得到了端到端时延性能。最后,给出数值仿真结果直观地展现时延性能随网络规模和业务负载的变化趋势。第二部分分析了节点缓存受限Ad Hoc网络的容量性能。当网络节点缓存大小为K时,在充分考虑节点间无线干扰和信道竞争的前提下,利用排队理论将节点缓存队列建模为G/G/1/K排队模型。在此基础上,构造了一个完备的理论框架分析了达到网络吞吐量上界的必要条件,以及在此条件下节点缓存队列的平均到达率和服务速率,并推导出单节点吞吐量C随网络节点数目的渐进变化趋势C=O(1-1/K)。进一步,针对对称网络拓扑和非对称网络拓扑,给出了可以实现网络吞吐量上界的调度策略。第三部分针对节点缓存受限Ad Hoc网络,提出了丢包开销的概念,即定义由于接收节点的缓存溢出导致数据包丢失时,之前用于发送此数据包所消耗的带宽为丢包开销。通过分析实现节点缓存受限Ad Hoc网络最优路径的条件,建立了评估其在任意路由策略下丢包开销的理论框架。仿真结果显示现有路由协议仍然具有很大的改善空间以减小丢包开销,提高网络吞吐量。第四部分提出了一组适用于Ad Hoc网络的高效路由协议。首先提出了一种具有业务感知能力的路由协议TACR,它能够利用基于维纳过程的预测方法感知网络业务变化,及时调整路由策略,并通过引入分布式Q学习算法动态调整路由生存期,提高了路由的自适应性。其次,提出了具有端到端拥塞控制功能的路由协议ECCR, ECCR将路径的长度和拥塞状况相结合作为最优路径的选择标准,提高了网络性能。进一步,在ECCR的基础上提出了M-ECCR, M-ECCR结合了单路径路由和多路径路由在网络拥塞控制中各自的优势,是一种混合路径的新型路由协议。最后,在TACR和ECCR的基础上,结合两者的优点,提出一种新的业务均衡认知路由协议NLBCR。NLBCR在利用基于维纳过程的预测方法感知业务的同时,通过对局部现有路径的调整,在尽可能不增加原有路径长度的情况下减少了网络拥塞,并通过重新确认现有路由的有效期来避免不必要的路由发现,降低了控制开销。仿真结果显示NLBCR能够有效的提高网络吞吐量,降低网络时延,并减小网络开销。
[Abstract]:Ad Hoc network is a self organizing wireless network, composed of free communication nodes which are not dependent on infrastructure support and control. Because of their fast networking and strong robustness, the Ad Hoc network has been applied to many key scenes, such as battlefield communications, rescue and disaster relief, and increasing the coverage of existing cellular networks. Therefore, Ad Hoc network is considered to be one of the important components of the next generation wireless communication network system. Network performance evaluation is the core subject of the study of the Ad Hoc network. It has important guiding significance to the actual networking and network optimization. It is the decisive factor to promote the development, use and commercialization of the Ad Hoc network. Design is the key technology of Ad Hoc network, directly affecting the data transmission of Ad Hoc network. Good routing protocol design can improve the overall performance of Ad Hoc network. In the national science and technology major special "wide area coverage low cost broadband access networking technology and application demonstration network development country" (2012ZX03004002-003), the 863 project "large-scale no" 2007AA012217, National Natural Science Foundation Project "wireless self organizing network performance optimization technology based on network maximum traffic statistics capacity" (61172079), National Natural Science Foundation project, "large-scale mobile ad hoc network routing technology based on MIMO and cooperative communication technology" (609) Under the support of 72048), this paper first analyzes the main performance indexes of Ad Hoc network, such as delay, throughput and overhead, and then proposes several routing protocols for Ad Hoc networks based on the theoretical analysis results. The main contents and contributions of this paper include the following aspects: the first part analyses the Limited number of hops (L < 2). The time delay performance of the mobile Ad Hoc network. In this Ad Hoc network, the source node sends multiple packet copies to the different relay nodes, and uses the mobility of these nodes to transfer the packets to the destination node when they move to the destination node. First, the data packet transfer process is modeled as a discrete random process, and its form is calculated. The average transfer step between States gets the closed expression of the time delay (the transfer delay) upper bound of the packet from the source node to the destination node, and gives the relationship f=O (((?) N) of the number of transmitted copies F and the network node number N under the optimal transfer time delay. The queuing delay of the source nodes is theoretically analyzed, and the end to end delay performance is obtained. Finally, the numerical simulation results are given to show the variation trend with network size and the traffic load. The second part analyzes the capacity energy of the node cache limited Ad Hoc network. Considering the wireless interference and channel competition among nodes, the node caching queue is modeled as a G/G/1/K queuing model by queuing theory. On this basis, a complete theoretical framework is constructed to analyze the necessary conditions to reach the upper bound of the network throughput, and the average rate of arrival and service rate of the node caching queue under this condition. And the gradual change trend of single node throughput C with the number of network nodes is derived C=O (1-1/K). Further, for symmetric network topology and asymmetric network topology, a scheduling strategy that can realize the upper bound of network throughput is given. The third part proposes the concept of packet loss overhead for the node cache Limited Ad Hoc network, which is defined because When the cache overflow of a receiving node leads to a packet loss, the bandwidth consumed before the packet is used as a packet loss overhead. By analyzing the condition of the optimal path of the node cache limited Ad Hoc network, a theoretical framework for evaluating the packet loss overhead under any routing policy is established. The simulation results show that the existing routing protocol is still still available. There is a great improvement in space to reduce packet loss and improve network throughput. Fourth a set of efficient routing protocols for Ad Hoc networks is proposed. First, a routing protocol, TACR, which has business perception ability, is proposed. It can use the predictor method based on the Wiener process to perceive network business changes and adjust the routing in time. The strategy, by introducing the distributed Q learning algorithm to dynamically adjust the routing survival time, improves the routing adaptability. Secondly, a routing protocol ECCR with end to end congestion control is proposed. ECCR combines the length of the path and congestion as the selection criterion for the optimal path, and improves the network performance. Further, in the base of ECCR M-ECCR, which combines the advantages of single path routing and multipath routing in network congestion control, is a new routing protocol with mixed paths. Finally, on the basis of TACR and ECCR, combining the advantages of the two, a new business equilibrium recognition routing protocol, NLBCR.NLBCR, is proposed in the use of Wiener process. At the same time, the prediction method can reduce the network congestion by adjusting the local existing path without increasing the original path length, and reaffirm the validity of the existing routing to avoid unnecessary routing discovery and reduce the control overhead. The simulation results show that NLBCR can effectively improve the network swallowing. Spit, reduce network delay, and reduce network overhead.
【学位授予单位】：西安电子科技大学
【学位级别】：博士
【学位授予年份】：2014
【分类号】：TN929.5

【相似文献】