QMRPRNS: Design of QoS multicast routing protocol using reliable node selection scheme for MANETs

A mobile Ad-Hoc networks (MANETs) is a continuously self-configuring, infrastructure-less network of wireless mobile devices. In which multicast is one of the efficient way of communication. Currently, several research have been conducted to design multicast routing protocols for wireless mobile ad-hoc networks (MANETs). Multicasting is a technique that allow to send the same message to a group of destinations simultaneously. However, it faces several challenges against its implementation in ad-hoc network due to its dynamic nature, lack of bandwidth, short battery lifetime of the mobile devices. The multicast routing protocol MAODV have several constraints as mentioned above. Hence to address these constraints a reliable neighbour nodes selection scheme has been integrated over MAODV. This paper attempt a Quality of Service (QoS) based multicast routing protocol using reliable neighbour nodes selection scheme (QMRPRNS) for same. The simulation has been conducted to compare the performance of the proposed scheme against some existing multicast routing protocols which shows significant improvement over EMAODV and MAODV.     

Prevention of Black Hole Attack in Multicast Routing Protocols for Mobile Ad-Hoc Networks Using a Self-Organized Public Key Infrastructure

ABSTRACT

A mobile ad-hoc network (MANET) is an autonomous system of mobile nodes connected by wireless links in which nodes cooperate by forwarding packets for each other thereby enabling communication beyond direct wireless transmission range. Example applications include battlefield communication, disaster recovery operations, and mobile conferencing. The dynamic nature of ad-hoc networks makes them more vulnerable to security attacks compared with fixed networks. Providing security in mobile ad-hoc networks has been a major issue in recent years. Most of the secure routing protocols proposed by researchers need a centralized authority or a trusted third party to provide authentication. This destroys the self-organizing nature of ad-hoc networks. Black Hole attack is one of the routing attacks that occur in MANETs. In this attack, a malicious node uses the routing protocol to advertise itself as having the shortest path to the node whose packets it wants to intercept. In this article, we propose an enhanced certificate based authentication mechanism, where nodes authenticate each other by issuing certificates to neighboring nodes and generating public key without the need of any online centralized authority. The proposed scheme uses Multicast Ad-hoc On Demand Distance Vector Routing (MAODV) protocol as a support for certification. The effectiveness of our mechanism is illustrated by simulations conducted using network simulator ns-2.     

基于博弈的MANETs信任模型研究

移动Ad-Hoc网络(MANET)是由一组带有无线收发装置的移动节点组成的无须固定设置支持的临时性的通信网络.MANETs具有开放的媒质、动态的拓扑结构、分布式的合作和受限的网络能力等基本特点.在MANETs中,节点之间相互信赖路由和转发数据包,节点间的合作是非常重要的.但是由于自私节点为了储存能量和其他资源,而不参与转发数据.由于MANETs通信没有第3方的中心认证,所以集中于强制合作是不适应的.基于博弈研究MANETs中的节点行为,根据节点的信誉度来获得资源,刺激节点共享资源和转发数据.提出了基于博弈理论的信任模型,鼓励包转发,约束自私节点.仿真结果表明该信任模型能够识别自私节点并且能在信任节点之间建立信任,提高了整个网络效率.     

Ad Hoc网络中的多播路由协议

无线Ad Hoc网络是指一组无线移动节点组成的多跳的,临时性的,无基础设施支持的无中心网络。多播是一种面向群组计算的通信传播方式,它使用单一的源地址把数据发给一组主机。如何在移动自组网中实现有效的多播路由技术是当前此领域研究中亟待解决的问题。文中对当前一些典型的多播路由协议进行了研究,并对它们各自的工作方式进行了分析,最后对它们各自的特点进行了比较。     

Ad Hoc网络中的多播路由协议

无线Ad Hoc网络是指一组无线移动节点组成的多跳的,临时性的,无基础设施支持的无中心网络。多播是一种面向群组计算的通信传播方式,它使用单一的源地址把数据发给一组主机。如何在移动自组网中实现有效的多播路由技术是当前此领域研究中亟待解决的问题。文中对当前一些典型的多播路由协议进行了研究,并对它们各自的工作方式进行了分析,最后对它们各自的特点进行了比较。     

Ant colony algorithms in MANETs: A review

