无线传感器网络DV-Hop节点定位改进算法

针对无线传感器网络中距离无关类节点定位算法定位误差较大的问题,提出了一种改进型DV-Hop节点定位算法。通过设置待定位节点到信标节点间的最小跳数门限,降低了定位累积误差;改进了平均每跳距离估计方法,并利用信标节点测量的位置误差作为修正值,对每跳距离的估计值进行修正;待定位节点仅选取与之较近的信标节点计算位置,降低了距离误差。仿真结果显示,在信标节点比例和网络节点总数相同的条件下,改进算法性能明显优于DV-Hop算法。     

天基预警系统资源调度问题分析

在介绍天基预警系统作战流程,以及天基预警系统资源和任务的分析和描述的基础上,提出天基预警系统资源调度问题,给出其输入输出结构,并以五元组的形式对该问题进行形式化描述。 关键词：天基预警系统、资源调度、形式化描述     

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014     

THO-MAC:一种两跳优化的低延迟低功耗无线传感器网络介质访问控制协议

功耗与延迟是无线传感器网络介质访问控制协议设计首要考虑的两个问题。提出了一种新的传感器网络低延迟、低功耗、接收节点初始化异步介质访问控制协议——THO-MAC协议。通过准确预测接收节点的唤醒时间,THO-MAC协议调度发送节点侦听信道,从而减少发送节点空闲侦听能量浪费。THOMAC协议在发送节点两跳转发节点集中选择使报文两跳转发延迟最小的转发节点,从而降低报文传输延迟。使用NS2模拟器对THO-MAC协议进行了详细模拟。模拟结果显示,与RI-MAC和Any-MAC协议相比,THOMAC协议可以减少35.5%和18%的报文传输延迟,同时节省23.5%和15.5%的节点功耗。     

巨磁阻传感器在齿轮精细检测中的应用

提出一种利用巨磁阻传感器进行齿轮精细检测的方法,介绍该方法的检测原理和系统组成,从可分辨最小磁场、时间响应和温度特性3个方面分析应用巨磁阻传感器的可行性和有效性,并通过实例测量实现对齿轮的磨损、点蚀等故障的有效检测与诊断.     

LEACH—DRT算法中基于神经网络的数据预测算法

为了保证无线传感器网络中数据的完整性,针对基于LEACH路由协议的动态轮时间算法存在的问题,提出一种基于人工神经网络的数据预测算法。该动态轮时间算法中,部分簇因调整后的轮时间不足以完成数据的采集而丢失数据。数据预测算法结合传感器节点数据具有时空相关性的特点,将时空延迟算子引入神经网络模型,并通过建立的神经网络模型对数据进行预测。仿真时采用伯克利英特尔实验室的传感器数据,通过Mafl软件对模型进行测试并分析仿真结果。实验结果表明：该算法对连续多个数据的预测效果理想,预测误差始终保持在较低水平。     

Review of the ordered and proportionate flow shop scheduling research

Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

An FPTAS for scheduling a two‐machine flowshop with one unavailability interval

We study a deterministic two‐machine flowshop scheduling problem with an assumption that one of the two machines is not available in a specified time period. This period can be due to a breakdown, preventive maintenance, or processing unfinished jobs from a previous planning horizon. The problem is known to be NP‐hard. Pseudopolynomial dynamic programming algorithms and heuristics with worst case error bounds are given in the literature to solve the problem. They are different for the cases when the unavailability interval is for the first or second machine. The existence of a fully polynomial time approximation scheme (FPTAS) was formulated as an open conjecture in the literature. In this paper, we show that the two cases of the problem under study are equivalent to similar partition type problems. Then we derive a generic FPTAS for the latter problems with O(n⁵/ε⁴) time complexity. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Proactive release procedures for just‐in‐time job shop environments,subject to machine failures

In this paper, we consider just‐in‐time job shop environments (job shop problems with an objective of minimizing the sum of tardiness and inventory costs), subject to uncertainty due to machine failures. We present techniques for proactive uncertainty management that exploit prior knowledge of uncertainty to build competitive release dates, whose execution improves performance. These techniques determine the release dates of different jobs based on measures of shop load, statistical data of machine failures, and repairs with a tradeoff between inventory and tardiness costs. Empirical results show that our methodology is very promising in comparison with simulated annealing and the best of 39 combinations of dispatch rules & release policies, under different frequencies of breakdowns. We observe that the performance of the proactive technique compared to the other two approaches improves in schedule quality (maximizing delivery performance while minimizing costs) with increase in frequency of breakdowns. The proactive technique presented here is also computationally less expensive than the other two approaches. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

某特种车辆TTCAN网络的静态调度设计

针对某特种车辆计算机控制系统对实时性的高要求,采用了TTCAN总线系统,为实现TTCAN系统的静态调度问题,提出了基于AL算法的改进算法——谐波周期算法,并通过MATLAB建立了系统的调度表。针对谐波周期算法的不足,结合该计算机控制系统的工作原理、信息传输的重要程度对静态调度表进行了适当的修改。通过与AL算法的对比分析,证实了改进的谐波周期算法在保证系统中周期型消息实时性能前提下,为非周期型信息获得了更大的传输带宽,又使系统信息传输的时间分配更加合理。