Dynamic routing of real-time jobs among parallel EDF queues: A performance study

This paper introduces an analytical method for approximating the performance of a firm real-time system consisting of a number of parallel infinite-capacity single-server queues. The service discipline for the individual queues is earliest-deadline-first (EDF). Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. Jobs either all have deadlines until the beginning of service or deadlines until the end of service. Upon arrival, a job joins a queue according to a state-dependent stationary policy, where the state of the system is the number of jobs in each queue. Migration among the queues is not allowed. An important performance measure to consider is the overall loss probability of the system. The system is approximated by a Markovian model in the long run. The resulting model can then be solved analytically using standard Markovian solution techniques. Comparing numerical and simulation results for at least three different stationary policies, we find that the existing errors are relatively small.     

Signal strength based routing for power saving in mobile ad hoc networks

The transmission bandwidth between two nodes in mobile ad hoc networks is important in terms of power consumption. However, the bandwidth between two nodes is always treated the same, regardless of what the distance is between the two nodes. If a node equips a GPS device to determine the distance between two nodes, the hardware cost and the power consumption increase. In this paper, we propose using a bandwidth-based power-aware routing protocol with signal detection instead of using GPS devices to determine the distance. In our proposed routing protocol, we use the received signal variation to predict the transmission bandwidth and the lifetime of a link. Accordingly, the possible amount of data that can be transmitted and the remaining power of nodes in the path after data transmission can be predicted. By predicting the possible amount of data that can be transmitted and the remaining power of nodes after data transmission, we can design a bandwidth-based power-aware routing protocol that has power efficiency and that prolongs network lifetime. In our simulation, we compare our proposed routing protocol with two signal-based routing protocols, SSA and ABR, and a power-aware routing protocol, MMBCR, in terms of the throughput, the average transmission bandwidth, the number of rerouting paths, the path lifetime, the power consumed when a byte is transmitted, and the network lifetime (the ratio of active nodes).     

一种基于区域访问概率的容迟网络路由算法

延迟容忍网络泛指没有稳定端到端传输路径的无线网络,广泛应用于太空网络、乡村网络、移动传感网络、Ad hoc网络等等,具有重要的研究意义.其路由问题极具挑战性,是当前的一个研究热点.本文针对基于区域单元(Cell)移动模型的延迟容忍网络,提出一个基于区域访问概率的路由算法--PROAREA算法.已有的算法主要通过节点间的相遇概率来指导路由决策,而PROAREA算法则通过各节点访问区域单元的概率估算出了节点间数据传输的期望延迟,从而能够直接使用期望延迟来指导路由决策,具有更好的效果.实验结果表明,与延迟容忍网络中的Epidemic算法和PROHET算法相比,PROAREA算法的传输成功率平均提高了15%和6.95%,而平均传输延迟平均降低了46.7%和40.2%.     

分布式蚁群QoS组播路由算法

为寻找满足带宽、延迟等约束的最小代价组播路由树的QoS组播路由,提出一种分布式蚁群优化算法。在蚂蚁行动过程中形成组播树的森林。若在某步结束时森林中仅剩1棵树,则蚂蚁达到目标,停止行动。仿真实验结果表明,该算法在结果和收敛速度方面都有良好的表现。     

一种能量有效的WSN分簇路由算法

针对无线传感器网络(WSN)中的热区问题,提出一种能量有效的WSN分簇路由算法EERA。以基站为圆心将整个感知区域划分为大小不等的圆环,依据节点剩余能量和相对位置选择簇首。簇间采用多跳路由传输数据,路由构建时考虑节点接收和发送数据能耗,将发送距离限制在阈值之内且尽量减少中转次数,簇首节点在稳定传输阶段动态改变转发路径。仿真结果表明,EERA能有效降低网络能耗,均衡网络节点的能耗,延长网络生命周期。     

能量感知的无线传感器网络路由协议

在无线传感器网络(WSN)中,如何实现数据转发的高效节能是WSN路由协议的核心问题。在LEPS路由协议基础上,引入能量感知机制,结合扩散延时方法提出EALB路由协议。通过仿真实验验证了EALB能有效减少冗余数据的发送,达到节能和节点间负载均衡、延长网络寿命的目的。     

HPMR系统KV路由算法设计

提出一种针对HPMR系统的KV路由算法。HPMR系统是MapReduce模型的一个实现,改进了MapReduce模型以适应高性能计算的需求。HPMR的KV路由算法生成KV路由表,所有数据的收发动作将依据该路由表进行。KV路由算法产生的KV路由表直接决定HPMR系统在通信阶段的时间开销。实验结果表明,该KV路由算法产生的KV路由表可以提高HPMR系统的通信性能。     

基于NS2的AOMDV路由协议的改进与性能仿真

对AOMDV协议进行了分析,指出了协议存在的不足,利用“一主一备”式路由和抢先式路由对其进行了改进,提出了PAOMDV协议。对NS2（Network Simulator Version2）的分裂对象模型进行了分析,基于NS2实现了AOMDV及PAOMDV路由协议的扩展与仿真。仿真结果表明：在相同的网络环境下,与AOMDV协议相比,PAOMDV协议减少了平均时延、降低了路由发现频率、提高了分组传送率。     

PRST-Chord:基于Chord的低延时查询改进算法

针对目前Chord协议中逻辑覆盖网与底层物理拓扑不匹配的问题,提出了一种改进算法PRST-Chord(proximity routing selection and topology-based Chord).该算法基于底层的拓扑信息来构造节点标识,使得物理上相邻的节点在逻辑上也尽可能相邻,同时修改了Chord的查询算法,通过预测节点问的网络延时优化下一跳节点的路由选择.仿真实验结果表明,改进算法有效地降低了查询延时,提高了资源定位的性能.     

容迟与容断网络中的路由协议

作为一种新型的端到端存储转发网络体系结构,容迟与容断网络(delay and disruption tolerant network)具有间歇连接、频繁割裂、时延极高、非对称的数据速率、较高的误码率、异构互连等特点,传统的Internet、移动Ad Hoc网络和传感网的路由协议难以有效应用在容迟与容断网络中,容迟与容断网络路由面临新的挑战.在简要介绍了容迟与容断网络的基本特性和路由协议设计挑战之后,提出了路由协议评估指标.然后从单播路由、组播路由和选播路由3个方面介绍了容迟与容断网络路由协议的研究进展,最后对主要路由协议进行了综合比较,并指出了未来的研究方向.