分布式TDMA网络的时隙设计技术

时隙分配是分布式TDMA组网的一个基础性工作,直接影响到Adhoc网络的性能。为支持低延迟数据业务,通常选择TDMA组网技术,但常规的固定时隙TDMA网络对时隙的利用率较低。提出了一种基于跳频的固定时隙分配和动态时隙分配相结合的TDMA时隙资源管理技术,有效地解决了TDMA网络的不同类型用户信息传输时隙分配问题。     

一种改进的动态TDMA时隙分配算法研究

针对移动自组织网络(Mobile Ad-Hoc Networks,MANET)对多节点场景的需求,在基于时分多址(Time Division Multiple Access,TDMA)固定时隙分配的基础上提出了一种改进的动态TDMA时隙分配算法。该算法根据节点数目的改变,通过针对不同的节点等级动态调整时隙分配策略,提高传输效率。对2种算法进行了对比仿真,仿真结果表明,改进的动态TDMA时隙分配算法更能适应节点数目不断变化的场景。     

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

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

一种固定分配与动态竞争结合的MAC层协议算法

为提升移动自组织(MANET)网络效率,动态时分多址(TDMA)时隙分配算法已经成为MANET网络的研究热点之一。提出了一种新颖的固定分配与动态竞争结合的媒体访问控制(MAC)层协议算法。该算法能在保证基本话音通信需求的基础上,根据不同业务特点动态调整时隙,保证网络对空闲时隙资源竞争使用的效率。仿真结果表明,相对于固定分配时隙算法,该算法大幅度提高了MANET网络的效率。     

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

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

单兵作战系统中信息监听冲突消除技术研究

针对当前单兵作战系统通信网络中所采用的固定分配TDMA算法不能适应大型战场环境和自组织运行需求的问题,提出一种基于消费算法和二叉树时隙分配算法的动态时隙分配TDMA算法,即C-TDMA算法,通过多组载波监听消除接入冲突,在保证延时的基础上使用消费算法控制节点分组发送量,提高信道接入公平性,同时通过二叉树时隙分配算法支持网络分布式运行。仿真结果表明,对于负载较重、传输混合业务且时延敏感的单兵作战系统网络,该算法可以消除接入冲突,提高信道吞吐率。     

基于动态优先级表的TDMA时隙分配

Ad Hoc网络组网效率提升的一个重要方面就是研究高效的时隙分配算法,动态TDMA时隙分配机制已经成为提高组网效率的一个热门研究点。这里基于动态优先级表提出一种新颖的动态时隙分配算法,该算法能在时间维上保证各节点对空闲时隙资源竞争使用的公平性。仿真结果表明基于动态优先级表的时隙分配算法能高效利用时隙资源,提高信道利用率。     

一种基于优先级的TDMA时隙接入算法

文章为TDMA时隙动态调整提供一种基于优先级的随机统一多址接入算法,通过用户的平台类型、用户的活动因子和新入网以及已经在网的用户,考虑用户的优先级和平台类型的优先级实现时隙的动态调整和时隙复用,解决了TDMA网络的不同类型用户信息传输时隙分配问题。     

战术无线网网络管理方法研究

针对战术无线通信网的具体特点和工作环境,给出了一种有中心控制的TDMA端到端战术无线通信网络结构,给出TDMA动态分配方案并分析了动态时隙分配机制,建立了时隙资源分配模型,给出了一种时隙分配算法--需求线路序贯处理法,以解决网络节点在动态变化下可靠通信的关键问题.     

TDMA时隙分配对业务时延性能的影响分析

 在TDMA通信系统中,时隙分配是影响业务时延性能的重要因素,包括时隙数量分配(带宽分配)、时隙分配周期(TDMA帧长)和时隙位置分配三方面.本文针对可变速率和固定速率两类业务,基于随机服务系统理论和交通流理论建立了业务时延模型,得到了平均时延的解析式,分析了时隙数量、时隙位置和TDMA帧长度对业务时延影响的规律和特点.结果表明时隙位置分配越均匀,越能改善业务的平均时延和时延抖动性能;而在传统的时隙连续分配方式下,增加时隙数量分配对时延性能提高非常有限.在DVB-RCS卫星系统等具有较长帧设计的TDMA系统中,采用时隙均匀分配方式能够有效提高业务时延性能.计算机仿真验证了建模分析的正确性.     

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.     

一种新的无线传感网络的时隙分配策略

时隙分配是时分多址(TDMA)接入的核心。TMDA将时间划分为若干个固定时隙,使2个干扰的节点在不同时隙内传输数据,进而降低接入碰撞率。为此,提出基于分布式TDMA的时隙分配算法。该算法以Drand算法为基础,对其进行改进。利用路由信息分配时隙,降低通信时延和传输的消息数。仿真结果表明,与Drand算法相比,提出的算法传输时延降低了约8%,传输的消息数约下降了24%。     

