自适应低轨卫星MAC协议性能分析

针对低轨卫星通信信道碰撞检测能力弱,时延较长和大业务量的特点,提出一种具有接入控制机制的自适应APRMA MAC协议。通过对信道负载和业务优先级判断来确定不同业务的接入概率函数,并且接入概率在每个时隙中通过更新来动态适应系统资源的变化。该MAC协议确保多个终端合理共享有限的无线资源同时,系统能达到高容量。通过仿真对语音业务丢包概率、数据包平均时延和数据业务吞吐量三个衡量协议性能指标与传统协议进行分析对比,证明了APRMA MAC协议显著改善系统性能。     

蓝牙EDR异步数据分组传输性能的研究

分析了蓝牙EDR规范定义的GFSK、π/4-DQPSK与8DPSK调制方式在加性高斯白噪声信道下的位错误率与平均接收信噪比的关系,推导了新增异步数据分组的重传概率与平均接收信噪比的函数表达式。通过分组重传概率与分组的不同特性分析了不同信噪比情况下各类型数据分组的传输性能,包括平均吞吐量、平均重传次数、平均传输时延等。该文是对蓝牙EDR规范新增调制方式与新增分组传输性能进行的研究,其分析结果可以作为其他研究的理论参考。     

Throughput enhancement by exploiting spatial reuse opportunities with smart antenna systems in wireless ad hoc networks

Smart antenna (or multi-beam antenna) systems can support simultaneous transmissions (or receptions) of multiple packets in different beams using the same channel. However, network performance is highly dependent on transmission scheduling. This study develops two transmission-scheduling schemes for use with smart antenna systems to improve network throughput and reduce transmission delay. The proposed scheduling mechanisms, which are designed to minimize the average latency and maximize network throughput, exploit the opportunities for parallel transmissions and consider communication restrictions and packet sizes. The performance results indicate that the proposed schemes outperform previous schemes in network throughput and transmission delay.     

WSN中基于中继选择的DH-MSMR-CARQ时延与吞吐量分析

为提高无线传感器网络（WSN）的时延和吞吐量性能,提出了一种两跳多源多中继协同自动重传请求（DH-MSMR-CARQ）协议。建立最大比合并（MRC）下两种不同中继选择的DH-MSMR-CARQ协议Markov链模型,分别给出状态空间。基于截短,由各自的平均分组差错率和状态转移概率矩阵推导协议的平均传输时延和吞吐量解析表达式。数值模拟结果表明,源节点数、分组长度及最佳中继节点到目的节点的分组差错率是影响平均传输时延的关键因素,采用第一种中继选择方式具有更高的吞吐量。另外,在非极端恶劣信道环境下（源节点到中继节点的分组差错率小于0.8）,DH-MSMR-CARQ协议比可直达的SSSR-CARQ、MSSR-CARQ和MSMR-CARQ协议具有更高的吞吐量。     

一种基于跨层功率控制的Ad hoc网络路由算法*

在无线Ad Hoc网络路由协议中引入功率控制不但可以降低网络能量消耗,同时还能改善网络的吞吐量、投递率等性能,已成为当前Ad Hoc网络的一个研究热点.本文提出了一种基于跨层功率控制的按需路由算法CPC-AODV(Cross-layer Power Control Ad hoc On-demand Distance Vector).算法按需建立多个不同功率级的路由,节点选择到目的节点最小功率级的路由来传递分组,并对网络层的数据分组、路由分组和MAC层控制帧的传输采用不同功率控制策略来降低能量消耗.仿真结果表明:算法有利于降低通信能量开销,延长网络寿命,提高网络投递率及改善网络时延.     

基于丢包统计的蓝牙信道质量估计和自适应分组策略

分析了蓝牙2.0协议的数据传输性能,给出了在不同的信道质量（接收信噪比）下所能达到的平均最大吞吐量,以及根据信道质量自适应选择分组的策略。提出了一种新的利用丢包统计估计信道质量的方法。根据最近发送的一定数目的分组的丢包情况求出这些分组的吞吐量,与已知的分组选择信噪比拐点的平均吞吐量进行比较,从而判断出信道质量所在的区段以及最适合传输的数据分组。从仿真结果来看,当判决所用的数据分组的数目N在30左右时,该方法达到的吞吐量十分接近平均最大吞吐量。该方法的软硬件开销极小,判决过程简单快速,可用于任何主控芯片的蓝牙系统。同时,该方法可在较短时间内（40 ms~180 ms左右）跟踪信道质量的变化,非常适合用于低速运动的蓝牙系统和蓝牙个人区域网。     