Mobile ad-hoc networks (MANETs) consist of special kind of wireless mobile nodes which form a temporary network without using any infrastructure or centralized administration. MANETs can be used in wide range of future applications as they have the capability to establish networks at anytime, anywhere without aid of any established infrastructure. It is a challenging task to find most efficient routing due to the changing topology and the dynamic behavior of the nodes in MANET. It has been found that ant colony optimization (ACO) algorithms can give better results as they are having characterization of Swarm Intelligence (SI) which is highly suitable for finding the adaptive routing for such type of volatile network. ACO algorithms are inspired by a foraging behavior of group of ants which are able to find optimal path based upon some defined metric which is evaluated during the motion of ants. ACO routing algorithms use simple agents called artificial ants which establish optimum paths between source and destination that communicate indirectly with each other by means of stigmergy. Keeping in view of the above, in this paper we provide a taxonomy of various ant colony algorithms with advantages and disadvantages of each others with respect to various metrics.     

基于MAODV多播路由协议的改进协议

MANET(移动自主网)是由一组带有无线收发装置的移动终端组成的一个多跳的临时性自治系统,网络中的节点互相通信而不依赖于预先架设的固定基础设施,在军用和紧急救援等特殊环境的应用前景非常广阔。多播是有利于成员组通信的方式,高效的多播路由是MANET网络多播路由的主要难题。文章在MAODV的基础上,提出了基于GroupH ello(GRPH)消息机制、路由发现和路由维护的MAODV多播路由协议的改进协议,仿真实验显示改进后的协议减少了开销、降低了时延,在高动态的网络中尤为明显。     

Using particle swam optimization for QoS in ad-hoc multicast

A mobile ad hoc network (MANET) is a collection of self-organized mobile nodes that are capable of communicating with each other without the aid of any established infrastructure or centralized administration. Multicasting plays a very important role in the application of ad hoc networks. As the number of participants increases, scalability of the multicast protocol becomes an important issue. When considering the increasing demand of Quality-of-Service (QoS) requirements in many applications, the existing multicast routing protocols used for ad-hoc network should be adapted appropriately to effectively meet the stringent QoS requirements of specific multimedia traffic. We thus propose a multicast routing protocol which tries its best to meet the variation of behavior of network topology and satisfy QoS requirements of specific multimedia traffic using particle swam optimization (PSO) in the volatile environments of a MANET. Meanwhile, a priority scheduler with PSO is also proposed to make scheduling decisions so that the packet loss rate can be further reduced. The results of a series of simulations exhibit the practicability and feasibility of our protocol.     

A reliable QoS aware routing protocol with slot assignment for mobile ad hoc networks

A mobile ad hoc network (MANET) is a collection of mobile hosts that form a temporary network on the fly without using any fixed infrastructure. Recently, the explosive growth in the use of real-time applications on mobile devices has resulted in new challenges to the design of protocols for MANETs. Chief among these challenges to enable real-time applications for MANETs is incorporating support for quality of service (QoS), such as bandwidth constraints. However, MANETs having a high ratio of topology change make routing especially unstable; making stability is an important challenge, especially for routing having a quality of service provision. In this paper, we propose a reliable multi-path QoS routing (RMQR) protocol with a slot assignment scheme. In this scheme, we examine the QoS routing problem associated with searching for a reliable multi-path (or uni-path) QoS route from a source node to a destination node in a MANET. This route must also satisfy certain bandwidth requirements. We determine the route expiration time between two connected mobile nodes using global positioning system (GPS). Then, two parameters, the route expiration time and the number of hops, are used to select a routing path with low latency and high stability. Simulation results show that the proposed RMQR protocol have some outstanding properties when compared with Lin's [Lin C-R. On-demand QoS routing in multihop mobile networks. In: Proceedings of the twentieth annual joint conference of the IEEE computer and communications societies (INFOCOM), vol. 3(22–26), 2001, p. 1735–44], Liao's [Liao W-H, Tseng Y-C, Wang S-L, Sheu J-P. A multi-path QoS routing protocol in a wireless mobile Ad Hoc network. Telecommunication Systems 2002;19(3–4):329–47], and Chen's [Chen Y-S, Tseng Y-C, Sheu J-P, Kuo P-H. An on-demand, link-state, multi-path QoS routing in a wireless mobile Ad-Hoc network. Computer Communications 204;27(1):27–40] protocols.     

基于Ad Hoc的QoS多播路由协议研究

