Component based ant routing protocols analysis over mobile ad hoc networks

To deeply exploit the mechanisms of ant colony optimization(ACO)applied to develop routing in mobile ad hoc networks(MANETS),some existing representative ant colony routing protocols were analyzed and compared.The analysis results show that every routing protocol has its own characteristics and competitive environment.No routing protocol is better than others in all aspects.Therefore,based on no free lunch theory,ant routing protocols were decomposed into three key components:route discovery,route maintenance(including route refreshing and route failure handling)and data forwarding.Moreover,component based ant routing protocol(CBAR)was proposed.For purpose of analysis,it only maintained basic ant routing process,and it was simple and efficient with a low overhead.Subsequently,different mechanisms used in every component and their effect on performance were analyzed and tested by simulations.Finally,future research strategies and trends were also summarized.

Analysis of reactive routing protocols for mobile ad hoc networks in Markov models

Mobile ad hoc networks （MANETs） have become a hot issue in the area of wireless networks for their non-infrastructure and mobile features. In this paper, a MANET is modeled so that the length of each link in the network is considered as a birthdeath process and the space is reused for n times in the flooding process, which is named as an n-spatiai reuse birth-death model （n-SRBDM）. We analyze the performance of the network under the dynamic source routing protocol （DSR） which is a famous reactive routing protocol. Some performance parameters of the route discovery are studied such as the probability distribution and the expectation of the flooding distance, the probability that a route is discovered by a query packet with a hop limit, the probability that a request packet finds a τ-time-valid route or a symmetric-valid route, and the average time needed to discover a valid route. For the route maintenance, some parameters are introduced and studied such as the average frequency of route recovery and the average time of a route to be valid. We compare the two models with spatial reuse and without spatial reuse by evaluating these parameters. It is shown that the spatial reuse model is much more effective in routing.

An Empirical Examination of Routing Protocols in Mobile Ad Hoc Networks

A Mobile Ad hoc NETwork (MANET) is a self-organizing, temporary, infrastructure-free, multi-hop, dynamic topology wireless network that contains collection of cooperative autonomous freely roaming mobile nodes. The nodes communicate with each other by wireless radio links with no human intervention. Each mobile node functions as a specialized router to forward information to other mobile nodes. In order to provide efficient end-to-end communication with the network of nodes, a routing protocol is used to discover the optimal routes between the nodes. The routing protocols meant for wired networks can not be used for mobile ad hoc networks because of the mobility of nodes. Routing in ad hoc networks is nontrivial due to highly dynamic nature of the nodes. Various routing protocols have been proposed and widely evaluated for efficient routing of packets. This research paper presents an overview on classification of wide range of routing protocols for mobile ad hoc wireless networks proposed in the literature and shows the performance evaluation of the routing protocols: DSDV, AODV, FSR, LAR, OLSR, STAR and ZRP using the network simulator QualNet 4.0 to determine which protocols may perform best in large networks. To judge the merit of a routing protocol, one needs performance metrics (throughput, end-to-end delay, jitter, packet delivery ratio, routing overhead) with which to measure its suitability and performance. Our simulation experiments show that the LAR protocol achieve relatively good performance compared to other routing protocols.

Multipath Source Self Repair Routing Algorithm for Mobile Ad Hoc Networks

A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.

DECLARATIVE HYBRID ROUTING PROTOCOLS IN AD HOC NETWORKS

This paper presents adaptive hybrid protocols based on the declarative network and mainly discusses the principle and realization of the Bayesian-estimation based adaptive hybrid protocol in the declarative network, which is well adapted to the Mobile Ad hoc NETwork (MANET). The adaptive hybrid protocol is designed for ad hoc networks which have characteristics like self-organizing, no trusted party, flexibility, etc. The nodes that run the hybrid protocol can automatically select one routing protocol that is suitable for different network environment. The Bayesian-estimation based adaptive strategy, that improves the adaptability and stability of the protocol, succeeds in the Rapidnet, a declarative network engine. The result in the Rapidnet proves that the hybrid protocol and the adaptive strategy are feasible. The experiment on the ns-3 simulator, an emerging discrete-event network simulator, validates that this protocol performs well and reduces communication overheads.

Distributed intrusion detection for mobile ad hoc networks

Mobile ad hoc networking （MANET） has become an exciting and important technology in recent years, because of the rapid proliferation of wireless devices. Mobile ad hoc networks is highly vulnerable to attacks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized monitoring and management point. The traditional way of protecting networks with firewalls and encryption software is no longer sufficient and effective for those features. A distributed intrusion detection approach based on timed automata is given. A cluster-based detection scheme is presented, where periodically a node is elected as the monitor node for a cluster. These monitor nodes can not only make local intrusion detection decisions, but also cooperatively take part in global intrusion detection. And then the timed automata is constructed by the way of manually abstracting the correct behaviours of the node according to the routing protocol of dynamic source routing （DSR）. The monitor nodes can verify the behaviour of every nodes by timed automata, and validly detect real-time attacks without signatures of intrusion or trained data. Compared with the architecture where each node is its own IDS agent, the approach is much more efficient while maintaining the same level of effectiveness. Finally, the intrusion detection method is evaluated through simulation experiments.

