Data Replication for Improving Data Accessibility in Ad Hoc Networks

In ad hoc networks, due to frequent network partition, data accessibility is lower than that in conventional fixed networks. In this paper, we solve this problem by replicating data items on mobile hosts. First, we propose three replica allocation methods assuming that each data item is not updated. In these three methods, we take into account the access frequency from mobile hosts to each data item and the status of the network connection. Then, we extend the proposed methods by considering aperiodic updates and integrating user profiles consisting of mobile users' schedules, access behavior, and read/write patterns. We also show the results of simulation experiments regarding the performance evaluation of our proposed methods     

移动Ad hoc网络中的密钥管理

首先阐述了移动adhoc网络中密钥管理的重要性,接着探讨了几种密钥管理的方法,包括局部分布式认证授权中心、完全分布式认证授权中心、自发证书、安全Pebblenets、指示性标志、基于口令验证的密钥交换等,并对这些方法进行了较完整的概括总结和深入的比较分析,最后提出了一些研究移动adhoc网络中密钥管理方法所必须注意的问题。     

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.     

Spontaneous Group Management in Mobile Ad Hoc Networks

This paper deals with the problem of Location Management in mobile ad hoc networks where users are organized in groups. In the following this type of systems are referred to as Mobile Ad hoc Networks for Group Operations (MANGO). This paper proposes a framework for location management which exploits the trend of mobile users to spontaneously form groups in MANGOs. The management procedures required to support such spontaneous groups, which are by nature dynamic, are introduced as well. The proposed spontaneous group management is based on a hierarchical location database architecture and the concept of Group Leader, which is a terminal responsible for the location update of a group of terminals. Objective of the proposed framework is minimizing the burden on location databases and, at the same time, the signaling issued by terminals. In this paper, distributed operations required to support the whole framework are properly introduced and described. Simulation experiments have been run in order to assess the proposed scheme. Performance results show that the introduced methodology allows reduced signaling and location updating.     

Inner-Circle Consistency for Wireless Ad Hoc Networks

This paper proposes and evaluates strategies to build reliable and secure wireless ad hoc networks. Our contribution is based on the notion of inner-circle consistency, where local node interaction is used to neutralize errors/attacks at the source, both preventing errors/attacks from propagating in the network and improving the fidelity of the propagated information. We achieve this goal by combining statistical (a proposed fault-tolerant duster algorithm) and security (threshold cryptography) techniques with application-aware checks to exploit the data/computation that is partially and naturally replicated in wireless applications. We have prototyped an inner-circle framework and used it to demonstrate the idea of inner-circle consistency in two significant wireless scenarios: 1) the neutralization of black hole attacks in AODV networks and 2) the neutralization of sensor errors in a target detection/ localization application executed over a wireless sensor network     

Replication of Routing Tables for Mobility Management in Ad Hoc Networks

Ad Hoc networking is a rather old technology that is gaining new momentum in the research community. It is still an area under development and there are several proposals for the technology regarding routing protocols, addressing, interoperability, etc. Because of the extreme conditions where Ad Hoc networks should operate, it is envisioned that in medium to large scale networks, a hybrid proactive and reactive routing mechanism should be used. Therefore, considering the proactive routing protocols as the most suitable protocol for certain topologies in Ad Hoc networks, this paper proposes a specific layered structure to enable both technologies in a seamless manner. This approach supports both reactive (e.g., AODV, DSR) and proactive link state (e.g., OLSP) protocols. The proposed layered structure divides the routing problem into different parts, where one module performs the routing algorithm, another module takes care of replicating and synchronizing the routing tables, and a third one evaluates the routing information for triggering hand-over signals to the upper layers. The overall responsibility for selecting the appropriate routing schema and for initiating the roaming process resides on a proposed Context Sensitive Roaming Layer. This paper describes the interface and the functions implemented by the Roaming Layer. The paper also analyses replication using the Server Cache Synchronization Protocol (SCSP). Finally, the last part of the paper describes the demand for Ad Hoc networks, which is driven by applications supported with an appropriate billing or bonus mechanism.     

移动Ad Hoc网络中的安全问题

移动自组网(Mobile Ad HoC Network)是一种无基础设施的无线网络由于它具有开放的媒质、分布式的合作、动态的拓扑结构和受限的网络能力等特点,所以特别容易受到攻击.为此文章结合移动Ad Hoc网络的特点分析了移动Ad Hoc网络面临的安全威胁,并对移动Ad Hoc网络的安全路由和安全报文传送问题进行了详细讨论.     

Internet Connectivity for Ad Hoc Mobile Networks

