适于无线多媒体传感器网络的MAC层退避算法

提出了服务区分动态退避算法--SDDB算法,通过对优先级不同的业务采用不同的退避方式,能在不显著降低网络吞吐量的同时,实现合理退避及业务优先级区分服务,有效避免二次冲突,支持突发业务流传输,保障优先级高的业务的实时传输要求,更适合多种业务并存的无线多媒体传感器网络.     

MAC协议冲突概率自适应退避算法的研究与实现

针对退避策略在无线传感器网络介质访问控制(MAC)协议中的作用与要求,分析了典型的无线传感器网络MAC((S-MAC)协议的退避机制,提出网络冲突概率自适应退避算法.并用NS2对其进行了性能仿真测试,仿真结果表明,在网络节点分布较为密集、突发数据流量变化较大的网络环境中,改进后的方案在能量效率和吞吐量方面都有较大的改善.     

基于移动性感知的无线传感器网络GTS自适应分配策略

为解决移动无线传感器网络中节点连通性较弱的问题,提出一种包含不同移动性节点的无线传感器网络提升移动节点连通性的保障时隙(GTS, guaranteed time slot)分配策略.首先,采用Kalman滤波预测模型得到用户下一阶段位置;接下来,引入一种考虑速度、方向和相对移动性的节点移动程度界定方法,并在此基础上进行GTS预约优先级的初步确定;随后,根据移动节点对所预约时隙的使用反馈情况自适应调整预约优先级;最后,根据节点的优先级决定GTS时隙的使用顺序及额外预留时隙的使用权.仿真结果显示,提出的分配策略在具有不同移动性节点的网络中,能够提高移动节点接入的成功率,保证较低的分组平均传输时延及较高的分组投递率.此外,采用基于反馈机制的自适应预约优先级调整策略能够显著增加整个网络中已分配时隙的正确使用率.     

基于自适应随机线性网络编码的优先级调度方案

该文针对无线多播网络中基于随机线性网络编码(RLNC)调度方案计算复杂度高,且网络传输性能易受反馈信息影响等问题,提出一种基于自适应RLNC的优先级调度方案(PSARLNC)。该方案结合视频流的特征采用适应多播的RLNC,相较于传统RLNC计算复杂度降低。经过初始传输后,在后续数据恢复阶段,综合考虑数据包剩余传输时隙,选取目的节点增益最大传输方式,最大化数据传输。同时,各中继节点根据接收情况,构建各自解码概率值,并以此为依据确定调度优先级并完成转发,自适应调整各节点传输,有效减少对反馈信息的依赖。仿真结果表明该方案与完全反馈方案性能十分接近,且在减小计算复杂度和降低对反馈信息依赖同时保证了较好的性能。     

基于IPv6的WSN边界路由器设计

针对无线传感器网络与IPv6网络互联,在分析现有接入方式不足的基础上设计了一种基于IPv6的无线传感器网络边界路由器。主要阐述了边界路由器的硬件和软件实现,重点介绍了基于IPv6的无线传感器网络协议栈适配层的设计。通过数据包分片与重组机制以及报头压缩机制,协议栈适配层实现了IPv6数据包在IEEE 802.15.4链路中的传输。实验结果表明,该设计方案实现了无线传感器网络与IPv6网络的无缝融合,数据传输稳定可靠,具有应用价值。     

基于网络编码的多径路由策略

针对无线传感器网络节点能量受限制的特点,提出基于网络编码的多径路由策略.该策略在数据传输过程当中通过增加跨层协作机制,减少对单个数据包的依赖,降低数据包重传次数,使得网络带宽得到优化,同时数据在传输路径中进行随机编码使得数据包安全传输.分析表明,该策略可以保证数据传输的有效性和安全性.     

一种时分接入高速可靠无线传感器网络协议

针对无线传感器网络数据采集系统中的提升数据吞吐能力、传输可靠性,文章提出了一种基于数据包协调的时分媒体接入协议,vaTDMA。通过节点间小体积数据包交互,分配节点信道接入时机。规避传统TDMA中传输时隙的必要冗余,并将其集中于采样周期的尾端,增加了数据包传输机会;通过重传算法提高传输可靠性。实验结果表明,文章提出的无线传感器网络通讯协议的有效性。     

面向混合业务的无线传感器网络能量有效接入策略

研究了在实时业务和非实时业务同时存在的混合背景下,非实时业务的无线传感器节点自适应侦听和睡眠的动态接入机制。网络节点处于睡眠状态时所需的能量很低,节约了无线传感器网络节点的平均能量消耗;但是,过长的睡眠时间可能使得网络节点错失传输机会。因此,根据信道的使用情况,合理地设定无线传感器网络节点的睡眠时间,能够在网络能量消耗和传输效率之间进行调整,从而最大化无线传感器网络的能量传输效率。首先,利用连续时间 Markov 方法对问题进行建模,并利用基于摄动分析理论对系统模型进行分析,获得求解无线传感器网络能量效率最大化的最优睡眠时间梯度算法。最后通过理论结果和计算机仿真模拟的对比,验证了推荐方法的可行性。     

一种无线传感网络代码分发协议的研究

无线传感器网络的分发协议用于更新节点程序和发送控制指令,目前普遍采用的分发协议存在传输数据量和能耗过大的问题.为此提出一种无线传感网络代码传播与维护的自调整算法,并通过设计分发协议测试系统进行算法性能测试.实验结果表明该算法能有效调节网络中数据包的传输速度,减少数据包传输量,降低能量损耗.     

海水养殖监测系统无线传感器网络协议研究

文中将无线传感器网络应用于海水养殖监测系统,根据海上养殖监测的特点,提出了一种适合海水养殖的无线传感器网络协议。该协议采用最小跳数异步分簇路由算法构建无线传感器网络,协调簇内能量平衡。对于正常数据和异常数据,采用自适应的数据传送机制进行数据传输,降低数据传输量,实现网络能量优化。仿真结果表明,在异常数据率较小的情况下,自适应的数据传输中节点产生的平均数据量和平均冗余数据量比普通的事件驱动型数据传输要小很多,降低了能耗,提高了传输效率。在信道传输质量较差的情况下,自适应的数据传送机制的传输效率更具优势。     

确保无线AdHoc网络服务质量的MAC协议研究

本文针对无线局域网中MAC层Qos支持技术进行了研究，在分析了现有的EDCF退避机制的静态参数设置方法的基础上，提出结合网络负载状况动态调节不同优先级业务的竞争窗口和退避时间，改变不同优先级业务的信道接入方式的方法。仿真结果表明，动态调节法相较于静态参数法在网络吞吐量、时延、碰撞率方面都有更好的表现。     

CSMA/CA‐based medium access control for indoor millimeter wave networks

Millimeter wave (mmWave) communication is a promising technology to support high‐rate (e.g., multi‐Gbps) multimedia applications because of its large available bandwidth. Multipacket reception is one of the important capabilities of mmWave networks to capture a few packets simultaneously. This capability has the potential to improve medium access control layer performance. Because of the severe propagation loss in mmWave band, traditional backoff mechanisms in carrier sensing multiple access/collision avoidance (CSMA/CA) designed for narrowband systems can result not only in unfairness but also in significant throughput reduction. This paper proposes a novel backoff mechanism in CSMA/CA by giving a higher transmission probability to the node with a transmission failure than that with a transmission success, aiming to improve the system throughput. The transmission probability is adjusted by changing the contention window size according to the congestion status of each node and the whole network. The analysis demonstrates the effectiveness of the proposed backoff mechanism on reducing transmission collisions and increasing network throughput. Extensive simulations show that the proposed backoff mechanism can efficiently utilize network resources and significantly improve the network performance on system throughput and fairness. Copyright © 2014 John Wiley & Sons, Ltd.     

A Cross-Layer Routing Scheme Using Adaptive Retransmission Strategy for Wireless Mesh Networks

In this paper, we develop a link quality-based adaptive adjustment mechanism of the MAC maximum retransmission count to reduce collision probability of wireless Mesh networks. Based on statistics acquired in the link layer and the retransmission strategy, a multi-metric cross-layer on-demand routing scheme is proposed for wireless Mesh networks. The proposed scheme uses information such as available link bandwidth, node residual load rate and transmission efficiency of a path adequately to cross-layer routing. The network layer can adaptively select an optimal path to deliver packets based on the acquired statistics of the MAC layer. Extensive simulation results demonstrate that the proposed scheme can reduce link failure probability, improve network throughput, and decrease the end-to-end delay effectively.     

Distributed Priority Scheduling and Medium Access in Ad Hoc Networks

Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet scheduling algorithms. However, due to the distributed nature of ad hoc networks, nodes may not be able to determine the next packet that would be transmitted in a (hypothetical) centralized and ideal dynamic priority scheduler. In this paper, we develop two mechanisms for QoS communication in multi-hop wireless networks. First, we devise distributed priority scheduling, a technique that piggybacks the priority tag of a node's head-of-line packet onto handshake and data packets; e.g., RTS/DATA packets in IEEE 802.11. By monitoring transmitted packets, each node maintains a scheduling table which is used to assess the node's priority level relative to other nodes. We then incorporate this scheduling table into existing IEEE 802.11 priority backoff schemes to approximate the idealized schedule. Second, we observe that congestion, link errors, and the random nature of medium access prohibit an exact realization of the ideal schedule. Consequently, we devise a scheduling scheme termed multi-hop coordination so that downstream nodes can increase a packet's relative priority to make up for excessive delays incurred upstream. We next develop a simple analytical model to quantitatively explore these two mechanisms. In the former case, we study the impact of the probability of overhearing another packet's priority index on the scheme's ability to achieve the ideal schedule. In the latter case, we explore the role of multi-hop coordination in increasing the probability that a packet satisfies its end-to-end QoS target. Finally, we perform a set of ns-2 simulations to study the scheme's performance under more realistic conditions.     

Performance of Energy-Efficient Cooperative MAC Protocol with Power Backoff in MANETs

This paper presents an energy-efficient cooperative MAC (EECO-MAC) protocol using power control in mobile ad hoc networks. Cooperative communications improve network performance by taking full advantage of the broadcast nature of wireless channels. The power control technique improves the network lifetime by adjusting the transmission power dynamically. We propose the best partnership selection algorithm, which takes energy consumption into consideration for selection of the optimal cooperative helper to join in the transmission. Through exchanging control packets, the optimal transmission power is allocated for senders to transmit data packets to receivers. In order to enhance energy saving, space–time backoff and time–space backoff algorithms are proposed. Simulation results show that EECO-MAC consumes less energy and prolongs the network lifetime compared to IEEE 802.11 DCF and CoopMAC at the cost of delay. Performance improvement offered by our proposed protocol is apparent in congested networks where nodes have low and limited energy.     

Performance analysis of prioritized parallel transmission MAC protocol in all‐IP wireless WAN

Prioritized parallel transmission MAC (PPTM) protocol is proposed for all‐IP wireless wide area network (WAN). In this paper, we analyse its performance and compare it with modified channel load sensing protocol (MCLSP). We model PPTM as a non‐preemptive priority queueing system and obtain a close form of transmission time delay for each priority class, throughput of the scheme, and number of packets in the queue in the Poisson arrival case. We find that PPTM achieves less transmission time delay than MCLSP does for high priority data. Hence, the overall performance of the system using PPTM is significantly improved. We verify the conclusions with simulation via a simplified all‐IP wireless WAN. Copyright © 2006 John Wiley & Sons, Ltd.     

Enhancing channel utilization by improving media access coordination in wireless local area networks

Distributed coordination function (DCF) is the basis protocol for IEEE 802.11 standard wireless local area networks. It is based on carrier sense multiple access with collision avoidance (CSMA/CA) mechanism. DCF uses backoff process to avoid collisions on the wireless channel. The main drawback with this process is that packets have to spend time in the backoff process which is an additional overhead in their transmission time. The channel is rendered idle when all the stations defer their transmissions due to their backoff process. Therefore, the channel utilization and the total throughput on the channel can be improved by reducing the average time spent by the packets in the backoff process. In this paper, we propose a new media access coordination function called proposed media access protocol (PMAP) that will improve the channel utilization for successful packet transmission and therefore, the total achievable throughput. In addition, we propose an analytical model for PMAP under saturated conditions. We use this model to analyze the performance of PMAP under saturated conditions. To substantiate the effectiveness of our model, we have verified the model by simulating PMAP in NS‐2. Simulation and analytical results show that under saturated conditions, PMAP shows profound improvement in the throughput performance compared to DCF. In addition, the throughput performance of PMAP under unsaturated conditions is presented. We have also presented the delay performance of PMAP and DCF through simulation in both saturated and unsaturated conditions. Simulation results show that the average delay experienced by the packets is less in PMAP compared to DCF. Further, the variance in the packet delay is same for both PMAP and DCF protocols under unsaturated conditions. From the performance results obtained for PMAP under both saturated and unsaturated conditions, it can be concluded that PMAP is superior in performance compared to DCF. Copyright © 2006 John Wiley & Sons, Ltd.     

Queueing analysis for preemptive transmission in underlay CRNs

In cognitive radio applications, there are multiple different types of message queues. Existing queueing based works in underlay cognitive radio networks mainly focused on homogeneous packets. Therefore, we propose a new underlay scheme to deal with packets' heterogeneity by assuming high‐priority packets have preemptive transmission opportunities over low‐priority ones, and the former ones have impatient waiting time. We model the secondary user packets' behavior as a M/M/1+GI queueing system from the perspective of the whole system, which is represented by a two‐dimensional state transition graph. The reneging probability of high‐priority packets and the average waiting time in two‐class priority queues are analyzed. Then we extend the single‐channel model to multiple channels. Under this scenario, the closed form of low‐priority packets' expected system delay is derived. Simulation results demonstrate that the average waiting time of high‐priority packets decreases with the growing interference power threshold and the average waiting time of the low‐priority packet is proportional to the arrival rate of high‐priority packet and so on. This work may lay the foundation to design efficient Medium Access Control protocols and optimize long‐term system performance by carefully choosing system parameters. Copyright © 2015 John Wiley & Sons, Ltd.     

Improving throughput through dynamically tuning contention window size in dense wireless network

With the boom of wireless devices, the number of wireless users under wireless local area networks (WLANs) has increased dramatically. However, the standard backoff mechanism in IEEE 802.11 adopts fixed initial contention window (CW) size without considering changes of network load, which leads to a high collision probability and low channel utilization in bursty arrivals. In this paper, a novel CW dynamic adjustment scheme is proposed to achieve high throughput performance in dense user environment. In the proposed scheme, the initial CW size is dynamically adjusted to optimum according to the measured packet collision probability. Simulation results show that the proposed scheme can significantly improve the throughput performance.     

Packet Delay Metrics for IEEE 802.11 Distributed Coordination Function

In this paper, we introduce a comprehensive packet delay analysis for wireless networks based on IEEE 802.11 Distributed Coordination Function (DCF). We develop mathematical models that calculate a set of packet delay metrics, namely a) the average packet delay for successfully transmitted packets, b) the average packet delay of successfully transmitted packets experiencing a specific number of collisions, c) the average packet drop time, d) the delay jitter and e) the delay distribution by computing the probability of a packet to be successfully transmitted experiencing delay time lower than a given value. All the developed models are based on calculating station’s delay time at the transmission slot(s) plus the average time that station defers at backoff slots before successful transmission. The mathematical models are simple, computationally fast and can be used to build admission control algorithms. Simulation results show that our proposed mathematical analysis is highly accurate.