首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到19条相似文献,搜索用时 562 毫秒
1.
无线传感器网络(WSN)的MAC协议主要采用基于CSMA/CA的DCF机制,上述协议的能源效率随网络中竞争节点个数和负载的增加而迅速恶化.研究发现,CSMA/CA可以认为是1-坚持CSMA和p-坚持CSMA的混合体[3].本文提出了一种状态检测与竞争节点个数的自适应优化机制,ABM(Adaptive Backoff Mechanism),同时引入了信号流图模型这种新的方法来进行数学建模.根据相关数学模型的分析,p与系统参数存在着一定的数学关系,竞争节点个数和负载的变化都会引起p的改变,因此通过p的变化对相关参数进行动态调整,从而有效地改善了协议的整体性能.同时给出了相关模型和计算的详细说明,最后实验仿真,新的方法能够根据竞争节点个数和负载的变化对系统性能进行整体优化,在能量效率方面明显优于标准的CSMA/CA的DCF机制.  相似文献   

2.
在无线局域网中提供服务质量(QoS)保证的MAC 算法应该满足业务区分服务的要求和系统性能的整体最优.以往的此类自适应MAC 算法依赖于对不同级别的竞争业务数目进行估计,计算过于复杂.提出一种基于QoS区分的自适应p-persistent MAC 算法,QDA-MAC(QoS differentiation based adaptive MAC scheme).该算法引入了新的参数-坚持因子(persistent factor),其优化值能够实时反映网络负载的变化情况,结合近似优化的自适应方法,每次发送尝试后,该算法不需要估计每类竞争业务的数目,利用坚持因子的优化值实时更新各类优先级业务的发送概率,调整相应的协议参数,系统的性能也能接近最优.仿真结果验证了该算法不仅能够根据竞争业务数目的变化对系统的性能进行整体优化,而且能够提供业务区分服务,在QoS区分的基础上可以为实时业务提供严格的QoS保证,尤其在信道利用率和时延等方面明显优于标准的IEEE 802.11 DCF 和IEEE 802.11e EDCA 机制.  相似文献   

3.
着眼于IEEE802.11MAC协议的改进与优化。根据马尔可夫理论分析了MAC层性能,首次提出利用平均冲突次数来代替以往算法中对竞争终端个数的精确测量,在此基础上将冲突权值引入DCF(distributed coordination function)机制中,从而提出了基于冲突权值的动态优化方案(dynamic optimization algorithm based on the conflict weights,DOBCW)。经仿真对比测试,改进方案DOBCW在系统吞吐量和系统时延方面很具优势,最高可  相似文献   

4.
最优常数竞争窗口对WLAN的性能优化研究*   总被引:2,自引:1,他引:1  
在IEEE 802.11网络中可通过监控信道获得系统中竞争节点数目,而IEEE 802.11DCF协议的设计并没有利用这一参数。因此,首先分析了在IEEE 802.11DCF中使用常数竞争窗口的可行性,提出了DCF/CCW这一改进协议,并对其进行系统吞吐量和接入时延分析。在此基础上,提出根据网络中竞争节点数目来选择最优常数竞争窗口的optimal-DCF/CCW协议。在optimal-DCF/CCW中,各终端首先利用S-DCF算法估算网络中竞争节点的数目,据此选择所应采用的最优常数竞争窗口Wopt的值。仿  相似文献   

5.
IEEE802.11分布式协调机制(DCF)是颇具影响力的无线网络标准,协议基于载波检测/碰撞退避多址接人协议和时隙退避算法.针对IEEE802.11DCF饱和状态不能解决无线网络复杂的工作机制,提出三维Markov链(3M)模型,分析IEEE802.11DCF的非饱和性能,各站点在发送成功后随机产生新的数据分组,且到达率满足Poisson分布.三维Markov模型的仿真与理论分析吻合,这表明3M对系统的吞吐率、延迟性能、稳定性等参数有明显的提高与改善.  相似文献   

6.
针对IEEE 802.11p协议移动性支持的评估需求,构建基于IEEE 802.11p协议的车联网应用场景,利用泊松过程描述车联网系统中的车辆到达模型。基于Veins平台搭建仿真场景并对仿真参数进行设置,从端到端延迟、丢包率、吞吐量方面测试并分析车流密度、车辆行驶速度对IEEE 802.11p性能的影响以及IEEE 802.11p应用于车联网环境的适用性。测试结果表明,车辆行驶速度对基于IEEE 802.11p协议的车联网性能影响较大,而车流密度对其性能影响较小,同时IEEE 802.11p协议适用于主动道路安全应用且有助于提高合作交通效率。  相似文献   

