Neighbor caching in multi-hop wireless ad hoc networks

We propose a neighbor caching strategy to overcome the overhead of multi-hop wireless communications. Neighbor caching makes a node able to expand its caching storage instantaneously by storing its data in the storage of idle neighbors. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The ranking based prediction is an adaptive algorithm that adjusts the frequency of neighbor caching and makes neighbor caching flexible according to the idleness of nodes.     

Broadcast scheduling with MIMO links in multi-hop ad hoc networks

As the current medium access control protocols with Multiple Input Multiple Output (MIMO) links only bear point to point service, broadcast scheduling algorithm in ad hoc networks with MIMO links is proposed. The key to the proposed broadcast scheduling algorithm is the time slot scheduling algorithm which guarantees collision-free transmissions for every node and the mini- mum frame length. The proposed algorithm increases the simultaneous transmissions of MIMO links efficiently. Due to the interference null capacity of MIMO links, the interference node set of each node can decrease from two-hop neighbors to one-hop neighbors possibly. Simulation results show that our algorithm can greatly improve network capacity and decrease average packet delay.     

Minimizing Intermediate Multicast routing for dynamic multi-hop ad hoc networks

A Minimizing Intermediate Multicast Routing protocol （MIMR） is proposed for dynamic multi-hop ad hoc networks. In MIMR, multicast sessions are created and released only by source nodes. In each multicast session process, the source node keeps a list of intermediate nodes and destinations, which is encapsulated into the packet header when the source node sends a multicast packet. Nodes receiving multicast packets decide to accept or forward the packet according to the list. Depending on topology matrix maintained by unicast routing, the shortest virtual hierarchy routing tree is constructed by improved Dijkstra algorithm. MIMR can achieve the minimum number of intermediate nodes, which are computed through the tree. No control packet is transmitted in the process of multicast session. Load of the network is largely decreased. Experimental result shows that MIMR is flexible and robust for dynamic ad hoc networks.     

On supporting reliable QoS in multi-hop multi-rate mobile ad hoc networks

Due to complicated situations such as node/link interference and traffic load, quality of service support in multi-hop multi-rate ad hoc networks remains a challenging issue. Furthermore, when mobility is present, because of frequent route change, it is even more difficult to maintain high level performance for existing real-time flows that may not tolerate serious performance degradation. In this paper, we focus on the issue of providing sufficient QoS in networks with moderate to high node mobility. We first introduce route available bandwidth (RAB), a major index for prediction of flow performance along a specific path. RAB considers various important factors such as intra-flow interference, effective link bandwidth, and channel busy time. Then, we devise a DSR based admission control scheme where the source node accepts/rejects a flow according to the RAB of the collected route when it receives a route reply packet. To handle mobility, we incorporate an additional metric of route reliability (RR) so that a path with sufficient bandwidth and reliability can be obtained. Results show that with admission control, existing flows experiences around 80–95% average delivery ratio, even for 20 m/s maximum moving speed, which is much better than 30–60% average delivery ratio when admission control is absent.     

Upper bounding service capacity in multi-hop wireless SSMA-based ad hoc networks

Upper bounds on the service carrying capacity of a multi-hop, wireless, SSMA-based ad hoc network are considered herein. The network has a single radio band for transmission and reception. Each node can transmit to, or receive from, multiple nodes simultaneously. We formulate the scheduling of transmissions and control of transmit powers as a joint, mixed-integer, nonlinear optimization problem that yields maximum return at minimum power subject to SINR constraints. We present an efficient tabu search-based heuristic algorithm to solve the optimization problem and rigorously assess the quality of the results. Through analysis and simulation, we establish upper bounds on the VoIP call carrying capacity of the network as function of various parameters. We discuss the pros and cons of using SSMA as a spectrum sharing technique in wireless ad hoc networks.     

An analytical model of delay in multi-hop wireless ad hoc networks

Several analytical models of different wireless networking schemes such as wireless LANs and meshes have been reported in the literature. To the best of our knowledge, all these models fail to address the accurate end-to-end delay analysis of multi-hop wireless networks under unsaturated traffic condition considering the hidden and exposed terminal situation. In an effort to gain deep understanding of delay, this paper firstly proposes a new analytical model to predict accurate media access delay by obtaining its distribution function in a single wireless node. The interesting point of having the media access delay distribution is its generality that not only enables us to derive the average delay which has been reported in almost most of the previous studies as a special case but also facilitates obtaining higher moments of delay such as variance and skewness to capture the QoS parameters such as jitters in recently popular multimedia applications. Secondly, using the obtained single node media access delay distribution, we extend our modeling approach to investigate the delay in multi-hop networks. Moreover, probabilities of collisions in both hidden and exposed terminal conditions have been calculated. The validity of the model is demonstrated by comparing results predicted by the analytical model against those obtained through simulation experiments.     

