A transition diagram is used to describe the behavior of systems. Birth-death equations were derived from transition diagram depicting the state of the birth-death processes. Queue models and characteristics of queue ...A transition diagram is used to describe the behavior of systems. Birth-death equations were derived from transition diagram depicting the state of the birth-death processes. Queue models and characteristics of queue models are also derivable from birth-death processes. These queue models consist of mathematical formulas and relationships that can be used to determine the operating characteristics （performance measures） for a waiting line. Schematic and transition diagrams of different single server queue models were shown. Relationships between birth-death processes, waiting lines （queues） and transition diagrams were given. While M/M/I/K queue model states was limited by K customers and had （K＋I） states, M/M/1/1 queue model had only two states. M/G/1/∝/∝ and M/M/1/∝/∝ shared similar characteristics. Many ideal queuing situations employ M/M/1 queueing model.展开更多
针对认知无线电(Cognitive Radio)频谱不连续,随机性和变化性大,以及TDMA,FDMA,CDMA不适用的问题,提出了一个基于变换域通信(Transform Domain Communication System)平台的认知无线电多址接入系统.该系统发射机通过将非空闲的频谱幅度...针对认知无线电(Cognitive Radio)频谱不连续,随机性和变化性大,以及TDMA,FDMA,CDMA不适用的问题,提出了一个基于变换域通信(Transform Domain Communication System)平台的认知无线电多址接入系统.该系统发射机通过将非空闲的频谱幅度置0,实现对授权用户的躲避;采用m状态序列产生的伪随机相位矢量,生成近似正交的调制基函数实现用户的多址接入;接收端通过本地基函数与接收信号相关估计出原始数据,并理论分析了系统的误码率.仿真表明,系统的检测概率,多址接入的用户数以及收发两端基函数的不一致会影响系统的性能.该系统能利用非连续频谱,并且基函数能够自适应变化,适合认知无线电。展开更多
On the basic of a type of practical examples we set up a new queueing model with negative customers. By the use of “Supplemental Variables method” and “State transfer analysis”, we get the generating function wit...On the basic of a type of practical examples we set up a new queueing model with negative customers. By the use of “Supplemental Variables method” and “State transfer analysis”, we get the generating function with negative powers of queue length and the waiting time expressions.展开更多
In the IEEE 802.16e/m standard, three power saving classes （PSCs） are defined to save the energy of a mobile sub- scriber station （MSS）. However, how to set the parameters of PSCs to maximize the power saving and ...In the IEEE 802.16e/m standard, three power saving classes （PSCs） are defined to save the energy of a mobile sub- scriber station （MSS）. However, how to set the parameters of PSCs to maximize the power saving and guarantee the quality of service is not specified in the standard. Thus, many algorithms were proposed to set the PSCs in IEEE 802.16 networks. However, most of the proposed algorithms consider only the power saving for a single MSS. In the algorithms designed for multiple MSSs, the sleep state, which is set for activation of state transition overhead power, is not considered. The PSC setting for real-time connections in multiple MSSs with consideration of the state transition overhead is studied. The problem is non-deterministic polynomial time hard （NP-hard）, and a suboptimal algorithm for the problem is proposed. Simulation results demonstrate that the energy saving of the proposed algorithm is higher than that of state-of-the-art algorithms and approaches the optimum limit.展开更多
文摘A transition diagram is used to describe the behavior of systems. Birth-death equations were derived from transition diagram depicting the state of the birth-death processes. Queue models and characteristics of queue models are also derivable from birth-death processes. These queue models consist of mathematical formulas and relationships that can be used to determine the operating characteristics （performance measures） for a waiting line. Schematic and transition diagrams of different single server queue models were shown. Relationships between birth-death processes, waiting lines （queues） and transition diagrams were given. While M/M/I/K queue model states was limited by K customers and had （K＋I） states, M/M/1/1 queue model had only two states. M/G/1/∝/∝ and M/M/1/∝/∝ shared similar characteristics. Many ideal queuing situations employ M/M/1 queueing model.
文摘针对认知无线电(Cognitive Radio)频谱不连续,随机性和变化性大,以及TDMA,FDMA,CDMA不适用的问题,提出了一个基于变换域通信(Transform Domain Communication System)平台的认知无线电多址接入系统.该系统发射机通过将非空闲的频谱幅度置0,实现对授权用户的躲避;采用m状态序列产生的伪随机相位矢量,生成近似正交的调制基函数实现用户的多址接入;接收端通过本地基函数与接收信号相关估计出原始数据,并理论分析了系统的误码率.仿真表明,系统的检测概率,多址接入的用户数以及收发两端基函数的不一致会影响系统的性能.该系统能利用非连续频谱,并且基函数能够自适应变化,适合认知无线电。
基金This research is supported by the the Scientific Foundation of Jiangsu Province (BK97047) and the Foundation of Jiangsu Education bureau (00KJT11003)
文摘On the basic of a type of practical examples we set up a new queueing model with negative customers. By the use of “Supplemental Variables method” and “State transfer analysis”, we get the generating function with negative powers of queue length and the waiting time expressions.
基金supported by the Ministry of Science, ICT and Future Planning (Korea), the Information Technology Research Center Support Program (No. IITP-2016-H860116-1005)the Research Fund of Hanyang University, Korea (No. HY-2016), and supervised by the Institute for Information & Communications Technology Promotion
文摘In the IEEE 802.16e/m standard, three power saving classes （PSCs） are defined to save the energy of a mobile sub- scriber station （MSS）. However, how to set the parameters of PSCs to maximize the power saving and guarantee the quality of service is not specified in the standard. Thus, many algorithms were proposed to set the PSCs in IEEE 802.16 networks. However, most of the proposed algorithms consider only the power saving for a single MSS. In the algorithms designed for multiple MSSs, the sleep state, which is set for activation of state transition overhead power, is not considered. The PSC setting for real-time connections in multiple MSSs with consideration of the state transition overhead is studied. The problem is non-deterministic polynomial time hard （NP-hard）, and a suboptimal algorithm for the problem is proposed. Simulation results demonstrate that the energy saving of the proposed algorithm is higher than that of state-of-the-art algorithms and approaches the optimum limit.
