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

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

基于优先级比较的动态TDMA信道接入技术研究

提出了一种新的基于优先级比较判定的动态TDMA信道接入协议,该协议使用邻节点对竞争节点的优先级进行比较判定,实现了节点对时隙的成功占用和空间复用,提高了信道的使用效率。通过分析比较了动态TDMA、ADAPT两种协议的性能,并使用OPNET软件进行了仿真验证。     

战术局域网TDMA动态优先级轮询调度算法研究

主要针对战术局域网动态时隙分配的优先级轮询调度算法进行了研究。传统的战术局域网集中式轮询算法不能很好地满足节点报文传输的动态时隙需求。为此,文章提出了一种动态时隙分配的优先级轮询调度算法。     

基于移动性感知的无线传感器网络GTS自适应分配策略

为解决移动无线传感器网络中节点连通性较弱的问题,提出一种包含不同移动性节点的无线传感器网络提升移动节点连通性的保障时隙(GTS, guaranteed time slot)分配策略.首先,采用Kalman滤波预测模型得到用户下一阶段位置;接下来,引入一种考虑速度、方向和相对移动性的节点移动程度界定方法,并在此基础上进行GTS预约优先级的初步确定;随后,根据移动节点对所预约时隙的使用反馈情况自适应调整预约优先级;最后,根据节点的优先级决定GTS时隙的使用顺序及额外预留时隙的使用权.仿真结果显示,提出的分配策略在具有不同移动性节点的网络中,能够提高移动节点接入的成功率,保证较低的分组平均传输时延及较高的分组投递率.此外,采用基于反馈机制的自适应预约优先级调整策略能够显著增加整个网络中已分配时隙的正确使用率.     

基于定向天线的移动自组网TDMA协议研究

传统的移动自组网大多采用全向天线组网,为提高传输距离、减少时隙冲突、提高时隙利用率,因此在组网过程中引入定向天线。为解决移动自组网中因引入定向天线带来的时隙冲突问题,论文从研究较为成熟的DTRA协议出发,通过在帧结构中增加随机微时隙的方式来减少时隙冲突。为给网络中各节点提供高效、公平的时隙分配策略,论文改进了DTRA协议中的时隙预留过程,提出了基于节点自身缓存队列数分配不同优先级时隙数目的动态时隙分配算法。通过提出的DTDMA协议与DTRA协议进行的对比仿真,验证了提出的DTDMA协议能够有效减少时隙冲突,且协议在保证高优先级节点可多申请数据时隙的前提下,改善了节点接入信道的公平性。     

基于定向天线的移动自组网TDMA协议研究

传统的移动自组网大多采用全向天线组网,为提高传输距离、减少时隙冲突、提高时隙利用率,因此在组网过程中引入定向天线。为解决移动自组网中因引入定向天线带来的时隙冲突问题,论文从研究较为成熟的DTRA协议出发,通过在帧结构中增加随机微时隙的方式来减少时隙冲突。为给网络中各节点提供高效、公平的时隙分配策略,论文改进了DTRA协议中的时隙预留过程,提出了基于节点自身缓存队列数分配不同优先级时隙数目的动态时隙分配算法。通过提出的DTDMA协议与DTRA协议进行的对比仿真,验证了提出的DTDMA协议能够有效减少时隙冲突,且协议在保证高优先级节点可多申请数据时隙的前提下,改善了节点接入信道的公平性。     

广义数据包到达的时延优化研究

在无线传感网中,Choobkar算法与Dilmaghani算法分析仅适用于在较高优先级节点空时隙时,较低优先级的节点总是有数据包要发送的情况。为此,提出了一种广义数据包到达算法(GPA)的时延分析。算法适用于数据包到达的任何模式,其中包括在较高优先级节点空时隙的情况下,较低优先级的节点可能或可能不具有待发送数据包。通过仿真验证,对比Choobkar算法和Dilmaghani算法,GPA算法的时延分析在整个负载范围内具有较好的准确度。     

EPON支持QoS的动态带宽算法研究

本文给出了一种支持多优先级业务的带宽分配算法。其中高优先级业务固定带宽分配和低优先级业务动态带宽分配,将上行帧分为第一时隙和第二时隙两部分,各ONU高优先级业务在上行第一时隙发送,第二时隙用于低优先级业务,同时采用固定周期的带宽分配方案,因此降低了高优先级业务的时延和时延抖动。通过ONU实行内部调度并且参与上行接入计算,避免了上行复杂的同步问题,提高了链路利用率。     

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

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

