EASA：一种分簇Ad Hoc网络高效自适应TDMA时隙分配算法

 提出一种适合于分簇Ad Hoc网络的高效自适应TDMA时隙分配算法EASA. EASA采用动态调整帧长以及根据簇内节点MAC层缓存队列长度进行自适应的时隙分配,解决了传统TDMA时隙分配算法中低传输速率节点占用不必要时隙的问题. 多个场景的实验结果表明,与传统TDMA时隙分配算法以及802.11相比,EASA可以大大提高网络吞吐量,很好的提高网络整体性能.     

动态TDMA时隙分配算法在数据链中的仿真

固定TDMA分配算法能够保证节点数据发送的公平性,但不可能针对当前业务和网络状态进行时隙预留分配,很难实现差别服务和提供支持QoS（服务质量）的机制。因此提出一种适用于TTNT（战术瞄准网络技术）数据链通信系统的动态TDMA时隙分配算法,在高负载的网络环境下,这种算法加入了优先级机制并根据业务量轻重对各节点采取不同的发送策略,对时隙有较高利用率,提高了Ad Hoc（自组织网）网络系统吞吐量。在OPNET网络仿真平台上进行了仿真验证,仿真结果表明该算法在吞吐量和时延方面都优于固定TDMA算法。     

一种基于公平接入的按需动态TDMA协议

针对移动自组织网络(MANET)动态时分多址接入(TDMA)协议的公平性问题,提出了一种基于公平接入的按需动态TDMA协议。节点以一定概率对业务时隙发起申请,根据邻居节点的回复完成时隙占用,通过感知业务量对占用的业务时隙数量进行动态调整。节点获取时隙资源的能力与节点编号以及时隙申请的先后顺序无关。对时隙申请概率以及一个时帧周期内的业务时隙个数进行了分析,给出了最优的参数选择。仿真结果表明相较于其它动态TDMA协议,该协议可以在保证网络吞吐量的同时提高节点接入信道的公平性。     

VANET中利用空闲TDMA时隙协助发送数据的方法

车载自组网中的分布式TDMA方法没有利用节点的空闲TDMA时隙,未能充分利用无线信道资源,基于此,提出了一种利用空闲TDMA时隙的MAC层数据重发方法,当节点发送数据失败时,附近节点利用空闲的TDMA时隙重新发送传输失败的数据。理论分析和仿真结果表明,所提方法显著提高了分布式TDMA方法的数据发送成功概率和网络吞吐量。此外,通过仿真比较所提方法与IEEE802.11p的性能,结果表明,由于以确定的方式访问信道,所提方法能够及时稳定地传输车载自组网中的实时安全信息。     

太赫兹无线个域网公平高效的MAC层优化机制

针对太赫兹无线个域网双信道媒体访问控制(Medium Access Control, MAC)协议中存在的信道资源分配公平性差、数据帧重传效率低和控制开销较高的问题,提出了一种公平高效的MAC层优化机制。新机制采用基于历史时隙申请信息的信道资源分配策略优化时隙分配公平性,根据信道质量自适应选择数据帧重传机制,控制节点从申请时隙的节点发送的控制帧中的“duration”字段提取时隙申请信息,省略时隙申请帧的发送,从而降低数据帧排队时延和控制开销,提高吞吐量。仿真结果表明,与TAB-MAC和MDP-MAC协议的机制相比,所提机制的数据帧平均排队时延降低了15%,吞吐量提高了5%。     

基于电力传输线的新型物联网络TDMA/CSMA协议研究

基于电力传输线路的下一代物联网络,通信信息发生碰撞不可避免,因而提出了一种CSMA多址协议的改进型方案,TDMA/CSMA混合协议,并运用马尔可夫链定性定量地分析了各个因素对网络性能的影响.实验结果证明该方案有效地提高了信道的传输速率和系统的吞吐量,结果显示节点间发送冲突的概率大为减少.     

无线Ad Hoc网络中基于活跃节点数预测的时隙ALOHA算法

针对采用时隙ALOHA算法的无线Ad Hoc网络,考虑数据包到达的动态性与数据包传输的随机性,以最大化吞吐量为目标,同时满足数据队列稳定性,构建了关于接纳控制与竞争接入的随机优化问题。由于在时隙ALOHA算法中数据包传输的最优概率取决于无线Ad Hoc网络中数据队列非空的活跃节点数,提出了一种基于活跃节点数预测的时隙ALOHA算法。该算法要求无线Ad Hoc网络中的所有发送节点实时地侦听通信信道的忙闲状态,计算基于信道状态的活跃节点数条件期望,从而动态地预测无线Ad Hoc网络在不同时刻的活跃节点数,达到网络节点依据局部网络状态信息自适应地优化数据包传输概率的目的。仿真结果表明,所提算法能够有效估计无线Ad Hoc网络在每个时隙的活跃节点数,从而显著提升网络吞吐量并且降低数据包的平均排队时延。     

新型无线紫外光协作通信网络性能分析与研究

