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

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

动态TDMA接入协议仿真分析

时分多址(Time Division Multiple Access,TDMA)接入是一种按时间片来划分每个节点信息发送时机的接入方式,在节点数目固定不变的情况下,可以达到较好的传输效率。提出一种基于微时隙的动态TDMA接入控制方式,动态更改各节点拥有的时隙数量,适应拓扑变化和提高系统整体性能。利用OPNET仿真工具对TDMA和动态TDMA协议进行仿真,分析仿真结果,对2种协议进行比较。     

TC2-MAC:一种无线传感器网络自适应混合 MAC 协议

摘 要：提出了一种新的自适应混合MAC协议TC2-MAC。该协议采用了基于二叉树结构的时隙块分配策略和基于时隙约束的CSMA/CA竞争接入方式,能够为不同传感器节点或不同类型业务的差异性QoS需求提供良好支持,并能够通过灵活的信息调度机制改善信道接入公平性,提高网络效率。理论分析和仿真结果表明：与传统基于TDMA机制的MAC协议相比,TC2-MAC对网络业务流量及拓扑结构的变化均具有更好的自适应性。     

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

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

移动自组网中联合优化设计的MAC/路由协议

文章针对节点数量多、密度大的一类移动自组网提出了一种跨层联合设计的MAC/路由协议.在MAC层上采用基于调度的信道分配算法以减少通信冲突,在网络层上结合使用表驱动路由和基于地理位置的路由来提高协议适应动态拓扑的能力,并设计了适合TDMA MAC协议的高效的消息交互机制.在OPNET仿真平台上与AODV/802.11和G...     

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

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

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

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

MIMO链路Ad Hoc网络中线程化的拓扑未知多址接入协议

针对MIMO链路Ad Hoc网络,提出了支持MIMO的线程化拓扑未知多址接入协议(MIMO-T-TTMA).MIMO-T-TTMA将时间扩展多址接入(TSMA)协议和时分多址接入(TDMA)协议以时间交替的方式相结合,进而为网络中节点分配时隙.在MIMO-T-TTMA中,每个节点被分配了若干时隙,每个分配时隙中,节点通过交互请求发送/允许发送(RTS/CTS)分组来确定发送使用的数据流数,而当RTS/CTS交互失败或者当前时隙为未分配时隙时,节点仍依一定的概率发送一个数据流,以提高网络的吞吐量.为了评估协议的性能,推导了MIMO-T-TTMA的吞吐量.数值结果表明,与已有的协议相比,MIMO-T-TTMA在节点度较大时具有较高的吞吐量,并且,吞吐量随节点度的变化比较平稳,因此,MIMO-T-TTMA适用于拓扑常发生剧烈变化的Ad Hoc网络.     

一种改进的Ad hoc网络中动态TDMA时隙分配方法

无线自组织网络(Ad hoc)是一种不依赖基础设施的网络,网络中的节点均是有移动主机构成.文中提出了一种改进的TDMA时隙分配方法,根据网络拓扑结构及带宽需求,本方法可以动态的改变帧长和发送机制,而且允许发送者预约邻居节点中未分配的时隙,仿真结果表明此协议优于USAP及802.11协议.     

认知无线传感网在规则拓扑中的媒体接入调度方法

针对多种规则拓扑结构,探讨基于TDMA和认知无线电的媒体接入调度策略;为Square、Hexagon和Triangle结构设计时隙和信道组合选择算法,并分析比较了对应的开销和吞吐量,指出Square结构具有最佳的传输性能;基于OMNet++平台下面向Square结构的仿真实验,指出Square中的4时隙调度方法提供最佳的传输性能,且较小的时隙长度有益于提升吞吐量.     

Virtual time-slot allocation scheme for throughput enhancement in a millimeter-wave multi-Gbps WPAN system

This paper proposes a virtual time-slot allocation (VTSA) scheme for throughput enhancement to realize a multi-Gbps time division multiple access (TDMA) wireless personal area network (WPAN) system in a realistic millimeter-wave residential multipath environment. TDMA system without time-slot-reuse mechanism conventionally allocates one TDMA time-slot to only one communication link at a time. In the proposed VTSA scheme, taking advantage on the large path loss in the millimeterwave band, a single TDMA time-slot can be reallocated and reused by multiple communication links simultaneously (hence the name virtual), thus significantly increasing system throughput. On the other hand, allowing multiple communication links to occupy the same time-slot causes the generation of co-channel interference (CCI). The cross layer VTSA scheme is therefore designed to be able to maximize the throughput improvement by adaptively scheduling the sharing of time-slots, and at the same time monitor the potential performance degradation due to CCI. As a result, it is found that the VTSA scheme is capable of improving system throughput as much as 30% in both AWGN and multipath channels (line-of-sight (LOS) and non-line-of-sight (NLOS) environment). Additionally, by coupling with higher-order modulation schemes, the system is able to achieve up to a maximum throughput of 3.8 Gbps. It is also observed that higher-order modulations although have higher maximum achievable throughput in low CCI environment, the tolerance against increasing CCI is considerably lower than that of the lower-order modulations.     

