Ad hoc网络中基于定期巡查机制的能量度量路由协议

目前在Adhoc网络中,现性的能量度量路由协议,一旦路由选定,数据包将一直发送,直到发送完毕或者路由中某个节点的能量耗尽结束。由于大量的数据包通过同一路由持续不断的发送,假如选定路由中某个节点的剩余能量不足以支持长时间的数据发送,那么这个节点必然会提前耗尽能量导致本路由的失效。连接在这个节点的其他路由也会因此失效。为解决之一问题,提出两个新的路由机制。一个是将MMBCR的能量消耗量计算存贮时间从原来的路由请求阶段调整到路由响应阶段,二是增加定期巡查机制即(PRD-MMBCR),定期检查路由中的情况变化,并根据变化调整路由。通过NS-2模拟环境的测试,PRD-MMBCR比现有的能量度量路由协议在延长路由的生命周期方面表现优异的多。     

无线传感器网络路由协议的节能研究

介绍无线传感器网络特点及应用,将传感器网络路由协议分为平面路由协议和层次型路由协议,并对其中典型的路由协议进行节能方面的分析,指出路由协议未来的研究重点。     

多节点下Ad Hoc网络路由协议模拟

在windows环境下,主要介绍基于NS-2网络模拟器的Ad Hoc网络路由协议的模拟实现。首先对协议模拟软件NS-2进行介绍,接着对现有的Ad Hoc网络的路由协议进行说明,最后对NS-2的方法及工作流程进行解释,并在此基础上针对不同网络模式、不同移动场景和不同的传输负载对表驱动路由协议,按需驱动路由协议进行模拟。结果表明对实时性要求较高的场合适宜使用表驱动协议,而对数据质量和网络带宽有严格要求的场合应使用按需驱动路由协议。     

RIP路由协议分析及配置简述

介绍RIP(Routing Information Protocol)路由协议的基本内容,分析RIP协议的工作原理,路由环路的产生及解决方法,通过实验阐述如何在路由器上配置RIP协议。     

自组网区域路由协议（ZRP）的关键技术分析

本文对自组网区域路由协议（ZRP）的关键技术进行了分析，其中包括多范围技术、混合路由技术、区域路由框架的调整机制，它可以为进行相关研究的专家和学者提供一种ZRP基础理论研究内容参考，为今后的进一步研究工作做好铺垫。     

浅析基于OSPF华为交换机路由协议配置

OSPF动态路由协议是目前应用最广泛的路由协议之一,介绍OSPF路由协议的工作原理和特点,并结合模拟实验介绍OSPF路由协议的设计和实现。     

一种新的基于移动预测的MANET路由协议

移动自组网是一种由一系列可以自由移动的节点主机聚集而成的一个临时性动态网络。它没有固定基站，也没有作为控制管理中心的节点主机，由于其拓扑的动态性，其路由协议与其他传统网络有很大的区别。为了能更有效地移动自组网中实现数据的传送，本文提出了一种基于移动预测下的MANET路由协议，该协议综合考虑了传输路径的延时和稳定性，选择在延时限制下平均拥有最稳特性的传输路径，模拟结果表明，这种方法比基于移动预测量稳路径路由协议的传输时延要短，传送成功概率要高，而控制开销却相关不大。     

自组网区域路由协议（ZRP）的研究综述

本文对自组网区域路由协议（ZRP）的研究进行了综述，包括ZRP分析和ZRP相关研究分析，它可以为进行相关研究的专家和学者提供一种ZRP基础理论研究内容参考，为今后的进一步研究工作做好铺垫。     

在协议集成测试系统上开展路由协议测试

在分析路由协议的特性及其测试需求的基础上，提出利用窗口黑盒来描述被测协议，利用多通道测试方法扩展对被测实现的控制和观察，通过扩充参考实现增强系统的测试能力。将这些理论，技术应用于系统中，对路由协议开展了有效的测试活动，为国产高性能路由器的开发提供了有力的支持，也进一步增强了PITS系统的功能和适用性。     

移动自组网选播路由协议ARAD