Performance study of SRMA multiple access protocols

In this paper we are concerned with packet broadcast networks in which users communicate with the central station. The key problem is multiple access of a shared broadcast channel. The performance of a family of SRMA (split-channel reservation multiple access) protocols for multiple access proposed by Tobagi and Kleinrock (1976) is studied. We analyse the performance of SRMA-RM (request message) and modified SRMA-RAM (request answer message) protocols in terms of the throughput and the average packet delay. Bounds on the throughput are also established for both protocols.     

LTE系统中提高TCP性能的资源调度算法研究

LTE可以提供真正无处不在基于IP的移动宽带业务,但随着承载网的IP化,网络拥塞、丢包、抖动、延时等质量问题将影响到LTE业务层的QoS质量.作为LTE无线资源管理的核心,研究并设计一个良好的资源调度算法是提高数据业务的性能和终端用户的体验是一个亟待解决的重要任务.本文通过借鉴LTE对VoIP数据分组的半持续调度算法的思想,提出了一种LTE的无线资源调度的改进方案.方案将TCP确认包映射到具有更高优先级的空闲逻辑信道,从而降低了ACK包在无线信道中发生丢弃和拥塞的概率,避免了TCP拥塞控制机制的频繁开启.仿真结果表明,本文提出的TCP确认包映射转换方案在RTT时延、吞吐量等方面均有一定的提升,具有一定的稳定性和性能优势.     

DLSOMAC:一个面向分布式无线链路调度技术的MAC协议

无线网络分布式链路调度技术通过发掘无线传输间的复用达到提高吞吐量的目的. 链路调度策略的形成需要节点间公平地交互含有如节点ID、队列长度等信息的短报文,并且这些短报文同步传输,导致信道拥挤.由于存在信道空闲侦听开销,在拥挤信道中频繁后退,以及隐藏终端和暴露终端的问题,传统的CSMA/CA (Carrier sense multiple access with collision avoidance)协议传输性能低下,难以为分布式无线链路调度技术服务. 针对链路调度策略形成期间报文短、信道拥挤以及公平性要求的挑战.提出了一个简单的随机MAC (Media access control)协议DLSOMAC (Distributed link scheduling oriented MAC). DLSOMAC协议没有信道侦听过程,以降低短报文的传输延迟开销;基于分布式息票收集算法,均匀分散传输时刻来降低冲撞概率和提高公平性,以满足分布式链路调度技术对MAC层的需求.用排队论分析了DLSOMAC的报文传输延迟性能.仿真实验表明, 在短报文情况下,无论网络负载轻重与否, DLSOMAC协议的报文传输延迟明显优于CSMA/CA,并且报文越短,性能相对越好.即使在长报文的情况下,当网络负载很重时, DLOSMAC协议也稍优于CSMA/CA协议,适合于为自组织网络的分布式链路调度技术服务.     

Defending against Wormhole Attack in MANET Using an Artificial Immune System

MANETs are mobile networks that are spontaneously deployed over a geographically limited area without requiring any pre-existing infrastructure. Typically, nodes are both autonomous and self-organized without requiring a central administration or a fixed network infrastructure. Due to their distributed nature, MANET is vulnerable to a specific routing misbehavior, called wormhole attack. In a wormhole attack, one malicious node tunnels packets from its location to the other malicious node. Such wormhole attacks result in a false route with fewer hop count. If the source node follows this fake route, malicious nodes have the option of delivering the packets or dropping them. This article aims at removing these attacks. For this purpose, it investigates the use of an Artificial Immune System (AIS) to defend against wormhole attack. The proposed approach learns rapidly how to detect and bypass the wormhole nodes without affecting the overall performance of the network. The proposed approach is evaluated in comparison with other existing solutions in terms of dropped packet count, packet loss ratio, throughput, packet delivery ratio, and end-to-end delay. A simulation result shows that the proposed approach offers better performance than other schemes defending against the wormhole attack.     

Adjusted probabilistic route discovery in mobile ad hoc networks