7.
IEEE 802.11e EDCA协议通过采用MAC层业务区分的方式,提供网络的QoS支持.分析并比较了802.11e EDCA对802.11 DCF的改进,并通过NS2仿真分析EDCA在Ad Hoc网络中的应用情况,进一步讨论并仿真实现了对EDCA协议参数的分析.仿真结果表明,EDCA在多跳Ad Hoc网络中仍保持了其有效性,实现业务区分并提高了网络的吞吐量等性能,同时协议参数的不同将极大的影响系统性能,通过优化设置参数可以进一步提高系统性能.  相似文献   

8.
基于802.11i的无线局域网安全加密技术研究   总被引:2,自引:0,他引:2  
为了提高无线局域网的安全性,解决传统安全机制WEP协议中所存在的缺陷,给出了一种基于IEEE802.11i的无线局域网安全模型.在分析了IEEE802.11i协议的体系结构和安全机制的基础上,对IEEE802.11i的数据加密技术进行了剖析,详细分析了TKIP和CCMP协议的加解密过程和安全性能,结果表明,TKIP的安全性能仍有局限性,只是一种过渡方案,而CCMP才是健壮的数据保密协议.  相似文献   

9.
IEEE 802.11p是IEEE针对车辆网络颁布的物理层与MAC层标准,网络中车辆密度是动态变化的,而IEEE 802.11p协议没有提出根据网络情况动态调整EDCA参数来优化网络性能。为了解决网络中节点密度变化带来的吞吐量低、碰撞率高的问题,提出一种EDCA自适应退避优化算法。仿真实验结果表明,该算法相对于传统EDCA算法,性能大幅度提高。  相似文献   

10.
对IEEE 802.11 MAC层协议公平性改进的研究   总被引:2,自引:1,他引:1  
Ad Hoc网络中基于IEEE 802.11的MAC层协议采用CSMA/CA机制,通过侦听只能获取一跳范围内节点的信息,存在隐终端问题,影响了网络流调度的公平性.文中对IEEE 802.11提出了一种修改方案,该方案通过邻居结点间的信息交换,使网络中每个节点具有其二跳范围内所有结点的信息,以发现网络中的隐终端,提高网络流调度的公平性.对比仿真实验结果表明,修改后的IEEE 802.11与原协议的网络吞吐量基本相当,但具有更好的公平性.  相似文献   

11.
基于无线信道的冲突分解算法仿真研究   总被引:1,自引:0,他引:1  
目前,无线局域网(WLAN)中的媒体接入控制层(MAC)广泛采用基于IEEE802.11的二进制指数回退算法(BEB)的DCF协议.当WLAN中的节点数目迅速增加时,该协议存在系统吞吐量会急剧降低,网络性能变差的缺点.详细分析了无线局域网中IEEE 802.11MAC层的二进制退避协议,指出原协议在进行冲突处理上的不足,并结合树型分解算法(TSA)和快速分解算法(FCR),提出一种改进的树型冲突分解算法(ITSA).并用MATLAB仿真了CSMA/CA协议和ITSA算法.分析和仿真结果证明,与IEEE 802.11等协议采用的二进制指数退避算法相比,该算法能较大的提高系统吞吐量.  相似文献   

12.
分布式协调功能(DCF)采用有冲突避免的载波侦听多路访问(CSMA/CA,Carrier Sense Multiple Access with Collision Avoidance)方式访问共享无线媒体,是IEEE802.11媒体访问控制协议的基础。然而,在活动节点数目较大的环境下,这种机制容易造成性能恶化,且难以提供实时业务的服务质量(QoS)保证。概述了IEEE802.11的DCF机制及其性能分析方法,重点剖析了当前基于DCF的各种QoS机制,讨论了它们各自的优缺点,最后得出了优化DCF的一些有益的结论。  相似文献   

13.
在无线局域网(WLANs)中,介质访问控制(MAC)协议的设计是一个核心的问题。MAC协议应该满足较高的吞吐量和较好的公平性等要求。根据802.11分布式协同函数(DCF),提出了一种新的高效的竞争窗口(CW)处理机制,称作自适应倍乘增加倍乘减小算法(ADD)。该算法的基本思想如下:每个站点在成功地连续发送n个数据包后,其MAC层的竞争窗口减小为原值的一半,而且n的值根据接入节点(AP)的瞬时流量自适应地调节。大量仿真实验表明:该算法可以通过有效地降低站点之间的冲突概率,来增加系统整体的吞吐量,同时增加不同站点之间的公平性。  相似文献   