近年来,随着计算机网络和无线通信技术的迅速发展,无线移动AdHoc网络在军事和民用方面获得了大量应用。多媒体业务的引入对AdHoc网络提出了多播和QoS服务的需求,如何在AdHoc网络中实现有效的多播和QoS服务是一项十分困难和具有挑战性的工作。论文介绍了当前几种比较典型的QoS多播路由协议,并且从多个方面对它们的特性进行了比较分析,最后对AdHoc网络的QoS多播路由协议的进一步研究提出了预测和展望。     

SafeMesh: A wireless mesh network routing protocol for incident area communications

Reliable broadband communication is becoming increasingly important during disaster recovery and emergency response operations. In situations where infrastructure-based communication is not available or has been disrupted, an Incident Area Network needs to be dynamically deployed, i.e. a temporary network that provides communication services for efficient crisis management at an incident site. Wireless Mesh Networks (WMNs) are multi-hop wireless networks with self-healing and self-configuring capabilities. These features, combined with the ability to provide wireless broadband connectivity at a comparably low cost, make WMNs a promising technology for incident management communications. This paper specifically focuses on hybrid WMNs, which allow both mobile client devices as well as dedicated infrastructure nodes to form the network and provide routing and forwarding functionality. Hybrid WMNs are the most generic and most flexible type of mesh networks and are ideally suited to meet the requirements of incident area communications. However, current wireless mesh and ad-hoc routing protocols do not perform well in hybrid WMN, and are not able to establish stable and high throughput communication paths. One of the key reasons for this is their inability to exploit the typical high degree of heterogeneity in hybrid WMNs. SafeMesh, the routing protocol presented in this paper, addresses the limitations of current mesh and ad-hoc routing protocols in the context of hybrid WMNs. SafeMesh is based on the well-known AODV routing protocol, and implements a number of modifications and extensions that significantly improve its performance in hybrid WMNs. This is demonstrated via an extensive set of simulation results. We further show the practicality of the protocol through a prototype implementation and provide performance results obtained from a small-scale testbed deployment.     

Standardisation advancements in the area of routing for mobile ad-hoc networks

Mobile Ad hoc Networks (MANETs) are self-organized and fully distributed networks that rely on the collaboration of participating devices to route data from source to destination. The MANET paradigm is expected to enable ubiquitous mobile communication and thus the proliferation of pervasive applications. The MANET Working Group (WG) of the Internet Engineering Task Force (IETF) is responsible for standardizing an appropriate Internet Protocol (IP) based routing protocol functionality for both static (mesh) and dynamic (mobile) wireless ad hoc network topologies. In this paper, we provide a background on the possibility to use MANETs for enabling future pervasive internet and innovative ubiquitous services. We also describe the work achieved by the MANET WG thus far on the area of secure unicast and multicast routing for MANETs. We also examine non-IETF work on this area, chiefly based on adaptive and hybrid routing. The paper then presents comparative performance evaluations of discussed routing protocols. It is mainly observed that there is a need for adaptive hybrid routing approaches in order to support future innovative and pervasive applications. Consequently, we present our conclusions.     

A new wireless ad hoc multicast routing protocol

An ad hoc network is a multi-hop wireless network of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and mobility require that ad hoc routing protocols be robust, simple, and energy conserving. This paper proposes a new ad hoc multicast routing protocol called neighbor-supporting multicast protocol (NSMP). NSMP adopts a mesh structure to enhance resilience against mobility. And NSMP utilizes node locality to reduce the overhead of route maintenance. NSMP also attempts to improve route efficiency and reduce data transmissions. Our simulation results show that NSMP delivers packets efficiently while substantially reducing control overhead in various environments.     

移动Ad Hoc网络中一种多播路由协议算法实现

MANET是一个多跳,节点无中心、自组织、互相通信而不依赖于预先架设的固定基础设施无线移动网络。本文提出了采用按需路由发现策略的移动Ad Hoc多播路由算法。此算法不需要维护全局的路由信息,通过按需路由发现过程,动态更新路由信息和建立多播转发组。多播数据包在转发组成员间进行有限泛洪,能够降低带宽的占用及减少路由更新信息的传播。仿真实验显示多播算法在带宽较低、多播组成员数量变化较大的移动分组无线网环境中,具有较好的可靠性和工作效率。     

移动Ad Hoc网络多播路由协议的研究进展