Survey of Clustering Schemes in Mobile Ad hoc Networks

Mobile ad-hoc networks (MANETs) are a specific kind of wireless networks that can be quickly deployed without pre- existing infrastructures. They are used in different contexts such as collaborative, medical, military or embedded applications. However, MANETs raise new challenges when they are used in large scale network that contain a large number of nodes. Subsequently, many clustering algorithms have emerged. In fact, these clustering algorithms allow the structuring of the network into groups of entities called clusters creating a hierarchical structure. Each cluster contains a particular node called cluster head elected as cluster head according to a specific metric or a combination of metrics such as identity, degree, mobility, weight, density, etc. MANETs has drawbacks due to both the characteristics of the transmission medium (transmission medium sharing, low bandwidth, etc.) and the routing protocols (information diffusion, path finding, etc.). Clustering in mobile ad hoc networks plays a vital role in improving resource management and network performance (routing delay, bandwidth consumption and throughput). In this paper, we present a study and analyze of some existing clustering approaches for MANETs that recently appeared in literature, which we classify as: Identifier Neighbor based clustering, Topology based clustering, Mobility based clustering, Energy based clustering, and Weight based clustering. We also include clustering definition, review existing clustering approaches, evaluate their performance and cost, discuss their advantages, disadvantages, features and suggest a best clustering approach.

Genetic Algorithm Routing Protocol for Mobile Ad Hoc Network

Mobile ad hoc network(MANET)is a dynamically reconfigurable wireless network with time-variable infrastructure.Given that nodes are highly mobile,MANET’s topology often changes.These changes increase the difficulty in finding the routes that the packets use when they are routed.This study proposes an algorithm called genetic algorithm-based location-aided routing(GALAR)to enhance the MANET routing protocol efficiency.The GALAR algorithm maintains an adaptive update of the node location information by adding the transmitting node location information to the routing packet and selecting the transmitting node to carry the packets to their destination.The GALAR was constructed based on a genetic optimization scheme that considers all contributing factors in the delivery behavior using criterion function optimization.Simulation results showed that the GALAR algorithm can make the probability of packet delivery ratio more than 99%with less network overhead.Moreover,GALAR was compared to other algorithms in terms of different network evaluation measures.The GALAR algorithm significantly outperformed the other algorithms that were used in the study.

Hardware in Loop Simulation for Emergency Communication Mobile Ad Hoc Network

For the research of mobile Ad hoc network (MANET), hardware in the loop simulation (HILS) is introduced to improve simulation fidelity. The architectures and frameworks of HILS system are discussed. Based on HILS and QualNet network simulator, two kinds of simulation frameworks for MANET multicast emergency communication network are proposed. By running simulation under this configuration and doing experiments with on-demand multicast routing protocol (ODMRP), unicast and multicast functions of this protocol are tested. Research results indicate that HILS method can effectively reduce the difficulty of system modeling and improve precision of simulation, and can further accelerate transition from design to system deployment.

Ad hoc网络DSR路由协议的优化

对DSR路由协议的路由选择和缓存策略进行分析,并针对它的不足,提出通过引入时间参数对路由的选择进行限制,采用自适应路由缩短机制的改进协议。新策略不但提高了缓冲器中路由的质量,而且充分利用了路由缓冲器的空间。利用NS2进行仿真,结果显示对DSR路由协议进行优化后,比较明显地改进了DSR路由协议的性能。

Ad Hoc网络DSR路由协议仿真性能分析

移动Ad Hoc网络是随着无线通信技术的快速发展而出现的一种新型网络。目前,它的应用越来越广泛。在介绍移动Ad Hoc网络的相关技术后,对动态源路由协议(DSR)进行了研究,通过计算机仿真,在不同的网络负荷、节点移动性条件下,对移动Ad Hoc网络的性能进行了分析,仿真结果表明DSR路由协议对于移动环境下的动态路由适应性较好。

Mobile Ad Hoc Network与Internet互联的技术研究

分析了移动IP和AODV协议的工作机理,对MANET与Internet互联的关键技术,包括协议转换、地址分配、网关发现、路由发现与数据传输等问题进行了详细的讨论,并对今后的研究工作进行了展望。

Ad Hoc网络安全路由协议SDSR设计

