无线传感器网络数据传输延时分配算法

为了提高箭载无线传感网络对火箭温度、冲击、热流等物理参数的处理能力,需对所采集的数据进行自适应延时分配,因此设计一种基于时隙窗口间隔均衡控制的无线传感器网络数据传输延时分配算法。构建火箭温度、振动、冲击等参数的数据采集模型,采用分布式网格均衡配置方法对无线传感器网络中的节点进行均衡部署；结合最短路径寻优方法使数据采集过程中的信道分配达到均衡,构建数据采集最短路径寻优控制模型,采用输出比特序列重组方法进行数据采集过程中的传输延迟配置；结合码元调节技术对数据传输进行自适应扩频调节,利用时隙窗口间隔均衡控制方法实现无线传感器网络数据传输延时分配。实验结果表明,采用该方法进行无线传感器网络数据传输延时分配的自适应性较好,输出稳定性较强、分配输出错误率低,有效性更强。     

面向无线认知网络的冗余感知数据消除

在无线认知网络的协作式频谱感知方案中,非授权用户（次要用户）将各自感知到的可用频谱信息转发给邻居节点,作为频谱分配的依据.而实际上,仅有部分数据影响着频谱分配的结果.无用信息的传递不仅产生了大量额外的通信开销,而且在频谱分配过程中浪费了计算资源.这种情况对于频谱资源稀缺的无线认知网络和能量有限的认知终端来说是无法接受的.因此,如何减少无用信息的传递是一个具有重大实际意义的问题.基于skyline查询处理,提出了多目标约束下skychannel查询处理方法,以减少冗余感知信息传递.其基本思想是：将数据空间划分为控制区域、被控区域和自由区域,按照信道的性能参数,将要查询的信道放入相应区域.传输时,直接忽略被控信道的信息而仅传输非被控信道的数据.在保证不影响频谱分配结果的前提下,可以大量降低网络开销,节约用户的计算资源.仿真结果显示,skychannel查询方法在节约查询时间、降低通信开销和计算开销等方面具有优势.     

An Adaptive Distributed Channel Allocation Strategy for Mobile Cellular Networks

A channel allocation algorithm includes a channel acquisition algorithm and a channel selection algorithm. Most of the previous work concentrates on the channel selection algorithm since early channel allocation algorithms simply use a centralized channel acquisition algorithm, which depends on a mobile switching center (MSC) to accomplish channel acquisition. Recently, distributed channel acquisition algorithms have received considerable attention due to their high reliability and scalability. There are two approaches to designing distributed channel acquisition algorithms: search and update. The update approach has shorter acquisition delay and lower call blocking rate, but higher message complexity. On the other hand, the search approach has lower message complexity, but longer acquisition delay and higher call blocking rate. In this paper, we propose a novel distributed channel acquisition algorithm, which is a significant improvement over both approaches. Also, we identify two guiding principles in designing channel selection algorithms and propose an algorithm which has low call blocking rate and low intrahandoff overhead. By integrating the channel selection algorithm into our channel acquisition algorithm, we get a complete distributed channel allocation algorithm. By keeping the borrowed channels, the channel allocation algorithm makes use of the temporal locality and adapts to the network traffic; i.e., free channels are transferred to hot cells to achieve load balance. Simulation results show that our channel allocation algorithm significantly outperforms the search approach and the update approach in terms of call blocking rate, message complexity, and acquisition delay.     

混合共享认知无线网络信道分配算法

混合频谱共享是适应认知用户不同地理分布的有效频谱共享模式。信道分配是无线通信网络中关键的问题之一,近年来得到了广泛研究。集中式信道分配算法是最常用的算法形式,但在认知无线电网络这种分布式系统中,集中式算法不易实现。将混合共享认知无线网络的信道分配问题构建为一对一的匹配博弈,提出了分布式用户-信道匹配算法。该算法数学复杂度低,且能够达到稳定匹配。仿真结果表明,算法收敛时间短,稳定匹配状态下的平均传输速率与使用匈牙利算法的最优分配算法所获得传输速率相接近,远优于随机分配算法的传输速率。     

Adaptive joint bandwidth and power allocation in heterogeneous wireless access environment

