基于服务曲线的TDMA无线网络上行信道时隙调度算法

研究了采用TDMA接入方式的无线分组网络上行信道时隙分配策略,基于移动台的QoS要求,提出了一种自适应时隙分配算法。利用服务曲线对移动台的QoS要求进行了建模。算法的目标是在尽量满足所有移动台Qos要求的基础上提高系统的上行吞吐量。在无法满足所有移动台QoS要求的情况下,使得移动台实际发送的数据与满足服务曲线要求之间的偏差最小。仿真结果表明：该算法能够在系统吞吐量和系统偏差之间进行折衷,从而有效地平衡上述两个目标。     

GSM网络优化实战与探讨

设计并实现了一种多网元数据采集方案,实时获取GSM网络中各网元的性能数据：提出使用快速增量更新算法来处理网络性能数据,提高了数据处理的效率;同时提出将GSM网个时隙资源只分配给一个用户使用,提出一种基于低相关度训练序列设计（TSC）的多用户同时隙复用技术,从而显著增加全球移动通信系统（GSM）的网络容量,实现对GSM网络的优化。     

基于图着色理论的异构车联网时隙分配方案

针对异构车联网系统车辆较多导致时隙分配困难的问题,提出了一种基于图着色理论的时隙分配方案。该方案以考虑两跳内节点的图为模型,通过图着色的方法分配时隙,有效降低了隐藏终端带来的丢包;另外给出了一种高效实用的时隙重用分配算法。该算法根据度定义权值以确定车辆分配时隙数目,保证了公平性,提高了时隙重用,进而提高了消息发送的可靠性,同时也适用于网络拓扑多变的车联网场景。仿真结果表明,在车辆数为200、时隙数为100时,与传统时隙分配方法相比,该方案的车辆平均收包率获得大幅提升。此外,随着时隙重用的增加,车辆间干扰增强,从而导致平均收包率降低。研究还发现,增加车辆发射功率时,由于接收端信干噪比先增加后趋于不变,所以平均收包率也先增加后趋于不变。     

基于3E均衡的CDM GDP机场时隙分配

为了科学合理利用机场时隙资源、降低航班延误损失,本文研究适合我国的CDM GDP时隙分配机制与方法。提出按工效分配的原则,给出了一种有效性、工效性和公平性均衡的CDM GDP时隙分配优化模型;并引入具体的评价指标量化分析航空公司之间延误分配的公平性。模型采用遗传算法予以实现。实例仿真结果表明,模型的工效性和公平性均比RBS算法有所提高,从而验证了其有效性。     

无线传感器网络的流量自适应分簇算法协议

在分析LEACH路由协议算法的缺点的基础上,提出了一种用于无线传感器网络的基于流量自适应的TDMA分簇算法协议.该协议根据当前节点数据流量的变化,自适应地调整该节点在其簇内通信的时隙长度,减少节点空闲时消耗的能量和节点从睡眠到活跃状态来回切换的能量.仿真实验结果表明,与LEACH协议簇内时隙分配算法相比,运用这种新的时隙分配算法,可以节省节点的能量,提高网络的生存时间,改善网络性能.     

面向多媒体业务的无线ATM多址接入协议

基于MDR-TDMA（Multi-service Dynamic Reservation-TDMA）的无线ATM多址接入控制协议包括两个主要的过程，即请求报文的信息时隙的分配过程，对于前者，通过基于帧的自适应伪贝叶斯ALOHA算法，在保证请求报文最优吞吐率的条件下，实现了不同优先级的请求报文接入。对于后者，着重分析了以视频会议为模型的VBR业务的带宽分配，提出了一种新的带宽分配方法-Minmax算法，并将它的仿真结果与线性比例算法进行比较。     

试论CDMA系统动态信道分配技术

在CDMA系统中,动态信道分配技术对于整个系统的正常运行起到了非常重要的作用,在资源分配方面,充分考虑所需的RU数量、干扰情况和业务的QoS要求等几个方面因素的基础上,采用动态信道分配。同时以,DCA是TDD系统的优势所在,也能灵活地分配时隙资源,动态地调整上下行时隙的个数,从而可以灵活地支持对称及非对称的业务。本文主要研究了CDMA系统动态信道分配技术全过程,及其CDMA系统的快速动态信道分配,对于CDMA系统动态信道分配研究,起到了非常重要的作用。     

802.15.4规范的增强型保障时隙通信协议的研究

