共查询到6条相似文献,搜索用时 4 毫秒
1.
基于Monte Carlo方法的任意概率密度随机数字信号发生器设计 总被引:3,自引:0,他引:3
在信号处理和计算机微观模拟的过程中,经常要构造具有特定概率密度的随机数发生器.采用常规方法实现难度较大且不具普遍性,本文根据Monte Carlo方法基本原理和随机信号的数字特征给出一种任意概率密度随机数发生器的设计方法及核心源代码.实验证明该方法简单高效、通用性好. 相似文献
2.
3.
4.
5.
Modeling and performance analysis of VI‐CRA: A congestion control algorithm for vehicular networks 下载免费PDF全文
This study proposes a Vehicle ID‐based CAM Rate Adaptation (VI‐CRA) algorithm for beacon messages in the vehicular network. Foremost, an improved vehicle ID–based analytical model is proposed at the MAC layer of vehicular network. The model weighs the random back‐off number chosen by vehicles participating in the back‐off process, with the vehicle ID incorporated in their respective CAMs. This eventually leads to the selection of a vehicle ID–based random back‐off number, minimizing the probability of collision due to same back‐off number selection. It is worth noting that the improved analytical model outperforms the existing works in terms of average packet delay since only one fourth of the contention window size is used throughout the simulation. To enhance the performance of the analytical model, the paper incorporates a congestion control algorithm, by adapting the rate of CAM broadcast over the control channel. The algorithm is designed considering a wide range of scenarios, ranging from nonsaturated to extremely saturated network (in terms of collision probability) and sparsely distributed to teemed network (in terms of vehicular density). For better analyses of simulation results, the algorithm is applied over different vehicle ID–based back‐off numbers. Simulation results for all the back‐off numbers show that vehicle ID–based CAM rate adaptation algorithm performs better than the traditional fixed CAM rate IEEE 802.11p, even at high vehicular density. 相似文献
6.
Markku Liinaharja Shyam S. Chakraborty 《AEUE-International Journal of Electronics and Communications》2002,56(3):177
In this article, an adaptive SR ARQ scheme is analyzed and optimized in a time-varying channel environment with unreliable feedback. Two-state Markov models are assumed for both the forward and the returnchannel.This enables the time behaviour of the entire system to be modelledby a Markov chain. To have an easy-to-implement scheme, we choose the smaller packet size to be half of the bigger one. Thus, there is only oneindependent design parameter related to packet size. The other two parametersare associated with channel sensing. The performance of the adaptive schemeis measured by its average throughput, which is upper-bounded by the throughput of the so-called ideal adaptive scheme. This upper bound is very useful in the optimization of the packet size and other design parameters. From the results, it can be concluded that the selection of the packet size is at least as critical as the optimization of the other parameters. The feedback errors degrade the throughput of the scheme, but their effect on the parameter optimization turns out to be almost negligible. 相似文献