针对传统病房呼叫系统结构复杂、施工难度大、扩展能力差等问题,设计了一款新型病房呼叫系统,该系统采用电力线进行数据传输。详细描述了电力线载波数据通信原理,依据系统实际功能需要对系统硬件电路和软件程序进行了设计,并设计了相关...针对传统病房呼叫系统结构复杂、施工难度大、扩展能力差等问题,设计了一款新型病房呼叫系统,该系统采用电力线进行数据传输。详细描述了电力线载波数据通信原理,依据系统实际功能需要对系统硬件电路和软件程序进行了设计,并设计了相关硬件电路进行实验测试。试验结果表明:所开发的基于PLC(Power Line Carrier)的病房呼叫系统具有电路设计简单、操作便利、组网容易等优点,能够满足医疗系统的各项技术要求。展开更多
This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can ...This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can be satisfied only if there is sufficient bandwidth available during resource scheduling and allocation. Unsatisfied requests were held in a queue. The metric of bandwidth utilization ratio was used to quantify the performance of our algorithms. By theoretical analysis, our algorithms can improve the average bandwidth usage ratio significantly, about 8%~10% without adding much computation complexity. Moreover, our algorithms outperform next fit with fragmentation (NFF) algorithm when the bandwidth resource is scarce. In this paper, the contributions follows: Introducing bandwidth packing problem into wireless network; Proposing two new bandwidth packing algorithms for wireless network where the complicate scheduling algorithms are prohibited; Studying the average performance of our algorithms mathematically, which agree well with the simulation results.展开更多
文摘针对传统病房呼叫系统结构复杂、施工难度大、扩展能力差等问题,设计了一款新型病房呼叫系统,该系统采用电力线进行数据传输。详细描述了电力线载波数据通信原理,依据系统实际功能需要对系统硬件电路和软件程序进行了设计,并设计了相关硬件电路进行实验测试。试验结果表明:所开发的基于PLC(Power Line Carrier)的病房呼叫系统具有电路设计简单、操作便利、组网容易等优点,能够满足医疗系统的各项技术要求。
文摘This paper presents a detail analysis of two bandwidth packing algorithms, used for processing connection requests in the centralized wireless network. Each call comes with a specific bandwidth request. A request can be satisfied only if there is sufficient bandwidth available during resource scheduling and allocation. Unsatisfied requests were held in a queue. The metric of bandwidth utilization ratio was used to quantify the performance of our algorithms. By theoretical analysis, our algorithms can improve the average bandwidth usage ratio significantly, about 8%~10% without adding much computation complexity. Moreover, our algorithms outperform next fit with fragmentation (NFF) algorithm when the bandwidth resource is scarce. In this paper, the contributions follows: Introducing bandwidth packing problem into wireless network; Proposing two new bandwidth packing algorithms for wireless network where the complicate scheduling algorithms are prohibited; Studying the average performance of our algorithms mathematically, which agree well with the simulation results.
