A Shoelace-Based QoS Routing Protocol for Mobile Ad Hoc Networks Using Directional Antenna

In this paper, we propose a new quality-of-service (QoS) routing protocol for mobile ad hoc network (MANET) using directional antennas. The proposed scheme offers a bandwidth-based routing protocol for QoS support in MANET using the concept of multi-path. Our MAC sub-layer adopts the CDMA-over-TDMA channel model. The on-demand QoS routing protocol calculates the end-to-end bandwidth and allocates bandwidth from the source node to the destination node. The paths are combined with multiple cross links, called shoelace, when the network bandwidth is strictly limited. Due to the property of the directional antenna, these cross links can transmit data simultaneously without any data interference. We develop a shoelace-based on-demand QoS routing protocol by identifying shoelaces in a MANET so as to construct a QoS route, which satisfied the bandwidth requirement, more easily. The shoelace-based route from the source to the destination is a route whose sub-path is constructed by shoelace structure. With the identified shoelaces, our shoelace-based scheme offers a higher success rate to construct a QoS route. Finally, simulation results demonstrate that the proposed routing protocol outperform existing QoS routing protocols in terms of success rate, throughput, and average latency.     

A secure and trust based on-demand multipath routing scheme for self-organized mobile ad-hoc networks

A mobile ad hoc network (MANET) is a self-configurable network connected by wireless links. This type of network is only suitable for provisional communication links as it is infrastructure-less and there is no centralized control. Providing QoS and security aware routing is a challenging task in this type of network due to dynamic topology and limited resources. The main purpose of secure and trust based on-demand multipath routing is to find trust based secure route from source to destination which will satisfy two or more end to end QoS constraints. In this paper, the standard ad hoc on-demand multi-path distance vector protocol is extended as the base routing protocol to evaluate this model. The proposed mesh based multipath routing scheme to discover all possible secure paths using secure adjacent position trust verification protocol and better link optimal path find by the Dolphin Echolocation Algorithm for efficient communication in MANET. The performance analysis and numerical results show that our proposed routing protocol produces better packet delivery ratio, reduced packet delay, reduced overheads and provide security against vulnerabilities and attacks.     

QoS routing through alternate paths in wireless ad hoc networks

Quality of service (QoS) routing plays an important role in QoS provisioning for mobile ad hoc networks. This work studies the issue of route selection subject to QoS constraint(s). Our method searches for alternate routes with satisfied QoS requirement(s) to accommodate each communication request when the shortest path connecting the source–destination pair of the request is not qualified. In order to effectively reduce protocol overhead, a directed search mechanism is designed to limit the breadth of the searching scope, which aims at achieving a graceful tradeoff between the success probability in QoS route acquisition and communication overhead. Efficient hop‐by‐hop routing protocols are designed for route selection subject to delay and bandwidth constraint, respectively. Simulation results show that the designed protocols can achieve high performance in acquiring QoS paths and in efficient resource utilization with low control overhead. Copyright © 2004 John Wiley & Sons, Ltd.     

QoS-aware routing based on bandwidth estimation for mobile ad hoc networks

Routing protocols for mobile ad hoc networks (MANETs) have been explored extensively in recent years. Much of this work is targeted at finding a feasible route from a source to a destination without considering current network traffic or application requirements. Therefore, the network may easily become overloaded with too much traffic and the application has no way to improve its performance under a given network traffic condition. While this may be acceptable for data transfer, many real-time applications require quality-of-service (QoS) support from the network. We believe that such QoS support can be achieved by either finding a route to satisfy the application requirements or offering network feedback to the application when the requirements cannot be met. We propose a QoS-aware routing protocol that incorporates an admission control scheme and a feedback scheme to meet the QoS requirements of real-time applications. The novel part of this QoS-aware routing protocol is the use of the approximate bandwidth estimation to react to network traffic. Our approach implements these schemes by using two bandwidth estimation methods to find the residual bandwidth available at each node to support new streams. We simulate our QoS-aware routing protocol for nodes running the IEEE 802.11 medium access control. Results of our experiments show that the packet delivery ratio increases greatly, and packet delay and energy dissipation decrease significantly, while the overall end-to-end throughput is not impacted, compared with routing protocols that do not provide QoS support.     

Route Maintenance in a Wireless Mobile Ad Hoc Network

A mobile ad-hoc network (MANET) is formed by a cluster of mobile hosts, without the infrastructure of base stations. To deal with the dynamic changing topology of a MANET, many routing protocols have been proposed. In this paper, we consider the route maintenance problem, which includes two parts: route deterioration and route breakage. In a MANET, a route may suddenly become broken because only one host roams away. Even if a route remains connected, it may become worse due to host mobility or a better route newly being formed in the system. Existing protocols, however, will stick with a fixed route once it is discovered, until it is expired or broken. In this paper, we show how to enhance several existing protocols with route optimization and local route recovery capability. So the routing paths can be adjusted on-the-fly while they are still being used for delivering packets and can be patched in minimum wireless bandwidth and delay while route errors occur.     

QoS routing in ad hoc wireless networks

