基于朋友机制的移动ad hoc网络路由入侵检测模型研究

从如何有效检测移动ad hoc网络路由入侵行为、如何准确地响应并将恶意路由节点移除网络,提供可信路由环境的角度进行分析,提出了一种基于朋友机制的轻量级移动ad hoc网络入侵检测模型,并以典型的黑洞攻击为例,通过OPNET网络建模仿真及实验分析,验证了该模型的可行性和有效性。     

移动ad hoc网络安全综述

移动ad hoc网络是由移动节点自组织形成的网络,由于其动态拓扑、无线通信的特点,容易遭受各种安全威胁.该文介绍了移动ad hoc网络安全研究的最新研究进展.首先从传输信道、移动节点、动态拓扑、安全机制、路由协议几方面,分析了移动ad hoc网络的安全弱点,然后将移动ad hoc网络安全方面的研究分为三个方向:密钥分配与管理、入侵检测、增强合作.对每个方向内一些典型安全方案也进行了分类论述,同时分析了各种方案的优点和缺点,并进行了综合比较.文中阐明了目前协议存在的一些问题并提出了相应的改进方法,最后指出了下一步研究方向.     

基于改进粒子群算法的Ad Hoc网络移动模型研究

 移动模型是研究ad hoc网络路由算法的基础.为解决基本粒子群算法的速度突变问题,使其适用于ad hoc网络移动模型,本文首先在基本粒子群算法的速度和位移更新公式中引入加速度和环境因子的概念,并提出用直角坐标系对其速度和位移进行分解.接着,我们建立了包含障碍物模型、速度初始化函数和无边界仿真区域的改进粒子群算法移动模型.为证实新移动模型的可行性和有效性,我们用Matlab和网络仿真软件OPNET进行仿真实验.结果表明,与传统的随机位点移动模型比较,基于改进粒子群算法的移动模型更贴近实际情景,并能够有效地应用在ad hoc网络中.     

移动Ad Hoc网络基于IPv6的Internet接入技术研究

针对实现移动用户无线上网的需求，通过对移动AdHoc网络的体系结构和路由技术的研究，以及对移动IPv6协议的工作原理及其与IPv4特性的比较分析，提出了AdHoc网络基于IPv6的Intemet接入方法，并对其地址自动配置、路由发现、网关发现、协议转换和分组转换等关键技术进行了分析，同时针对这两种技术相结合存在的广播和多跳问题提出了改进方法，并对今后的工作进行了展望。     

蜂窝ad hoc网络概述

一、ad hoc网络与蜂窝网络的结合 在移动无线通信网络原有的网络构架技术中通常包括蜂窝移动通信网络和无线局域网,蜂窝移动通信网络移动终端接入固定网络是基于基站的中心接人方式,而无线局域网则要通过接入点（AP）完成终端接入固定网络,这两种网络都是单跳网络。ad hoc技术所标称的是一种有别于中心接人和单跳的特征,强调多跳和无中心接入,移动终端不仅具有主机的功能,还具有路由器的功能,使得无线移动ad hoc网络被认为是下一代移动通信系统解决方案中最有希望被采用的末端网络。     

一种移动接入网络中4over6软线隧道方案的设计与实现

文章提出一种使用4over6软线隧道实现IPv6接入网络中用户驻地设备与移动基站之间进行IPv4数据通信的方案。通过将4over6软线隧道技术与ARP代理技术相结合,解决IPv6大规模推广后,移动接入网络中依赖IPv4协议栈的遗留设备间的三层通信问题,并根据此设计思路在Linux平台上利用IPv6隧道模块和ARP代理功能完成工程性实现和验证。最后对比讨论该方案与其他的可行性方案,并提出潜在问题以便进一步研究。     

层次型移动IPv6网络中的路由优化方案

本文描述了层次性移动IPv6的原理，讨论了层次性移动IPv6网络中的路由优化问题；介绍了三种基于层次性移动IPv6路由优化的方案，最后根据数据结果对其性能进行了比较分析。     

面向移动IPv6层次化网络的快速接入认证方案

提出了一个面向移动IPv6层次化网络的快速接入认证方案,从效率和安全性2个方面提高移动IPv6层次化网络接入认证的性能。首先,利用向量网络地址编码方法实现网络数据传输,提高家乡注册性能;其次,提出一种基于格的层次化签名方案,在接入认证过程中实现双向认证,提高认证过程的安全性。方案分析表明,所提出的接入认证方案具有强不可伪造性并可以抵御网络中的重放攻击,同时可以减少整个接入认证过程的延迟时间。     

基于层次移动IPv6接人认证设计与实现

在移动IPv6和层次移动IPv6中，移动节点通过无线接入点（AP）接入网络并且自动配置地址，缺乏必要的安全认证和地址管理机制。针对这一问题，文章结合IPv6的动态主机配置协议（DHCPv6）和认证，授权，计费（AAA，Authentication,Authorization,Accounting）协议设计出一套安全可靠的接入认证机制，并给出了实验结果。结果表明该接入认证方案能够有效实现对移动节点的合法性进行验证，认证成功的同时也为移动节点（MN）配置了合法IP地址，能够满足实际应用的需要。     

