无线传感器网络环境下基于事件 驱动应用的节能TDMA协议

媒质接入控制是无线传感器网络设计的关键问题之一.由于媒质接入控制协议直接控制着节点无线通信模块的活动,而无线通信模块是传感器节点能量消耗的主要来源,因此MAC协议节能效率的好坏将严重影响网络的性能.基于TDMA的MAC协议具有固有的节能特性,即通过合理的TDMA调度避免传输碰撞以及减少节点空闲监听的时间.本文提出了ED-TDMA协议,一种面向事件驱动的传感器网络应用的TDMA协议.该协议根据当前源节点的数目动态地改变TDMA帧的长度,提高了信道利用率;同时采用位图方式的TDMA调度,极大地减少了TDMA调度的开销,节约了能量.此外,通过引入簇内覆盖的思想,使得簇内的活动节点数目为一常数,同时减少了工作节点的数目,从而延长网络的生命周期,并在一定程度上提高了系统的可伸缩性.实验结果显示,ED-TDMA协议更适用于网络负载较低、节点密度高的无线传感器网络.     

多跳无线网中基于空分TDMA的时隙分配策略

空分TDMA（STDMA）是基于TDMA的信道接入协议,该技术被应用于实时性要求较高的多跳（multi-hop）无线网络中,并可使多个在地理位置相互独立的移动终端使用相同的时隙来增加网络容量,不同移动终端之间的数据传输通过对终端调度安排来实现。调度算法一般分为基于节点或基于链路的分配方式。对这两种方式对比发现,在一定条件下两者都有不理想的特性。因此,结合两种方式优点提出了一种新颖的分配策略。仿真结果表明：该分配策略在高业务负载情况下能满足链路分配的高吞吐量,也能达到低业务负载下节点分配的低延迟。     

无线网络中中继协助的媒体接入协议

IEEE 802.11在物理层支持多速率.目前已提出许多机制通过自动调整速率充分利用多速率能力.本文观察到在无线网络中,相对于单跳的低速率链路,多跳高速率的路径可以减少信道占用时间,并提出了中继协助的媒体接入协议(Relay Aided Media Access,RAMA).RAMA利用中继节点将一跳低速链路拆为两跳高速链路.大量仿真结果表明,RAMA能够提供更好的吞吐量和时延性能.     

无线Ad Hoc网络MAC层速率自适应技术研究

目前的IEEE802.11标准虽然在物理层提供了对多速率的支持,但是在MAC（媒体接入控制,Media Access Control）层却没有规定速率自适应的方法。研究了无线Ad Hoc网络（自组织网）中的速率自适应技术,针对RBAR协议存在的不足提出了一种改进的MAC层速率自适应协议,该协议实现简单,与标准的兼容性好,对信道的变化适应能力更强。仿真结果表明,该协议比RBAR协议具有更好的性能。     

一种基于动态TDMA时隙分配的攻击方法研究与实现

基于时分多址（Time Division Multipie Access）的MAC层协议在应用于AdHoc网络时，具有较好的稳定性，但同时也存在一些安全漏洞。文中在已有研究的基础上，进一步分析了TDMA帧结构，提出一种针对TDMA时间帧的攻击方法，并在NS2仿真平台上实现。通过前后网络性能的分析比较，可以看出该攻击效果明显，论证了攻击方法的可行性。论文的最后，我们针对该攻击，对相应的防御机制进行了分析和探讨。     

IEEE802．16协议的研究及系统仿真

基于最新的宽带无线接入协议IEEE802．16，通过计算机仿真平台，实现了工作在TDMA—DAMA／FDD模式的仿真系统，设计了上行链路接入的带宽调度机制来实现动态带宽分配。仿真的结果评估了在具有CBR和VBR两种业务终端的系统环境中，对该带宽调度机制的性能，以及其对系统队列长度、网络时延等各项性能指标的影响。     

基于NOMA的全双工多层异构网下行链路覆盖分析

针对异构网（Heterogeneous Network,HetNet）无线回程,现有研究主要集中于提升网络吞吐量,而对回程覆盖性能研究较少.由此,本文构造了一种在小小区基站（Small cell Base Station,SBS）上结合全双工（Full-Duplex,FD）和非正交多址接入（Non-Orthogonal Multiple Access,NOMA）技术的大规模多输入多输出（Multiple Input Multiple Output,MIMO）辅助多层HetNet模型.利用信干比（Signal-to-Interference Ratio,SIR）来模拟有源SBS的分布,得出不同类型接收端的干扰;然后推导了移动用户（Mobile User,MU）下行链路覆盖概率闭合表达式.仿真和数值结果表明,SBS下行链路覆盖概率会随着小小区下行链路功率共享系数的增加而减小;此外,通过对比NOMA和正交多址接入（Orthogonal Multiple Access,OMA）以及FD和半双工（Half-Duplex,HD）对下行链路覆盖性能的影响,本文提出的方案能显著提升网络性能.     

