MANETs中基于节点移动度的虚连接的路由

由于移动自组织网络MANETs中节点的快速移动,使得维持源节点与目的节点间的通信路径成为一项挑战性工作。节点的高速移动导致通信链路频繁断裂。为此,提出基于节点移动度的虚连接的路由(MDVRP)。虚路由为一条动态的逻辑路由,其由一系列的特定地理区域构成。每个区域内的节点依据自己的移动度设置转发数据包的定时器,移动度越小,具有优先转发数据包权。MDVRP通过虚路由策略,在源节点与目的节点间建立了多条传输路通,每个节点能独立选取下一跳转发节点,并利用节点移动度,择优选取转发数据包下一跳节点,从而提高链路的稳定性。仿真结果表明,提出的路由协议在端到端传输时延、路由开销以及数据包传输率性能均得到提高。     

网络移动无缝切换机理研究

网络移动通过移动路由器实现边缘移动网络节点间及其与骨干网络节点间的会话连续性。移动路由器在嵌套接入环境下的接入安全与切换延时已经成为网络移动发展的最大障碍。在分析网络移动无缝切换研究现状的基础上,提出基于协同模型的网络架构、基于移动模型的预切换方法等需要突破的关键技术以及相应的无缝切换技术思路,支持轻量可信切换、多穴负载均衡、嵌套路由优化,为设计具有服务质量和安全保证的端到端网络移动通信协议提供技术支撑。     

基于信任及能量评估的AODV安全路由

在Ad Hoc网络中,动态拓扑及自由移动的特点使恶意节点发起各种攻击造成网络资源不可用。为此提出移动频率(MF,Mobile Frequency)评估节点移动情况。同时,在AODV的基础上,提出一个基于节点信任度和能量的路由方案,该方案中节点信任度受移动频率影响,下一跳节点的选择由信任度和能量共同决定,并通过区分可信与不可信节点,孤立恶意节点来保证路径上的节点都有足够能量并且安全可信。     

移动Adhoc网络中多径路由的研究

移动Adhoc网络（MANETs）中,因为节点是可以自由移动的,所以源节点到目的节点间的连接很不稳定。多径路由可以快速修复路由,也带来许多其它的好处。文章分类研究了多径路由在移ChAdhoc网络路由协议中的应用,并对应用多径路由前后的路由协议性能进行了比较。     

部分连接自组织网络按需路由技术研究

自组织网络中节点随机移动,能源耗尽等因素易使网络形成部分连接状态。为保证该特殊网络中的数据有效传输,文中提出了一种基于任务接替的按需路由技术,利用数据传输任务接替节点实现部分连接网络中无连接区域间的相互通信,并采用NS2网络仿真器验证了该路由技术的有效性以及分析了任务接替节点移动速度、网络节点通信距离对通信时延的影响。     

基于节点信任值的安全层次路由协议

由于无线传感器网络容易受到攻击,所以保证无线传感器在网络数据传输过程中的路由安全是必要的,文中提出一种基于节点信任值、节点度和距离的簇头选举算法,进行路由主干节点的可信选举,建立安全可信的层次路由。仿真结果表明,该算法可有效评估节点的信任值,解决了节点失效或被俘获所导致的层次路由安全问题。     

移动IPv6路由优化中的安全威胁及解决方案

分析了移动IPv6的路由优化过程中存在的各种安全威胁。针对虚假绑定更新消息介绍了一种基于返回路由可达过程的路由优化安全认证解决方案,使得通信节点只有在确认移动节点的家乡地址和转交地址均可到达后,方接受来自该移动节点的绑定更新消息,并建立二者间的直接路由。     

战术自组网分层安全框架研究

