共查询到18条相似文献,搜索用时 0 毫秒
1.
A coded wavelength division multiplexing passive optical network (WDM PON) is presented for fiber to the home (FTTH) systems to protect against eavesdropping. The proposed scheme applies spectral amplitude coding (SAC) with a unipolar maximal-length sequence (M-sequence) code matrix to generate a specific signature address (coding) and to retrieve its matching address codeword (decoding) by exploiting the cyclic properties inherent in array waveguide grating (AWG) routers. In addition to ensuring the confidentiality of user data, the proposed coded-WDM scheme is also a suitable candidate for the physical layer with connection anonymity. Under the assumption that the eavesdropper applies a photo-detection strategy, it is shown that the coded WDM PON outperforms the conventional TDM PON and WDM PON schemes in terms of a higher degree of connection anonymity. Additionally, the proposed scheme allows the system operator to partition the optical network units (ONUs) into appropriate groups so as to achieve a better degree of anonymity. 相似文献
2.
针对建筑施工电梯的工作需要,采用先进的编/译码器,研制成一种结构新颖、操作方便、成本低廉的N∶1无线呼叫通讯系统。文章介绍了系统的功能要求及各组成部分的设计原理。接收系统使用4片MC145027,可译出64个楼层的呼梯信号。由于设计了一种独特的发射互锁环,有效地解决了多个楼层同时呼梯的冲突问题。本系统可用于建筑施工及其它场合。 相似文献
3.
4.
5.
ZHU Jiang WEI Ning XU Binyang LI Shaoqian 《电子学报:英文版》2008,(4):726-732
We propose a cross-layer optimal access and transmission framework for dynamic spectrum access to maximize expected long-term average throughput under power and collision constraints by a dynamic programming method namely Constrained Markov decision process (CMDP). The optimal policy for CMDP is capable of guiding transmitter to choose an available channel and transmission rate at the beginning of each frame for its long-term goals according to current channel sensing results and prior channel fading information. The complexity of finding the optimal policy by Linear programming (LP) approach increases exponentially with the number of channels and fading levels, which incurs so-called curse of dimensionality. Therefore we propose two complexity- reduced suboptimal policies, namely, policy separation and heuristic algorithms. Finally, we compare the performances of policies by numerical results. 相似文献
6.
A motion segmentation framework that effectively exploited the multiple sources of image information and fused these sources of the information synergisti-cally was proposed to serve the purpose of motion segmen- tation. A Markov process was formulated for motion seg- mentation in which two feature spaces were established to estimate the state transition Probability density function (PDF) and the initial state, respectively. An information fusion space was developed such that each motion struc-ture was described as a single distribution in this space. The proposed framework can naturally embed the evolution equations of the active contour methods into the seg-mentation to achieve contour-based segmentation results. Extensive empirical evaluations demonstrate the robust-ness and the promise of this framework. 相似文献
7.
《电子学报:英文版》2024,33(6)
This paper proposes a Markov decision process based service migration algorithm to satisfy quality of service(QoS)requirements when the terminals leave the original server.Services were divided into real-time services and non-real-time services,each type of them has different requirements on transmission bandwidth and latency,which were considered in the revenue function.Different values were assigned to the weight coefficients of QoS par-ameters for different service types in the revenue and cost functions so as to distinguish the differences between the two service types.The overall revenue was used for migration decisions,rather than fixed threshold or instant revenue.The Markov decision process was used to maximize the overall revenue of the system.Simulation results show that the proposed algorithm obtained more revenue compared with the existing works. 相似文献
8.
9.
Ben-Jye Chang 《Telecommunication Systems》2006,33(4):333-352
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for
achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each
accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic
rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long
handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost
of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher
Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose
herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce
the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed
approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments.
Meanwhile, the optimal number of rake combiners is also analyzed in this paper.
This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018. 相似文献
10.
Rojin Naseri Mohammad Abdollahi Azgomi Ali Naghash Asadi 《International Journal of Communication Systems》2024,37(5):e5686
The cloud computing systems, such as the Internet of Things (IoT), are usually introduced with a three-layer architecture (IoT-Fog-Cloud) for the task offloading that is a solution to compensate for resource constraints in these systems. Offloading at the right location is the most significant challenge in this field. It is more appropriate to offload tasks to fog than to cloud based on power and performance metrics, but its resources are more limited than the resources of the cloud. This paper tries to optimize these factors in the fog by specifying the number of usable servers in the fog. For this purpose, we model a fog computing system using the queueing theory. Furthermore, binary search and reinforcement learning algorithms are proposed to determine the minimum number of servers with the lowest power consumption. We evaluate the cost of the fog in different scenarios. By solving the model, we find that the proposed dispatching policy is very flexible and outperformed the known policies by up to 31% and in no case is it worse than either of them, and the overall offloading cost increases when fog rejects tasks with a high probability. Our offloading method is more effective than running all fog servers simultaneously, based on simulation results. It is evident from the similarities between the simulation results and those derived from the analytical method that the model and results are valid. 相似文献
11.
Traffic management is a highly beneficial mechanism for satisfying quality‐of‐service requirements and overcoming the resource scarcity problems in networks. This paper introduces an optimal connection admission control mechanism to decrease the packet loss ratio and end‐to‐end delay in cognitive radio sensor networks (CRSNs). This mechanism admits data flows based on the value of information sent by the sensor nodes, the network state, and the estimated required resources of the data flows. The number of required channels of each data flow is estimated using a proposed formula that is inspired by a graph coloring approach. The proposed admission control mechanism is formulated as a semi‐Markov decision process and a linear programming problem is derived to obtain the optimal admission control policy for obtaining the maximum reward. Simulation results demonstrate that the proposed mechanism outperforms a recently proposed admission control mechanism in CRSNs. 相似文献
12.
Optical Burst Switching (OBS) has been proposed as a promising switching technology for the next generation of optical transport networks. In this paper, we address the issue of how to provide proportional differentiated services in OBS networks. Firstly, a Dynamic Wavelength Selection (DWS) scheme is introduced to provide proportional differentiated services in bufferless OBS networks by dynamically assigning more and longer periods of wavelengths to high priority classes. This scheme can also utilize wavelengths efficiently because the wavelengths are shared among different classes. Next, a Delayed Burst Assignment (DBA) scheme is introduced, by which bursts of the high priority class are given a higher probability for reserving wavelengths by scheduling the bursts of the low priority class with a delay to provide quality of service (QoS) in OBS networks. The integration of these two schemes provides proportional differentiated services and improves the burst loss performance by giving the burst head packet (BHP) two opportunities of scheduling its data burst (DB). 相似文献
13.
针对嵌入式设备互连环境和嵌入式通信中间件的特点,结合马尔可夫决策过程理论,建立了解决路由问题的有限阶段模型,并修改马尔可夫有限阶段模型的向后递归迭代算法,提出了马尔可夫有限阶段决策路由算法MFHDR(Markov Finite Horizon Decision Routing).该算法具有分布计算和自我学习的特性,从而降低了单台嵌入式设备的工作强度,均衡了各台设备的负载,具有较好的时间和空间复杂度,并且能够有效的避免环路的产生. 相似文献
14.
视情维修可以根据设备工作状况安排预防性维修措施,是解决退化失效问题、保证设备可用度的有效途径。以无人机核心部件为研究对象,将部件在运行中发生的缓慢劣化过程,划分为若干个性能劣化状态。利用连续时间马尔可夫链理论建立状态维修及更换策略模型。以设备的稳态最大可用度为决策指标,同时考虑相邻两个阶段的平均劣化时间、平均检测时间、平均预防性维修时间以及更换部件时间等因素的影响。根据马氏过程平稳状态下的统计平衡原理,采用递归求解的算法对模型进行求解,最终确定系统最优检测频率、视情维修阈值和更换策略。实验结果表明,该模型能有效描述设备的劣化过程,实现设备维修优化。 相似文献
15.
16.
Fog computing has already started to gain a lot of momentum in the industry for its ability to turn scattered computing resources into a large-scale, virtualized, and elastic computing environment. Resource management (RM) is one of the key challenges in fog computing which is also related to the success of fog computing. Deep learning has been applied to the fog computing field for some time, and it is widely used in large-scale network RM. Reinforcement learning (RL) is a type of machine learning algorithms, and it can be used to learn and make decisions based on reward signals that are obtained from interactions with the environment. We examine current research in this area, comparing RL and deep reinforcement learning (DRL) approaches with traditional algorithmic methods such as graph theory, heuristics, and greedy for managing resources in fog computing environments (published between 2013 and 2022) illustrating how RL and DRL algorithms can be more effective than conventional techniques. Various algorithms based on DRL has been shown to be applicable to RM problem and proved that it has a lot of potential in fog computing. A new microservice model based on the DRL framework is proposed to achieve the goal of efficient fog computing RM. The positive impact of this work is that it can successfully provide a resource manager to efficiently schedule resources and maximize the overall performance. 相似文献
17.
In order to achieve the Quality of Service (QoS) provisioning and efficient resource utilization in cellular network and Wireless Local Area Network (WLAN) integration, an Integrated Service-Based Call Admission Control (ISB-CAC) scheme is proposed in this paper. The integrated network is modeled by using multi-dimensional Markov chains. The numerical analysis is presented to evaluate the important performance measures such as the blocking probability of originating calls, the dropping probability, and the average transfer time, etc. The steady-state probabilities of the multi-dimensional Markov chains are obtained by using an iterative approach, and the CAC parameters are optimally designed. The analytical model is validated by the computer simulation. It is shown that compared with the conventional WLAN-First Call Admission Control (WF-CAC) scheme, the proposed ISB-CAC scheme not only provides better QoS for mobile users but also utilizes the bandwidth resources more efficiently. 相似文献
18.
WANG Yu-bao LIN Jin-tongBeijing University of Posts Telecommunications Beijing P.R. China 《中国邮电高校学报(英文版)》2005,12(1)
1 Introduction Recently, considerable interest has been focused on Opti cal Code Division Multiple Access (OCDMA)[1~15], be cause of the advantages of flexible bandwidth management,asynchronous access, and the potential network scalabilityetc. In an OCDMA system, many users can simultaneouslyshare the same channel through the allocation of specific ad dress codes. All users signals are transmitted by the sameoptical fiber channel. At the receiver end, the matched de coder can re… 相似文献