针对IEEE 802.15.4-2006标准的保障通信时隙(GTS)分配机制存在系统容量低和传输时延大的不足,提出了增强型的GTS方案。该方案设计了新的GTS分配算法,以支持端设备之间的直接端对端通信;将原标准中的单信道分配算法扩展为多信道分配算法,以充分利用物理层规范提供的多信道资源;设计了GTS通信维护算法,以增强系统的可靠性。理论分析和仿真结果均表明,该方案可将相邻端对端设备之间的平均传输时延减少到原标准的1/3,系统容量最大可以扩展2N倍(N为系统数据信道数),且增加的网络开销可接受。     

基于FDMA系统的两跳中继网络的资源分配

首先介绍了一种可用于两跳中继网络的时分模式帧结构,然后基于该帧结构提出了一种资源分配算法.该算法包括两个步骤:第一个步骤是第一个时隙上的动态资源分配,第二个步骤是基站与中继站之间的最优化功率分配.两跳中继网络中下行存在三种链路:"基站-中继"链路、"基站-用户"链路和"中继-用户"链路,在系统资源有限的条件下,通过所提算法为这三种链路分配相应的带宽和功率,可以使得系统的吞吐量最大.仿真结果表明所提算法能够有效地提高系统的吞吐量.     

智能包装中的RFID标签防碰撞算法研究

目的 解决目前物流系统中智能包装RFID标签冲突的问题。方法 在研究已有防碰撞算法的性能和缺点基础上,针对大量标签场景设计一种分组动态帧时隙的混合查询树（GDFSA-HQT）算法。该算法在每一轮识别之后估计还没有识别的标签数量,如果还没有识别的标签数量小于或等于354个,则先采用动态帧时隙ALOHA（DFSA）算法对标签进行识别,再采用混合树查询算法（HQT）进行标签识别;若未被识别标签数大于354个,则先对标签进行分组处理,再分别采用DFSA和HQT进行标签识别。结果 仿真实验表明,GDFSA-HQT算法的吞吐率能够保持在0.82左右。结论 GDFSA-HQT算法解决了标签碰撞问题,在大量智能包装的物流系统中具有良好的应用前景。     

基于空闲时间分配的电压调节策略

为了求解考虑系统能耗的实时动态电压调节（DVS）问题，提出了基于空闲时间分配算法（STDA）的DVS策略，该策略以时间片为单位逐步把所有空闲时间分配给各个任务，且每个时间片都被分配给产生能量减少量最大的任务。分析指出，当时间片大小设置合适时，STDA算法的能耗接近于DVS问题的最小能耗。仿真实验结果表明，对于仅考虑处理器能耗的DVS问题，STDA算法的能耗和最优策略的能耗相近；而对于考虑系统能耗的DVS问题，STDA算法减少能耗的效果要优于其他现有DVS策略。     

Dual-broadband multistandard printed slot antenna with a composite back-patch

A square slot antenna fed by a coplanar waveguide for dual-band multistandard applications is presented. Printed on the back of the square slot is a composite patch formed by an annular metal ring inscribed by a circular patch. Appropriate design of the composite back-patch resulted in five resonant bands, the first (last) two of which were combined to form a lower (upper) operating band. The ratio of the two operating band centre frequencies can be tuned larger than 2.5. A pair of notches was embedded in the annular metal ring to further broaden the lower (upper) operating band up to a fractional bandwidth of 37% (20%). The measured results indicate that the proposed antenna can cover the frequency bands of the following wireless communication standards: digital communication system, personal communication services, universal mobile telecommunications system and 2.4/5-GHz wireless local-area networks.     

基于遗传算法的移动终端交互界面布局优化

目的研究遗传算法与移动终端界面布局中舒适度影响最大子集特征之间的关系。方法利用层次分析法进行了三维及二维共同协作的人机约束条件,选择交互界面中布局的特征,找出对交互界面布局中人的最优舒适度影响最大的子集特征。结论通过对案例的可用性测试分析数据并得出移动终端交互界面布局优化设计的要点。     

Optimal Coverage Multi-Path Scheduling Scheme with Multiple Mobile Sinks for WSNs

Wireless Sensor Networks (WSNs) are usually formed with many tiny sensors which are randomly deployed within sensing field for target monitoring. These sensors can transmit their monitored data to the sink in a multi-hop communication manner. However, the ‘hot spots’ problem will be caused since nodes near sink will consume more energy during forwarding. Recently, mobile sink based technology provides an alternative solution for the long-distance communication and sensor nodes only need to use single hop communication to the mobile sink during data transmission. Even though it is difficult to consider many network metrics such as sensor position, residual energy and coverage rate etc., it is still very important to schedule a reasonable moving trajectory for the mobile sink. In this paper, a novel trajectory scheduling method based on coverage rate for multiple mobile sinks (TSCR-M) is presented especially for large-scale WSNs. An improved particle swarm optimization (PSO) combined with mutation operator is introduced to search the parking positions with optimal coverage rate. Then the genetic algorithm (GA) is adopted to schedule the moving trajectory for multiple mobile sinks. Extensive simulations are performed to validate the performance of our proposed method.     