未来战术通信网络将使用VHF／UHF无线电进行语音和数据通信,战术通信网络相对固网而言,具有低带宽、高误码率和节点移动性的特点。由于组网对战术通信而言相对较新,其安全性尚未得到完备的考虑,尽管移动Adhoc网络（MANETs）的安全威胁已经被广泛研究,但是不同通信手段具有不同的特点,其安全威胁不一定类似。文中通过分析已有的MANET安全威胁提出了一种新的方法,以评估其对战术网络的潜在影响。尽管这些分析并不覆盖所有可能的威胁,但它具有优势并且能定位主要问题。基于这个分析,提出一个分层的服务框架并集成各层的安全功能。     

一种新型安全路由协议——势能导向多下一跳路由协议

路由协议是网络的核心控制协议,通过路由协议增强网络可用性和安全性显得尤为重要。在研究网络路由协议及其安全机制的基础上,充分考虑网络路由过程的动态可用性和节点可信度,在路由机制中首次定义了寻路和可信势能,并设计实现了基于节点势能导向的多下一跳路由协议,很好地解决了目前互联网中突发事件易引起网络拥塞和不安全节点对用户信息安全的隐患,对加强网络抗毁性、保障用户信息安全具有重要价值。     

传感器网络簇间通信自适应节能路由优化算法

提出了一种用于无线传感器网络簇间通信的自适应节能路由优化算法。网络中以总体通信能耗最小为首要原则建立端到端之间的路由,并对簇间通信提出了一种优化算法,使得簇首之间相互通信时,可以在直接、中继以及协作3种不同方式中自适应地选择最节能的通信方式。所提出的路由算法可确保源节点与基站通信过程中选择到最优或次优的节能路由,并可降低由于通信覆盖盲区造成的通信中断的概率。仿真结果表明,与其他传感器网络路由算法相比,所提出的路由算法在相同吞吐量和误码率前提下每一轮都消耗更少的能量,并且在不同的节点密度下都可有效地延长网络的生命周期和工作时间。     

Trust Based Detection and Elimination of Packet Drop Attack in the Mobile Ad-Hoc Networks

The mobile ad hoc network (MANET) is communication network of a mobile node without any prior infrastructure of communication. The network does not have any static support; it dynamically creates the network as per requirement by using available mobile nodes. This network has a challenging security problem. The security issue mainly contains a denial of service attacks like packet drop attack, black-hole attack, gray-hole attack, etc. The mobile ad-hoc network is an open environment so the working is based on mutual trust between mobile nodes. The MANETs are vulnerable to packet drop attack in which packets travel through the different node. The network while communicating, the node drops the packet, but it is not attracting the neighboring nodes to drop the packets. This proposed algorithm works with existing routing protocol. The concept of trusted list is used for secure communication path. The trusted list along with trust values show how many times node was participated in the communication. It differentiates between altruism and selfishness in MANET with the help of energy level of mobile components. The trust and energy models are used for security and for the differentiation between altruism and selfishness respectively.     

Agent-based trusted on-demand routing protocol for mobile ad-hoc networks

The routing performance in mobile ad hoc networks (MANETs) relies on the co-operation of the individual nodes that constitute the network. The existence of misbehaving nodes may paralyze the routing operation in MANETs. To overcome this behavior, the trustworthiness of the network nodes should be considered in the route selection process combined with the hop count. The trustworthiness is achieved by measuring the trust value for each node in the network. In this paper, a new protocol based on self monitoring (agent-based) and following the dynamic source routing (DSR) algorithm is presented. This protocol is called agent-based trusted dynamic source routing protocol for MANETs. The objective of this protocol is to manage trust information locally with minimal overhead in terms of extra messages and time delay. This objective is achieved through installing in each participated node in the network a multi-agent system (MAS). MAS consists of two types of agents: monitoring agent and routing agent. A new mathematical and more realistic objective model for measuring the trust value is introduced. This model is weighted by both number and size of routed packets to reflect the “selective forwarding” behavior of a node. The performance evaluation via simulation shows that our protocol is better than standard and trusted DSR. The simulation is done over a variety of environmental conditions such as number of malicious nodes, host density and movement rates.     

基于Grover搜索算法的MANET网络路由协议

