同时送取货的随机旅行时间车辆路径问题方法

建立了同时送取货的随机旅行时间车辆路径问题(STT-VRPSPD)的机会约束规划模型,构建了分散搜索算法求解策略.分散搜索算法中,针对STT-VRPSPD问题的复杂特性,构造了解的改进策略、组合策略,并采用改进的节约算法构造分散搜索算法初始解,从而使文中设计的分散搜索算法更加适应STT-VRPSPD问题特有的负载波动性.仿真实验中,首先对分散搜索算法的参数设置进行分析,确定了最优参数组合;然后基于经典的Dethloff算例数据,构造了STT-VRPSPD的测试算例,并对分散搜索算法和遗传算法进行了对比分析,结果表明,分散搜索算法对于STT-VRPSPD的求解质量优于遗传算法.     

Anonymous multipath routing protocol based on secret sharing in mobile ad hoc networks

Because the intrinsic characteristics of mobile ad hoc networks(MANETs) cause several vulnerabilities,anonymous routing protocols attract much more attention in secure mobile ad hoc networks for the purposes of security and privacy concerns.Until recently,lots of anonymous routing protocols have been proposed.However,most of them are single path or use one path at a time,and the multipath schemes can not thwart both the passive attacks and active attacks simultaneously.Thus an anonymous multipath routing protocol based on secret sharing is proposed.The protocol provides identity anonymity,location anonymity,data and traffic anonymity by employing cryptograph technology and secret sharing in MANET communication process.Meanwhile,a hash function is introduced to detect active attacks in the data transmission process.The protocol can effectively thwart various passive attacks and reduce the successful probability of active attacks(such as interception and physical destroy attacks).Simulation results show that the proposed scheme provides a reasonably good level of network security and performance.     

WSN中基于簇头路径转换的定向扩散路由协议

针对定向扩散协议中兴趣泛洪时巨大的能量开销以及最优路径后续维护等问题,提出一种无线传感器网络中基于簇头路径转换的定向扩散路由协议.该协议首先通过结合非均匀分簇将网络分簇,在兴趣扩散时将兴趣消息扩散到簇头,减少能量消耗;其次,通过在簇头之间选择优先级最高的下一跳簇头节点形成最优路径,进行后续数据的传输.直到最优路径上某个簇头所剩能量接近设定的阈值时,该簇头采用基于时间的回溯迭代查询机制选择继任的传输节点,进行最优路径的转换,继续传输数据.仿真结果表明,该协议能有效延长网络生存周期,提高能量利用率,均衡网络能量消耗.     

无线Ad hoc网络中DSR协议的多路探测和定时算法改进

无线Ad hoc网络拓扑结构频繁变化导致DSR缓存中的路由信息过期,过期路由的使用导致信息传输的失败。文章在动态源路由协议(Dynamic Source Routing,简称DSR)的基础上提出了多路探测和定时机制的路由协议(Multi-Probing and Time-out Dynamic Source Routing,MPTDSR),该协议通过定时地主动探测路径的有效性从而清除缓存中的过期路由,主动更新缓存。实验结果表明,在数据的传输率、传输延时、路由开销等方面均优于基于路由缓存的DSR协议。     

无线传感器网络中基于负载平衡的多路路由

针对传感器节点能量受限的特点，提出了一种无线传感器网络中基于负载平衡的多路路由（load balancing multi-path routing,LBMPR）协议．LBMPR依赖传感器节点的地理位置生成从源节点到sink节点的多条路径，数据通信均匀分布于不同路径上，从而达到节点间的负载平衡，延长了网络的寿命．仿真实验表明，若选择适当的参数a和b，较之mesh-2和mesh-3，LBMPR能获得更好的负载平衡性能．     

A mobile accessible closed multi-part group communication scheme in IPv6 network

To solve the problems of current IP multicast which includes poor inter-domain many-to-many group support, security vulnerabilities and dependency to specific multicast infrastructure, a mobile accessible closed multi-part group （MACMPG） communication protocol in IPv6 network is proposed. By extending the single source multicast protocol, the communication channel for multi-part group communication across domains is established. Based on lPv6 CGA, the secure closed group communication scheme is designed. The access to the multicast traffic only confined to the authorized senders and receivers and only trusted routers are allowed to be the branch points of MACMPG tree. By tunneling mechanism, the MACMPG traffic can be transmitted across non-MACMPG routing area, and the mobile nodes can join the group remotely and roam freely between domains, which eliminates the dependency on specific IP multicast routing.     

Ad Hoc网络安全备选路由机制

提出了一种基于单向哈希链和备选路由机制的增强路由可用性的安全路由改进方法,仿真结果表明,这种机制能够在网络节点动态移动和网络中存在不协作节点的情况下,保证网络具有较低的路由请求次数和较高的数据接收效率。     

A survey on routing in wireless sensor networks

One of the most important issues in wireless sensor networks is data delivery service between sensors and the data collection unit (called sink). Although sensor networks and mobile ad hoc networks are similar to some extent, they are radically distinct in many aspects. Sensor networks have many unique features, making them more challenging and need further research efforts. The existing routing protocols for sensor networks can be classified as indicator-based and indicator-free. In this survey, we make a comparative study of these protocols. Open issues and research directions are pointed out as guidelines for our future work.     

多集散点车辆路径优化的混合算法

为使多集散点车辆路径优化结果全局最优,以订单为基准建立多集散点车辆路径优化模型.采用粒子群算法与改进蚁群算法组成的混合优化算法求解模型.由粒子群算法的粒子位置向量得到每辆车所需运送的订单号,用蚁群算法优化单车路径,根据优化的总路径评价和筛选粒子,直到满足终止条件.该模型和混合算法是所有车辆对所有订单节点的路径优化,突破了多仓库问题直接或间接转化为多个单仓库车辆路径优化问题中的局部节点求解的限制.实例求解结果表明,用该混合算法优化的车辆总路径长度小于用蚁群算法求得的结果.     

面向月球探测多机器人通信系统的Ad hoc路由协议优化设计

Ad hoc网络作为一种不依赖于任何固定设施的临时性多跳自治系统,是解决月球探测过程中多机器人通信问题的可行选择。由于月球探测多机器人通信系统对节能和实时性等方面的特殊要求,现有的Ad hoc网络路由协议还难以满足工程设计和实际应用的需求。因而,结合月球探测环境下的实际工程需要,对现有的Ad hoc网络路由协议进行优化设计就成为关键。在分析月球探测多机器人通信系统拓扑结构的基础上,给出了系统中各节点的能量消耗模型;进而,建立了路径寻优的数学模型,在动态源路由协议DSR的基础上设计了一种基于能量约束的Ad hoc网络路由协议。该协议综合考虑了通信系统对于节能和实时性两方面的需求,将路由跳数、路由传送功率、节点剩余电池能量作为路由度量,采用改进的离散Bellman-Ford算法进行最优路径的求解。仿真实验结果表明,该协议在保证通信系统实时性的前提下,可延长网络生存时间,能为月球探测多机器人系统提供更可靠的通信保障。