Design of a medium access control feedback mechanism for cellularTDMA packet data systems

Cellular packet data systems require medium access control (MAC) protocols that allow flexible resource allocation on both the uplink and the downlink. The overhead introduced for managing MAC functions should be minimized, and control fields should be well protected in order to provide robustness to channel errors. The IS-136 TDMA digital control channel specifies shared channel feedback (SCF) procedures and fields for managing uplink resources. However, the SCF mechanism is not well suited to long packet data transactions. We describe a simple and robust packet channel feedback (PCF) mechanism for an IS-136 based TDMA packet data channel by identifying the minimal set of functions and fields required to manage both contention access and reserved access. The proposed scheme has unambiguous state transitions and better performance under error conditions. The PCF scheme provides considerable flexibility in assigning bandwidth to multiple users, and allows the efficient scheduling of contention and reservation opportunities on each subchannel without wasted slots     

A Five-Phase Reservation Protocol (FPRP) for Mobile Ad Hoc Networks

A new single channel, time division multiple access (TDMA)-based broadcast scheduling protocol, termed the Five-Phase Reservation Protocol (FPRP), is presented for mobile ad hoc networks. The protocol jointly and simultaneously performs the tasks of channel access and node broadcast scheduling. The protocol allows nodes to make reservations within TDMA broadcast schedules. It employs a contention-based mechanism with which nodes compete with each other to acquire TDMA slots. The FPRP is free of the hidden terminal problem, and is designed such that reservations can be made quickly and efficiently with negligible probability of conflict. It is fully-distributed and parallel (a reservation is made through a localized conversation between nodes in a 2-hop neighborhood), and is thus scalable. A multihop ALOHA policy is developed to support the FPRP. This policy uses a multihop, pseudo-Bayesian algorithm to calculate contention probabilities and enable faster convergence of the reservation procedure. The performance of the protocol, measured in terms of scheduling quality, scheduling overhead and robustness in the presence of nodal mobility, has been studied via simulations. The results showed that the protocol works very well in all three aspects. Some future work and applications are also discussed.     

Access protocol performance for on-board processing business satellite systems

This paper presents protocols for use in efficient accessing of multi-service business satellite systems. A new reservation TDMA scheme with free slots contention is proposed as being particularly suitable. The new access protocol is simulated using a numerical Petri-net model and results are given for variations in numbers of earth-stations, traffic mixes, balanced-to-unbalanced traffic, reservation scheme and free slots contention. Finally an analytical derivation is presented for the protocol performance which agrees well with simulation.     

Ku-Band satellite data networks using very small aperture terminals—part I: Multi-access protocols

This two-part paper presents a comprehensive overview on the technology of very small aperture terminal (VSAT)-based satellite data networks, which have received increasing attention in recent years because of a combination of technical and economic factors. Ku-band networks with customer-premise earth-stations can overcome the inherent local access bottleneck in wide-area terrestrial data networks by suitably exploiting the unique multi-access and broadcast features of satellite communication. In this part of the paper, the issue of multiple access, which is an important critical path technology in the ongoing evolution of VSAT data networks, is considered in detail. Satellite multi-access protocols are classified in terms of channel synchronization (slotted and unslotted) and the qualitative nature of message access (fixed assigned, contention and reservation). In addition to well known techniques such as ALOHA, slotted ALOHA, tree CRA, packet CDMA and demand assigned (DAMA) TDMA, a number of new approaches to efficient unslotted access, including selective reject (SREJ) ALOHA, time-of-arrival CRA and locally synchronous reservation, are discussed. The general review is followed by a detailed performance comparison of a number of candidate first-generation VSAT protocols, namely ALOHA, slotted ALOHA, SREJ-ALOHA, DAMA with TDMA reservation access and DAMA with slotted ALOHA reservation access. The performance evaluation, based on detailed simulations with VSAT equipment and transaction traffic parameters, is summarized by curves of average delay and throughput vs. number of VSATs per channel for each of the protocols considered. Higher-order differences in delay performance are illustrated with appropriate delay distribution results and the sensitivity of performance with respect to key equipment and traffic parameters is investigated. For the transaction traffic model under consideration, the results suggest the use of SREJ-ALOHA among contention techniques or DAMA with slotted ALOHA reservation among controlled access alternatives. The trade-off between contention and reservation access is shown to be more complex, depending on the combination of average delay, peak delay, transmission cost and equipment complexity suited to the particular application. In Part II

1 To published in the next issue

of this paper on Ku-band VSAT networks, the issue of overall system design is considered.     

A hexagonal-tree TDMA-based QoS multicasting protocol for wireless mobile ad hoc networks

