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

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

基于无线传感器网络汇聚传输实时性的分布式调度算法

在无线传感器网络多种应用中,各节点需要在短时间内将采集的数据传输至汇聚节点,从而形成多对一的汇聚传输。针对网络汇聚传输的实时性,提出了一种分布式的节点传输调度算法。各节点只需要根据一跳范围内的邻居信息进行传输调度。仿真和分析表明该算法可以有效避免数据碰撞,并使得完成一次全网数据收集所需要的时隙数基本在网络节点总数的1.6到1.8倍左右,比目前其他调度算法在实时性和复杂度方面更具有优势。     

一种基于多跳光旁路的IP over WDM节能网络设计方法

针对IP over WDM网络,基于多跳光旁路和流量疏导,以减少能耗为目标对网络链路配置进行设计;考虑多跳光旁路会增大业务传输距离的问题,分析了光路建立顺序对业务传输距离的影响;通过优先路由短距离业务和限制最大传输跳数来减少业务的平均传输跳数。仿真结果表明,优先建立短距离光路的启发式算法与Dijkstra算法相比可以减少25%～55%的能耗,业务平均物理跳数与Dijkstra算法相差在1跳之内。     

WDM网络中基于负载平衡的动态波长路由算法

在WDM网络中，路由和波长分配（RWA）算法是一个焦点问题．当前的RWA算法多是考虑路径跳数或全网拥塞程度，并没有分析各个链路的具体情况．文中提出一种WDM网络中能实现负载平衡的路由算法——最大波长跳数比值（MWHR）算法。基本思想是：根据各备选路径的跳数和其经过的各链路上的可用波长数信息。计算该路径的优先选取权值，优先选取权值最大的路径．仿真表明，该算法在保证较低的阻塞率情况下，能有效的将业务负载均衡分布在网络中的所有链路上．     

支持MIMO链路的Ad hoc网络中的链路激活型拓扑未知MAC协议

该文提出了支持多输入多输出(MIMO)链路的Ad hoc网络的链路激活型拓扑未知多址接入协议。该协议利用正交拉丁方来为网络链路分配传输时隙,保证每个链路在1帧中至少有1个时隙可以成功传输。推导了该协议的平均吞吐量,并以最大化平均吞吐量为准则给出了选择协议参数的方法。数值结果表明,与已有链路激活型和节点激活型拓扑未知协议相比,本文的协议可以提高网络节点的吞吐量。     

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

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

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

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

节点重要性感知的透明虚拟光网络协同映射策略

针对透明弹性光网络环境下虚拟光链路映射过长和频谱碎片问题,该文提出一种节点重要性感知的协同映射算法。在节点映射阶段,设计节点重要性度量准则,评估未映射节点和已映射节点的邻近性,以及光路的频谱紧密度,以缓解链路频谱碎片和增强节点映射的紧凑性。同时,为了降低节点映射成功而链路映射失败的概率,提出一种节点-链路协同映射算法,当成功映射一对相邻虚拟节点时,立即映射他们之间的虚拟光链路,并分配频谱资源,最小化虚拟光链路所映射物理光路跳数。仿真结果表明,所提算法能够使用更少的频谱资源传输更多的虚拟光网络业务,且缩短了虚拟光链路映射长度。     

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

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

基于链路优先的快速协同虚拟网络映射算法

在网络虚拟化环境中,为了减少链路映射成本和提高收益,提出了一种链路优先的协同映射算法。该算法交替映射链路和节点,并使用贪心思想优先将带宽资源需求较大的虚拟链路映射到跳数较少的物理路径上,最终达到降低虚拟网络平均消耗和提高虚拟网络接受率的目的。仿真结果表明,与已有算法相比,所提算法节约了链路映射的成本,提高了虚拟网络接受率和物理网络收益,算法运行时间也有效缩短。     

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

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

A Power-Efficient Distributed TDMA Scheduling Algorithm with Distance-Measurement for Wireless Sensor Networks