感知无线电ad hoc网络基于干扰的路由

感知无线电技术作为一种新兴技术,通过时间和空间维度上的频谱空洞的利用能很好地提高频谱利用率。感知无线电的路由不同于传统的路由度量,因为次用户从时间和空间上都不能对主用户造成干扰。在感知无线电ad hoc网络环境下,选取了干扰作为路由的度量,并将干扰分为系统内干扰(次用户自身之间的干扰)和系统间干扰(次用户对主用户的干扰)。在已有的ad hoc网络干扰路由协议的基础上对干扰权重做出改进,并提出新的基于系统间路由干扰(对主用户干扰最小化)和基于联合系统内和系统间干扰的路由协议。仿真结果表明,该干扰模型符合感知无线电移动ad hoc网络的特性。     

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.     

Mobile IPv6-based ad hoc networks: its development and application

The Internet protocol version 6 (IPv6)-enabled network architecture has recently attracted much attention. In this paper, we address the issue of connecting mobile ad hoc networks (MANETs) to global IPv6 networks, while supporting IPv6 mobility. Specifically, we propose a self-organizing, self-addressing, self-routing IPv6-enabled MANET infrastructure, referred to as IPv6-based MANET. The proposed self-organization addressing protocol automatically organizes nodes into tree architecture and configures their global IPv6 addresses. Novel unicast and multicast routing protocols, based on longest prefix matching and soft state routing cache, are specially designed for the IPv6-based MANET. Mobile IPv6 is also supported such that a mobile node can move from one MANET to another. Moreover, a peer-to-peer (P2P) information sharing system is also designed over the proposed IPv6-based MANET. We have implemented a prototyping system to demonstrate the feasibility and efficiency of the IPv6-based MANET and the P2P information sharing system. Simulations are also conducted to show the efficiency of the proposed routing protocols.     

GPS/Ant-Like Routing in Ad Hoc Networks

A mobile ad hoc network (MANET) is comprised of mobile hosts that can communicate with each other using wireless links. In this paper we present a novel routing algorithm called GPSAL (GPS/Ant-Like Routing Algorithm) which is based on GPS (Global Positioning System) and mobile software agents modeled on ants for routing in ad hoc networks. We compare our algorithm to the Location-Aided Routing (LAR) [20] algorithm for MANET which is also based on GPS. Simulation results show that our algorithm has less overhead than LAR.     

Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking

As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper, we give an overview of the Safari architecture for highly scalable ad hoc network routing, and we present the design and evaluation of a specific realization of the Safari architecture, which we call Masai. We focus in this work on the scalability of learning and maintaining the routing state necessary for a large ad hoc network. The Safari architecture provides scalable ad hoc network routing, the seamless integration of infrastructure networks when and where they are available, and the support of self-organizing, decentralized network applications. Safari’s architecture is based on (1) a self-organizing network hierarchy that recursively groups participating nodes into an adaptive, locality-based hierarchy of cells; (2) a routing protocol that uses a hybrid of proactive and reactive routing information in the cells and scales to much larger numbers of nodes than previous ad hoc network routing protocols; and (3) a distributed hash table grounded in the network hierarchy, which supports decentralized network services on top of Safari. We evaluate the Masai realization of the Safari architecture through analysis and simulations, under varying network sizes, fraction of mobile nodes, and offered traffic loads. Compared to both the DSR and the L+ routing protocols, our results show that the Masai realization of the Safari architecture is significantly more scalable, with much higher packet delivery ratio and lower overhead.     

Integrating Mobile Ad Hoc Network to the Internet

A novel scheme is presented to integrate mobile ad hoc networks （MANETs） with the lnternet and support mobility across wireless local area networks （WLANs） and MANETs. The mobile nodes, connected as a MANET, employ the optimize d link state routing （OLSR） protocol for routing within the MANET. Mobility management across WLANs and MANETs is achieved through the hierarchical mobile IPv6 （HMIPv6） protocol. The performance is evaluated on a HMIPv6 based test-bed composed of WLANs and MANETs. The efficiency gain obtained from using HMIPv6 in such a hybrid network is investigated. The investigation result shows that the use of HMIPv6 can achieve up to 27% gain on reducing the handoff latency when a mobile roams within a domain. Concerning the reduction of the signaling load on the lnternet, the use of HMIPv6 can achieve at least a 54% gain and converges to 69%.     

Adding sense of spatial locality to routing protocols for mobile ad hoc networks