为进一步提高无线紫外光通信网络的信息传输质量和网络性能,提出了一种新型无线紫外光协作通信网络,网络中各节点采用解码转发方式,设定各节点优先级,从而实现了网络节点实时转发的协作策略。仿真分析了有无缓存设置和有无协作条件下无线紫外光通信网络的归一化吞吐量、各节点平均时延等性能。仿真结果表明：无缓存设置时,随着数据帧传输成功率的增加,高优先级节点一直有较高的归一化吞吐量,而低优先级节点数据帧丢失,归一化吞吐量下降;有缓存设置时,随着缓存的增加,各节点归一化吞吐量均有所增加;与无协作相比,有协作的紫外光通信网络具有更高的节点归一化吞吐量和平均时延。     

一种简单的适合无线Mesh网络的机会协作MAC机制

针对IEEE802．11MAC（medium access control）协议中通信模式的缺陷,提出了一种新的协作MAC机制。该机制重点研究了分布式中继节点的选择算法,并定义了一种新的控制帧（retran）。目的节点通过发送retran帧启动协作机制,收到该帧的节点根据中继选择算法设置自身定时器,从而竞争产生“机会中继”,使其在源节点与目的节点之间搭建通信桥梁,该方法简单可行。仿真表明,随着网络中节点数的增加,新的机制对网络吞吐量和误比特性能的改善效果明显,从而提高了通信质量。     

一种基于固定TDMA的无冲突动态时隙分配算法

本文提出了一种适用于Adhoc网络的动态时隙分配TDMA算法——IP-TDMA算法,该算法以一种新颖的方式在固定TDMA的基础上叠加了优先级竞争机制,既有最差性能保障,又有较高信道利用率。通过采用一种特殊的帧结构,P-TDMA算法还可以避免信令分组的碰撞,是一种有效而又可靠的广播动态时隙分配TDMA算法。仿真结果表明,无论在吞吐量还是迟延方面,P-TDMA算法都比固定TDMA表现出更好的性能。     

一种改进的数据链协作MAC协议

针对基于TDMA（时分多址）的数据链网络协议在恶劣环境下时延大、业务突发性强等缺点,提出了一种改进的数据链协作MAC协议。在原有的协议中引入协作通信的思想,节点根据协作机制,利用自身时隙进行协作转发,并进一步加入中继优先权因子改进协作机制,中继节点根据节点的繁忙程度与信道条件来判定是否协作传输。通过对网络时延性能的研究与仿真,结果表明,改进后的协作协议性能优于传统的数据链协议。     

Optimal frame pattern design for a TDMA mobile communication systemusing a simulated annealing algorithm

Different relative positions of voice and data slots within the frame of a TDMA (time-division multiple access) mobile communication system may result in different system data throughput. The design of the optimal relative position, namely the frame pattern which can achieve maximum data throughput, is described. This design method can be formulated as solving a combinatorial optimization problem. Generally, the global optimal solution of such a problem is hard to find using conventional methods, which may be computationally intractable. A reliable and effective method called a simulated annealing algorithm is applied to obtaining the global optimum. Numerical results reveal that there exist various optimal frame patterns for different ranges of traffic load and the optimal frame pattern can achieve great throughput improvement over a random frame pattern     

多跳Ad hoc网络中支持MIMO的拓扑未知预约时分多址接入协议

该文提出适合多跳Ad hoc网络的支持MIMO的拓扑未知预约时分多址接入协议。通过预约,每个节点在其分配的无冲突时隙并行发送最大数据流,并以一定概率利用其分配时隙中的冲突时隙和未分配时隙中的空闲时隙而发送一部分数据流。该协议不需知道全网拓扑结构,便于实现和分布式应用。通过理论分析推导出最小通过率及最佳帧长。结果表明该协议具有对网络拓扑的稳定性。     

Cooperative quadrature physical layer network coding in wireless relay networks

This paper proposes a cooperative quadrature physical layer network coding (CQPNC) scheme for a dual‐hop cooperative relay network, which consists of two source nodes, one relay node and one destination node. All nodes in the network have one antenna, and the two source nodes transmit their signals modulated with quadrature carriers. In this paper, a cooperative quadrature physical layer network coded decode‐and‐forward (DF) relay protocol (CQPNC‐DF) is proposed to transmit the composite information from the two source nodes via the relay node to the destination node simultaneously to reduce the number of time slots required for a transmission. The proposed CQPNC‐DF relay protocol is compared with time‐division multiple‐access amplify‐and‐forward (TDMA‐AF), TDMA‐DF, cooperative network coded DF (CNC‐DF) and cooperative analog network coded AF (CANC‐AF) relay protocols to demonstrate its effectiveness in terms of bit error rate (BER) and system throughput under different propagation conditions. The simulation results reveal that the proposed CQPNC‐DF relay protocol can significantly improve the network performance. Compared with two TDMA schemes and CNC‐DF, the proposal can provide up to 100% and 50% throughput gains, respectively. Moreover, no matter what the scene, the proposed scheme always has the lowest BER in the low SNR region. Copyright © 2013 John Wiley & Sons, Ltd.     