The growing deployment rate of wireless LANs indicates that wireless networking is rapidly becoming a prevalent form of communication. As users become more accustomed to the use of mobile devices, they increasingly want the additional benefit of roaming. The Mobile IP protocol has been developed as a solution for allowing users to roam outside of their home networks while still retaining network connectivity. The problem with this solution, however, is that the deployment of foreign agents is expensive because their coverage areas are limited due to fading and interference. To reduce the number of foreign agents needed while still maintaining the same coverage, ad hoc network functionality can cooperate with Mobile IP such that multihop routes between mobile nodes and foreign agents can be utilized. In this work, we present a method for enabling the cooperation of Mobile IP and the Ad hoc On-Demand Distance Vector (AODV) routing protocol, such that mobile nodes that are not within direct transmission range of a foreign agent can still obtain Internet connectivity. In addition, we describe how duplicate address detection can be used in these networks to obtain a unique co-located care-of address when a foreign agent is not available.     

Explicit Multicasting for Mobile Ad Hoc Networks

In this paper we propose an explicit multicast routing protocol for mobile ad hoc networks (MANETs). Explicit multicasting differs from common approaches by listing destination addresses in data packet headers. Using the explicit destination information, the multicast routing protocol can avoid the overhead of employing its own route construction and maintenance mechanisms by taking advantage of unicast routing table. Our protocol – termed Differential Destination Multicast (DDM) – is an explicit multicast routing protocol specifically designed for MANET environment. Unlike other MANET multicasting protocols, instead of distributing membership control throughout the network, DDM concentrates this authority at the data sources (i.e. senders) thereby giving sources knowledge of group membership. In addition, differentially-encoded, variable-length destination headers are inserted in data packets which are used in combination with unicast routing tables to forward multicast packets towards multicast receivers. Instead of requiring that multicast forwarding state to be stored in all participating nodes, this approach also provides the option of stateless multicasting. Each node independently has the choice of caching forwarding state or having its upstream neighbor to insert this state into self-routed data packets, or some combination thereof. The protocol is best suited for use with small multicast groups operating in dynamic MANET environment.     

Associativity-Based Routing for Ad Hoc Mobile Networks

This paper presents a new, simple and bandwidth-efficient distributed routing protocol to support mobile computing in a conference size ad-hoc mobile network environment. Unlike the conventional approaches such as link-state and distance-vector distributed routing algorithms, our protocol does not attempt to consistently maintain routing information in every node. In an ad-hoc mobile network where mobile hosts (MHs) are acting as routers and where routes are made inconsistent by MHs' movement, we employ an associativity-based routing scheme where a route is selected based on nodes having associativity states that imply periods of stability. In this manner, the routes selected are likely to be long-lived and hence there is no need to restart frequently, resulting in higher attainable throughput. Route requests are broadcast on a per need basis. The association property also allows the integration of ad-hoc routing into a BS-oriented Wireless LAN (WLAN) environment, providing the fault tolerance in times of base stations (BSs) failures. To discover shorter routes and to shorten the route recovery time when the association property is violated, the localised-query and quick-abort mechanisms are respectively incorporated into the protocol. To further increase cell capacity and lower transmission power requirements, a dynamic cell size adjustment scheme is introduced. The protocol is free from loops, deadlock and packet duplicates and has scalable memory requirements. Simulation results obtained reveal that shorter and better routes can be discovered during route re-constructions.     

Ad hoc网络中的路由技术

Ad hoc网络是一些移动节点组成一个多跳的临时性无线自治系统，这种新型的通信网络具有动态变化的拓扑结构和分布控制的网络机制。文中针对Ad hoc网络作了简单的介绍并重点介绍了针对Ad hoc网络特性而提出的路由协议。     

Multicast Routing in Mobile Ad Hoc Networks

We focus on one critical issue in mobile ad hoc networks that is multicast routing. Advantages and limitations of existing routing protocols are illustrated. Optimal routes, stable links, power conservation, loop freedom, and reduced channel overhead are the main features to be addressed in a more efficient mechanism. In this paper, we propose a new on-demand multicast routing protocol, named Source Routing-based Multicast Protocol (SRMP). Our proposition addresses two important issues in solving routing problems: (i) path availability concept, and (ii) higher battery life paths. SRMP applies a source routing mechanism, and constructs a mesh to connect group members. It provides stable paths based on links' availability according to future prediction of links' states, and higher battery life paths. This protocol succeeded to minimize network load via designing optimal routes that guarantee reliable transmission and active adaptability. A performance comparison study with On-demand Multicast Routing Protocol (ODMRP) and Adaptive Demand-driven Multicast Routing (ADMR) protocol is undertaken. Analysis results show the strength of the SRMP nodes' selection criteria and its efficient energy consumption compared to the other two protocols.     

