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.     

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

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

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

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

基于TDMA的分布式全双工链路调度算法研究

为了解决无线Ad hoc网络在负载较重时网络性能差等问题,提出了一种将TDMA（Time Division Media Access）与CCFD（Co-time Co-frequency Full Duplex）相结合的分布式全双工MAC（Media Access Control）协议.数据传输前节点首先在链路共存准则的基础上进行抑制检查,随后主链路按一定的优先级筛选二级链路并发起调度请求,调度所需的四次握手过程在业务时隙头部完成.本协议在不影响传统TDMA半双工通信的条件下,增加同一时隙中可以共存的链路数,改善网络的吞吐量和时延性能.     

Reduced‐frame TDMA protocols for wireless sensor networks

Time‐division multiple‐access (TDMA) is a common medium access control paradigm in wireless sensor networks. However, in its traditional form, the TDMA‐based protocols suffer from low channel utilization and high message delay because of a long frame length needed to provide collision‐free transmissions, which is particularly damaging in dense wireless sensor networks. In this paper, we investigate the performance and the energy efficiency of a class of TDMA‐based protocols, called reduced‐frame TDMA, where every TDMA slot is augmented with a short time period dedicated for carrier sense multiple access‐based contention resolution mechanism. Because of their ability to dynamically resolve collisions caused by conflicting slot assignments, the reduced‐frame TDMA protocols can be configured with any frame length, independently of node density. In addition, we present a distributed heuristic slot assignment algorithm that minimizes interslot interference in the presence of limited number of slots per frame. The simulation results indicate that the reduced‐frame TDMA protocols significantly reduce the message delay and increase the maximum throughput without incurring significant penalty in energy efficiency compared with the traditional TDMA scheme. Copyright © 2012 John Wiley & Sons, Ltd.     

System Capacity and Access Control for Multimedia TDMA/SS Networks

In this paper, we study the system capacity and access control for the TDMA/SS (time division multiple access with spread spectrum) cellular networks supporting multimedia services. In the TDMA/SS system, time is divided into frames and each frame is further divided into slots. Only one user is allowed to transmit in a slot and spread spectrum technique is adopted to combat inter-cell interference. A packet can occupy more than one slot, depending on the user's data rate and quality of service requirement. We derive a necessary and sufficient condition for a group of users to be admissible for the TDMA/SS system and prove that its admission region contains that of the TDMA/CDMA system. In the TDMA/CDMA system, time is also divided into frames and each frame consists of several slots. The difference is that every packet occupies exactly one slot and multiple users can transmit their packets in the same slot. Numerical results show that the admission region of the TDMA/SS system can be significantly larger than that of the TDMA/CDMA system. To further increase bandwidth utilization and guarnatee delay bound requirements, several access control schemes are proposed. Simulation results are obtained for these access control schemes.     

Bandwidth‐guaranteed QoS routing of multiple parallel paths in CDMA/TDMA ad hoc wireless networks

This paper investigates the issues of QoS routing in CDMA/TDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request between two nodes will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a new scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement of the call and the delays of these paths are within the required bound of the call. We also propose three strategies by which to choose a set of paths as the route, namely, shortest path first (SPF), largest bandwidth first (LBF), and largest hop‐bandwidth first (LHBF). Extensive simulations have been conducted to evaluate the performance of the three strategies in comparison with a traditional single path routing algorithm. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy. Copyright © 2005 John Wiley & Sons, Ltd.     

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%。     

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

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

Bandwidth guaranteed call admission in TDMA/CDMA ad hoc wireless networks

This paper first studied the timeslot assignment problem in time division multiple access/code division multiple access (TDMA/CDMA) wireless ad hoc networks. Given a path P, we prove that a timeslot assignment providing one unit of bandwidth on P can be found in O(P) time if such an assignment exists. The results have been extended to the case that P can provide two units of bandwidth. Based on the timeslot assignment for the special cases, an efficient slot assignment algorithm with O(P²k) is proposed for general cases, where k is the number of slots in a TDMA frame. Then, the timeslot assignment algorithm is integrated into a quality of service (QoS) call admission scheme for QoS call requests. Extensive simulations are conducted and the results have demonstrated the superior performance of our method.     