The emergence of nomadic applications have generated much interest in wireless network infrastructures that support real-time communications. We propose a bandwidth routing protocol for quality-of-service (QoS) support in a multihop mobile network. The QoS routing feature is important for a mobile network to interconnect wired networks with QoS support (e.g., ATM, Internet, etc.). The QoS routing protocol can also work in a stand-alone multihop mobile network for real-time applications. This QoS routing protocol contains end-to-end bandwidth calculation and bandwidth allocation. Under such a routing protocol, the source (or the ATM gateway) is informed of the bandwidth and QoS available to any destination in the mobile network. This knowledge enables the establishment of QoS connections within the mobile network and the efficient support of real-time applications. In addition, it enables more efficient call admission control. In the case of ATM interconnection, the bandwidth information can be used to carry out intelligent handoff between ATM gateways and/or to extend the ATM virtual circuit (VC) service to the mobile network with possible renegotiation of QoS parameters at the gateway. We examine the system performance in various QoS traffic flows and mobility environments via simulation. Simulation results suggest distinct performance advantages of our protocol that calculates the bandwidth information. It is particularly useful in call admission control. Furthermore, “standby” routing enhances the performance in the mobile environment. Simulation experiments show this improvement     

Secure multicast routing protocols in mobile ad‐hoc networks

A mobile ad‐hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi‐hop radio network. Routing protocols in MANETs define how routes between source and destination nodes are established and maintained. Multicast routing provides a bandwidth‐efficient means for supporting group‐oriented applications. The increasing demand for such applications coupled with the inherent characteristics of MANETs (e.g., lack of infrastructure and node mobility) have made secure multicast routing a crucial yet challenging issue. Recently, several multicast routing protocols (MRP) have been proposed in MANETs. Depending on whether security is built‐in or added, MRP can be classified into two types: secure and security‐enhanced routing protocols, respectively. This paper presents a survey on secure and security‐enhanced MRP along with their security techniques and the types of attacks they can confront. A detailed comparison for the capability of the various routing protocols against some known attacks is also presented and analyzed. Copyright © 2013 John Wiley & Sons, Ltd.     

Bandwidth‐satisfied routing in multi‐rate MANETs by cross‐layer approach

Previous quality‐of‐service (QoS) routing protocols in mobile ad hoc networks (MANETs) determined bandwidth‐satisfied routes for QoS applications. Since the multi‐rate enhancements have been implemented in MANETs, QoS routing protocols should be adapted to exploit them fully. However, existing works suffer from one bandwidth‐violation problem, named the hidden route problem (HRP), which may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Without considering the bandwidth consumption to ongoing flows is the reason the problem is introduced. This work proposes a routing protocol that can avoid HRP for data rate selection and bandwidth‐satisfied route determination with an efficient cross‐layer design based on the integration of PHY and MAC layers into the network layer. To use bandwidth efficiently, we aim to select the combination of data rates and a route with minimal bandwidth consumption to the network, instead of the strategy adopted in the most previous works by selecting the combination with the shortest total transmission time. Using bandwidth efficiently can increase the number of flows supported by a network. Copyright 2010 John Wiley & Sons, Ltd.     

A Dynamic Alternate Path QoS Enabled Routing Scheme in Mobile Ad hoc Networks

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. Routing algorithm has been a challenge task in the wireless ad hoc network for a long time due to the dynamic nature of network topology. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. The on-demand routing protocol for ad hoc network is appealing because of its low routing overhead and its effectiveness when the frequency of route re-establishment and the demand of route queries are not high. However, considering the increasing demand of Quality-of-Service (QoS) requirements in many applications, the current on-demand 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 routing protocol which tries its best to satisfy QoS requirements of specific multimedia traffic in the volatile environments of a MANET. The results of a series of simulations exhibit the practicability and feasibility of our approaches. This research was partially supported by National Science Council under grant NSC 93-2213-E-026-001     

Deploying power‐aware on‐demand (PAOD) schemes over routing protocols of mobile wireless ad hoc networks

A mobile ad hoc network (MANET) is an autonomous collection of mobile nodes that communicate over relatively bandwidth‐constrained wireless links. MANETs need efficient algorithms to determine network connectivity, link scheduling, and routing. An important issue in network routing for MANETs is to conserve power while still achieve a high packet success rate. Traditional MANET routing protocols do not count for such concern. They all assume working with unlimited power reservoirs. Several ideas have been proposed for adding power‐awareness capabilities to ad hoc networks. Most of these proposals tackle the issue by either proposing new power‐aware routing protocols or modifying existing routing protocols through the deployment of power information as cost functions. None of them deal with counter‐measures that ought to be taken when nodes suffer from low power reserves and are subject to shut down in mid of normal network operations. In this paper, power‐awareness is added to a well‐known traditional routing protocol, the ad hoc on‐demand distance vector (AODV) routing protocol. The original algorithm is modified to deal with situations in which nodes experience low power reserves. Two schemes are proposed and compared with the original protocol using different performance metrics such as average end‐to‐end delays, transmission success rates, and throughputs. These schemes provide capabilities for AODV to deal with situations in which operating nodes have almost consumed their power reserves. Copyright © 2005 John Wiley & Sons, Ltd.