A novel approach to source routing for multi-hop ad hoc networks

The popularity of wireless ad hoc networks has significantly increased over the past years. As a result, a great scientific effort has been made to develop and implement efficient routing protocols, able to cope with the stochastically varying topology of such networks. We present an efficient routing protocol that combines source routing, caching of routes, and the use of sequence numbers to alleviate the routing load and at the same time increase the successful delivery of data packets.     

Estimating the value of co-operation approaches for multi-hop ad hoc networks

In multi-hop ad hoc networks, each node may be involved in forwarding data acting as a router. Unfortunately, in civilian scenarios with usually an open community, it is not obvious why nodes should forward foreign data and waste their battery power, CPU cycles, etc. Some work has already been done in proposing approaches to intensify participation in ad hoc networks. However, it is more or less a question of belief whether these approaches really benefit the community. This work gives a rational estimation of the effect of approaches that intensify participation in ad hoc networks. We present essential results assuming in particular low-dense networks that use on-demand routing protocols by applying some fundamental statistics to the problem.     

一种高效可靠的无人机自组网多跳TDMA协议

设计无人机自组网媒体接入控制(Medium Access Control,MAC)协议时,需要考虑其控制开销和数据传输的可靠性。鉴于此,结合现有无线自组网多跳时分多址接入(Time Division Multiple Access,TDMA)协议和无人机自组网特点,提出了一种高效可靠的无人机自组网多跳TDMA协议。首先采用高效负载均衡的时隙请求信息上传机制,选择一个负载较小的节点转发节点时隙请求信息;然后根据相互通信的父节点删除重复节点的时隙请求信息,减少相同节点的时隙请求信息转发次数;最后通过实时更新节点时隙请求信息机制,提高节点时隙请求信息传输的可靠性。仿真结果表明,该协议在数据传输成功率、平均时延、控制开销方面优于现有协议,可较好地应用在无人机自组网中。     

Mobility prediction and routing in ad hoc wireless networks

By exploiting non-random behaviors for the mobility patterns that mobile users exhibit, we can predict the future state of network topology and perform route reconstruction proactively in a timely manner. Moreover, by using the predicted information on the network topology, we can eliminate transmissions of control packets otherwise needed to reconstruct the route and thus reduce overhead. In this paper, we propose various schemes to improve routing protocol performances by using mobility prediction. We then evaluate the effectiveness of using mobility prediction via simulation. Copyright © 2001 John Wiley & Sons, Ltd.     

Dense cluster gateway based routing protocol for multi-hop mobile ad hoc networks

In a multi-hop mobile ad hoc network dynamic clusterization of nodes can be quite effective for better management of routing problems. In a cluster based protocol inter cluster data transfer takes place through the cluster gateways. Therefore, it is important to maintain information about the gateways as a part of the routing tables in order that the inter cluster routing proceeds smoothly even as the nodes move about. In this paper we propose a randomized approach for inter cluster routing over dense cluster gateways (DCG). A group of large number of gateway edges between two adjacent clusters offering inter cluster connectivity between the two is referred to as a DCG. The minimum number of gateway edges that define a DCG is dependent on the characteristics of particular ad hoc network. A DCG is expected to offer robust inter cluster connectivity as it typically has a large number of gateway edges. Our protocol is an improvement over the cluster based routing using k-tree core backbone proposed in [Information Processing Letters 88 (2003) 187–194]. It distributes the routing load on the cluster gateways without adding the extra overhead of maintaining information about dense cluster gateways. We also propose a heuristic which reduces the load on the cluster-heads. The heuristic elects some nodes to act as sub-cluster-heads which share a part of the workload of the respective cluster-heads. The protocol has been implemented on ns-2 simulator. An analysis of the result of the experiments has been presented.     

A cross-layer protocol for exploiting cooperative diversity in multi-hop wireless ad hoc networks

Cooperative communication has emerged to reap the benefits of spatial diversity. To fully exploit cooperative diversity, we propose a medium access control and routing enabled cross-layer cooperative transmission (MACR-CCT) protocol for improving the performance in multi-hop wireless ad hoc networks (MWAN). Different from previous cooperative protocols that determine a receiver in one hop according to a non-cooperative routing protocol first and then select a cooperative relay, MACR-CCT selects the cooperative relay together with the receiver in one hop to exploit fully cooperative diversity, so that the receiver is selected for higher cooperative gain and closer distance to destination, and the relay is selected to achieve the better throughput performance while considering transmission error. Furthermore, considering that there are multiple source–destination pairs in MWAN, MACR-CCT takes interference mitigation into account to further improve network throughput when selecting the cooperative relay. Besides, we propose a theoretical model to analyze the throughput performance. Finally, we take advantage of simulation results to validate the effectiveness of our analytical model and show that our proposed MACR-CCT protocol can significantly outperform existing packet transmission mechanisms in terms of throughput and delay under the multi-hop multi-flow network scenario.     