移动AdHoc网络是一个自组织、移动节点通过无线链路组成的动态拓扑变化的网络.由于网络规模小、无基础设施、构建迅速等特点,从而广泛用于紧急事件、军事和民用领域以及多媒体应用等.随着网络应用规模的增长,在移动AdHoc网络中支持多播路由成为网络领域中一类重要的研究课题.该文综述了移动AdHoc网络多播路由方面的一些最新工作,论述了设计移动AdHoc网络多播路由协议的特性、问题和技术,详细描述和比较了目前典型的移动AdHoc网络多播路由协议,为进一步的应用和研究提出了新的课题.     

一种UC匿名的移动自组网概率组播策略

鉴于现有移动自组网匿名路由协议不能为组播提供匿名通信支持,而只能提供特定非形式化的匿名性分析,提出了一种UC(universally composable)匿名的移动自组网概率组播策略.在路由发现阶段,采用一次性密钥对保持路径记录私密.在数据分组传输阶段,采用Gossip机制、DH秘密路径及Bloom Filter编码实现匿名源路由组播.最后,采用UC框架分析了协议的匿名性,并对协议的性能进行了仿真.分析与仿真结果表明,该策略在实现匿名性的同时还提供了较好的可靠性.     

认知无线电网络中QoS组播路由调度

在多跳认知无线电网络中,组播的信息通常要经由多个中间节点的转发才能到达最终的目的节点。现有的研究中已经有很多的组播路由协议,然而这些协议都是基于传统无线网络的,并不适合新型的认知无线电网络。本文解决的的问题是:在多跳无线网络中,给定一个具有QoS要求的组播请求,如何建立组播路由以及对路径节点进行传输调度,使得在满足QoS要求下整个传输过程的带宽消耗最小。本文提出了一个分布式的组播路由协议来解决该问题,该协议不仅实现了路由过程的建立,同时还完成了对节点传输过程的合理调度。实验结果证明本文的传输调度策略能有效地减少网络的带宽消耗,同时增加组播请求响应的成功率。     

移动自组网络中Anycast通信协议的研究综述

移动自组网是一种特殊的无线移动通信网络,不依赖于存在的固定设施,其结构具有快速展开、自治、多跳等特性。选播协议(Anycast)是IP网路的一种通信模型,它在资源健壮性、效率方面对移动自组网尤显重要。本文介绍了移动自组网络和Anycast通信协议的基本概念和特点,分析和评价了目前移动自组网络中Anycast路由协议的研究现状,提出了该领域的进一步研究方向和基本思路。     

Genetic algorithms with immigrants schemes for dynamic multicast problems in mobile ad hoc networks

In this paper, the problem of dynamic quality-of-service (QoS) multicast routing in mobile ad hoc networks is investigated. Lots of interesting works have been done on multicast since it is proved to be a NP-hard problem. However, most of them consider the static network scenarios only and the multicast tree cannot adapt to the topological changes. With the advancement in communication technologies, more and more wireless mobile networks appear, e.g., mobile ad hoc networks (MANETs). In a MANET, the network topology keeps changing due to its inherent characteristics such as the node mobility and energy conservation. Therefore, an effective multicast algorithm should track the topological changes and adapt the best multicast tree to the changes accordingly. In this paper, we propose to use genetic algorithms with immigrants schemes to solve the dynamic QoS multicast problem in MANETs. MANETs are considered as target systems because they represent a new generation of wireless networks. In the construction of the dynamic network environments, two models are proposed and investigated. One is named as the general dynamics model in which the topologies are changed due to that the nodes are scheduled to sleep or wake up. The other is named as the worst dynamics model, in which the topologies are altered because some links on the current best multicast tree are removed. Extensive experiments are conducted based on both of the dynamic network models. The experimental results show that these immigrants based genetic algorithms can quickly adapt to the environmental changes (i.e., the network topology changes) and produce high quality solutions following each change.     

Behavior of Ad Hoc routing protocols,analyzed for emergency and rescue scenarios,on a real urban area

A mobile Ad Hoc network (MANET) is a collection of wireless mobile nodes that can dynamically configure a network without a fixed infrastructure or central administration. This makes it ideal for emergency and rescue scenarios, where sharing information is essential and should occur as soon as possible. This article discusses which of the routing strategies for mobile MANETs: proactive, reactive or hierarchical, has a better performance in such scenarios. By selecting a real urban area for the emergency and rescue scenario, we calculated the density of nodes and the mobility model needed for the validation study of AODV, DSDV and CBRP in the routing model. The NS2 simulator has been used for our study. We also show that the hierarchical routing strategies are better suited for this type of scenarios.