一种短波数据链的动态TDMA协议

针对短波资源有限、传输速率低的特点,提出了基于短波数据链的动态TDMA协议（HF-DTDMA）,该协议能对短波信道资源进行自适应动态分配,提高信道利用率,满足短波网络业务量实时变化的需求。通过建立短波数据链的仿真场景,分析了动态TDMA协议的性能,并且与固定TD-MA机制的性能进行了对比分析,动态TDMA协议在吞吐量和传输时延上性能明显提升。仿真结果也表明,提出的动态TDMA协议在时效性和吞吐率上能满足短波数据链的设计要求。     

无线传感器MAC层协议的研究

作为信号处理、通信和传感器三项技术结合的产物，无线传感器网络具有许多方面的应用，像在环境保护、领土安全和未来数字化战争等中。近年来对无线传感器的介质访问控制（Media Access Control，MAC）层协议研究也越来越多。在详细介绍了一些典型的协议基础上分析了协议的优缺点，以便无线传感器网络MAC层协议的近一步研究和改进。     

MIMO Ad Hoc网络中基于正交阵列的拓扑未知多址接入协议

针对支持MIMO(Multiple Input Multiple Output)的Ad Hoc网络,提出了基于正交阵列的拓扑未知多址接入协议MIMO_O_TTMA(MIMO Supported Orthogonal Array Based Topology Transparent Multiple Access).协议利用正交阵列为节点分配若干时隙,在每个分配时隙中,节点通过与目的节点交互RTS/CTS(Request To Send/Clear To Send)分组来确定发送的数据流数,以机会地利用MIMO的空间复接来提升网络性能.MIMO_O_TTMA在保证节点在一帧内至少有一个时隙能够无干扰地传输的基础上,允许协议的帧长能在一定的范围内进行灵活选择,从而为协议性能的优化提供了更为有利的条件.为评估MIMO_O_TTMA的性能,利用概率方法分析了协议的吞吐量性能,数值结果表明,与已有拓扑未知MAC(Media Access Control)相比,MIMO_O_TTMA有效提升了网络吞吐量.     

一种高效可靠的无人机自组网多跳TDMA协议

设计无人机自组网媒体接入控制(Medium Access Control,MAC)协议时,需要考虑其控制开销和数据传输的可靠性。鉴于此,结合现有无线自组网多跳时分多址接入(Time Division Multiple Access,TDMA)协议和无人机自组网特点,提出了一种高效可靠的无人机自组网多跳TDMA协议。首先采用高效负载均衡的时隙请求信息上传机制,选择一个负载较小的节点转发节点时隙请求信息;然后根据相互通信的父节点删除重复节点的时隙请求信息,减少相同节点的时隙请求信息转发次数;最后通过实时更新节点时隙请求信息机制,提高节点时隙请求信息传输的可靠性。仿真结果表明,该协议在数据传输成功率、平均时延、控制开销方面优于现有协议,可较好地应用在无人机自组网中。     

Slot allocation strategies for delay sensitive traffic support in asynchronous ad hoc wireless networks

Supporting real‐time traffic in ad hoc wireless networks is considered as a challenging problem. Existing bandwidth reservation mechanisms assume a TDMA environment where achieving time synchronisation is expensive in terms of resources. Heuristics that exist for slot allocation schemes assume a CDMA over TDMA model in order to alleviate the presence of hidden terminals. Slot allocation strategies in the presence of hidden terminals assume significance in a single channel system for supporting delay sensitive traffic. In this paper, we propose three heuristics for the slot allocation process in asynchronou single channel multihop wireless networks in the presence of hidden terminals. The heuristics we propose are the early fit reservation (EFR), minimum bandwidth‐based reservation (MBR) and position‐based hybrid reservation (PHR). The EFR heuristic assigns bandwidth link‐by‐link in the forward path. The MBR heuristic allocates bandwidth to the links in the increasing order of free conn‐slots. The PHR heuristic assigns bandwidth for every link proportional to its position in the path. Simulation studies show that EFR performs better in terms of delay characteristics. MBR provides better call blocking performance at the cost of high end‐to‐end delay. PHR provides a better delay performance compared to MBR and better call blocking performance comparedto EFR. Copyright © 2004 John Wiley & Sons, Ltd.     

FrogSim: distributed graph coloring in wireless ad hoc networks

Graph coloring, which is at the heart of several problems arising in wireless ad hoc networks, concerns the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. This paper deals with the problem of generating valid colorings in a distributed way, while minimizing the number of colors used. Examples of related problems in wireless ad hoc networks are TDMA slot assignment, wakeup scheduling, and data collection. The presented algorithm is inspired by the desynchronization observed in the context of the calling behaviour of male Japanese tree frogs. Experimental results indicate that the proposed algorithm is very competitive with current state-of-the-art approaches.     

