基于无线Mesh网络的多跳中继传输模式研究

无线Mesh网络(Wireless Mesh Network)简称WMN,是一种通过无线链路连接路由器和终端设备的无线多跳网络。文章对无线Mesh网络中IEEE802.11异常传输问题做出了深入分析,通过数学模型的分析,理论验证了在无线Mesh网络中只要有一个节点使用较低的发送速率,那么其他高速率的节点吞吐率都会显著下降,从而导致整个网络的吞吐性能下降。并且通过仿真实验,验证了多跳中继传输方案可以解决IEEE802.11异常传输问题,提高网络的整体吞吐性能。     

IEEE 802.16(WiMax)Mesh组网机制分析

IEEE 802.16(WiMax)标准规定了一个高速率大范围的多跳无线Mesh网络机制.文章介绍了IEEE 802.16(WiMax)无线城域网(WMAN)标准及无线Mesh网络(WMN)的多跳特点,着重对IEEE 802.16(WiMax)Mesh组网机制进行分析,介绍了WiMax Mesh网络的构造、特点、帧结构及其新节点接入进程和集中调度策略,并列举了这种网络的不足,为无线Mesh网络的研发人员提供一些参考.     

有限区域同时同频全双工跳频自组网性能研究

该文针对有限区域的同时同频全双工(CCFD)跳频自组网络,通信节点位置不等价,受非对称互干扰和自干扰影响的场景,开展有限区域全双工跳频自组网的通信性能分析。以网络频带利用率为性能指标,推导出节点位置分布条件下的网络频带利用率闭合表达式,并提出一种降低网络互干扰的节点位置优化分布方法。理论和仿真结果表明,有限区域全双工跳频自组网的性能与频点个数、通信距离、节点个数强相关,且全双工自组网络的性能与半双工网络相比,其占优区域受节点个数约束。     

无线Mesh网络组网模式构建

一、引言无线MESH网络(WMN,Wireless Mesh Network,又称无线网状网),是一种新型的宽带无线网络结构,是一种高容量、高速率的分布式网络,它的核心指导思想是让网络中的每个节点都可以发送和接收信号,传统的WLAN一直存在的可伸缩性低和健壮性差等诸多问题由此迎刃而解。无线Mesh技术的出现,代表着无线网络技术的又一大跨越,基于mesh技术的多跳WMN网络正成为目前     

LEACH协议最佳群首个数的研究

低能耗自适应分簇(LEACH)协议随机循环地选择群首并将网络能量消耗平均分配给每个节点,但没有考虑选择的群首个数是否在最佳群首范围内。为了避免网络中群首节点数较少或较多而导致节点过早死亡,结合节点数据融合率并以单跳与多跳相结合的方式将数据发送给基站的方法确定最佳群首个数。当网络中的分群个数与最佳群首个数相同时,可以提高网络生命周期,节约网络能耗。     

一种基于Mesh结构的新型层次化片上网络拓扑结构

针对片上网络(NoC)较远距离节点路由跳数较大导致的网络功耗和面积过大问题,该文通过分析Mesh和集中式Mesh(CMesh)结构特性,提出一种基于Mesh的新型层次化CHMesh结构。该结构分两层,底层以Mesh方式互连,并划分为多个路由区域,以保证邻近节点的通信需求,上层以CHMesh方式通过中间节点将底层各个区域进行互连,以降低网络直径。设计了针对性最短路径CHXY路由算法,该算法复杂度低,能够避免死锁。性能分析和仿真实验表明,在非均匀流量模式下,CHMesh结构的吞吐量比传统Mesh和Ref-Mesh分别提高约60%和10%,在较大规模片上网络中更有优势。     

无线Mesh网络中激励机制研究

为了激励无线Mesh网络中自私节点转发数据,通过分析节点自私行为激励的原因和目标,将适用于无线Mesh网络中对节点自私行为的四类激励机制进行比较.讨论了无线Mesh网络博弈模型,并对无线Mesh网络中重复博弈模型进行理论分析.针对节点的自私行为提出了基于博弈论与信誉相结合的激励方案.仿真实验表明,该方案不仅降低了基于信誉的复杂度又能有效激励更多自私节点转发数据,从而提高了网络的整体性能.     

基于数据块优先级的无线多跳Mesh网络数据分发算法

为了解决当前无线多跳Mesh网络数据分发算法大都使用Mesh-Pull分发策略,导致其传输性能较弱,以及较大的数据分发时延的不足,设计了基于数据块优先级的无线多跳Mesh网络数据分发算法。首先,基于Mesh-Pull方法,考虑其吞吐量与时延的干扰作用,定义了最优化择取机制,并引入数据块的优先级,确定网络中的待传输数据块的请求排序,并通过评估Mesh网络的带宽和SNR值,寻找出最优邻居节点。实验数据显示,与当前Mesh-Pull数据分发算法相比,该算法具有更低的网络时延与更高的吞吐量。     