Recently, there has been an increasing interest in mobile ad hoc networks. In a mobile ad hoc network, each mobile node can freely move around and the network is dynamically constructed by collections of mobile nodes without using any existing network infrastructure. Compared to static networks, it faces many problems such as the inefficiency of routing algorithms. Also, the number of control packets in any routing algorithm increases as the mobile speed or the number of mobile nodes increases. Most of the current routing protocols in ad hoc networks broadcast the control packets to the entire network. Therefore, by reducing the number of control packets, the efficiency of the network routing will be improved. If we know where the destination is, we can beam our search toward that direction. However, without using global positioning systems, how can we do this? Define the range nodes as the 1‐hop or 2‐hop neighbors of the destination node. In this paper, we propose using the range nodes to direct our searches for the destination. It can be combined with the existing routing protocols to reduce the control overhead. We show through simulations that AODV and DSR combined with the range node method outperforms the original AODV and DSR routing protocols in terms of control packets overhead. We also show that the delay introduced in find range nodes is insignificant. Copyright © 2006 John Wiley & Sons, Ltd.     

Trading latency for energy in densely deployed wireless ad hoc networks using message ferrying

Wireless mobile ad hoc networks (MANETs) have the potential for use in important application environments, such as remote environmental monitoring, where energy resources are limited. Efficient power management is necessary to allow these networks to operate over a long period of time. One of the key factors affecting the design of power management mechanisms is the routing protocol in use within the network. In this paper, we investigate the Message ferrying (MF) routing paradigm as a means to save energy while trading off data delivery delay. In MF, special nodes called ferries move around the deployment area to deliver messages for nodes. While this routing paradigm has been developed mainly to deliver messages in partitioned networks, here we explore its use in a connected MANET. The reliance on the movement of ferries to deliver messages increases the delivery delay if a network is not partitioned. However, delegating message delivery to ferries provides the opportunity for nodes to save energy by aggressively disabling their radios when ferries are far away. To exploit this feature, we present a power management framework, in which nodes switch their power management modes based on knowledge of ferry location. We evaluate the performance of our scheme using ns-2 simulations and compare it with a multihop routing protocol, dynamic source routing (DSR). Our simulation results show that MF achieves energy savings as high as 95% compared to DSR without power management and still delivers more than 98% of messages. In contrast, a power-managed DSR delivers many fewer messages than MF to achieve similar energy savings. In the scenario of heavy traffic load, the power-managed DSR delivers less than 20% of messages. MF also shows robust performance for highly mobile nodes, while the performance of DSR suffers significantly. Thus, delay tolerant applications can use MF rather than a multihop routing protocol to save energy efficiently when both routing approaches are available.     

Performance of ad hoc routing using directional antennas

This paper evaluates the tradeoffs involved in using directional antennas in ad hoc routing. Although problems with utilizing directional antennas have been visited in the past, the research has been confined mostly to medium access control. To determine whether directional antennas are beneficial to ad hoc networks, it is necessary to evaluate the impact of directional antennas on the performance of routing protocols as well. In this paper, we evaluate the performance of DSR (dynamic source routing) using directional antennas. We identify several issues that emerge from executing DSR (originally designed for omnidirectional antennas) over directional antennas. Using insights gained from simulations, we propose routing strategies that adapt the routing protocol to directional communication. Our analysis shows that by using directional antennas, ad hoc networks may achieve better performance. However, scenarios exist in which using omnidirectional antennas may be more appropriate.     

Cross-Layer Design for Data Accessibility in Mobile Ad Hoc Networks

Mobile ad hoc networks (MANET) are becoming an integral part of the ubiquitouscomputing and communication environment, providing new infrastructure formultimedia applications such as video phone, multimedia-on-demand, and others.In order to access multimedia information in MANET, Quality of Service (QoS)needs to be considered, such as high success rate to access multimedia data,bounded end-to-end delay, and others. In this paper, we present a dataaccessibility service for a group of mobile users to access desired data withhigh success rate. This accessibility service is only possible if we utilizeadvanced data advertising, lookup and replication services, as well as a novelpredictive location-based QoS routing protocol in an integrated fashion. Usingcross-layer design, we illustrate how the QoS routing protocol assists dataadvertising, lookup and replication services to achieve high data accesssuccess rate. Simulation results have shown that our design is successful ina dynamic MANET.     

A routing protocol for mobile ad‐hoc networks using the profit optimization model

Recently, wireless networks have become one of the major development trends in computer network technology. Because there is no more need of the wired transmission medium, applications have thus diversified. One such growing field of wireless networks is the mobile ad‐hoc network (MANET). A MANET consists of mobile hosts (such as portable laptops, vehicles, etc.), and no fixed infrastructure is required. MANETs provide ease of self‐configuration and can extend coverage at a low cost. Numerous applications have therefore been proposed under this network environment for daily life use. Because MANETs nodes are capable of moving, MANET network topology changes frequently. Thus, the traditional routing protocols fail to fit such an environment. In this paper, we propose an efficient routing protocol for MANETs, which integrates the mathematical model of profit optimization (the Kelly formula) from the field of economics to cope with the routing problem caused by node mobility. Some numerical simulations have been conducted to evaluate the performance of the proposed method using the network simulator NS‐2. The results show that our proposed method outperforms conventional routing protocols in packet delivery ratio comparisons; and the average end‐to‐end delays are within a tolerable range. Copyright © 2013 John Wiley & Sons, Ltd.