In Mobile Ad-hoc Networks (MA-NETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading perfor-mance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover’s sear-ching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover’s algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capa-bility of the network.     

E‐TDGO: An encrypted trust‐based dolphin glowworm optimization for secure routing in mobile ad hoc network

Mobile ad hoc networks (MANETs) are independent networks, where mobile nodes communicate with other nodes through wireless links by multihop transmission. Security is still an issue to be fixed in MANETs. Hence, a routing protocol named encrypted trust‐based dolphin glowworm optimization (DGO) (E‐TDGO) is designed using Advanced Encryption Standard‐128 (AES‐128) and trust‐based optimization model for secure routing in MANET. The proposed E‐TDGO protocol includes three phases, namely, k‐path discovery, optimal path selection, and communication. At first, k paths are discovered based on the distance and the trust level of the nodes. From the k paths discovered, the optimal path is selected using a novel algorithm, DGO, which is developed by combining glowworm swarm optimization (GSO) algorithm and dolphin echolocation algorithm (DEA). Once the optimal path is selected, communication begins in the network such that E‐TDGO protocol ensures security. The routing messages are encrypted using AES‐128 with shared code and key to offer security. The experimental results show that the proposed E‐TDGO could attain throughput of 0.11, delay of 0.01 second, packet drop of 0.44, and detection rate of 0.99, at the maximum number of rounds considered in the network of 75 nodes with attack consideration.     

移动自组网电力及负荷感知的构造最小连通支配集算法

在移动自组网络MANET(Mobile Ad-hoc Networks)中,移动节点之间的通信是多跳(Multi-hop)的,即需要网络中其他节点的参与得以进行,因此,节点之间的通信路径会因为节点的电力耗竭或节点的移动而中断.本文提出了根据移动节点当前电力及通信负荷来选择支配节点的最小连通支配集CDS(Connected Dominating Set)构造算法,这种算法可以减小由移动节点电力耗竭所致的通信路径失效的概率,也可以减少数据包通过各移动节点的延误时间,对设计MANET的高效稳定的路由策略有着重要的应用价值.     

Security and performance enhancement of AODV routing protocol

A mobile ad hoc networks (MANET) is a decentralized, self‐organizing, infrastructure‐less network and adaptive gathering of independent mobile nodes. Because of the unique characteristics of MANET, the major issues to develop a routing protocol in MANET are the security aspect and the network performance. In this paper, we propose a new secure protocol called Trust Ad Hoc On‐demand Distance Vector (AODV) using trust mechanism. Communication packets are only sent to the trusted neighbor nodes. Trust calculation is based on the behaviors and activities information of each node. It is divided in to trust global (TG) and trust local (TL). TG is a trust calculation based on the total of received routing packets and the total of sending routing packets. TL is a comparison between total received packets and total forwarded packets by neighbor node from specific nodes. Nodes conclude the total trust level of its neighbors by accumulating the TL and TG values. The performance of Trust AODV is evaluated under denial of service/distributed denial of service (DOS/DDOS) attack using network simulator NS‐2. It is compared with the Trust Cross Layer Secure (TCLS) protocol. Simulation results show that the Trust AODV has a better performance than TCLS protocol in terms of end‐to‐end delay, packet delivery ratio, and overhead. Next, we improve the performance of Trust AODV using ant algorithm. The proposed protocol is called Trust AODV + Ant. The implementation of ant algorithm in the proposed secure protocol is by adding an ant agent to put the positive pheromone in the node if the node is trusted. Ant agent is represented as a routing packet. The pheromone value is saved in the routing table of the node. We modified the original routing table by adding the pheromone value field. The path communication is selected based on the pheromone concentration and the shortest path. Trust AODV + Ant is compared with simple ant routing algorithm (SARA), AODV, and Trust AODV under DOS/DDOS attacks in terms of performance. Simulation results show that the packet delivery ratio and throughput of the Trust AODV increase after using ant algorithm. However, in terms of end‐to‐end delay, there is no significant improvement. Copyright © 2014 John Wiley & Sons, Ltd.     

Secure multicast routing protocols in mobile ad‐hoc networks

A mobile ad‐hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi‐hop radio network. Routing protocols in MANETs define how routes between source and destination nodes are established and maintained. Multicast routing provides a bandwidth‐efficient means for supporting group‐oriented applications. The increasing demand for such applications coupled with the inherent characteristics of MANETs (e.g., lack of infrastructure and node mobility) have made secure multicast routing a crucial yet challenging issue. Recently, several multicast routing protocols (MRP) have been proposed in MANETs. Depending on whether security is built‐in or added, MRP can be classified into two types: secure and security‐enhanced routing protocols, respectively. This paper presents a survey on secure and security‐enhanced MRP along with their security techniques and the types of attacks they can confront. A detailed comparison for the capability of the various routing protocols against some known attacks is also presented and analyzed. Copyright © 2013 John Wiley & Sons, Ltd.     

An energy aware algorithm for OLSR clustering

One of the important aspects of a mobile ad hoc network (MANET) is the limitation of the amount of available energy and the network lifetime. The tremendous amount of using mobile nodes in wireless communication medium makes energy efficiency a fundamental requirement for MANETs. In this paper, we propose a novel energy aware clustering algorithm for the optimized link state routing (OLSR) routing protocol. This algorithm takes into account the node density and mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reasonable number of cluster heads that will serve for hierarchical routing based on OLSR. The proposed algorithm aims to increase the network lifetime by considering the ad hoc residual energy while taking routing decisions. It also optimizes the delay of carried flows by adopting a selective forwarding approach based on a hierarchical routing model.     

Gateway Selection Protocol in Hybrid MANET Using DYMO Routing

In this paper, we propose a novel gateway (GW) selection protocol in hybrid Mobile Ad hoc Networks (MANETs). We focus on the situation that occurs when specialized, sensitive data is sent to the Internet from MANET nodes. These special data types are especially susceptible to security risks such as information leak and data falsification. Therefore, it is necessary for such special data to be forwarded by a secure/trusted GW which is controlled by a trusted network administrator. However, there should be multiple GWs deployed in a MANET, where the cost ineffectiveness makes it difficult for a network administrator to simultaneously manage every GW. Because of the risk of forwarding special data through an unmaintained GW, we propose a routing protocol which allows a source node to have sensitive data forwarded to the Internet through a trusted GW. To achieve this desirable performance, we improve upon one of the newest routing protocols, Dynamic MANET On-demand (DYMO), which works in consideration of application data. Through simulations, we evaluate our protocol in comparison with the conventional DYMO protocol. The results show that our protocol can make MANET source nodes choose GWs for specific data.     

New Approaches to Routing in Mobile Ad hoc Networks

Worldwide Interoperability for Microwave Access (Wimax) is power station through which mobile network, commonly known as A Mobile Ad-hoc Network (MANET) is used by the people. A MANET can be described as an infrastructure-less and self-configure network with autonomous nodes. Participated nodes in MANETs move through the network constantly causing frequent topology changes. Designing suitable routing protocols to handle the dynamic topology changes in MANETs can enhance the performance of the network. In this regard, this paper proposes four algorithms for the routing problem in MANETs. First, we propose a new method called Classical Logic-based Routing Algorithm for the routing problem in MANETs. Second is a routing algorithm named Fuzzy Logic-based Routing Algorithm (FLRA). Third, a Reinforcement Learning-based Routing Algorithm is proposed to construct optimal paths in MANETs. Finally, a fuzzy logic-based method is accompanied with reinforcement learning to mitigate existing problems in FLRA. This algorithm is called Reinforcement Learning and Fuzzy Logic-based (RLFLRA) Routing Algorithm. Our proposed approaches can be deployed in dynamic environments and take four important fuzzy variables such as available bandwidth, residual energy, mobility speed, and hop-count into consideration. Simulation results depict that learning process has a great impact on network performance and RLFLRA outperforms other proposed algorithms in terms of throughput, route discovery time, packet delivery ratio, network access delay, and hop-count.