Trust prediction and trust-based source routing in mobile ad hoc networks

Mobile ad hoc networks (MANETs) are spontaneously deployed over a geographically limited area without well-established infrastructure. The networks work well only if the mobile nodes are trusty and behave cooperatively. Due to the openness in network topology and absence of a centralized administration in management, MANETs are very vulnerable to various attacks from malicious nodes. In order to reduce the hazards from such nodes and enhance the security of network, this paper presents a dynamic trust prediction model to evaluate the trustworthiness of nodes, which is based on the nodes’ historical behaviors, as well as the future behaviors via extended fuzzy logic rules prediction. We have also integrated the proposed trust predication model into the Source Routing Mechanism. Our novel on-demand trust-based unicast routing protocol for MANETs, termed as Trust-based Source Routing protocol (TSR), provides a flexible and feasible approach to choose the shortest route that meets the security requirement of data packets transmission. Extensive experiments have been conducted to evaluate the efficiency and effectiveness of the proposed mechanism in malicious node identification and attack resistance. The results show that TSR improves packet delivery ratio and reduces average end-to-end latency.     

Admission control schemes for 802.11-based multi-hop mobile ad hoc networks: a survey

Mobile ad hoc networks (MANETs) promise unique communication opportunities. The IEEE 802.11 standard has allowed affordable MANETs to be realised. However, providing Quality of Service (QoS) assurances to MANET applications is difficult due to the unreliable wireless channel, the lack of centralised control, contention for channel access and node mobility. One of the most crucial components of a system for providing QoS assurances is admission control (AC). It is the job of the AC mechanism to estimate the state of the network?s resources and thereby to decide which application data sessions can be admitted without promising more resources than are available and thus violating previously made guarantees. Unfortunately, due to the aforementioned difficulties, estimating the network resources and maintaining QoS guarantees are non-trivial tasks. Accordingly, a large body of work has been published on AC protocols for addressing these issues. However, as far as it is possible to tell, no wide-ranging survey of these approaches exists at the time of writing. This paper thus aims to provide a comprehensive survey of the salient unicast AC schemes designed for IEEE 802.11- based multi-hop MANETs, which were published in the peerreviewed open literature during the period 2000-2007. The relevant considerations for the design of such protocols are discussed and several methods of classifying the schemes found in the literature are proposed. A brief outline of the operation, reaction to route failures, as well as the strengths and weaknesses of each protocol is given. This enables patterns in the design and trends in the development of AC protocols to be identified. Finally, directions for possible future work are provided.     

Securing ad hoc networks

Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. Military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in the design of these networks is their vulnerability to security attacks. In this article, we study the threats on ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes-to defend routing against denial-of-service attacks. We also use replication and new cryptographic schemes, such as threshold cryptography, to build a highly secure and highly available key management service, which terms the core of our security framework     

A cluster based mobility prediction scheme for ad hoc networks

The ad hoc networks are completely autonomous wireless networks where all the users are mobile. These networks do not work on any infrastructure and the mobiles communicate either directly or via other nodes of the network by establishing routes. These routes are prone to frequent ruptures because of nodes mobility. If the future movement of the mobile can be predicted in a precise way, the resources reservation can be made before be asked, which enables the network to provide a better QoS. In this aim, we propose a virtual dynamic topology, which on one hand, will organize the network as well as possible and decreases the impact of mobility, and on the other hand, is oriented user mobility prediction. Our prediction scheme uses the evidence theory of Dempster–Shafer in order to predict the future position of the mobile by basing itself on relevant criteria. These ones are related to mobility and network operation optimisation. The proposed scheme is flexible and can be extended to a general framework. To show the relevance of our scheme, we combine it with a routing protocol. Then, we implemented the prediction-oriented topology and the prediction scheme which performs on it. We implemented also a mobility prediction based routing protocol. Simulations are made according to a set of elaborate scenarios.     

A routing protocol using a reliable and high-throughput path metric for multi-hop multi-rate ad hoc networks

