作者机构：
[Wu, Libing; Cao, Shuqin; Chen, Yanjiao] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China.;[Wu, Libing] Wuhan Univ, Sch Cyber Sci & Engn, Wuhan, Peoples R China.;[Wu, Libing] Wuhan Univ, Shenzhen Res Inst, Wuhan, Peoples R China.;[Cui, Jianqun; Chang, Yanan] Cent China Normal Univ, Sch Comp, Wuhan, Peoples R China.
通讯机构：
[Libing Wu] S;School of Computer Science, Wuhan University, Wuhan, 430072, China<&wdkj&>School of Cyber Science and Engineering, Wuhan University, China<&wdkj&>Shenzhen Research Institute of Wuhan University, China
摘要：
机会网络中的通信设备大多是随着时间的流逝而进行移动的,然而节点之间的移动路径又具有一定的重复性.因此,可以记录节点移动时与之相遇的节点之间的信息,利用该信息对路由算法做出更合理的决策.本文根据节点之间的相遇历史信息,提出了一种基于节点相似率的概率路由算法（Probabilistic routing algorithm based on node similarity rate,S-Prophet）,对传统的Prophet算法的预估节点传输概率阶段进行改进.首先统计网络中节点与其他节点的相遇集合,定义节点相似率,设计一个新的节点投递概率公式,并根据节点相遇持续时间对Prophet路由算法的概率衰减公式进行改变,最后,通过仿真实验验证SProphet的有效性.
作者机构：
[Cui, Jianqun; Cao, Shuqin; Chang, Yanan] Cent China Normal Univ, Comp Sch, Wuhan 430079, Hubei, Peoples R China.;[Wu, Libing] Wuhan Univ, Comp Sch, Wuhan 430072, Hubei, Peoples R China.;[Liu, Dan] Wuhan Univ Technol, Sch Comp Sci & Technol, Wuhan 430070, Hubei, Peoples R China.;[Yang, Yi] Fontbonne Univ, Dept Math & Comp Sci, St Louis, MO 63105 USA.
通讯机构：
[Chang, Yanan] C;[Wu, Libing] W;Cent China Normal Univ, Comp Sch, Wuhan 430079, Hubei, Peoples R China.;Wuhan Univ, Comp Sch, Wuhan 430072, Hubei, Peoples R China.
关键词：
Connection strength;delay tolerant network;message handling capacity;quality of node;spray and wait
摘要：
The Internet of Things is one of the new emerging application domains that require delay tolerant network (DTN) support, where an end-to-end path between the source and the destination may not always exist. Due to the intermittent connectivity of DTN, the design of an efficient routing algorithm is the main challenge. In this paper, we first define a metric called message handling capacity to determine the ability of a node to forward messages. Then, we introduce a concept called connection strength to reflect the connection time between nodes and then integrate the concept into delivery predictability used by Prophet to determine the chance of a node completely delivering a message to the destination. Subsequently, we present a metric called quality of node (QoN), which is calculated by combining the relative weights of the message handling capacity and the improved delivery predictability. Finally, we present an adaptive spray and wait routing algorithm based on QoN (QoN-ASW). The QoN-ASW adaptively allocates the number of message copies between the encountered nodes according to the proportion of quality of node in the spray phase, which avoids the blindness of replica distribution. In addition, a forwarding scheme is implemented in the wait phase, which takes full advantage of encounter opportunities. In the simulation, we demonstrate the efficiency of integrating the connection strength into delivery predictability and compare the QoN-ASW with four existing DTN routing algorithms from four aspects. The simulation results show that the QoN-ASW can significantly improve the delivery rate and reduce the average delay while achieving a relatively low overhead.
关键词：
improved brainstorm optimization;Vehicle routing problem with soft time window
摘要：
In this paper, we propose a novel ant colony optimization algorithm based on improved brainstorm optimization (IBSO-ACO) to solve the vehicle routing problem with soft time windows. Compared with the traditional ant colony algorithm, the proposed IBSO-ACO can better address the local optimum problem, since we have carefully designed an improved brainstorming optimization algorithm to update the solutions obtained by the ant colony algorithm, which enhance the solution diversity and the global search ability. Furthermore, we use the classification method to accelerate the convergence of the proposed algorithm. The extensive experimental results have confirmed that the proposed IBSO-ACO algorithm can achieve a lower routing cost at a high convergence rate than the traditional ant colony algorithm and the simulated annealing ant colony algorithm.
摘要：
组播技术从IP组播到应用层组播的发展,解决了IP组播部署困难的问题.应用层组播采用终端主机转发数据的方式,在一对多的媒体内容分发方面具有广阔的应用前景.由于终端主机灵活性高,可随意退出组播树,在传输数据时易中断的特点,因此需要解决应用层组播的稳定性问题.首先分析了影响应用层组播稳定的三个因素:节点的转发能力、稳定状态和节点间通信延时.其次根据这些约束条件抽象出T-DTD(Spanning tree based on degree-constrained,max on-session time and depth bound for ALM)模型,最后给出稳定度因子在T-DTD下的表达形式,并据此提出一种适用T-DTD模型下的DTD-H(DTD-heuristic)算法,模拟实验证明该算法在降低平均时延、最大延时和提高稳定度方面有明显作用.
作者：
Cui, Jianqun*;Ma, Liang;Gao, Kuan;Wu, Libing;Yang, Yi
期刊：
JOURNAL OF INTERNET TECHNOLOGY,2018年19(5):1425-1434 ISSN：1607-9264
通讯作者：
Cui, Jianqun
作者机构：
[Cui, Jianqun; Gao, Kuan] Cent China Normal Univ, Sch Comp, Wuhan, Hubei, Peoples R China.;[Ma, Liang] Cent China Normal Univ, Middle Sch 1, Wuhan, Hubei, Peoples R China.;[Wu, Libing] Wuhan Univ, Sch Comp, Wuhan, Hubei, Peoples R China.;[Yang, Yi] Fontbonne Univ, Dept Math & Comp Sci, St Louis, MO USA.
通讯机构：
[Cui, Jianqun] C;Cent China Normal Univ, Sch Comp, Wuhan, Hubei, Peoples R China.
摘要：
Application Layer Multicast (ALM) systems can easily be deployed compared with IP multicast because they do not require any modification to the current Internet infrastructure. Topology-aware ALM systems make multicast forwarding path as far as possible to match the underlying physical paths. They can reduce redundant data packets and forwarding delay. So the source path topology map construction is more important in topology-aware ALM systems. We find that only the routers directly connecting to terminal nodes (usually as gateway) and their connection information are required to be added to the source path topology map. This kind of topology map is named as gateway-level map. In this paper, we first prove that for the same multicast members, the complete path-matching algorithm (based on the gateway-level topology map) generates the same multicast tree as the complete topology map. After that, we present a delay coarse-grained matching method to generate the gateway-level topology map. Furthermore, the paper discusses some details such as how to get the topology information, how to build the map, how to maintain map information, and so on. Finally, performance analysis and simulation experiments demonstrate the conclusion that the method not only simplifies the information required by topology construction, but also accelerates the speed of accessing topological information. The time of application layer multicast nodes joining the multicast tree is reduced. This method also provides users the higher quality of service.
摘要：
在移动应用层组播通信中,热点地区可能会因用户过多而导致用户流服务满意度降低,非热点地区却可能会出现资源浪费现象,引起整个系统性能下降。提出了一种基于移动终端主动反馈的自适应负载均衡机制（Adaptive Load Balancing Mechanism based Mobile Terminal Active Feedback,ALBM-MTAF）。ALBM-MTAF利用网络相关性能指标模拟移动终端（用户）所获得的流媒体服务满意度（Streaming Media Service Satisfaction,SMSS）,通过终端用户主动反馈SMSS不断进行自适应的调整,将SMSS较差地域的子节点切换到SMSS较好的父节点上,从而实现整个系统的负载均衡。模拟实验表明,该机制具有良好的负载均衡效果,并能保证通信的质量。
作者机构：
School of Computer Science,Wuhan University,Wuhan,China;School of Computer Science,Central China Normal University,Wuhan,China;Department of Computer Science,St. Francis Xavier University,Canada;Colorado Technical University,Colorado Spring,CO,USA
会议名称：
第十届和谐人机环境联合学术会议
会议时间：
2014-09-13
会议地点：
北京
会议论文集名称：
第十届和谐人机环境联合学术会议论文集
关键词：
energy prediction;cluster head selection;clustering routing;LEACH;wireless sensor networks
摘要：
Clustering technology used in routing protocols can reduce energy consumption and prolong the lifetime of wireless sensor networks.Cluster head selection is one of the most important parts in clustering routing.An improved selection method (LEACH-EP) based on LEACH is proposed in this paper.Its core is to maintain the structure of clusters unchanged in K rounds.In the first round,cluster head nodes are selected according to LEACH,and then they are selected based on energy prediction in the remaining K-1 rounds.LEACH-EP reduces the updates of clusters’ structure and delays the dead time of nodes.The simulation with OMNeT++ shows that the LEACH-EP delays the dead time of the first node efficiently and it achieves an improvement on the effective network lifetime.At the same time,it is more conducive to energy balance.
期刊：
International Journal of Security and its Applications,2012年6(2):91-102 ISSN：1738-9976
通讯作者：
Guo, Y.J.(ccnugyj@126.com)
作者机构：
[Guo, Ya Jun; Shi, Hui; Gao, Hui Dan; Cui, Jian Qun; Hao, Heng Geng] Department of Computer Science, Central China Normal University, Wuhan 430079, China
通讯机构：
Department of Computer Science, Central China Normal University, China
关键词：
EPC;Internet of things;RFID;Random oracle model;SPAP
摘要：
Radio frequency identification (RFID) is one of the key technologies which constitute internet of things. Security and privacy issues of RFID systems is the focus of the present study. By analyzing several typical RFID security protocols, for the special security requirements of RFID systems in internet of things, in the paper, we propose a communication protocol SPAP(security-provable authentication protocol), then analyze and demonstrate the security of the protocol in details by the random oracle model. Analysis show that the protocol not only can solve the tag tracking, replay attack, cloning attack and the tag information indistinguishable, but also can solve the internal attack and the ownership transfer of tags and other issues of RFID Systems in internet of things. Finally, according to the comparisons, SPAP has the best performance.
期刊：
PACIIA 2009 - 2009 2nd Asia-Pacific Conference on Computational Intelligence and Industrial Applications,2009年1:397-400
通讯作者：
Cui, J.(jqcui@126.com)
作者机构：
[Peng, Xi; Cui, Jianqun] Department of Computer Science, Huazhong Normal University, Wuhan, China;[Wu, Dan] School of Computer Science, University of Windsor, Windsor, ON, Canada;[Wu, Libing] School of Computer, Wuhan University, Wuhan, China
