基于拟生灭过程的多跳Ad hoc网络洪泛方式下拥塞控制及饱和条件研究

802.11Ad hoc网络中拥塞控制是保证网络稳定性的重要因素。拥塞发生时,通常的做法是控制流量,而研究网络何时出现拥塞则是目前的首先任务。针对多跳Ad hoc网络,对单个节点的数据发送过程,考虑包的最大重传次数、数据包的缓冲队列,提出一种新的基于802.11MAC接入协议DCF Basic Access机制的无限状态拟生灭过程模型。研究了在洪泛方式下为避免网络到达饱和状态,节点MAC层上数据包的到达率应满足的条件。指出在DCF协议下到达率对网络状态的影响。与现有文献的区别是,从网络层的角度进行研究,提出了一种新的更精确地描述数据发送过程的模型。给出了多跳Ad hoc网络中稳定性与数据到达率的数学关系式,为多跳Ad hoc网络的拥塞控制提供了一个重要的参考。     

基于GM(1,1)预测的MANET拥塞控制

提出一种用于无线移动Ad hoc网络的TCP自适应拥塞控制机制(TCP_Acc),在给定数据链路层统计带宽的情况下,使用GM(1,1)模型预测未来的网络状态,并根据预测得到的带宽信息自适应地调节拥塞窗口。仿真实验结果表明,该机制能够有效地改进无线移动Ad hoc网络中实时TCP通信的可靠性和无线实时通信的服务质量,如较低的丢包率以及端到端延迟等。     

显式控制协议在Ad Hoc网络中的应用

Ad hoc网络是一种无基础设施、无中心控制的分布式自组织对等式网络,在紧急情况下能够简单迅速搭建。而传统的TCP拥塞控制协议在Ad Hoc网络中表现出不稳定性,不公平性,带宽利用率不高以及随着跳数增加吞吐量减少等问题。eXplicit Control Protocol(XCP),即显式控制协议,是一个基于反馈的拥塞控制协议,其通过对注入网络的数据流设置标记并由网络向发送端发送准确定量的反馈信息来实现拥塞控制。本文简单阐述了TCP拥塞控制协议及其一些改进方案在Ad Hoc网络中的缺陷,并主要针对XCP在Ad Hoc网络中的运用WXCP进行了详细的分析和讨论。     

Ad hoc网络及其安全性分析

Ad hoc网络是一种特殊的多跳移动无线网络，具有广泛的应用场合。文中介绍了Ad hoc网络的产生、定义、特点和应用，然后在探讨Ad hoc网络的安全需求的基础上，分析了移动Ad hoc网络易于遭受的攻击，并集中讨论了移动Ad hoc网络的路由安全、密钥管理等关键问题。提出了按移动Ad hoc网络的安全需求进行分级，然后分别实现的解决策略。     

移动自组网络信任激励机制研究

该文结合移动 Ad hoc 网络的特点分析了移动 Ad hoc 网络面临的安全信任问题。旨在构建一种基于信誉激励的机制,来发现并处理 Ad hoc 网络系统中节点对于资源的非法使用．从而推动 Ad hoc 网络健康发展。     

基于MAODV协议的网络编码方案*

目前网络编码在Ad hoc组播网络中的应用研究比较缺乏,针对这个问题,提出了一种在由MAODV协议(multicast Ad hoc on-demand distance vector routing protocol)组建的Ad hoc组播网络中使用网络编码的网络编码策略,并且为了解决如何解码的问题提出了网络编码处理策略,使得网络编码可以应用在Ad hoc组播网络中,提高了网络性能。理论分析和仿真结果表明,基于网络编码的Ad hoc组播网络与普通Ad hoc组播网络相比,减少了数据包发送次数,降低了网络     

Ad hoc网络的安全问题综述

安全性是决定Ad hoc网络潜能能否得到充分施展的一个关键所在,特别是Ad hoc网络在军事上和商业上的应用。由于不依赖固定基础设施,Ad hoc网络为其使用的安全体系结构提出了新的挑战。相对于传统的网络,Ad hoc网络更易受到各种安全威胁和攻击,包括被动窃听、数据篡改和重发、伪造身份和拒绝服务等。用于传统网络的安全解决方案不能直接应用于Ad hoc网络,现存的用于Ad hoc网络的大多协议和提案也没有很好地解决安全问题．特别是没有考虑特定的环境。     

基于MAODV的移动多播路由协议的改进与仿真

移动Ad hoc网络是指由一组带有无线收发装置的移动节点组成的一个多跳的、不需要固定中心接入点或者基站支持的自治系统。对移动Ad hoc网络多播路由中的MAODV协议进行理论分析,提出了一种使用转接机制改进MAODV协议的方法,该改进协议使用新的NACK抑制机制来防止NACK风暴,减少了移动Ad hoc网络中大量的路由重构和数据分组的重传。采用OPNET软件进行仿真,仿真结果证明了该改进协议在Ad hoc网络中的可行性和有效性。     