Multi-Criteria Fuzzy-Based Decision Making Algorithm to Optimize the VHO Performance in Hetnets

Despite the seemingly exponential growth of mobile and wireless communication, this same technology aims to offer uninterrupted access to different wireless systems like Radio Communication, Bluetooth, and Wi-Fi to achieve better network connection which in turn gives the best quality of service (QoS). Many analysts have established many handover decision systems (HDS) to enable assured continuous mobility between various radio access technologies. Unbroken mobility is one of the most significant problems considered in wireless communication networks. Each application needs a distinct QoS, so the network choice may shift appropriately. To achieve this objective and to choose the finest networks, it is important to select a best decision making algorithm that chooses the most effective network for every application that the user requires, dependent on QoS measures. Therefore, the main goal of the proposed system is to provide an enhanced vertical handover (VHO) decision making program by using a Multi-Criteria Fuzzy-Based algorithm to choose the best network. Enhanced Multi-Criteria algorithms and a Fuzzy-Based algorithm is implemented successfully for optimal network selection and also to minimize the probability of false handover. Furthermore, a double packet buffer is utilized to decrease the packet loss by 1.5% and to reduce the number of handovers up to 50% compared to the existing systems. In addition, the network setup has an optimized mobility management system to supervise the movement of the mobile nodes.     

PLANNING TIMELY ARRIVALS TO A STOCHASTIC PRODUCTION OR SERVICE SYSTEM

A stochastic planning problem of determining the optimal arrival times for N customers, each to be assigned to one of K equal time slots, is considered. The objective is to minimize the total system cost, which is composed of the customer waiting cost and the server availability cost. This optimal arrival schedule is examined for a single server system with either exponential or Erlang-fc service time distribution.

Two versions of this planning arrival problem are considered, a dynamic version and a static version. The dynamic problem requires planning decisions to be made at the beginning of each time slot, while in the static problem all decisions must be made at the beginning of the first time slot. The dynamic problem is solved by dynamic programming. The structure of the optimal dynamic policy is identified and used to solve the dynamic problem efficiendy. A branch-and-bound algorithm, which uses the solution to the dynamic problem, is developed to solve the static problem. The results can be used to schedule material deliveries, work-in-process flows, appointments, or other similar systems.     

An Optimized Algorithm for Resource Allocation for D2D in Heterogeneous Networks

With the emergence of 5G mobile multimedia services, end users’ demand for high-speed, low-latency mobile communication network access is increasing. Among them, the device-to-device (D2D) communication is one of the considerable technology. In D2D communication, the data does not need to be relayed and forwarded by the base station, but under the control of the base station, a direct local link is allowed between two adjacent mobile devices. This flexible communication mode reduces the processing bottlenecks and coverage blind spots of the base station, and can be widely used in dense user communication scenarios such as heterogeneous ultra-dense wireless networks. One of the important factors which affects the quality-of-service (QoS) of D2D communications is co-channel interference. In order to solve this problem of co-channel interference, this paper proposes a graph coloring based algorithm. The main idea is to utilize the weighted priority of spectrum resources and enables multiple D2D users to reuse the single cellular user resource. The proposed algorithm also provides simpler power control. The heterogeneous pattern of interference is determined using different types of interferences and UE and the priority of color is acquired. Simulation results show that the proposed algorithm effectively reduced the co-channel interference, power consumption and improved the system throughput as compared with existing algorithms.     

Magnetically induced vibration in a permanent-magnet brushless DC motor with symmetric pole-slot configuration

The paper reports a numerical and experimental study of magnetically induced vibration associated with rotor/stator eccentricity and imperfect magnetization for 8-pole 6-slot symmetric brushless dc (BLDC) motors. Magnetic forces and cogging torque are calculated for various slot angles by using the finite-element method (FEM). The results show that there is an optimal slot angle for minimum cogging torque, but this slot angle is not optimal for reducing magnetic forces. In the idle acoustics test, the motors with reduced magnetic forces show clear reduction at the expected frequencies while the motors with minimum cogging torque show no change at the cogging torque frequency, which implies unbalanced magnetic forces have greater effect on actual vibration of the spindle motor than cogging torque. The results show that the proper direction in motor design is to reduce unbalanced magnetic forces when both cogging torque and unbalanced magnetic forces are not achievable simultaneously.