This paper describes a power-efficient distributed TDMA slot scheduling algorithm which the slot allocation priority is controlled by distance measurement information in details. In our former proposed scheme, L-DRAND+, an extension of Lamport’s bakery algorithm for prioritized slot allocation based on the distance measurement information between nodes and a packet-based transmission power control had been applied. In this paper, we propose its enhanced scheme with a weighted rule control and state machines refinements of L-DRAND+, named L-DRAND++. This aims at the achievement of media access control methods which can construct a local wireless network practically by limiting the scope, and eliminate the redundant power consumption in the network. The proposed scheme can be shown as a possible replacement of DRAND algorithm for Z-MAC scheme in a distance-measurement-oriented manner. In addition, to evaluate the ordered node sequence determined by the algorithm, node sequence metric is proposed. By using the metric, we can evaluate protocol behaviors according to the environmental situation around the node.     

LSAPSP: Load distribution‐based slot allocation and path establishment using optimized substance particle selection in sensor networks

Sensor node energy conservation is the primary design parameters in wireless sensor networks (WSNs). Energy efficiency in sensor networks directly prolongs the network lifetime. In the process of route discovery, each node cooperates to forward the data to the base station using multi‐hop routing. But, the nodes nearer to the base station are loaded more than the other nodes that lead to network portioning, packet loss and delay as a result nodes may completely loss its energy during the routing process. To rectify these issues, path establishment considers optimized substance particle selection, load distribution, and an efficient slot allocation scheme for data transmission between the sensor nodes in this paper. The selection of forwarders and conscious multi‐hop path is selected based on the route cost value that is derived directly by taking energy, node degree and distance as crucial metrics. Load distribution based slot allocation method ensures the balance of data traffic and residual energy of the node in areal‐time environment. The proposed LSAPSP simulation results show that our algorithm not only can balance the real‐time environment load and increase the network lifetime but also meet the needs of packet loss and delay.     

Fair Algorithms for Maximal Link Activation in Multihop Radio Networks

We present a distributed algorithm for obtaining a fair time slot allocation for link activation in a multihop radio network. We introduce the concept of maximal fairness in which the termination of a fair allocation algorithm is related to maximal reuse of the channel under a given fairness metric. The fairness metric can be freely interpreted as the expected link traffic load demands, link priorities, etc. Since respective demands for time slot allocation will not necessarily be equal, we define fairness in terms of the closeness of allocation to respective link demands while preserving the collision free property. The algorithm can be used in conjunction with existing link activation algorithms to provide a fairer and fuller utilization of the channel.     

Comparison of time slot allocation strategies for CDMA/TDD systems

The traffic (load) asymmetry between uplink and downlink is a remarkable traffic characteristic in cellular mobile multimedia communications. The code division multiple access system with time division duplex mode (CDMA/TDD system), adopting unbalanced slot allocation between uplink and downlink, is a good solution for this traffic asymmetry. However, the level of traffic asymmetry may be significantly different from cell to cell. In this paper, we investigate a slot allocation strategy (DA strategy), by which each cell has its own slot allocation according to the level of traffic asymmetry. We compute the system capacity with DA strategy and find out the optimal slot allocation for the system. We also compare the maximum capacity to that with another strategy (SA strategy), by which all cells have the same slot allocation. As a result, this paper shows that the system with DA strategy outperforms the system with SA strategy in the aspect of capacity     

道路交通网络节点分配优化策略研究进展

为了进一步提高城市道路交通网络的通行效率,粒子群优化和神经网络等多种智能优化算法受到越来越多的关注。近年来,深度学习技术的普及与应用大幅提升了城市交通网络的节点识别效率,而交通网络的节点调度又扩展了深度学习技术的应用。文中详细分析了交通节点调度所面临的关键问题,归纳并总结了相关网络节点分配的研究现状。在此基础上,深入研讨了城市交通网络节点调度与深度学习的应用前景,并对交通网络节点分配优化策略的未来研究方向进行了展望。     

Rain granularity effects on bandwidth demand for faded DVB‐RCS systems

