共查询到20条相似文献,搜索用时 78 毫秒
1.
研究了协作通信与认知无线电的结合,针对TD-SCDMA系统和WiMAX系统组成的异构无线网络,提出了一种基于多用户分集的协作频谱感知机制.根据该算法,WiMAX用户被分成若干个簇,选择每个簇内瞬时信道条件最好的WiMAX用户协作检测频谱,并利用软硬结合的判决手段,既保证检测性能,又不增加复杂度.分析和仿真表明,该算法一方面保证了频谱检测的可靠性,降低了虚警概率,另一方面减少了通信开销,提高了判决消息传输的可靠性,达到了提升频谱利用率的目的. 相似文献
2.
3.
4.
5.
6.
汇聚树路由协议(CTP)是目前无线传感器网络(WSN)中常用的数据采集路由协议。它是基于期望传输次数(ETX)的树型路由协议。但对多跳路径的衡量,简单的ETX相加往往无法良好刻画实际路径质量,致使该协议很难选出最优路径。本文提出了基于端到端的数据到达率(PDR)的CTP改进协议,能更好地衡量多跳路径的网络质量。据此选出的最优路径能构建更优的汇聚树,提高端到端数据传递的成功率,减少平均传递次数和平均传递时间,这样可以节省能耗,提高网络生存时间。同时,本文提出在建树过程中采取动态时延广播策略,可以有效减少建路由树时的广播次数,节省开销。 相似文献
7.
研究了晶粒尺寸对 Cu-32Zn 合金锯齿屈服的影响。实验表明:(1)在半经验公式ρ_m=N·ε~β及 C_v=K·ε~m 中的β及 m 随晶粒度加大而增大;(2)获得了四种不同类型的锯齿波;(3)出现锯齿波的温区按临界应变量ε_c 随温度升高而分别减小、为0及增大而分成三个区段;(4)随着晶粒度的增大,ε_c 变大;出现锯齿波的温度范围扩大;三个温区中的两个温度点移向高温区;锯齿波的波幅减小。上述结果可用ρ_m 及 C_v 和晶粒尺寸的关系及根据大量位错的集体行为和溶质原子与位错的弹性交互作用的模型来解释。 相似文献
8.
为提高滚动轴承故障诊断的准确性,提出一种基于固有时间尺度分解(ITD)、奇异值分解(SVD)和多点最优最小熵反褶积(MOMEDA)相结合的故障特征提取方法。首先,采用ITD分解故障振动信号,并构建基于峭度和相关系数的组合权重指标筛选准则,从而完成分量信号的筛选与重构。其次,对其进行SVD滤波降噪。最后,利用MOMEDA提取降噪后信号中的周期性冲击成分,并通过Hilbert包络谱分析得到诊断结果。经过实验数据分析,结果表明所提出的方法不仅能滤除噪声干扰,增强故障特征信息,而且能准确提取出故障特征。 相似文献
9.
在可用子载波、干扰温度、次级用户功率预算及公平性等约束条件下,提出了一种适用于认知OFDM系统的公平有效的多用户资源分配方案.该方案将子载波和功率分配分为两个相继的步骤,以降低计算复杂度.第一步引入子载波分配的比例公平原则,保证每个用户都能满足一定的通信要求;第二步采用一种改进的快速迭代注水算法,通过选择适当的调整步长... 相似文献
10.
11.
Bui L Srikant R Stolyar A 《Philosophical transactions. Series A, Mathematical, physical, and engineering sciences》2008,366(1872):2059-2074
In this paper, we extend recent results on fair and stable resource allocation in wireless networks to include multicast sessions, in particular multi-rate multicast. The solution for multi-rate multicast is based on scheduling virtual (shadow) 'traffic' that 'moves' in reverse direction from destinations to sources. This shadow scheduling algorithm can also be used to control delays in wireless networks. 相似文献
12.
13.
根据业务流的自相似性提出了一种新颖的信道分配算法。该算法首先根据流的自相似性,估计网络中的节点的业务量。然后,根据业务量多少确定占用信道的优先级。业务量大的节点可以优先占用信道。这样,解决了“热点”信道资源紧张的问题。同时,算法对“非热点”的吞吐量影响很小。理论分析证明,这种算法可以有效提高网络吞吐量。仿真结果表明,运用这种算法,网络的吞吐量比最小干扰固定信道分配算法和最小干扰混合信道分配算法可分别提高70%和40%。 相似文献
14.
为了有效实现基于虚拟机技术的高性能计算环境资源调度与分配,以满足用户不同服务质量请求,提出了一种动态可调节的资源分配策略.该策略以用户任务被放缓程度为核心指标,并允许用户根据该指标提出相应的服务质量约束,从资源提供者的角度保证了用户获得相关服务的开销最低,同时总的资源收益最大.对该分配模式下的静态资源分配问题进行了形式化的描述,并结合该策略提出混合背包算法.实验结果表明:面对大规模应用时,该算法较其它一般性算法更易得到效能较优的资源分配方案. 相似文献
15.
Akash Chandrayan Santanu Bandyopadhyay 《Clean Technologies and Environmental Policy》2014,16(3):455-465
In this paper, a generalised methodology is proposed to target cost optimal allocation of resources in segregated targeting problems. Cost optimal segregated targeting problems are characterised by the existence of multiple zones; each consisting of a set of demands and using a unique resource with given cost and a single quality index (e.g., emissions factor, contaminant concentrations, etc.). All these zones share a common set of internal sources. This paper presents a rigorous mathematical proof of the decomposition principle that decomposes the problem into a sequence of sub-problems. Decomposition of the original problem is performed based on the prioritised costs for each external resource, attached to a particular zone. Prioritised cost of a resource depends on the pinch quality, quality of the resource and its cost. Applicability of the proposed methodology is illustrated by examples from carbon-constrained energy planning and water allocation networks. 相似文献
16.
Acquiring good throughput and diminishing interference to primary users (PU) are the main objectives for secondary users in a cognitive radio (CR) network. This paper proposes a centralized subcarrier and power allocation scheme for underlay multi-user orthogonal frequency division multiplexing considering the rate loss and the interference those the PU can tolerate. The main purpose of the proposed scheme is to efficiently distribute the available subcarriers among cognitive users to enhance both the fairness and the throughput performance of the cognitive network while maintaining the QoS of primary users. Simulation results show that the proposed scheme achieves a significantly higher CR network throughput than that of the conventional interference power constraint (IPC) based schemes and provides a significantly enhanced fairness performance. Also, contrary to the conventional IPC based schemes, the proposed scheme is able to significantly increase the achieved throughput as the number of CR users increases. 相似文献
17.
18.
结合频域均衡(FDE)研究了在频率选择性衰落信道下基于虚拟 MIMO-STBC 的无线传感器网络的功率分配(PA)方案.利用从目标簇反馈回信源簇的信道状态信息,在协同传输节点总发送功率一定的情况下,通过最大化信宿节点接收到数据的信噪比推导出了一种基于滤波器组频域加权的 PA 方案.仿真结果表明,在系统一定的误码率要求下,采用这种 PA 方案的无线传感器网络所需要的发射功率要少于等 PA 方案所需要的发射功率,从而减少了无线传感器网络的能耗. 相似文献
19.
Interference-limited resource allocation for cognitive radio in orthogonal frequency-division multiplexing networks 总被引:1,自引:0,他引:1
Efficient and fair resource allocation strategies are being extensively studied in current research in order to address the requirements of future wireless applications. A novel resource allocation scheme is developed for orthogonal frequency-division multiplexing (OFDM) networks designed to maximise performance while limiting the received interference at each user. This received interference is in essence used as a fairness metric; moreover, by defining different interference tolerances for different sets of users, the proposed allocation scheme can be exploited in various cognitive radio scenarios. As applied to the scheme, the authors investigate a scenario where two cellular OFDM-based networks operate as primary and secondary systems in the same band, and the secondary system benefits by accessing the unused resources of the primary system if additional capacity is required. The primary system benefits either by charging the secondary system for the use of its resources or by some form of reciprocal arrangement allowing it to use the secondary system's licenced bands in a similar manner, when needed. Numerical results show our interference-limited scheduling approach to achieve excellent levels of efficiency and fairness by allocating resources more intelligently than proportional fair scheduling. A further important contribution is the application of sequential quadratic programming to solve the non-convex optimisation problems which arise in such scenarios. 相似文献