Conventional on-demand route discovery methods in mobile ad hoc networks (MANET) employ simple flooding method, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This paper proposed two new probabilistic methods that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation analysis reveals that equipping AODV with an appropriate probabilistic route discovery method can result in significant performance improvements in terms of routing overhead, MAC collisions and end-to-end delay while still achieving a good throughput when compared with the traditional AODV.     

Ad hoc网络中Backpressure调度算法延迟性能的改进*

为了成功传输数据包,Backpressure算法需要形成从源节点到目的节点的递减队列差梯度。但是,形成队列差梯度需要一段时间并且所需时间的波动性大,容易导致数据包平均延迟变大。通过分析时间波动性的原因,提出了改进的Backpressure算法(associated with the hops and delay, DH-BP),以解决在Ad hoc网络下有固定路由的Backpressure算法的延迟问题。DH-BP算法用由队列长度、队头延迟、路由跳数决定的计数器值代替队列长度值,来计算链路调度集合,从而实现链路调度。理论上证明了DH-BP算法具有throughput-optimal性能。仿真结果表明,DH-BP算法相比另外两种算法,其延迟性能和总吞吐量都有改善。     

提高蓝牙广播性能的自适应分组选择策略

分析了蓝牙2.0+EDR新规范π/4-DQPSK与8DPSK调制方式在加性高斯白噪声信道(AWGN)下的比特错误率与平均接收信噪比的关系,推导了ACL数据分组的广播重传概率与平均接收信噪比的函数表达式,提出了蓝牙2.0+EDR广播数据分组在加性高斯白噪声信道下的自适应分组选择策略,即通过在不同的信噪比下选择不同的分组类型进行传输以得到最少的广播重传次数和最大的传输吞吐量。仿真结果为在不同信道条件下取得最好的广播效果提供了参考。     

蓝牙散射网的数据传输性能分析

在蓝牙微微网中,主设备决定跳频序列.由于各主设备独立跳频,因此在多个微微网中数据分组会由于跳至同一频隙而产生较高的误包率.文中建立了散射网下数据分组相互干扰的分析模型,在此基础上得出了蓝牙散射网在进行ACL分组传输时的网络吞吐量.针对不同的跳频方式和网络是否全局时隙同步的四种情况对单一类型的分组发送成功率进行了具体的分析,并进一步得出采用混合分组时的网络最大吞吐量,并得出达到最大吞吐量是应当采用的最佳分组及最佳分组的传输延迟.     

An underwater acoustic MAC protocol using reverse opportunistic packet appending

Underwater communication primarily utilizes propagation of acoustic waves in water. Its unique characteristics, including slow propagation speed and low data rates, pose many challenges to Media Access Control (MAC) protocol design. In most existing handshaking-based underwater MAC protocols, only an initiating sender can transmit data packets to its intended receiver after a channel reservation through a Request-to-Send (RTS)/Clear-to-Send (CTS) handshake. This conventional single-node transmission approach is particularly inefficient in underwater environments, as it does not account for long propagation delays. To improve channel utilization in high latency environments, we propose a novel approach that exploits the idle waiting time during a 2-way handshake to set up concurrent transmissions from multiple nodes. The sender can coordinate multiple first-hop neighbors (appenders) to use the current handshake opportunity to transmit (append) their data packets with partially overlapping transmission times. After the sender finishes transmitting its packets to its own receiver, it starts to receive incoming appended packets that arrive in a collision-free packet train. This not only reduces the amount of time spent on control signaling, but it also greatly improves packet exchange efficiency. Based on this idea, we propose an asynchronous, single-channel handshaking-based MAC protocol based on reverse opportunistic packet appending (ROPA). From extensive simulations (single- and multi-hop networks) and comparisons with several existing MAC protocols, including MACA-U, MACA-UPT, BiC-MAC, Slotted-FAMA, DACAP, unslotted Aloha, we show that ROPA significantly increases channel utilization and offers performance gains in throughput and delay while attaining a stable saturation throughput.     

An expert system for real-time traffic management in wireless local area networks