Ad hoc网络及其安全性分析

Ad hoc网络是一种特殊的多跳移动无线网络,具有广泛的应用场合。文中介绍了Ad hoc网络的产生、定义、特点和应用,然后在探讨Ad hoc网络的安全需求的基础上,分析了移动Ad hoc网络易于遭受的攻击,并集中讨论了移动Ad hoc网络的路由安全、密钥管理等关键问题。提出了按移动Ad hoc网络的安全需求进行分级,然后分别实现的解决策略。     

试论Ad hoc网络的安全策略

Ad hoc是一种完全由无线连接的移动节点所构成的网络。相比于传统的网络,Ad Hoc网络更易受到各种安全威胁和攻击,用于传统网络的安全解决方案不能直接应用于Ad hoc网络,现存的用于Ad hoc网络的大多协议和提案也没有很好解决安全,本文对Ad hoc网络的安全问题、策略和机制进行了一些有益的探讨。     

异构网络环境下TCP协议性能提高方法

由于无线移动网络的发展,拓扑环境复杂多变,传统的测量网络参数的方法不再适合。采用新的方法计算RTT,使得准确度更高,不仅能够及时反映网络的变化而且能够过滤掉噪声,在网络发生丢包后,通过对RTT变化的实时分析来判断网络是否拥塞,判断丢包是由网络拥塞还是无线链路引起的随机错误,然后分别采取不同的措施。最后使用NS2进行模拟,验证了该算法。     

Adaptive congestion control scheme in mobile ad-hoc networks

In the past, several authors have expressed their concerns over the poor congestion control in mobile wireless ad-hoc networks using traditional reference layer model. Many solutions were proposed to handle growing traffic and congestion in the network, using link layer information. Existing solutions have shown difficulties in dealing with congestion with varying packets drop. Moreover, ensuring the superior performance of congestion control schemes with traditional referenced layer model is a challenging issue, due to quick topology changes, dynamic wireless channel characteristics, link-layer contentions, etc. In this paper, we propose an effective cross-layer adaptive transmission method to handle the congestion in mobile wireless ad-hoc networks adequately. Simulation results exemplify the usefulness of the proposed method in handling congestion, and yields better results compared to existing approaches.     

分级ad-hoc网络中的一种移动节点故障诊断算法

讨论了ad—hoc网络中现有的故障诊断算法，并分析了“基于比较的故障诊断”算法由于节点重复诊断和诊断消息在整个ad-hoc网络中洪泛导致的系统开销大的问题，同时指出了该算法在诊断期间网络拓扑变化则部分节点无法诊断的缺陷．然后提出了一种“基于簇的比较诊断算法”，该算法在分级ad—hoc网络中利用簇首对簇内节点的集中控制功能优化了诊断过程，实现了诊断期间网络拓扑变化时对移动节点的诊断．仿真结果表明．与“基于比较的故障诊断”算法相比，“基于簇的比较诊断算法”具有更小的系统开销．     

基于移动agent的无结构P2P网络拓扑重连方法研究

为了提高无结构P2P网络中资源查找的效率,同时避免在资源查找过程中出现拥塞,提出了一种基于移动agent的网络拓扑重连方法。网络节点定期进行拓扑重连,同时通过收集其邻居节点的处理能力以及连通性等信息,指导移动agent有目的地在网络迁移,从而使移动agent及时发现网络节点上的拥塞,并使用拓扑优化机制降低节点上的负载。实验证明该方法能优化网络的拓扑结构,避免网络查询过程中发生拥塞,提高资源查找的效率,同时适应网络查询负载的动态变化。     

Markovian jump guaranteed cost congestion control strategies for large scale mobile networks with differentiated services traffic

In this paper, two novel congestion control strategies for mobile networks with differentiated services (Diff-Serv) traffic are presented, namely (i) a Markovian jump decentralized guaranteed cost congestion control strategy, and (ii) a Markovian jump distributed guaranteed cost congestion control strategy. The switchings or changes in the network topology are modeled by a Markovian jump process. By utilizing guaranteed cost control principles, the proposed congestion control schemes do indeed take into account the associated physical network resource constraints and are shown to be robust to unknown and time-varying network latencies and time delays. A set of Linear Matrix Inequality (LMI) conditions are obtained to guarantee the QoS of the Diff-Serv traffic with a guaranteed upper bound cost. Simulation results are presented to illustrate the effectiveness and capabilities of our proposed strategies. Comparisons with centralized and other relevant works in the literature focused on Diff-Serv traffic and mobile networks are also provided to demonstrate the advantages of our proposed solutions.     

LIAD: Adaptive bandwidth prediction based Logarithmic Increase Adaptive Decrease for TCP congestion control in heterogeneous wireless networks