Multifold node authentication in mobile ad hoc networks

An ad hoc network is a collection of nodes that do not need to rely on a predefined infrastructure to keep the network connected. Nodes communicate amongst each other using wireless radios and operate by following a peer‐to‐peer network model. In this article, we propose a multifold node authentication approach for protecting mobile ad hoc networks. The security requirements for protecting data link and network layers are identified and the design criteria for creating secure ad hoc networks using multiple authentication protocols are analysed. Such protocols, which are based on zero‐knowledge and challenge‐response techniques, are presented through proofs and simulation results. Copyright © 2007 John Wiley & Sons, Ltd.     

Hybrid Dynamic Channel Assignment in Clustered Wireless Multihop CDMA/TDMA Ad Hoc Networks

A good channel assignment scheme in a multihop ad hoc network should not only guarantee successful data transmissions without collisions, but also enhance the channel spatial reuse to maximize the system throughput. It becomes very inefficient to use fixed channel assignment when the network size grows. Therefore, spatial reuse of channels become more important in a large multihop ad hoc network. In this paper, we consider an ad hoc network with an overlaid CDMA/TDMA structure. We divide each code into time slots to form the channels. A dynamic channel assignment (DCA) strategy called Hybrid-DCA is proposed in a clustered ad hoc network. This DCA strategy is designed to make the best use of available channels by taking advantage of the spatial reuse concept. In Hybrid-DCA, the increase in spatial reuse is achieved by adding certain control overhead. We show that the bandwidth saving due to channel spatial reuse is higher than the additional bandwidth spent on the control overhead.     

一种基于CDMA/TDMA混合多址的GSM与CDMA扩容方法

提出了一种基于CDMA/TDMA混合多址的GSM与CDMA扩容方法。在发送端,通过扩频码对GSM信号进行直接序列扩频,使其多址方式由TDMA变换为CDMA/TDMA,然后与CDMA信号在空间同频传输,这样就可以解决两个系统在Um接口的兼容问题;在接收端,使用相同的扩频码对CDMA/TDMA信号进行解扩,使其多址方式由CDMA/TDMA还原为TDMA,由此可以将GSM与CDMA两种信号进行分离。文章提出了用互补码集作为多址接入码,并给出了一个时隙内GSM用户被扩频调制的具体过程。理论分析和仿真结果表明,该方法可使系统总容量扩大2倍。     

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

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

HSG‐ad hoc network: A novel hierarchical star graph ad hoc network with self‐organization and routing discovery free

In ad hoc wireless networks, most data are delivered by multi‐hop routing (hop by hop). This approach may cause long delay and a high routing overhead regardless of which routing protocol is used. To mitigate this inherent characteristic, this work presents a novel ad hoc network structure that adopts dual‐card‐mode, self‐organization with specific IP naming and channel assignment to form a hierarchical star graph ad hoc network (HSG‐ad hoc). This network not only expedites data transmission but also eliminates the route discovery procedure during data transmission. Therefore, the overall network reliability and stability are significantly improved. Simulation results show that the proposed approach achieves substantial improvements over DSDV, AODV, and DSR in terms of average end‐to‐end delay, throughput, and packet delivery ratio. Copyright © 2009 John Wiley & Sons, Ltd.     

Fair TDMA scheduling in wireless multihop networks