基于邻居监测的时隙动态复用算法

提出一种基于邻居信道监测的信道时隙动态复用算法,在保证每个节点获得周期性时隙的同时,可以无冲突地对信道进行空间复用,获得额外的动态时隙资源,提高节点占用的信道带宽和信道资源利用率,提高节点的随遇接入与自适应能力,同时满足周期性信息与突发信息的传输需要。可应用于具有较大节点数量与部署范围的战术通信系统。     

A demand-based slot assignment algorithm for energy-aware reliable data transmission in wireless sensor networks

This paper proposes a new demand-based slot assignment (DSA) algorithm that allocates time slots based on the bandwidth demand of each node in a tree topology. DSA is basically different from SDA, DAS, or WIRES that assigns one large slot for each sensor node, but is similar to the frame-slot pair assignment (FSA) algorithm used in TreeMAC in that it assigns multiple small size slots for sensor nodes per each data collection round. DSA tackles the shortcomings of FSA in terms of the capability of packet aggregation and filtering, the balance of energy consumption, and bandwidth utilization. In general, nodes at lower tree depths process more packets and consume more energy than ones at higher tree depths, and thus the imbalanced energy consumption shortens network lifetime. The proposed algorithm allocates a sequence of receiving slots and then a sequence of sending slots to each node. This approach not only reduces the power consumption of nodes at lower depths significantly by allowing efficient data aggregation and filtering, but also it improves bandwidth utilization by removing wasted slots. In addition, the RTS and CTS messages are used within a slot for ensuring the reliability of data transmission and updating sync time between a child and its parent. Simulation results show that DSA far outperforms FSA in energy consumption and bandwidth utilization.     

Hybrid time slot allocation algorithm based on LoRa Internet of things

To improve the efficiency and stability of data transmission in the long-range (LoRa) Internet of things (IoT),a hybrid time slot allocation algorithm is proposed, which implements a priority mechanism with high-priority nodes sending data in fixed time slots and low-priority nodes using the carrier sense multiple access (CSMA) algorithm to compete for shared time slots to transmit data. To improve network efficiency, a gateway is used to adjust the time slot allocation policy according to network status and balance the number of fixed and shared time slots. And more, a retransmission time slot is added to the time slot allocation algorithm, which redesigns the time frame structure, and adopts a retransmission mechanism to improve communication reliability. Simulation and measurement results show that the packet loss rate and transmission delay of the proposed hybrid algorithm are smaller than those of the fixed slot allocation algorithm, making the proposed algorithm more suitable for LoRa IoT.     

Wireless Adaptive Framed Pseudo-Bayesian Aloha (AFPBA) Algorithm with Priorities

In this paper, we propose a new priority algorithm to control the access to the wireless ATM MAC uplink frame, for multimedia traffic like wireless ATM, similar to the Pseudo-Bayesian algorithm presented in [1]. The adaptive framed Pseudo-Bayesian Aloha (AFPBA) algorithm ensures minimum access delay for high priority traffic classes with small delay degradation to low priority traffic classes. Control packets are transmitted in each slot according to transmission probabilities based on the history of the channel and in contention with other packets of the same priority class. The number of contention slots assigned for each priority class, on a given frame, changes adaptively according to its priority index and the estimated arrival rate on each frame using an adaptive slot assignment mechanism. Finally, the throughput analysis of the algorithm is presented and the delay performance is evaluated by simulation on a wireless channel in the presence of shadowing, Rayleigh fading and capture. Results show that the wireless channel offers significant delay improvements to all priority packets, especially in the presence of fast fading.     