Joint bandwidth and power allocation for a multi-radio access(MRA)system in a heterogeneous wireless access environment is studied.Since both the number of users being served by the system and the wireless channel state are time-varying,the optimal resource allocation is no longer a static optimum and will change with the varying network state.Moreover,distributed resource allocation algorithms that require iterative updating and signaling interactions cannot converge in negligible time.Thus,it is unrealistic to assume that the active user number and the wireless channel state remain unchanged during the iterations.In this paper,we propose an adaptive joint bandwidth and power allocation algorithm based on a novel iteration stepsize selection method,which can adapt to the varying network state and accelerate the convergence rate.A distributed solution is also designed for the adaptive joint resource allocation implementation.Numerical results show that the proposed algorithm can not only track the varying optimal resource allocation result much more quickly than a traditional algorithm with fixed iteration stepsize,but can also reduce the data transmission time for users and increase the system throughput.     

Bandwidth allocation in UWB WPANs with ECMA-368 MAC

The new ECMA-368 MAC for UWB WPANs consists of two channel access methods: the distributed reservation protocol (DRP) and prioritized contention access (PCA). The exact method of medium access slot (MAS) allocation in DRP is not specified in the standard. The contribution of this paper is twofold. First, the paper describes a distributed resource allocation method in which a number of interference–avoidance rules are used to reserve slots for devices. Devices maintain sending and receiving tables to track activities in the neighbourhood. The proposed method is a simple, effective solution to the DRP MAS allocation problem, avoiding reservation conflicts and interference from hidden terminals. Secondly, for VBR MPEG-4 video traffic, we propose a bandwidth requirement calculation method based on traffic prediction. In the proposed scheme bandwidth is allocated based on accurate traffic predictions, therefore matching network resources to the traffic demand. Application QoS is maintained while network utilization is kept high. Furthermore, the simple, adaptive linear predictor does not incur much computation overhead. Simulation results have demonstrated the accuracy of the proposed prediction algorithm and effectiveness of the bandwidth allocation method.     

基于节点重要度的路由选择与频谱分配算法

在频谱一致性和频谱连续性的约束条件下,弹性光网络运行一段时间后,网络频谱会出现大量碎片的问题。针对碎片以及业务在各节点间分配不均衡的问题,提出了一种基于节点重要度的路由选择与频谱分配算法NIRSA（Route Selection and Spectrum Allocation algorithm based on Node Importance）。该算法针对路由选择问题,考虑业务的类型与大小,找出网络中的关键节点,使得业务分配达到均衡。在频谱分配方面,算法考虑到网络链路上频谱资源的分布情况,结合每个业务所需的频隙数,可以尽可能地减少频谱碎片。在NSFNET和USNET两个不同规模的网络拓扑环境下,对所提算法进行了仿真实验。仿真结果显示,所提出的NIRSA算法既可以有效地降低业务阻塞率,又能提高网络的频谱利用率,实现网络性能提升。     

认知无线Ad Hoc网络干扰约束和能量高效路由算法

为了减少认知无线Ad Hoc网络的传输中断概率,实现频谱和能量高效,提出一种干扰约束和能量高效（Interference Constraints and Energy-Efficient,ICEE）的路由算法。信道检测除了基于认知节点（Cognitive Radio,CR）对主用户（Primary Users,PU）的干扰约束外,还增加了CR节点的数据传输所需持续时间约束,以保证CR节点在有效利用空闲信道的同时减少传输中断事件的发生,减少故障重传所损耗的能量。在设计路由算法时采用了链路能耗和节点寿命作为度量,通过联合最优的链路选择方程实现网络能量高效,并延长网络的生命周期。实验仿真结果表明,相比较认知Ad hoc网络的自适应路由协议,基于联合信道分配和自适应功率控制的路由协议,ICEE算法在数据包平均能耗上分别减少了41.2%和24.5%,并且有效地延长了网络生命周期。     

Distributed Construction and Maintenance of Bandwidth and Energy Efficient Bluetooth Scatternets

Bluetooth networks can be constructed as piconets or scatternets depending on the number of nodes in the network. Although piconet construction is a well-defined process specified in Bluetooth standards, scatternet formation policies and algorithms are not well specified. Among many solution proposals for this problem, only a few of them focus on efficient usage of bandwidth in the resulting scatternets. In this paper, we propose a distributed algorithm for the scatternet formation problem that dynamically constructs and maintains a scatternet based on estimated traffic flow rates between nodes. The algorithm is adaptive to changes and maintains a constructed scatternet for bandwidth-efficiency when nodes come and go or when traffic flow rates change. Based on simulations, the paper also presents the improvements in bandwidth-efficiency and reduction in energy consumption provided by the proposed algorithm.     