In wireless multihop networks, communication between two end-nodes is carried out by hopping over multiple wireless links. However, the fact that each node has to transmit not only its own traffic, but also traffic on behalf of other nodes, leads to unfairness among the communication rates of the nodes. Traditional Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) based media access control does not work satisfactory in a multihop scenario, since an intended target of a communication may be subject to mutual interference imposed by concurrent transmissions from nodes, which cannot directly sense each other, thus causing unfair throughput allocation. Although Time Division Multiple Access (TDMA) seems to be a more promising solution, careful transmission scheduling is needed in order to achieve error-free communication and fairness. Several algorithms may be found in the literature for scheduling TDMA transmissions in wireless multihop networks. Their main goal is to determine the optimal scheduling, in order to increase the capacity and reduce the delay for a given network topology, though they do not consider the traffic requirements of the active flows of the multihop network or fairness issues. In this paper, we propose a joint TDMA scheduling/load balancing algorithm, called Load-Balanced-Fair Flow Vector Scheduling Algorithm (LB-FFVSA). This algorithm schedules the transmissions in a fair manner, in terms of throughput per connection, taking into account the communication requirements of the active flows of the network. Simulation results show that the proposed algorithm achieves improved performance compared to other solutions, not only in terms of fairness, but also in terms of throughput. Moreover, it was proved that when a load balancing technique is used, the performance of the scheduling algorithm is further improved.     

Novel Assignment Strategies for Spatial Reuse TDMA in Wireless Ad hoc Networks

Spatial reuse TDMA has been proposed as an access scheme for multi-hop radio networks where real-time service guarantees are important. The idea is to increase capacity by letting several radio terminals use the same time slot when possible. A time slot can be shared when the radio units are geographically separated such that small interference is obtained. In reuse scheduling, there are several alternative assignment methods. Traditionally, transmission rights are given to nodes or to links, i.e., transmitter/receiver pairs. We present a comparison of these two approaches and show that both have undesirable properties in certain cases, e.g. link assignment gives a higher delay for low traffic loads but can achieve much higher throughput than node assignment. Furthermore, we propose a novel assignment strategy, achieving the advantages of both methods. Simulation results show that the proposed method can achieve the throughput of link assignment for high traffic loads as well as the lower delay characteristics of node assignment for low traffic loads.     

Low‐jitter slot assignment algorithm for deadline‐aware packet transmission in wireless video surveillance sensor networks

This work presents a distributed time‐slot assignment algorithm which adopts TDMA as Medium Access Control, specially suited to support applications with strict delay, jitter, and throughput requirements characterized by convergecast traffic pattern in sensor networks. (e.g. wireless video surveillance sensor networks). The proposed algorithm has three characteristics: (1) every node is guaranteed a path to the base station for its data delivery. In the path, sufficient resource is reserved and weighted fairness can be achieved. (2) It uses cascading time‐slot assignment and jitter minimization algorithm in each node to minimize jitter and end‐to‐end delay. (3) Nodes are only active during their scheduled slots and sleep otherwise. This offers energy saving by reducing idle listening and avoiding overhearing. The performance of the proposed algorithm is evaluated over simulations and analyzed theoretically in comparison with existing slot assignment algorithm. The results show that our algorithm provides lower end‐to‐end delay, jitter, and higher throughput. Copyright © 2010 John Wiley & Sons, Ltd.     

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网络.     

High transmission power increases the capacity of ad hoc wireless networks

In this paper, the effect of transmission power on the throughput capacity of finite ad hoc wireless networks, considering a scheduling-based medium access control (MAC) protocol such as time division multiple access (TDMA) and an interference model that is based on the received signal-to-interference-plus-noise ratio (SINR) levels, is analyzed and investigated. The authors prove that independent of nodal distribution and traffic pattern, the capacity of an ad hoc wireless network is maximized by properly increasing the nodal transmission power. Under the special case of their analysis that the maximum transmission power can be arbitrarily large, the authors prove that the fully connected topology (i.e., the topology under which every node can directly communicate with every other node in the network) is always an optimum topology, independent of nodal distribution and traffic pattern. The present result stands in sharp contrast with previous results that appeared in the literature for networks with random nodal distribution and traffic pattern, which suggest that the use of minimal common transmission power that maintains connectivity in the network maximizes the throughput capacity. A linear programming (LP) formulation for obtaining the exact solution to the optimization problem, which yields the throughput capacity of finite ad hoc wireless networks given a nodal transmit power vector, is also derived. The authors' LP-based performance evaluation results confirm the distinct capacity improvement that can be attained under their recommended approach, as well as identify the magnitude of capacity upgrade that can be realized for networks with random and uniform topologies and traffic patterns.