TDMA scheduling algorithms for wireless sensor networks

Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is activated at least once. This is based on the assumption that there are many independent point-to-point flows in the network. In sensor networks however often data are transferred from the sensor nodes to a few central data collectors. The scheduling problem is therefore to determine the smallest length conflict-free assignment of slots during which the packets generated at each node reach their destination. The conflicting node transmissions are determined based on an interference graph, which may be different from connectivity graph due to the broadcast nature of wireless transmissions. We show that this problem is NP-complete. We first propose two centralized heuristic algorithms: one based on direct scheduling of the nodes or node-based scheduling, which is adapted from classical multi-hop scheduling algorithms for general ad hoc networks, and the other based on scheduling the levels in the routing tree before scheduling the nodes or level-based scheduling, which is a novel scheduling algorithm for many-to-one communication in sensor networks. The performance of these algorithms depends on the distribution of the nodes across the levels. We then propose a distributed algorithm based on the distributed coloring of the nodes, that increases the delay by a factor of 10–70 over centralized algorithms for 1000 nodes. We also obtain upper bound for these schedules as a function of the total number of packets generated in the network.     

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

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

DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad Hoc Networks

This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O(delta ) time and message complexity where delta is the maximum size of a two-hop neighborhood in a wireless network while message complexity remains O(delta ), assuming that message delays can be bounded by an unknown constant. DRAND is the first fully distributed version of RAND. The algorithm is suitable for a wireless network where most nodes do not move, such as wireless mesh networks and wireless sensor networks. We implement the algorithm in TinyOS and demonstrate its performance in a real testbed of Mica2 nodes. The algorithm does not require any time synchronization and is shown to be effective in adapting to local topology changes without incurring global overhead in the scheduling. Because of these features, it can also be used even for other scheduling problems such as frequency or code scheduling (for FDMA or CDMA) or local identifier assignment for wireless networks where time synchronization is not enforced. We further evaluate the effect of the time-varying nature of wireless links on the conflict-free property of DRAND-assigned time slots. This experiment is conducted on a 55-node testbed consisting of the more recent MicaZ sensor nodes.     

An Improved Contention Access Mechanism for FPRP to Increase Throughput

Five‐phase reservation protocol (FPRP) is a contention‐based media access control protocol for wireless ad hoc networks. FPRP uses a five‐phase reservation process to establish slot assignments based on time division multiple access. It allows a node to reserve only one slot in an information frame. Once a node has reserved a slot, it will cease contending for other slots. As a result, there may be less contending nodes in the remaining slots, so the time slots in an information frame are not fully used by FPRP. To improve time slot utilization, this paper proposes an improved pseudo‐Bayesian algorithm, based on which an improved contention access mechanism for FPRP is proposed, in which nodes are allowed to contend for more than one slot in a reservation frame according to a certain probability/priority. Simulation results indicate that the proposed mechanism performs better than FPRP in time slot utilization and hence the network throughput under various scenarios.     

Joint load balanced stable routing and communication segment assignment in mobile cognitive radio ad‐hoc networks

The fundamental issues in mobile cognitive radio ad‐hoc networks are the selection of the optimal stable paths between nodes and proper assignment of the frequency channels/time slots (communication segments) to the links. In this paper, a joint load balanced stable routing and communication segment assignment algorithm is proposed that considers jointly the mobility prediction, mitigating the co‐channel interference and energy consumption. The novelty of the proposed algorithm lies in the increasing of the path stability, which benefits from the maximum link lifetime parameter and introduced weighting function to keep routes away from the PU's region. This avoids the negative impacts on the PUs' operations and decreases the conflict of the cognitive nodes. In the proposed algorithm, the concept of load balancing is considered that yields in the balancing energy consumption in the network, improving the network performance and distributing traffic loads on all available channels. The effectiveness of the proposed algorithm is verified by evaluating the aggregate interference energy, average end‐to‐end delay, goodput, and the energy usage per packet under 6 scenarios. The results show that the performance of the proposed algorithm is significantly better than the recently proposed joint stable routing and channel assignment protocol.     

Entire network load‐aware cooperative routing algorithm for video streaming over mobile ad hoc networks

In this paper, we present an entire network load‐aware cooperative routing algorithm based on IEEE 802.11 multi‐rate for video streaming over mobile ad hoc networks. The proposed routing algorithm is designed to minimize the consumed time slots while guaranteeing the required time slots at all the pairs of adjacent nodes over the route and the contention neighbors of these nodes to support the route. Furthermore, the proposed routing algorithm can distribute the network loads well over the entire network. This technology is essential because video streaming applications require stringent quality of service and even larger network resources compared with traditional data services, and these demands may dramatically increase the entire network load and/or cause network congestion. Finally, experimental results are provided to show a performance of the proposed routing algorithm. Copyright © 2011 John Wiley & Sons, Ltd.