认知无线Mesh网络中基于协作学习自动机的自适应信道分配算法*

在认知无线Mesh网络多信道环境中处理繁重的数据业务是一项具有挑战性的任务。为了解决这个问题,提出了一种新的基于协作学习自动机(Learning automata,LA)的自适应信道分配算法(CLACAA)。在所提出的算法中,LA被部署在邻近的互相协作的次用户上。首先,为了LA能自适应地更新其动作概率向量,设计了一种线性奖赏无为方案;其次,定义了一种新的信道利用率因子用于信道选择,以解决信道冲突发生的问题;最后,给出了当信道由于大量输入请求而过载时的信道切换方案。实验仿真结果表明,该算法在提升网络吞吐量和数据传输率,降低切换时延和缓冲时延上有明显的优势。     

车联网D2D通信中最大化频谱资源利用率分配算法

无线通信技术快速发展,终端设备不断增多,为缓解这一现象,提升系统网络容量,针对车联网蜂窝D2D(device to device)通信资源分配问题,提出了一种最大化频谱资源利用率分配算法.该算法以最大化频谱资源利用率为优化目标,在满足车联网通信的基本服务质量(quality of service,QoS)下,通过V2V(vehicle to vehi-cle)和V2P(vehicle to people)共享信道资源来提高频谱资源利用率.首先利用信道状态信息定义的链路增益因子为终端用户找到潜在的通信链路集合;然后证明终端用户复用链路资源时功率分配问题为一个凸优化问题,利用凸优化理论求得最优传输功率;随后求解最优的信道匹配问题,此问题为多对一的加权匹配问题,为降低算法复杂度用KM(Kuhn Munkres)算法来求解.仿真结果表明,所提算法较其他算法能够有效地提升系统吞吐量、提高频谱资源利用率、提升网络性能,优化车联网通信资源分配问题.     

Adaptive channel and power allocation of downlink multi-user MC-CDMA systems

The Multi-Carrier Code Division Multiple Access (MC-CDMA) is becoming a very attractive multiple access technique for high-rate data transmission in the future wireless communication systems. This paper is focused on the joint channel and power allocation in the downlink transmission of multi-user MC-CDMA systems and considers the throughput maximization problem as a mixed integer optimization problem. For simple analysis, the problem is divided into two less complex sub-problems: power allocation and channel allocation, which can be solved by a suboptimal Adaptive Power Allocation (APA) algorithm and an optimal Adaptive Channel Allocation (ACA) algorithm, respectively. By combining APA and ACA algorithms, an adaptive channel and power allocation scheme is proposed. The numerical results show that the proposed APA algorithm is more suitable for MC-CDMA systems than the conventional equal power allocation algorithm, and the proposed channel and power allocation scheme can significantly improve the system throughput performance.     

基于干扰估计的WSN链路自适应控制方法

针对现有的无线传感器网络传输功率控制算法未充分考虑实际信道干扰的问题,给出了基于干扰估计的最优传输功率计算方法;考虑到通信信道及活跃节点数目的时变性,提出了自适应速率调整算法;最后通过试验验证了所提方法的可行性。     

Optimizing the radio resource utilization of multiaccess systems with a traffic-transmission quality adaptive packet scheduling

In this paper we state a general framework for radio resource allocation based on a matrix which highlights the trade-offs of complexity and efficiency. This framework is outlined for the systematic definition of scheduling algorithms that are jointly adaptive to traffic and to transmission quality in order to improve the radio resource utilization and the achievable throughput of cellular networks for the support of best-effort traffic. We consider the application of the matrix concept to both time division and code division multiple access, the latter scheme also bringing about mutual interference among competing users. Then we propose a scheduling algorithm for wireless systems, called channel adaptive open scheduling (CHAOS). The CHAOS performance in terms of throughput and delay is extensively compared with those resulting from a load adaptive channel independent scheduling (CIS). A major result of this work is the quantitative assessment of the performance advantage allowed by jointly accounting for traffic congestion and transmission quality. Moreover the main implementation issues related to the proposed algorithms are investigated.     

应急通信系统中基于集群智能的动态信道分配