The mobile multimedia applications have recently generated much interest in wireless ad hoc networks with supporting the quality-of-service (QoS) communications. The QoS metric considered in this work is the reserved bandwidth, i.e., the time slot reservation. We approach this problem by assuming a common channel shared by all hosts under a TDMA (Time Division Multiple Access) channel model. In this paper, we propose a new TDMA-based QoS multicast routing protocol, namely hexagonal-tree QoS multicast protocol, for a wireless mobile ad hoc network. Existing QoS routing solutions have addressed this problem by assuming a stronger multi-antenna model or a less-strong CDMA-over-TDMA channel model. While more practical and less costly, using a TDMA model needs to face the challenge of radio interference problems. The simpler TDMA model offers the power-saving nature. In this paper, we propose a new multicast tree structure, namely a hexagonal-tree, to serve as the QoS multicasting tree, where the MAC sub-layer adopts the TDMA channel model. In this work, both the hidden-terminal and exposed-terminal problems are taken into consideration to possibly exploit the time-slot reuse capability. The hexagonal-based scheme offers a higher success rate for constructing the QoS multicast tree due to the use of the hexagonal-tree. A hexagonal-tree is a tree whose sub-path is a hexagonal-path. A hexagonal-path is a special two-path structure. This greatly improves the success rate by means of multi-path routing. Performance analysis results are discussed to demonstrate the achievement of efficient QoS multicasting.     

A Dynamic Adaptation Mechanism for Traffic Conditions in Wireless Sensor Network

As overall network traffic pursue to expand, a lot of low-power medium access control protocols have been proposed to deal with burst traffic in wireless sensor network. Although most of them provide low throughput but do not well optimize the energy consumption. In this paper, we propose a new hybrid carrier sense multiple access with collision avoidance (CSMA/CA) and time division multiple access (TDMA) protocol that arranges nodes into two categories of priority according to their traffic rate and data transmission delay. Nodes that have continuous data should send its data during the contention free period, those one will be classified as low priority and its data will be scheduling using TDMA. Others nodes who have a random data should transmit it immediately during the contention access period (CAP) using a fuzzy logic algorithm, based on their queue length and implemented in the CSMA/CA algorithm. Therefore, the proposed scheme dynamically changes the CAP length to ensure that nodes can complete its transaction during the same super-frame. Simulation results are done using the network simulator tools (NS-2) and have improved good efficiency regarding the IEEE 802.15.4 standard. The mechanism has improved the energy consumption, minimised the packet loss probability, increased the throughput variation in the network and also minimised the average end to end delay.     

Contention-free distributed dynamic reservation MAC protocol withdeterministic scheduling (C-FD3R MAC) for wireless ATMnetworks

This paper proposes a novel MAC protocol for wireless ATM networks, which is characterized by a contention-free mechanism of the reservation request and a deterministic nature of mobile-assisted (distributed) uplink scheduling under a framework of the dynamic reservation TDMA, as discussed in the current standardization activities of ETSI Project BRAN (broadband radio access network) and the wireless ATM working group in the ATM Forum. The design objective of the proposed MAC protocol is to guarantee the real-time constraint of the real-time VBR (rt-VBR) traffic class while maximizing the multiplexing gain among all ATM traffic classes, especially with a fixed length frame. The proposed deterministic scheduling scheme for the rt-VBR traffic class lends itself to implementing the minimal configuration of control data units for reservation request as desired under the limited wireless resources. Simulation experiments using statistically multiplexed MPEG-2 video streams are performed for a 25 Mbits/s wireless ATM access link scenario. It has been shown that the proposed framework guarantees the delay constraint of rt-VBR sessions along with its cell loss rate significantly reduced, while improving the average delay performance of the nrt-VBR in the range of 10%-30% without compromising the channel utilization as compared to the DSA++ system     

A hybrid contention-based TDMA technique for data transmissions

A hybrid contention-based time-division multiaccess (TDMA) protocol is proposed and studied. Channel time is organized into frames, each consisting of reservation, fixed, and variable subframes. Users are divided into groups. Each group is given a data slot in the fixed subframe that is open to users in that group on the basis of contention. Each user can also place his demand in the reservation subframe. The number of slots assigned to a particular user is based on the information gathered from the other two subframes. Performance analyses, both transient and steady-state, are successfully carried out. Computer simulations verify the analyses     

A Space-Division Multiple-Access Protocol for Spot-Beam Antenna and Satellite-Switched Communication Network

This paper identifies the characteristics of a point-topoint demand-assignment satellite-switched spot-beam antenna communication network for integrated data voice traffic. The described protocol is known as space-division multiple-access (SDMA) which uses an on-board central traffic controller, a fixed-assignment timedivision multiple-access (TDMA) protocol for reservations, and a rigid frame structure with separate data and voice subframes. Message and circuit switching are utilized for data and voice traffic, respectively. Synchronization is maintained by a looped-back reservation burst. A detailed delay analysis of data and voice traffic is presented for an arbitrary compound arrival process. A new method for the calculation of the data reservation and scheduling delays is derived. A comparison of the performance of the SDMA protocol to other protocols is shown. This paper demonstrates the feasibility and illustrates the design of the SDMA protocol.