14.
Runtime optimization of IEEE 802.11 wireless LANs performance   总被引:2,自引:0,他引:2  
IEEE 802.11 is the standard for wireless local area networks (WLANs) promoted by the Institute of Electrical and Electronics Engineers. Wireless technologies in the LAN environment are becoming increasingly important and the IEEE 802.11 is the most mature technology to date. Previous works have pointed out that the standard protocol can be very inefficient and that an appropriate tuning of its congestion control mechanism (i.e., the backoff algorithm) can drive the IEEE 802.11 protocol close to its optimal behavior. To perform this tuning, a station must have exact knowledge of the network contention level; unfortunately, in a real case, a station cannot have exact knowledge of the network contention level (i.e., number of active stations and length of the message transmitted on the channel), but it, at most, can estimate it. We present and evaluate a distributed mechanism for contention control in IEEE 802.11 wireless LANs. Our mechanism, named asymptotically optimal backoff (AOB), dynamically adapts the backoff window size to the current network contention level and guarantees that an IEEE 802.11 WLAN asymptotically achieves its optimal channel utilization. The AOB mechanism measures the network contention level by using two simple estimates: the slot utilization and the average size of transmitted frames. These estimates are simple and can be obtained by exploiting information that is already available in the standard protocol. AOB can be used to extend the standard 802.11 access mechanism without requiring any additional hardware. The performance of the IEEE 802.11 protocol, with and without the AOB mechanism, is investigated through simulation. Simulation results indicate that our mechanism is very effective, robust, and has traffic differentiation potentialities.  相似文献   

15.
In this paper, we present an analytical model to evaluate the hidden station effect on the performance of the IEEE 802.11 Distributed Coordination Function (DCF) in both non-saturation and saturation condition. DCF is a random channel-access scheme based on Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) method and the exponential backoff procedure. DCF is widely used and can support both wireless network with an access point and ad hoc wireless network because of its random channel-access method. On the other hand, this method unavoidably suffers the hidden station effect that causes significant performance degradation. As shown in this paper, hidden stations occur frequently in real-world settings, and the performance impact on the 802.11 DCF is a significant concern, but it has not been adequately studied. We study this problem through a spatial–temporal analysis and a Markov chain model. Our model generalizes the existing work on the performance modeling of 802.11 DCF for both non-saturation and saturation conditions. The scenario of no hidden station can be considered as a special case in our model. The performance of our model is evaluated by comparison with ns-2 simulations.  相似文献   

16.
The IEEE 802.11 MAC protocol has gained widespread popularity and has been adopted as the de-facto layer 2 protocol for wireless local area networks (WLANs). However, it is well known that as the number of competing stations increases, the performance of the protocol degrades dramatically. Given the explosive growth in WLANs’ usage, the question of how to sustain each user’s perceived performance when a large number of competing stations are present, is an important and challenging open research problem.Motivated by this, in this paper we analyze the behavior of 802.11-based WLANs as the number of competing stations increases, and attempt to provide concrete answers to the following fundamental questions: (i) is there a set of system and protocol parameters that we can scale in order to sustain each individual user’s perceived performance, and (ii) what is the minimum scaling factor?Using theoretical analysis coupled with extensive simulations we show that such a set of parameters exists, and that the minimum scaling factor is equal to the factor by which the number of users increases. Our results reveal several important scaling properties that exist in today’s 802.11-based wireless networks, and set guidelines for designing future versions of such networks that can efficiently support a very large number of users.  相似文献   

17.
In this paper, we propose a novel contention-based protocol called backoff counter reservation and classifying stations for the IEEE 802.11 distributed coordination function (DCF). In the proposed scheme, each station has three states: idle, reserved, and contentious. A station is in the idle state if it has no frame ready to transmit. A station is in the reserved state if it has a frame ready to transmit and this frame's backoff counter has been successfully announced through the previous successfully transmitted frame so that other stations know this information. A station is in the contentious state if it has a frame ready to transmit, but this frame's backoff counter has not been successfully announced to other stations. All the stations in the idle state, the reserved state, and the contentious state form an idle group, a reserved group, and a contentious group, respectively. Two backoff schemes are proposed in the BCR-CS protocol based on the number of stations in the contentious group including the optimal pseudo-p-persistent scheme. The proposed schemes are compared with the DCF and the enhanced collision avoidance (ECA) scheme in the literature. Extensive simulations and some analytical analysts are carried out. Our results show that all proposed schemes outperform both the DCF and the ECA, and the BCR-CS with optimal pseudo-p-persistent scheme is the best scheme among the four schemes.  相似文献   

18.
IEEE802.11采用基于二进制指数回退算法(BEB)的DCF作为其基本的媒体接入控制协议(MAC)。但研究表明,在该DCF机制下,当节点数目迅速增加时,系统吞吐量急剧降低,严重影响网络性能。提出了一种基于4进制回退的DCF算法,仿真结果表明,改进后的DCF能使系统性能有较大的提高。  相似文献   

19.
IEEE802.11采用基于二进制指数回退算法(BEB)的DCF作为其基本的媒体接入控制协议(MAC)。但研究表明,在该DCF机制下,当节点数目迅速增加时,系统吞吐量急剧降低,严重影响网络性能。提出了一种根据竞争节点数目调整退避指数r的方案以改进DCF性能,仿真结果表明,改进后的DCF能使系统性能有较大的提高。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号