应急通信系统中频谱资源在时间和空间上的动态变化,使得寻找一条稳定的公共控制信道十分困难。为此,将认知无线电技术引入应急通信系统中,建立了应急认知无线电网络模型,提出一种基于集群智能的动态信道分配算法。系统中每个节点根据检测到的可用信道信噪比和邻居节点对信道的选择情况,采用信道选择更新函数,选择公共控制信道。应急通信系统中的所有节点构成一个集群,节点进行各自的信道更新并与其他节点交互形成集群智能。各节点周期性地进行消息发送与监听,依据频谱资源的动态变化及时更新公共控制信道的选择,最终达到全局公共控制信道的动态选择。仿真结果表明,算法能够达到公共控制信道的有效收敛,有很好的可扩展性,并且能够快速地适应频谱资源的动态变化。     

WMN中的干扰避免部分重叠信道分配算法

针对无线mesh网络(wireless mesh networks,WMN)中存在的信道干扰问题,提出一种基于部分重叠信道(partially overlapping channels,POC)的负载平衡且干扰避免的信道分配算法。通过基于Huffman树的通信接口分配方法连接邻居节点的接口;根据网络干扰情况,对链路进行迭代信道分配,使用静态链路调度保证网络连接;利用启发式算法优先为重要程度较高的链路分配无干扰时隙,对链路调度进行优化。仿真结果表明,在具有混合流量的WMN中,所提算法可以显著提升网络吞吐量,降低网络干扰与平均丢包率,改善网络性能。     

基于TDMA的空中自组网MAC层资源调度算法研究

空中移动无线自组织网络是一种拓扑结构快速变化,有自组织性的多跳无中心网络;针对传统时隙分配算法资源利用率低、吞吐量不足、通信距离近等问题,采用引入分配系数的混合时隙分配模式,通过节点业务优先级和流量预测相结合,设计了一种基于TDMA定向分布式资源动态调度算法（M-TDMA）;对比分析了节点数量、传输速率、分配系数以及不同拓扑等多个维度对算法传输时延、吞吐量以及丢包率的影响;最后通过仿真实验对资源调度算法进行验证;仿真结果表明,在20个网络节点时,网络的最大传输时延小于600 ms,网络吞吐量可以达到4.5 Mbps以上, M-TDMA算法通过高效的资源调度,有效降低了网络传输时延并提高了网络吞吐量;     

一种异构多接口多信道无线网络的信道分配算法

多接口多信道技术是无线网络环境中减少链路干扰、提高网络吞吐量的有效途径,但如何合理有效地进行信道分配已成为多接口多信道无线网络所面临的主要问题之一.针对自私的网络节点,本文使用非合作博弈对异构条件下多接口节点的信道分配问题进行建模分析,其纳什均衡解为解决该问题所需的稳定的信道分配方案.本文首先讨论纳什均衡的存在条件并提出实现纳什均衡的分布式算法.此外,考虑到实际网络中节点仅能感知局部信道信息以及接口工作信道受限等因素,本文进一步改进算法并通过仿真实验对其收敛性进行证明.     

Proactive cooperative scheduling and buffer management for multimedia networks

Is it possible, and to what extent feasible, for link schedulers and buffer managers in multimedia networks with propagation delays to relieve effectively congestion by means of feedback signaling? We show that a proactive cooperative control algorithm for distributed resource scheduling and buffer management obviates the problem of propagation delays. The algorithm is based on traffic predictions of correlated input traffic streams into network nodes. Nodes projecting to be under stress signal their neighboring upstream nodes for the latter to readjust their flow rates, whileguaranteeing quality of service as negotiated at call setup. Detailed implementations of the adaptive, feedback control mechanisms of distributed asynchronous algorithms that project future overload conditions are presented. The design allows the underlying single-node link scheduling and buffer management algorithm to be run in either a cooperative or a noncooperative mode of operation.     

Performance analysis of a threshold based distributed channel allocation algorithm for cellular networks

Rapid advances of the handheld devices and the emergence of the demanding wireless applications require the cellular networks to support the demanding user needs more effectively. The cellular networks are expected to provide these services under a limited bandwidth. Efficient management of the wireless channels by effective channel allocation algorithms is crucial for the performance of any cellular system. To provide a better channel usage performance, dynamic channel allocation schemes have been proposed. Among these schemes, distributed dynamic channel allocation approaches showed good performance results. The two important issues that must be carefully addressed in such algorithms are the efficient co-channel interference avoidance and messaging overhead reduction. In this paper, we focus on our new distributed channel allocation algorithm and evaluate its performance through extensive simulation studies. The performance evaluation results obtained under different traffic load and user mobility conditions, show that the proposed algorithm outperforms other algorithms recently proposed in the literature.