For accessing plentiful resources in the Internet through wireless mobile hosts, diverse wireless network standards and technologies have been developed and progressed significantly. The most successful examples include IEEE 802.11 WiFi for wireless networks and 3G/HSDPA/HSUPA for cellular communications. All IP-based applications are the primary motivations to make these networks successful. In TCP/IP transmissions, the TCP congestion control operates well in the wired network, but it is difficult to determine an accurate congestion window in a heterogeneous wireless network that consists of the wired Internet and various types of wireless networks. The primary reason is that TCP connections are impacted by not only networks congestion but also error wireless links. This paper thus proposes a novel adaptive window congestion control (namely Logarithmic Increase Adaptive Decrease, LIAD) for TCP connections in heterogeneous wireless networks. The proposed RTT-based LIAD has the capability to increase throughput while achieving competitive fairness among connections with the same TCP congestion mechanism and supporting friendliness among connections with different TCP congestion control mechanisms. In the Congestion Avoidance (CA) phase, an optimal shrink factor is first proposed for Adaptive Decreasing cwnd rather than a static decreasing mechanism used by most approaches. Second, we adopt a Logarithmic Increase algorithm to increase cwnd while receiving each ACK after causing three duplicate ACKs. The analyses of congestion window and throughput under different packet loss rate are analyzed. Furthermore, the state transition diagram of LIAD is detailed. Numerical results demonstrate that the proposed LIAD outperforms other approaches in goodput, fairness, and friendliness under diverse heterogeneous wireless topologies. Especially, in the case of 10% packet loss rate in wireless links, the proposed approach increases goodput up to 156% and 1136% as compared with LogWestwood+ and NewReno, respectively.     

无线移动网络中增强TCP性能的技术综述

TCP是因特网上的主要传输协议，在数据包丢失主要是由拥塞引起的传统网络上，TCP可以充分发挥其性能，但是在无线移动网络中，TCP将无线信道比特差错和移动切换引起的数据包丢失误归于网络发生拥塞而采取拥塞控制措施，不必要地降低了端到的吞吐率，导致自身性能的下降，首先阐述了当前无线移动网络的发展状况和TCP面临的问题，在此基础上，综述和评价了各种增强TCP性能的技术方案，最后，结合无线移动通信系统的最新进展，分析和探讨了当前存在的问题和进一步的研究方向。     

一种改进的基于Smith原则的计算机高速通信网络的拥塞控制方案

1.引言 ATM网络是一类虚拟的电路交换网络,它融入了电路交换技术和包交换技术。在这两个系统融入以前它们是独立的,若要互相通信必须获得彼此的通信参数才能建立虚拟连接。而ATM网络通过存储技术和统计复用来共享网络资源,网络资源的共享使得通信费用大大减少。ATM是以定长的信元(cell)作为高速通信信息的载体,它具有高速、低比特错误率、动态分配带宽和高复合能力的优点,这些使得它非常适宜于需要保证服务质量(Quality of Service,QoS)的多媒体数据流。由于多媒体业务流的特性,常引起网络拥塞并降低服务的质量。因此必须采取一定的流量管理控制机制来避免网络的拥塞。     

Active route-maintenance protocol for signal-based communication path in ad hoc networks

Ad hoc wireless networks consist of mobile hosts in a network without base stations, and are characterized by a highly dynamic network topology. The network topology changes frequently due to host migration, signal interference and power outages, making routing maintenance a challenging consideration in designing routing protocols. This study presents an active route-maintenance protocol to prevent the current route from disconnecting. Monitoring the signal strength and stability of individual hosts allows the active node, which causes the route to have a weak connection, to issue actively a route-reestablishment instruction for selecting one of its neighbors as a candidate of active node. An enhanced active route-maintenance protocol is also proposed to reduce the probability of route breakage and enhance the route's efficiency. Performance simulation reveals that the proposed route maintenance protocol effectively reduces both the overhead and route maintenance, and alleviates route-breakage.     

移动P2P网络的协作缓存优化策略

移动P2P网络具有拓扑动态多变、节点资源有限、网络资源短缺的特点.如何合理地、高效地使用移动节点提供的协作缓存资源、增加移动节点间的协作来减少移动P2P的网络时延、节省带宽、防止拥塞是一个关键问题.深入研究了有限协作缓存--Cache资源的替换策略、重要数据的及时缓存和Cache资源的充分使用问题.并根据蚁群算法的思路,提出了一种基于信息素的Cache替换算法,建立了选取适当存储空间作为Cache的数学模型和推导.理论分析和仿真数据表明该算法能有效提高协作Cache资源的使用率,促进了移动节点间的协作,提高了移动节点从邻居节点获得资源的成功率,并减少了协作Cache资源请求的平均响应时间.