In this paper, a high-throughput routing protocol for multi-rate ad hoc networks using lower layer information is proposed. By choosing the route with the minimum value of the proposed “Route Assessment Index” metric which has the form of entropy function, the selected route is ensured to have high throughput and link reliability among route candidates. Link bottleneck is avoided in the chosen route; hence, the packet drop rate due to buffer overflow is alleviated. Furthermore, an effective route discovery strategy is also introduced along with new routing metric. The correctness of the proposal is proven, and the simulation results show that our new metric provides an accurate and efficient method for evaluating and selecting the best route in multi-rate ad hoc networks.     

Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks

One possibility direction to assist routing in Mobile Ad Hoc Network (MANET) is to use geographical location information provided by positioning devices such as global positioning systems (GPS). Instead of searching the route in the entire network blindly, position-based routing protocol uses the location information of mobile nodes to confine the route searching space into a smaller estimated range. The smaller route searching space to be searched, the less routing overhead and broadcast storm problem will occur. In this paper, we proposed a location-based routing protocol called LARDAR. There are three important characteristics be used in our protocol to improve the performance. Firstly, we use the location information of destination node to predict a smaller triangle or rectangle request zone that covers the position of destination in the past. The smaller route discovery space reduces the traffic of route request and the probability of collision. Secondly, in order to adapt the precision of the estimated request zone, and reduce the searching range, we applied a dynamic adaptation of request zone technique to trigger intermediate nodes using the location information of destination node to redefine a more precise request zone. Finally, an increasing-exclusive search approach is used to redo route discovery by a progressive increasing search angle basis when route discovery failed. This progressive increased request zone and exclusive search method is helpful to reduce routing overhead. It guarantees that the areas of route rediscovery will never exceed twice the entire network. Simulation results show that LARDAR has lower routing cost and collision than other protocols. Tzay-Farn Shih was with Department of Electrical Engineering, National Taiwan University. Tzay-Farn Shih received the B.S. degree in Information Management from Chinese Culture University, Taiwan, in 1992, the M.S. degree in Computer Science Engineering from Tatung University, Taiwan, in 1996, and the Ph.D. degree in Electrical Engineering from National Taiwan University, Taiwan, in 2006. He is presently an assistant professor of Computer Science and Information Engineering at Chaoyang University of Technology, where he initially joined in August 2006. He is currently an overseas member of the Institute of Electronics, Information and Communication Engineers (IEICE). His current research interests include computer simulation, computer networks routing protocol, wireless networks, Mobile Ad Hoc networks and sensor networks. Hsu-Chun Yen was born in Taiwan, Republic of China, on May 29, 1958. He received the B.S. degree in electrical engineering from National Taiwan University, Taiwan, in 1980, the M.S. degree in computer engineering from National Chiao-Tung University, Taiwan, in 1982, and the Ph.D. degree in computer science from the University of Texas at Austin, U.S.A., in 1986. He is presently a Professor of Electrical Engineering at National Taiwan University, where he initially joined in August 1990. From August 1986 to July 1990, he was an Assistant Professor of Computer Science at Iowa State University, Ames, Iowa, U.S.A. His current research interests include Petri net theory, formal methods, design and analysis of algorithms, and complexity theory. Dr. Yen is an editor of International Journal of Foundations of Computer Science (IJFCS, World Scientific Publisher).     

基于细胞适应机制的自组网多路径路由协议

针对一些ARAS(adaptive response by attractor selection)模型的噪声影响不明确和活跃度不能准确确定状态转换时机的缺点,建议了一个改进的ARAS模型。此模型利用被重新推导的吸引子明确了噪声对模型的随机影响。通过建议一个与当前路径状态和最好路径状态的差成反比的活跃度公式,经Matlab验证,改进模型可提高负载平衡的准确度。在一个基于AODV的多路径路由中,通过使用ARAS改进模型选择路由路径,提出一种基于细胞适应机制的多路径路由协议(MPAM),并在OPNET中验证了方法的有效性。     

Mobility prediction in mobile ad hoc networks using a lightweight genetic algorithm

A mobile ad hoc network is a collection of wireless mobile nodes creating a network without using any existing infrastructure. Much research has been carried out to find out an optimal routing protocol for the successful transmission of data in this network. The main hindrance is the mobility of the network. If the mobility pattern of the network can be predicted, it will help in improving the QoS of the network. This paper discusses a novel approach to mobility prediction using movement history and existing concepts of genetic algorithms, to improve the MANET routing algorithms. The proposed lightweight genetic algorithm performs outlier removal on the basis of heuristics and parent selection using the weighted roulette wheel algorithm. After performing the genetic operations a node to node adjacency matrix is obtained from which the predicted direction of each node is calculated using force directed graphs and vector calculations. The technique proposes a new approach to mobility prediction which does not depend on probabilistic methods and which is completely based on genetic algorithms.