Mesh网络中基于节点信誉度和标识的可信认证

针对无线Mesh网络开放性和多跳通信导致易受外部和内部攻击以及节点失效等问题,提出了一种高效、安全的可信节点间认证方案。该方案针对无线Mesh网络的特点,首先通过基于Beta分布的节点行为信誉的管理计算其信任度,利用信任度识别节点是否可信;其次采用CPK标识认证算法结合挑战随机数,一次性完成入网节点的双向身份认证、网络认证和通信密钥的建立等问题。提高了节点认证效率,简化了认证的流程,减少了认证时延。最后通过安全性分析说明认证的安全性,通过性能分析说明认证的高效性。     

基于IEEE 802.16-2004标准的Mesh机制

MESH网络架构引入多跳的方式完成长距离通信,取得了覆盖范围和吞吐量的性能优化。本文介绍了基于IEEE 802．16-2004标准的Mesh机制,基于对协议的理解,对Mesh网络中新节点接入过程和协议中对调度的规定进行了详细阐述。     

一种自适应调整发送概率的无线传感器网络MAC协议

文章提出一种新的无线传感器网络MAC协议AMAC.AMAC是对S-MAC的扩展,克服了S-MAC采用固定竞争窗,无法适应网络负载变化的缺点.为不影响协议休眠激活周期的建立,文章提出固定竞争窗加p坚持的退避算法,当退避计数器减为零时,节点不是立即发送数据,而是以最优概率p发送.为确定p值,又推导出使平均发送能耗最小的p与活动节点数的关系,同时提出了活动节点数估计算法.最后通过仿真验证了AMAC协议的自适应性和能量有效性.     

An effective medium contention method to improve the performance of IEEE 802.11

In this paper, we propose an effective medium access mechanism to enhance performance of the IEEE 802.11 distributed coordination function (DCF). One of the primary issues of 802.11 is a contention-based medium access control (MAC) mechanism over a limited medium, which is shared by many mobile users. In the original 802.11 DCF, the binary exponential backoff algorithm with specific contention window size is employed to coordinate the competition for shared channel. Instead of binary exponential increase, we adopt linear increase for the contention window that is determined according to the competing number of nodes. We also assume that the access point can broadcast the number of mobile nodes to each station through management frames. An analytical model is developed for the throughput performance of the wireless medium. Using simulation results from the NS2 simulator, we show that our model can accurately predict the system saturation throughput, and can obtain better performance in terms of throughput, fairness, and packet drop.     

Using Incompletely Cooperative Game Theory in Wireless Mesh Networks

Recently, game theory has become a useful and powerful tool in research on wireless mesh networks. In this article the authors present a novel concept of incompletely cooperative game theory and use it to improve the performance of MAC protocols in WMNs. In this game, first, each node estimates the current game state (e.g., the number of competing nodes). Second, the node adjusts its equilibrium strategy by tuning its local contention parameters (e.g., the minimum contention window) to the estimated game state. Finally, the game is repeated several times to get the optimal performance. To use the game effectively in WMNs, the authors present a hybrid CSMA/CA protocol by integrating a proposed virtual CSMA/CA and the standard CSMA/CA protocol. When a node has no packet to send, it contends for the channel in virtual CSMA/CA mode. In this way the node can estimate the game state and obtain the optimal strategy. When a node has packets to send, it contends for the channel in standard CSMA/CA mode with the optimal strategy obtained in virtual CSMA/CA mode, switching smoothly from virtual to standard CSMA/CA mode. At the same time, the node keeps adjusting its strategy to the variable game state. In addition, the authors propose a simplified game-theoretic MAC protocol (G-CSMA/CA) by designing an auto degressive backoff mechanism based on the incompletely cooperative game. G-CSMA/CA can easily be implemented in mesh nodes. Finally, simulation results show that the incompletely cooperative game can increase system throughput, decrease delay, jitter, and packet loss rate, and support the game effectively.     

Video transmission strategy in multi-rate and multi-node IEEE 802.11 networks

The video transmission strategy VQCW (video queue contention window) was proposed for video transmission fair problem in multi-rate and multi-node IEEE 802.11 networks.The strategy was based on node queue selective packet drop and contention window dynamic adjustment.It deduced a maximum throughput model according to initial contention window size because of the relation between throughput and initial contention window size.This model can provide theoretical upper limit for improving throughput.The theoretical modeling and NS simulation show that the proposed strategy can maintain both video transmission quality and high network overall throughput.     

Novel Adaptive DCF Protocol Using the Computationally-Efficient Optimization with the Feedback Network Information for Wireless Local-Area Networks