Broadband satellite communication networks, operating at Ka band and above, play a vital role in today's worldwide telecommunication infrastructure. The problem, however, is that rain can be the most dominant impairment factor for radio propagation above 10 GHz. This paper studies bandwidth and time slot allocation problem for rain faded DVB‐RCS satellite networks. We investigate how using finer rain granularity can improve bandwidth utilization in DVB‐RCS return links. The paper presents a mathematical model to calculate the bandwidth on demand. We formulate the radio resource allocation as an optimization problem and propose a novel algorithm for dynamic carrier bandwidth and time slots allocation, which works with constant bit rate type of traffic. We provide theoretical analysis for the time slot allocation problem and show that the proposed algorithm achieves optimal results. The algorithm is evaluated using a MATLAB simulation with historical rain data for the UK. Copyright © 2014 John Wiley & Sons, Ltd.     

太赫兹无线局域网MAC协议优化设计

针对现有太赫兹无线网络MAC(Medium Access Control)协议中存在的无线局域网场景下原有波束赋形方案不适用、关联请求时段在新入网节点数量受限情况下时隙利用率低,以及网络流量较大时扇区号靠后的节点一直无法获得时隙导致时延陡增的情况,提出了一种适用于无线局域网的高效低时延太赫兹MAC协议(High Efficiency and Low Latency Terahertz MAC,HELL-MAC)。该协议利用中心控制节点与普通节点间的信息交互减少了不必要的波束赋形过程,采用机会性复用关联S-CAP(Sub-channel Access Period)机制提高了时隙利用率,采用公平时隙分配机制提高了时隙分配的公平性,从而减少了波束赋形时间,降低了平均端到端时延,提高了信道利用率。     

Wide-band TD-CDMA MAC with minimum-power allocation and rate- and BER-scheduling for wireless multimedia networks

A wide-band time-division-code-division multiple-access (TD-CDMA) medium access control (MAC) protocol is introduced in this paper. A new minimum-power allocation algorithm is developed to minimize the interference experienced by a code channel such that heterogeneous bit-error rate (BER) requirements of multimedia traffic are satisfied. Further, from analysis of the maximum capacity of a time slot, it is concluded that both rate and BER scheduling are necessary to reach a maximum capacity. Based on the new minimum-power allocation algorithm as well as on rate and BER scheduling concepts, a new scheduling scheme is proposed to serve packets with heterogeneous BER and quality of service (QoS) requirements in different time slots. To further enhance the performance of the MAC protocol, an effective connection admission control (CAC) algorithm is developed based on the new minimum-power allocation algorithm. Simulation results show that the new wide-band TD-CDMA MAC protocol satisfies the QoS requirements of multimedia traffic and achieves high overall system throughput.     

A tree-based slot allocation algorithm for loss-free slotted OBS networks

Optical burst switching (OBS) is regarded as one of the most promising switching technologies for next generation optical networks. However, the data burst contention problem is still unresolved thoroughly even though slotted OBS (SOBS) is studied as a new paradigm reducing the blocking rate. In this article, we propose a tree-based slot allocation (TSA) algorithm for loss-free SOBS networks, where the TSA algorithm originally avoids contention of the time-slots by reserving the time-slots with different time-slot positions for the source nodes, respectively. In order to manage the time-slots efficiently, we also propose an OBS superframe, which is a cyclic period and consists of multiple time-slots transmitted by the source nodes toward the same incoming port of a destination node. In addition, we attempt to optimize multiplexing of the OBS superframes to reduce wavelength consumption. On the other hand, when incoming traffic is beyond expectation, a source node may need more time-slots to prevent packet loss because of buffer overflow. For reallocation of the time-slots, we propose a flow control scheme managing some number of shared time-slots, where a control node adaptively allocates (or redeems) the time-slots to (or from) source nodes by utilizing the shared time-slots based on fluctuating traffic condition. Simulation results show that the blocking rate of the proposed TSA–OBS scheme is zero with acceptable queueing delay at moderate traffic offered loads. In addition, multiplexing optimization simulated in the 14-node NSFNET achieves a 63% reduction of wavelength consumption. Moreover, the proposed flow control scheme assisting the TSA algorithm maintains a target upper-bound of queueing delay at the source node, so that packet loss caused by buffer overflow is prevented.