针对移动自组(ad hoc)网的特点,提出了一种适合ad hoc移动网络的选播路由协议——ARAD协议.该协议在充分考虑选播路由特点的基础上,将ad hoc按需距离矢量路由(AODV)协议的路由发现机制与动态源路由(DSR)协议的缓存源路由技术相结合,在动态变化的ad hoc网络中实现了一种高效的选播路由.模拟结果表明,在动态的网络环境下,ARAD协议能够取得良好的性能.     

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years, with the rapid development of the Internet and wireless communication technology, wireless Ad hoc networks have received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks. This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol, which has the following two aspects of improvement: (1) In the route discovery process, a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a “Mark” bit that representing remaining energy of a node. (2) Based on (1), a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively. Simulation results demonstrate that compared with AODV and other existing routing protocols, proposed algorithm can reduce network energy consumption and balance node energy, thus extending the network lifetime.     

一种用于Ad Hoc网络的简单跨层流控机制及其性能分析

为了改善Ad Hoc网络中传输层协议的性能,基于跨层设计思想设计了一种简单的流控机制.该机制有效地利用了网络层路由反馈、传输层协议、应用层速率自适应调节之间的关联性和跨层信息交互,应用层可根据网络层反馈的路由信息来调节发送速率,进而将网络负载维持在合理水平以最大化网络吞吐量.通过计算机模拟评价了此跨层流控机制,模拟评价结果表明,该机制能够使上层应用得到更加智能的控制,改善了基于UDP和TCP的业务性能,尤其是在网络负载较低的情况下效果更为明显.     

A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology

Many routing protocols, such as distance vector and link-state protocols are used for finding the best paths in a network. To find the path between the source and destination nodes where every node is visited once with no repeats, Hamiltonian and Hypercube routing protocols are often used. Nonetheless, these algorithms are not designed to solve the problem of a node failure, where one or more nodes become faulty. This paper proposes an efficient modified Fault-free Hamiltonian Cycle based on the Hypercube Topology (FHCHT) to perform a connection between nodes when one or more nodes become faulty. FHCHT can be applied in a different environment to transmit data with a high-reliability connection by finding an alternative path between the source and destination nodes when some nodes fail. Moreover, a proposed Hamiltonian Near Cycle (HNC) scheme has been developed and implemented. HNC implementation results indicated that FHCHT produces alternative cycles relatively similar to a Hamiltonian Cycle for the Hypercube, complete, and random graphs. The implementation of the proposed algorithm in a Hypercube achieved a 31% and 76% reduction in cost compared to the complete and random graphs, respectively.     

ACO–EEOLSR: enhanced energy model based link stability routing protocol in mobile ad hoc networks

A mobile ad hoc network (MANET) has abundant mobile nodes that are free to communicate independently in many locations. Many existing energy models address the inadequacy of resources based on Ad hoc On-demand Multipath Distance Vector and Optimized Link State Protocol (OLSP) routing protocols for MANET along with various parameters. The architecture of energy-efficient routing mechanisms is a challenging problem in a MANET. In this work, a novel energy-aware routing model is introduced for MANET comprising an ant colony optimization (ACO) enhanced approach to energy-efficient-optimized link state routing (named ACO–EEOLSR). Initially, the route discovery is progressed by means of neighbor estimation and also with the authentication of link stability. Parameters such as energy, distance, and hop count are employed as willingness nodes, where both the energy and distance are entrenched through the OLSP. Consequently, the hop count is applied via the ACO system that is beneficial for link stability. After the acceptance of an acknowledgement, the hop count is authorized for further performance analysis. This approach increases the Quality of Service and also uses less energy compared to other energy models. The accomplished simulation upshot depicts that the ACO–EEOLSR outperforms the EEOLSR scheme with respect to the performance metrics of energy consumption, packet delivery ratio, total remaining time, average network lifetime, and a variance of energy.     

ECO-BAT: A New Routing Protocol for Energy Consumption Optimization Based on BAT Algorithm in WSN

Wireless sensor network (WSN) has been widely used due to its vast range of applications. The energy problem is one of the important problems influencing the complete application. Sensor nodes use very small batteries as a power source and replacing them is not an easy task. With this restriction, the sensor nodes must conserve their energy and extend the network lifetime as long as possible. Also, these limits motivate much of the research to suggest solutions in all layers of the protocol stack to save energy. So, energy management efficiency becomes a key requirement in WSN design. The efficiency of these networks is highly dependent on routing protocols directly affecting the network lifetime. Clustering is one of the most popular techniques preferred in routing operations. In this work we propose a novel energy-efficient protocol for WSN based on a bat algorithm called ECO-BAT (Energy Consumption Optimization with BAT algorithm for WSN) to prolong the network lifetime. We use an objective function that generates an optimal number of sensor clusters with cluster heads (CH) to minimize energy consumption. The performance of the proposed approach is compared with Low-Energy Adaptive Clustering Hierarchy (LEACH) and Energy Efficient cluster formation in wireless sensor networks based on the Multi-Objective Bat algorithm (EEMOB) protocols. The results obtained are interesting in terms of energy-saving and prolongation of the network lifetime.     