CT-TDMA：水下传感器网络高效TDMA协议

针对水下无线传感器网络(UWSN,underwater sensor networks)提出以发送端为中心以连续时间为计量单位的冲突状态模型——局部冲突状态图及其分布式构建算法,并在此基础上设计了基于启发式规则的水下传感器网络TDMA协议(CT-TDMA,continuous time based TDMA)。CT-TDMA利用UWSN中同一接收节点与不同发送节点之间链路时延的差异性,减少在目的端的接收帧之间的空闲时间,从而提高网络流量;基于启发式规则的分配算法,能有效缩短连续时间轴上的时刻分配所花费的时间。模拟实验证明:CT-TDMA与以ST-MAC为代表的按时隙分配的TDMA方案相比,网络流量提高了20%,数据分组的端到端时延降低了18%;与由全局知识所计算出的最优分配策略相比,网络流量达到了80%,端到端时延仅延长了12%。     

多服务多用户OFDM系统资源分配算法

提出了一种正交频分复用（OFDM）系统的多服务多用户资源分配算法。与传统多用户OFDM系统资源分配算法只考虑一种类型的服务不同,提出的算法同时考虑了数据业务和语音业务,分析了两种业务不同的资源分配需求,对语音业务采用了时分多址（TDMA）的方式,并且加入了对每种数据业务最低传输速率的要求。仿真结果表明,新算法能够在满足语音用户固定传输容量的基础上,提升数据用户总的传输容量,同时保证每一个数据用户的最低传输容量的要求。     

QoS-aware TDMA for end-to-end traffic scheduling in ad hoc networks

The proliferation of low-cost broadband air interfaces has paved the way to the introduction of high-definition multimedia services in mobile and wireless networks. The cost for network resources utilization, when provisioning such services, will play a prominent role in their commercial success, since the more spare resources that can be used, the more cheaply the services can be delivered to the end users. In the context of promoting the role of ad hoc networks as service platforms for high quality multimedia applications, this article first discusses and classifies a set of issues involved in quality of service (QoS) provisioning in ad hoc networks and then presents a congestion-free TDMA algorithm for end-to-end network resources assignment via an optimized mechanism that relies on capacity requests and grants. The article also illustrates a method for invoking this algorithm to achieve efficient end-to-end QoS provisioning and concludes by showing the superiority of the proposed algorithm, as compared to other recently proposed TDMA scheduling algorithms     

TDMA卫星通信系统中一种话音业务统计复用算法

本文提出了一种用于计算统计复用ＴＤＭＡ卫星通信系统中话音业务应申请时隙数的算法，给出了计算公式，并进行了分析、计算和模拟。结果证明，采用这种时隙计算算法可在用户能接受的信元丢失概率下，达到比传统ＴＤＭＡ／ＤＡ方案高许多的时隙利用率，同时具有差不多的时延性能。     

Analysis of a contention resolution multiple-access algorithm for handling mixed traffic on wireless networks

Existing wireless standards, like DECT and GSM, are based on TDMA. Packet multiple-access algorithms perform statistical multiplexing, leading to greater efficiency than basic TDMA which assigns a fixed amount of channel resources to each user. Moreover, these methods permit one to handle in a more flexible way different kinds of information. Most of the proposed packet access methods, applied to radio networks, are based on slotted ALOHA algorithms. We propose a methodology for applying packet contention resolution multiple-access techniques to wireless networks. The proposed techniques are able to handle the access of mixed traffic types. We define and analyze a multiple-access algorithm for handling the access of a mixed set of users, including a group of speech users and a population of users that generate a random traffic approximated by a stream of Poisson.     

Soft output interference suppression in TDMA wireless communications

We present a novel symbol-by-symbol Bayesian multiuser detector for cochannel interference cancellation in TDMA cellular communications. To begin with, we present the usual composite signal model consisting of the desired signal, interferer, channel parameters and channel noise. Then, we derive the soft output interference cancellation algorithm (SICA) to compute fixed-lag maximum a posteriori (MAP) estimates of the data symbols of the desired user, using a fixed lookahead of D observations. In the process, the interferer symbols are treated as nuisance parameters and averaged out. The complexity of the SICA is exponential in the length of the combined channel at the receiver. Subsequently, we present a simple, yet effective, technique for complexity reduction without significant performance degradation. We apply the algorithm to some typical scenarios, using the IS-136 TDMA standard, to demonstrate its interference suppression capabilities. In this paper, we assume that all relevant channel parameters are known. Hence, our results should be viewed as representing the best possible performance that can be obtained with the SICA in the scenarios considered. This revised version was published online in July 2006 with corrections to the Cover Date.