Efficient Broadcasting in Mobile Ad Hoc Networks

This paper presents two efficient flooding algorithms based on 1-hop neighbor information. In the first part of the paper, we consider sender-based flooding algorithms, specifically the algorithm proposed by Liu et al. In their paper, Liu et al. propose a sender-based flooding algorithm that can achieve local optimality by selecting the minimum number of forwarding nodes in the lowest computational time complexity O(n logn), where n is the number of neighbors. We show that this optimality only holds for a subclass of sender-based algorithms. We propose an efficient sender-based flooding algorithm based on 1-hop neighbor information that reduces the time complexity of computing forwarding nodes to O(n). In Liu's algorithm, n nodes are selected to forward the message in the worst case, whereas in our proposed algorithm, the number of forwarding nodes in the worst case is 11. In the second part of the paper we propose a simple and highly efficient receiver-based flooding algorithm. When nodes are uniformly distributed, we prove that the probability of two neighbor nodes broadcasting the same messageneighbor nodes broadcasting the same message exponentially decreases when the distance between them decreases or when the node density increases. The analytical results are confirmed using simulation.     

Incorporating Data from Multiple Sensors for Localizing Nodes in Mobile Ad Hoc Networks

The ad hoc network localization problem deals with estimating the geographical location of all nodes in an ad hoc network, focusing on those nodes that do not have a direct way (for example, GPS) to determine their own location. Proposed solutions to the ad hoc localization problem (AHLP) assume that nodes are capable of measuring received signal strength indication (RSSI) and/or are able to do coarse (sectoring) or fine signal angle-of-arrival (AoA) measurements. Existing algorithms exploit different aspects of such sensory data to provide either better localization accuracy or higher localization coverage. However, there is a need for a framework that could benefit from the interactions of nodes with mixed types of sensors. In this paper, we study the behavior of RSSI and AoA sensory data in the context of AHLP by using both geometric analysis and computer simulations. We show which type of sensor is better suited for which type of network scenario. We study how nodes using either, both, or none of these sensors could coexist in the same localization framework. We then provide a general particle-filtering framework, the first of its kind, that allows heterogeneity in the types of sensory data to solve the localization problem. We show that, when compared to localization scenarios where only one type of sensor is used, our framework provides significantly better localization results. Furthermore, our framework provides not only a location estimate for each nonanchor, but also an implicit confidence measure as to how accurate this estimate is. This confidence measure enables nodes to further improve on their location estimates using a local, iterative one-hop simple message exchange without having to rely on synchronized multiphase operations like in traditional multilateration methods.     

Distributed Event Notification for Mobile Ad Hoc Networks

Emergency-and-rescue applications must be continually available, placingstrong demands on middleware solutions running over mobile ad hoc networks.This highly available distributed event notification service can help byreaching the different network partitions and providing a useful deliverysemantic.     

Flooding-Based Geocasting Protocols for Mobile Ad Hoc Networks

Geocasting is a variation on the notion of multicasting. A geographical area is associated with each geocast, and the geocast is delivered to the nodes within the specified geographical area. Thus, geocasting may be used for sending a message that is likely to be of interest to everyone in a specified area. In this paper, we propose three geocasting protocols for ad hoc networks, obtained as variations of a multicast flooding algorithm, and then evaluate these approaches by means of simulations. Proposed geocasting algorithms attempt to utilize physical location information to decrease the overhead of geocast delivery.     

MANET接入技术研究

以移动AdHoc网络(MobileAdHocNetworks)的接入技术为研究对象,介绍了该网络的特点及其采用的各种接入技术,并以双忙音多址(DBTMA)和RTS/CTS两种接入技术为例,比较了它们对网络性能的影响,最后是对MANET接入技术的总结。     

移动代理在MANET路由协议中的应用研究

移动Ad Hoc网络(MANET)是由移动节点组成的分布式异构网络,其路由协议的研究是该领域的焦点之一。本文分析了现有移动Ad Hoc网络两类路由协议的优缺点,接着提出将移动代理应用于AODV路山协议的方案,最后给出了初步的仿真结果。仿真结果表明,通过移动代理的漫游更新途经节点路由表,可以在网络负载增加不人的情况下,减少路由发起数,降低端到端的数据传输延迟。     

Suppressive Fair Buffer Management Policy for Intermittently Connected Mobile Ad Hoc Networks

Wireless Personal Communications - We propose a suppressive fair buffer management policy for intermittently connected mobile ad-hoc networks. So far, several buffer management policies have been...