动态源路由(DSR)协议中没有考虑任何安全的防护措施。为此,在分析DSR协议和安全路由协议(SRP)的基础上提出一种具有较高安全性的路由协议SDSR。将改进的SRP协议嵌入DSR协议中,并在DSR协议路由发现中添加路由记录压缩函数。仿真实验表明,SDSR协议在不影响基本性能的前提下可提高安全性。

Ad Hoc的DSR协议在物联网中的运用

分析了移动自组织Ad Hoc网络与物联网相似的组网结构和通信特点,在此基础上讨论了Ad Hoc中DSR路由协议在物联网通信过程中的适用性。并通过NS模拟了DSR路由协议在物联网中的通信过程,由仿真结果可知:当网络节点移动速度增快或网络规模扩大时,采用按需路由协议DSR可以保持较高的分组平均递交率和较低的路由开销,同时网络也具有较好的服务质量,适合规模较大、快速移动、拓扑结构变化较快的物联网。

“线性结构”Ad hoc网络DSR及AODV路由协议的性能

路由协议对Adhoc网络的性能影响很大。为了给"线性结构"Adhoc网络找到合适的路由协议,研究了DSR和AODV协议的工作原理,对比分析DSR和AODV协议共性和区别。采用OPNET仿真"线性结构"网络环境,对比分析DSR协议和AODV协议的网络性能。仿真结果表明,DSR协议在分组投递率和吞吐量比AODV协议好,DSR协议的路由负荷比AODV稍差。

移动Ad Hoc网络DSR路由协议的改进

在Ad Hoc网络中,针对DSR协议对快速移动的网络拓扑响应不及时,容易产生许多失效路由及产生的路由效率低和能耗不平衡等缺点,提出了一种改进的DSR路由协议(Improved-DSR简称IDSR)。该协议为每个节点增加了邻居表结构与能量均衡机制,使节点能够及时地更新缓存中的失效路由,并根据邻居表中节点状态缩短路由,同时节点通过延迟转发路由发现包的时间来选择生存时间长的路由。仿真结果表明:IDSR与传统的DSR协议相比,IDSR明显提高了分组送达比例,降低了平均延时,延长了网络的生存时间。

Flooding attack and defence in Ad hoc networks

Mobile ad hoc networks are particularly vulnerable to denial of service （DOS） attacks launched through compromised nodes or intruders. In this paper, we present a new DOS attack and its defense in ad hoc networks. The new DOS attack, called AA hoc Flooding Attack（AHFA）, is that intruder broadcasts mass Route Request packets to exhaust the communication bandwidth and node resource so that the valid communication can not be kept. After analyzed AM hoc Flooding Attack, we develop Flooding Attack Prevention （FAP）, a genetic defense against the AM hoc Flooding Attack. When the intruder broadcasts exceeding packets of Route Request, the immediate neighbors of the intruder record the rate of Route Request. Once the threshold is exceeded, nodes deny any future request packets from the intruder. The results of our implementation show FAP can prevent the AM hoe Flooding attack efficiently.

一种新的军用移动AD HOC网络及DSR路由算法

移动ADHOC网络(MANET)不需要固定基站支持,可实现分布式的无中心管理,可临时组织,并具有高度移动性和抗毁性,为特殊环境(尤其是军用通信)提供了理想的解决方案。MANET可采用平面结构或分级结构,当网络规模较大并需要提供一定的服务质量保障时,宜采用分级网络结构。文章结合一种新的军用网络结构,针对其子网提出了基于动态源路由(DSR)协议的优化措施,以保证较高的报文传输成功率、较小的网络开销、较高的网络吞吐量和较小的端到端时延。

Virtual reality mobility model for wireless ad hoc networks

For wireless ad hoc networks simulation, node＇s mobility pattern and traffic pattern are two key elements. A new simulation model is presented based on the virtual reality collision detection algorithm in obstacle environment, and the model uses the path planning method to avoid obstacles and to compute the node＇s moving path. Obstacles also affect node＇s signal propagation. Considering these factors, this study implements the mobility model for wireless ad hoc networks. Simulation results show that the model has a significant impact on the performance of protocols.

无线Ad hoc网络DSR路由协议的性能分析

无线Ad hoc网络的应用越来越广泛.由于其节点的移动性,使得现有的路由协议不能满足需求,为此,有许多的研究着力于无线路由方面并提出了多个无线Ad hoc路由协议.本文针对其中的DSR路由协议进行性能分析并通过国际通用的网络仿真器NS2进行网络仿真.仿真是在5个无线节点的网络拓扑结构中进行,通过nam直观观看网络运行的具体过程,如数据包的发送、转发、丢失和网络拓扑结构对数据传输的影响等.最后对整个过程产生的Trace文档进行处理、分析,得到DSR协议的传输速率、网络开销及其他性能特性,并和其他路由协议进行比较.