Distributed protocols for ad hoc wireless LANs: a learning-automata-based approach

An ad hoc learning-automata-based protocol for wireless LANs, capable of operating efficiently under bursty traffic conditions, is introduced. According to the proposed protocol, the mobile station that is granted permission to transmit is selected by means of learning automata. At each station, the learning automaton takes into account the network feedback information in order to update the choice probability of each mobile station. The proposed protocol is compared via simulation to TDMA and IEEE 802.11 under bursty traffic conditions. Ad hoc learning-automata-based protocol (AHLAP) is shown to exhibit superior performance compared to TDMA in all cases. Compared to IEEE 802.11, the burstier the network traffic, the larger the performance increase of AHLAP. Furthermore, the implementation of AHLAP is more easier than that of IEEE 802.11.     

Rate regulated TDMA system for cochannel interference limited wireless ad hoc networks

The time slotted system with rate regulation, which adapts the transmission rate to the interference for each time slot, is proposed to enhance the throughput while meeting the SINR requirement for cochannel interference limited wireless ad hoc networks. We show that the throughput of the rate regulated TDMA system is larger than that of the rate regulated TDMA/CDMA system. Furthermore, we also propose a scheduling algorithm to maximize the total throughput of the rate regulated TDMA system.     

一种新型的Ad hoc QoS多播路由协议

无线自组织（Ad hoc）网络的应用环境要求其必须提供一定的服务质量（QoS）保证，然而，无线信道固有的特点及节点移动造成网络拓扑的频繁变化，使得在无线Ad hoc网络中支持QoS较困难。可以采用Ad hoc QoS多播（AQM）协议通过事先预约邻居节点以跟踪资源的有效性等措施来解决这一问题。通过考虑传输时延、丢失率、带宽要求、时延抖动、吞吐量等QoS指标，寻找满足特定QoS要求的路由，AQM协议可以明显地改善多播通信的性能。网络仿真结果表明AQM协议基本适合Adhoc网络。     

无线传感器网络中一种动态节能的MAC协议

媒体访问控制(MAC)协议是无线传感器网络的关键协议之一,它对无线传感网络的运行和性能具有重要的影响.针对基于簇的TDMA机制存在问题,文中提出了一个动态节能的DE-MAC协议,该协议能够根据簇成员节点数目和通信负载动态地分配成员节点的时隙,减少节点的空闲侦听时间.仿真结果表明,DE-MAC协议能够有效地提高信道的利用率和网络能量有效性.     

A column generation method for spatial TDMA scheduling in ad hoc networks

An ad hoc network can be set up by a number of units without the need of any permanent infrastructure. Two units establish a communication link if the channel quality is sufficiently high. As not all pairs of units can establish direct links, traffic between two units may have to be relayed through other units. This is known as the multi-hop functionality. In military command and control systems, ad hoc networks are also referred to as multi-hop radio networks.

Spatial TDMA (STDMA) is a scheme for access control in ad hoc networks. STDMA improves TDMA by allowing simultaneous transmission of multiple units. In this paper, we study the optimization problem of STDMA scheduling, where the objective is to find minimum-length schedules. Previous work for this problem has focused on heuristics, whose performance is difficult to analyze when optimal solutions are not known. We develop novel mathematical programming formulations for this problem, and present a column generation solution method. Our numerical experiments show that the method generates a very tight bound to the optimal schedule length, and thereby enables optimal or near-optimal solutions. The column generation method can be used to provide benchmarks when evaluating STDMA scheduling algorithms. In particular, we use the bound obtained in the column generation method to evaluate a simple greedy algorithm that is suitable for distributed implementations.     

基于预测的Ad Hoc路由协议研究

Ad Hoe网中节点的任意运动,导致了大量的重路由操作,从而降低了网络性能。而基于预测的路由协议能够有效地减少网络拓扑结构的变化对于路由操作的影响。文章主要讨论了Ad Hoc网的特点以及目前已经提出的几种节点运动预测方案,同时对基于预测的路由协议进行研究。     

Congestion Control Performance of R-DSDV Protocol in Multihop Wireless Ad Hoc Networks

Ad hoc wireless networks are composed of mobile nodes communicating through wireless links, without any fixed backbone infrastructure. Frequent topology changes due to node mobility make routing in such dynamic networks a challenging problem. Moreover, successful message routing implies every mobile node is potentially capable of acting as a router, thus supporting store-and-forward mechanisms. However, resource limitations on these nodes also require a control on congestion due to message forwarding. In this paper, we consider our recently proposed randomized version of the well-known Destination-Sequenced Distance Vector (DSDV) routing protocol, referred to as R-DSDV, and validate its performance through extensive simulation experiments. Our results demonstrate that a probabilistic control on message traffic based on local tuning of protocol parameters is feasible, and that R-DSDV outperforms the basic DSDV protocol by significantly reducing the average queue size associated with each mobile node and hence the average packet delay.