The paper explores delay-based congestion and flow control and the offloading of real-time traffic from wireless local area networks (WLANs) to mobile cellular networks (MCNs) in multihomed devices. The control system developed is based on an embedded hierarchical expert system. It adjusts transceivers’ traffic flow(s) for prevailing network conditions to achieve application-dependent delay and throughput limits. In wireless networks, delay and throughput depend on the packet size, packet transmission interval, and node connection density. Therefore, the controller on the destination node monitors average one-way delay and the change of one-way delay of the incoming traffic. On this basis, it adjusts the packet size and transmission interval of the source node by transmitting a control command to the source. If the prevailing level of traffic in the network exceeds its capacity despite of the control actions taken, devices prepare for developed asynchronous offloading of traffic to another access network.The control model was validated via simulation of Voice over Internet Protocol (VoIP) traffic in the OMNeT++ network simulator. The results demonstrate that the expert system developed is able to regulate packet sizes to match the prevailing application-dependent optimum and transfer traffic to another network if the network exceed its capacity no matter the control actions taken. Although this work is motivated mainly by issues of congestion and flow control of WLAN systems and the simulations and results were prepared for the IEEE 802.11b system, the approach and techniques are not limited to these systems, but they are applicable for other packet switched access networks (PSANs), too.     

基于隐藏终端的时隙802.15.4网络吞吐量研究

为了提高802.15.4网络吞吐量性能,设计了一种改进的节点状态转换过程,提出了一种考虑隐藏终端问题和重传的节点接入信道模型,并对模型进行分析计算。基于计算结果和信道状态模型分析,对考虑隐藏终端问题的数据碰撞概率、丢包率和网络吞吐量进行推导。最后研究了数据包到达率、退避指数和隐藏终端对网络吞吐量性能的影响。实验表明,模型较好地描述了节点接入信道过程,能够对网络吞吐量进行精准的动态分析。实验结果表明,与无重传机制的802.15.4网络相比,网络吞吐量增加了83.9%左右。与部分条件休眠的方法比较,网络吞吐量平均增加了13.3%,提出的模型能够有效提升网络吞吐量性能。     

一种联合多信道分配决策的认知Mesh系统数据传输优化算法

在认知Mesh系统进行数据传输的过程中,为了提高数据包投递成功率及网络的吞吐量,减少网络延迟时间,提出一种联合多信道分配决策的认知Mesh系统数据传输优化算法(JCWN)。针对信道的干扰问题,建立了认知Mesh系统的干扰无向图,分析节点链路的网络干扰电平。在节点的路由请求阶段通过提出基于信道干扰电平的路由指标函数,并通过权重阈值来为节点链路分配干扰较小的信道。在路由选择上,联合多路由算法计算每条路由路径的信道干扰程度,为了保障节点传输数据的成功率而选择干扰程度更小的路由。实验仿真结果表明,在数据包投递成功率上,该算法相比POC算法以及基于RL的算法提高了20%以上,在提高网络吞吐量,减少延迟时间上也表现出了更好地效果。     

A novel minimum delay maximum flow multicast algorithm to construct a multicast tree in wireless mesh networks

The construction of multicast tree within given constraints, such as delay and capacity, is becoming a major problem in many wireless networks, especially wireless mesh networks (WMN). Due to the limited capacity of the wireless node, a multicast call may be dropped if there is no multicast tree formed within the given constraints. In this paper, we propose a new multicast tree construction algorithm which has maximum traffic flow and minimum delay under capacity constraints. The problem of multicast is formulated as a Linear Programming (LP) problem with associated constraints. A cost function (CF) is defined to choose the less loaded route among the available ones. A Minimum Delay Maximum Flow Multicast (MDMF) algorithm is proposed to solve this problem using CF and associated constraints. The performance of the proposed algorithm and CF is evaluated and compared with well-known algorithms with respect to packet delivery fraction, latency, and network throughput. The results obtained show that the proposed algorithm has a lesser number of transmissions for a given CF. Moreover, the proposed algorithm has high throughput, packet delivery fraction and less latency compared to other well-known algorithms in this category.     

A study of the length effect of fiber delay line based on CSMA/CP optical packet switching

This paper proposes a novel MAC (media access control) protocol named CSMA/CP for a metropolitan area network for the next generation Internet, which is an OPS (optical packet switch) network that all-optically and directly transfers IP packets over a WDM (wavelength division multiplexing) ring network. The proposed protocol uses the concepts of CSMA (carrier sense multiple access) and CP (carrier preemption) to all-optically transfer the IP packets of the nodes in the WDM ring networks. This paper studies the length effect of FDL (fiber delay line) in each node to support variable packet transmission, and develops an analytical model to analyze and simulate the packet delay and throughput.