多跳Ad Hoc网络中支持MIMO的分布式拓扑未知时分多址接入协议的研究与分析

针对Ad Hoc网络和MIMO的有效结合,提出了适于多跳Ad Hoc网络的支持MIMO的分布式拓扑未知时分多址接入协议.该协议通过有限域无线网络设计算法在每帧给每个节点分配时隙且无需知道全网拓扑信息,这极大地减小了收集全网拓扑信息的开销.通过预约,每个节点在其分配的无干扰时隙并行发送MIMO链路的所有数据流,并在与其他节点共享的时隙发送MIMO链路的一部份数据流来解决传输冲突.同时推导出保证通过率和最佳帧长.结果显示动态分配MIMO的传输容量和抗干扰能力会极大地提高通过率.     

Performance evaluation of a satellite-switched variable-frame TDMA system

In satellite-switched time-division multiple access (SS/TDMA) systems, the demand assignment control is a suitable scheme for the bursty packets to enhance the capacity efficiency. In the system, by applying the demand assignment scheme, the minimum transmission time could be achieved by the efficient time slot assignment algorithm. According to a given traffic matrix, the minimum transmission time cannot exceed the fixed TDMA frame duration. The spare time may be left at the end of the TDMA frame as the growth space for the future needs. To increase the system efficiency, the spare time could be reduced. In this paper, a demand assignment protocol with a variable frame is proposed for the system. The Markov chain model is applied to analyze the system performance on throughput, balking probability and packet delay. Performance comparison with the previous presented protocol, the proposed protocol could show a simple control technique and the efficient performance results in the system. It is a suitable candidate to be employed in the satellite networks to provide communication between the satellite and earth stations.     

Analysis and determination of cooperative MAC strategies from throughput perspectives

In recent years, cooperative communication has been developed as a new communication strategy that incorporates a relay node to assist direct point-to-point transmission. By exploiting cooperative diversity, different types of techniques have been proposed to improve transmission reliability from the physical layer perspective. However, owing to the longer transmission time resulting from the cooperative schemes, there is no guarantee to enhance network throughput in view of the medium access control (MAC) performance. In this paper, system throughput of combined direct/cooperative communication is evaluated by exploiting the proposed analytical model based on the IEEE 802.11 MAC protocol. The feasibility of adopting either cooperative or direct communication is also studied in the analytical model. In terms of network throughput, whether to adopt cooperative schemes depends on the tradeoff between cooperative transmission delay and channel quality of direct communication. Moreover, two cooperative MAC protocols are proposed to determine the circumstances to activate cooperative communication according to the channel quality. The full-channel quality indicator based cooperative (FCC) MAC protocol is introduced to choose both the transmission scheme and the relay node according to the full channel quality information. However, the overhead caused by the FCC scheme can degrade the throughput performance as the number of available relays is significantly increased. Therefore, the bitwise competition based cooperative (BCC) MAC protocol is utilized to efficiently determine a feasible relay node for data transmission. Simulations are performed to validate the effectiveness of proposed analytical models and cooperative MAC protocols. It is observed that the proposed BCC scheme can outperform both the FCC protocol and conventional direct transmission with enhanced system throughput.     

Relay with deflection routing for effective throughput improvement in Gbps millimeter-wave WPAN systems

In this paper, we propose a deflection routing scheme that improves effective throughput (defined as the successfully transmitted bits over the duration between two available sequential time slots) of millimeter-wave wireless personal area network (mmWave WPAN) systems. The upcoming mmWave WPAN is based on dynamic time division multiple access (TDMA) and designed to guarantee Gbps-order transmission capability for high definition TV (HDTV) transmission, high speed wireless docking and gaming, etc. The decode-and-forward (DF) type of relay offers a simple solution to the issues of mmWave WPAN systems, such as limited coverage range and unexpected blockage. However, due to the required extra time, DF relay on the other hand decreases the effective throughput, and may not be sufficient to satisfy the requirement of the above data-rate-greedy applications. Inspired by the fact that the significant path loss of a millimeter-wave environment can provide good space isolation, we propose a deflection routing scheme to improve the effective throughput by sharing time slots for direct path with relay path. Based on the sub-exhaustive search, a routing algorithm, named as best fit deflection routing (BFDR), has been developed to find the relay path with the least interference that maximizes the system throughput. To reduce the computational complexity of the BFDR, we have also developed a sub-optimal algorithm named as random fit deflection routing (RFDR). The RFDR algorithm finds the sub-optimized relay path, where the interference may not be the least but is sufficiently low to guarantee the concurrent transmissions. Computer simulations show that, in realistic 60 GHz environments, the effective system throughput can be improved up to 28% under grid topology and 35% under random topology. RFDR achieves almost the same order of throughput improvement with only 10% of the computational complexity of BFDR.