An Intelligent Forwarding Strategy in SDN-Enabled Named-Data IoV

Internet of Vehicles (IoV), a rapidly growing technology for efficient vehicular communication and it is shifting the trend of traditional Vehicular Ad Hoc Networking (VANET) towards itself. The centralized management of IoV endorses its uniqueness and suitability for the Intelligent Transportation System (ITS) safety applications. Named Data Networking (NDN) is an emerging internet paradigm that fulfills most of the expectations of IoV. Limitations of the current IP internet architecture are the main motivation behind NDN. Software-Defined Networking (SDN) is another emerging networking paradigm of technology that is highly capable of efficient management of overall networks and transforming complex networking architectures into simple and manageable ones. The combination of the SDN controller, NDN, and IoV can be revolutionary in the overall performance of the network. Broadcast storm, due to the broadcasting nature of NDN, is a critical issue in NDN based on IoV. High speed and rapidly changing topology of vehicles in IoV creates disconnected link problem and add unnecessary transmission delay. In order to cop-up with the above-discussed problems, we proposed an efficient SDN-enabled forwarding mechanism in NDN-based IoV, which supports the mobility of the vehicle and explores the cellular network for the low latency control messages. In IoV environment, the concept of Edge Controller (EC) to maintain and manage the in-time and real-time vehicular topology is being introduced. A mathematical estimation model is also proposed in our work that assists the centralized EC and SDN to find not only the shortest and best path but also the most reliable and durable path. The naming scheme and in-network caching property of the NDN nodes reduce the delay. We used ndnSIM and NS-3 for the simulation experiment along with SUMO for the environment generation. The results of NDSDoV illustrate significant performance in terms of availability with limited routing overhead, minimized delay, retransmissions, and increased packet satisfaction ratio. Besides, we explored the properties of EC that contribute mainly in path failure minimization in the network.     

Traffic Engineering in Dynamic Hybrid Segment Routing Networks

The emergence of Segment Routing (SR) provides a novel routing paradigm that uses a routing technique called source packet routing. In SR architecture, the paths that the packets choose to route on are indicated at the ingress router. Compared with shortest-path-based routing in traditional distributed routing protocols, SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress router. Despite the advantages of SR, it may be difficult to update the existing IP network to a full SR deployed network, for economical and technical reasons. Updating partial of the traditional IP network to the SR network, thus forming a hybrid SR network, is a preferable choice. For the traffic is dynamically changing in a daily time, in this paper, we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR network. WASAR algorithm can be divided into three steps: firstly, representative Traffic Matrices (TMs) and the expected TM are obtained from the historical TMs through ultra-scalable spectral clustering algorithm. Secondly, given the network topology, the initial network weight setting and the expected TM, we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning (DRL) algorithm. Thirdly, we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands, in order to improve the network performance. In the evaluation, we exploit historical TMs to test the performance of the obtained routing configuration in WASAR. The extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization (MLU) under the dynamic traffic.     

基于局部位置更新的无线传感器网络路由协议

提出了在具有移动基站的无线传感器网络中的一种新的路由协议,该协议在基站移动时只需要在一个小的区域内更新基站的位置信息,因此既节省了传感器节点的能量,又使基站在移动过程中仍可保持与传感器节点的持续通信.理论分析和模拟研究表明,与全局更新基站位置信息的路由协议相比,该协议降低了基站位置信息更新的代价,减少了无线信道的冲突概率,减少了延迟,可适用于对延迟要求较高的大规模无线传感器网络.     

一种改进的传感器网络分簇分层路由协议

在分析了无线传感器网络中传统的LEACH和LEACH-C路由协议基础上,结合MTE路由协议思想,提出了一种新的改进型分簇分层路由协议(improved clustering hierarchical routing protocol,ICH).文中簇首节点可以采用多跳方式传输数据包,且在选择中继节点时考虑节点剩余能量,对进入下一轮的条件进行了限制.实验表明,改进后的ICH协议的节点存活率比LEACH-C好.