In this paper, we design a novel computationallyefficient linear programming (LP) algorithm to maximize the throughput with respect to the minimum contention window size for the IEEE 802.11 Distributed Coordination Function (DCF) protocol. Based on our LP scheme, a new DCF protocol which can select the best access mode and the optimal size of the minimum contention window is proposed by considering the channel condition and the number of competing stations jointly. The numerical results demonstrate that our proposed DCF protocol significantly outperforms the conventional method.     

Incomplete cooperation‐based service differentiation in WLANs

In the IEEE 802.11 wireless LAN (WLAN), the fundamental medium access control (MAC) mechanism—distributed coordination function (DCF), only supports best‐effort service, and is unaware of the quality‐of‐service (QoS). IEEE 802.11e enhanced distributed channel access (EDCA) supports service differentiation by differentiating contention parameters. This may introduce the problem of non‐cooperative service differentiation. Hence, an incompletely cooperative EDCA (IC‐EDCA) is proposed in this paper to solve the problem. In IC‐EDCA, each node that is cooperative a priori adjusts its contention parameters (e.g., the contention window (CW)) adaptively to the estimated system state (e.g., the number of competing nodes of each service priority). To implement IC‐EDCA in current WLAN nodes, a frame‐analytic estimation algorithm is presented. Moreover, an analytical model is proposed to analyze the performance of IC‐EDCA under saturation cases. Extensive simulations are also carried out to compare the performances of DCF, EDCA, incompletely cooperative game, and IC‐EDCA, and to evaluate the accuracy of the proposed performance model. The simulation results show that IC‐EDCA performs better than DCF, EDCA, and incompletely cooperative game in terms of system throughput or QoS, and that the proposed analytical model is valid. Copyright © 2010 John Wiley & Sons, Ltd.     

有限负载下802.11 DCF的性能分析及优化

利用三维马尔可夫链和M/G/1/K队列建立了有限负载下DCF机制的性能模型,分析了终端数量、传输负载、二进制指数回退机制及MAC层有限队列对系统性能的影响.基于该模型,推导了有限负载下最大化吞吐量的最优最小竞争窗口的闭式解.仿真结果表明,模型能够有效地预测有限负载下DCF的性能,根据传输负载调整最小竞争窗口大小能够获得最大化吞吐量.     

An energy-efficient MAC protocol based on IEEE 802.11 in wireless ad hoc networks

Energy efficiency is a measure of the performance of IEEE 802.11 wireless multihop ad hoc networks. The IEEE 802.11 standard, currently used in wireless multihop ad hoc networks, wastes bandwidth capacity and energy resources because of many collisions. Therefore, controlling the contention window size at a given node will increase not only the operating life of the battery but also the overall system capacity. It is essential to develop effective backoff schemes for saving power in IEEE 802.11 wireless multihop ad hoc networks. In this paper, we propose an energy-efficient backoff scheme and evaluate its performance in an ad hoc network. Our contention window mechanism devised by us grants a node access to a channel on the basis of the node’s percentage of residual energy. We use both an analytical model and simulation experiments to evaluate the effective performance of our scheme in an ad hoc network. Our extensive ns-2-based simulation results have shown that the proposed scheme provides excellent performance in terms of energy goodput, end-to-end goodput, and packet delivery ratio, as well as the end-to-end delay.     

Energy adaptive MAC protocol for IEEE 802.15.7 with energy harvesting

The medium access control (MAC) protocol for indoor visible light communication (VLC) with energy harvesting is explored in this paper. The unfairness of throughput exists among devices due to the significant difference of their energy harvesting rates which changes with distance, acceptance angle and the obstruction probability. We propose an energy harvesting model, a new obstruction probability model and an energy adaptive contention algorithm to overcome the unfairness problem. This device can adjust its contention window according to the energy harvesting rate. As a result, the device with lower energy harvesting rate can get shorter contention window to improve its transmission opportunity. Simulation results show that our MAC protocol can achieve a higher degree of fairness.     

A successive transmission medium access scheme with dynamic contention window for VLC system with saturated traffic

The visible light communication (VLC) network is usually relatively small scale and can provide high-data-rate information transmission, where multiple users get access to the network according to the carrier sense multiple access with collision avoidance (CSMA/CA) mechanism specified by IEEE 802.15.7 standard. In this paper, we propose a novel dynamic contention window with successive transmission (DCW-ST) scheme to improve the performance of this channel access mechanism and to achieve better network throughput without delay performance degradation. Specifically, we propose to adjust the contention window dynamically to adapt to the time-changing network size. Further, we derive the contention window size to achieve trade-off of throughput and delay, and the minimum contention window size required for the throughput enhancement. In addition, in order to further improve the delay performance, we present a successive transmission scheme that allows the nodes which have completed one transmission successfully to get the chance of transmitting information successively according to the network condition. Simulations are performed for the VLC system in saturated traffic and compared with the theoretical performances, which demonstrate that our proposed scheme outperforms the legacy CSMA/CA of IEEE 802.15.7.