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     

移动自组网QoS路由协议研究

移动自组网是由一组带有无线收发装置的移动节点组成的一个多跳的临时性的自治系统。随着无线通信中多媒体业务的增加,在移动自组网中提供QoS(Quality of Sevice服务质量)保障具有越来越重要的意义,而QoS路由技术则是其中的核心技术和热点问题。文章指出移动自组网QoS路由的困难,对移动自组网典型QoS路由协议进行了详细的分析与比较,并对几种较新的移动自组网QoS路由协议进行了介绍,末了对移动自组网QoS路由协议的发展进行了展望。     

Dynamic QoS Allocation for Multimedia Ad Hoc Wireless Networks

In this paper, we propose an approach to support QoS for multimedia applications in ad hoc wireless network. An ad hoc network is a collection of mobile stations forming a temporary network without the aid of any centralized coordinator and is different from cellular networks which require fixed base stations interconnected by a wired backbone. It is useful for some special situations, such as battlefield communications and disaster recovery. The approach we provide uses CSMA/CA medium access protocol and additional reservation and control mechanisms to guarantee quality of service in ad hoc network system. The reason we choose CSMA protocol instead of other MAC protocols is that it is used in most of currently wireless LAN productions. Via QoS routing information and reservation scheme, network resources are dynamically allocated to individual multimedia application connections.     

QoS Routing for Mesh-Based Wireless LANs

Wireless LANs with their increased data rate become an attractive technology for connecting mobile users to the Internet. Efficient deployment of wireless LANs will require the ability to extend the wireless LANs coverage without the need to deploy a very large number of access points. Mesh-based wireless LANs are an attractive solution to this problem. These networks extend wireless LAN coverage by using each node in the network as a router, resulting in a multihop topology. In this paper we introduce a novel routing algorithm, wireless mesh routing (WMR), that provides quality-of-service (QoS) support and accounts for the characteristics of both infrastructure-based wireless LANs and ad hoc networks. The algorithm is validated using the OPNET modeler. The simulation results show that the mesh network using WMR protocol can provide QoS support and react dynamically to the network status changes with low control overheads. Using the proposed software architecture the proposed routing protocol can be implemented with any MAC protocol, resulting in easy implementation in existing wireless nodes.     

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.     

Routing protocol development for quality of service optimization of video‐on‐demand system over mobile ad hoc networks

A video‐on‐demand (VoD) application system over mobile ad hoc networks typically requires particular quality of service (QoS) parameters to be achieved. In this paper, we have proposed a novel QoS‐based routing protocol called as mobile VoD protocol. This protocol has been developed for improving the QoS of the mobile VoD system (normal Mobi_VoD approach). The protocol uses customer caching scheme for storing the first fragment of the entire video in the mobile customers and thereafter broadcast them when the new mobile customers missed the portion of the already transmitted first fragment for reducing the service delay of the customer, consequently optimizing QoS parameters. Various scenarios have been studied, and the efficacy of simulation results proves that the proposed system architecture in which the mobile customers use an ad hoc network caching scheme (mobile VoD protocol) is more efficient and performs better than the existing system (ad hoc on‐demand distance vector protocol) when compared in terms of QoS parameters such as the end‐to‐end delay, energy consumption, packet delivery ratio, throughput, and overhead.     

An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks

A mobile ad hoc network (or manet) is a group of mobile, wireless nodes which cooperatively form a network independent of any fixed infrastructure or centralized administration. In particular, a manet has no base stations: a node communicates directly with nodes within wireless range and indirectly with all other nodes using a dynamically-computed, multi-hop route via the other nodes of the manet.Simulation and experimental results are combined to show that energy and bandwidth are substantively different metrics and that resource utilization in manet routing protocols is not fully addressed by bandwidth-centric analysis. This report presents a model for evaluating the energy consumption behavior of a mobile ad hoc network. The model was used to examine the energy consumption of two well-known manet routing protocols. Energy-aware performance analysis is shown to provide new insights into costly protocol behaviors and suggests opportunities for improvement at the protocol and link layers.     

Reducing multicast traffic load for cellular networks using ad hoc networks

There has been recent extensive research on integrating cellular networks and ad hoc networks to overcome the limitations of cellular networks. Although several schemes have been proposed to use such hybrid networks to improve the performance of individual multicast groups, they do not address quality of service (QoS) issues when multiple groups are present. This paper, on the other hand, considers an interesting scenario of hybrid networks when an ad hoc network cannot accommodate all the groups and a base station has to select a subset of groups to optimize its bandwidth savings and maximize the utilization of the ad hoc network while providing QoS support for multicast users. In this paper, a network model for multicast admission control that takes wireless interference into account is developed, the group selection problem is formulated as a multidimensional knapsack problem, and an integer linear programming (ILP) formulation and a polynomial-time dynamic algorithm are proposed. A distributed implementation of the dynamic algorithm in real systems is also examined. Simulation studies demonstrate that the dynamic algorithm is able to achieve very competitive performance under various conditions, in comparison with the optimal solution computed by the ILP approach.     

Admission control in time-slotted multihop mobile networks

The emergence of nomadic applications have generated a lot of interest in next-generation wireless network infrastructures which provide differentiated service classes. So it is important to study how the quality of service (QoS), such as packet loss and bandwidth, should be guaranteed. To accomplish this, we develop am admission control scheme which can guarantee bandwidth for real-time applications in multihop mobile networks. In our scheme, a host need not discover and maintain any information of the network resources status on the routes to another host until a connection request is generated for the communication between the two hosts, unless the former host is offering its services as an intermediate forwarding station to maintain connectivity between two other hosts. This bandwidth guarantee feature is important for a mobile network to interconnect wired networks with QoS support. Our connection admission control scheme can also work in a stand-alone mobile ad hoc network for real-time applications. This control scheme contains end-to-end bandwidth calculation and bandwidth allocation. Under such a scheme, the source 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 the case of ATM interconnection, the bandwidth information can be used to carry out an intelligent handoff between ATM gateways and/or to extend the ATM virtual circuit service to the mobile network with possible renegotiation of QoS parameters at the gateway. We examine via simulation the system performance in various QoS traffic flows and mobility environments     

Distributed protocols for ad hoc wireless LANs: a learning-automata-based approach

An ad hoc learning-automata-based protocol for wireless LANs, capable of operating efficiently under bursty traffic conditions, is introduced. According to the proposed protocol, the mobile station that is granted permission to transmit is selected by means of learning automata. At each station, the learning automaton takes into account the network feedback information in order to update the choice probability of each mobile station. The proposed protocol is compared via simulation to TDMA and IEEE 802.11 under bursty traffic conditions. Ad hoc learning-automata-based protocol (AHLAP) is shown to exhibit superior performance compared to TDMA in all cases. Compared to IEEE 802.11, the burstier the network traffic, the larger the performance increase of AHLAP. Furthermore, the implementation of AHLAP is more easier than that of IEEE 802.11.     

A nonpreemptive priority-based access control scheme for broadbandad hoc wireless ATM local area networks

The DQRUMA (distributed-queueing request update multiple access) protocol has been considered as an access protocol for the BAHAMA (broadband ad hoc wireless ATM local area network). However, it cannot support the service discipline of integrated multimedia traffic since it does not include any priority and access control policy. In this paper, we propose a nonpreemptive priority-based access control scheme for the DQRUMA protocol. Under such a scheme, modifying the CSMA/CA protocol in the contention period supports many levels of priorities such that user mobility (handoff) can be supported in BAHAMA. Besides, the proposed transmit-permission policy and adaptive bandwidth allocation scheme provide various QoS (quality-of-service) guarantees while maintaining high bandwidth utilization. Simulations show that it provides a good performance in ad hoc wireless ATM LAN environments     

Dynamic Adaptive Routing for a Heterogeneous Wireless Network

This paper presents an integrated architecture of a Heterogeneous Wireless Network (HWN) and a dynamic adaptive routing protocol (DARP) for a HWN. To allow mobile users versatile communication with anyone or any device at any place and anytime, HWN integrates cellular network with an ad hoc network (independent Basic Service Set) in wireless local area network (WLAN) and reserves advantages of sizable coverage in a cellular network and high data rate in deployable ad hoc network. It also enlarges the scope of communication for ad hoc network and improves the throughput for cellular network. Consequently, nodes in HWN can communicate with each other or access Internet ubiquitously. We also address the routing issues for HWN, because the routing protocol for HWN is different from those used in cellular network or ad hoc network. The dynamic adaptive routing protocol establishes a better path for the source to arrive at the destination across multiple hops or cellular network and provides appropriate QoS (quality of service) in HWN.Through simulation, we will demonstrate the merit of the HWN, proposed routing performance on HWN and overhead of control traffic. A performance analysis of the proposed protocol is depicted. The results of the analysis, and simulations, are presented and discussed.     

一种自组网功率控制算法及分析

无线自组网中的移动节点大多依靠电池提供能量,因此能量是影响无线自组网性能的一个很大的瓶颈,作为事实上的无线自组网媒体接入协议,802.11并没有动态调整传输功率的能力,大大限制了网络的生存时间。采用功率控制可以提高节点的功率使用效率,减少相邻节点间的干扰,改善网络的性能。在802.11基础上提出一种基于信噪比的动态传输功率控制算法。通过进行计算机仿真,与802.11协议相比,在保持吞吐量性能的前提下,大大减少了节点的功率消耗,提高了节点的能量利用率。     

Stable routing algorithm for mobile ad hoc networks using mobile agent

Wireless ad hoc networks are growing important because of their mobility, versatility, and ability to work with fewer infrastructures. The mobile ad hoc network is an autonomous system consisting of mobile nodes connected with wireless links. Establishing a path between two nodes is a complex task in wireless networks. It is still more complex in the wireless mobile ad hoc network because every node is no longer as an end node and an intermediate node. In this paper, it focuses on design of connectionless routing protocol for the wireless ad hoc networks based on the mobile agent concept. The proposed model tries to discover the best path taking into consideration some concerns like bandwidth, reliability, and congestion of the link. The proposed model has been simulated and tested under various wireless ad hoc network environments with the help of a different number of nodes. The results demonstrate that the proposed model is more feasible for providing reliable paths between the source and destination with the minimum control message packets over the network. It has delivered more number of packets to the destination over the network. Copyright © 2012 John Wiley & Sons, Ltd.     

QoS routing for wireless ad hoc networks: problems, algorithms, and protocols

QoS routing plays an important role for providing QoS in wireless ad hoc networks. The goals of QoS routing are in general twofold: selecting routes with satisfied QoS requirement(s), and achieving global efficiency in resource utilization. In this article we first discuss some key design considerations in providing QoS routing support, and present a review of previous work addressing the issue of route selection subject to QoS constraint(s). We then devise an on-demand delay-constrained unicast routing protocol. Various strategies are employed in the protocol to reduce the communication overhead in acquiring cost-effective delay-constrained routes. Simulation results are used to verify our expectation of the high performance of the devised protocol. Finally, we discuss some possible future directions for providing efficient QoS routing support in wireless ad hoc networks.     

Quality of service provisioning in ad hoc wireless networks: a survey of issues and solutions

An ad hoc wireless network (AWN) is a collection of mobile hosts forming a temporary network on the fly, without using any fixed infrastructure. Characteristics of AWNs such as lack of central coordination, mobility of hosts, dynamically varying network topology, and limited availability of resources make QoS provisioning very challenging in such networks. In this paper, we describe the issues and challenges in providing QoS for AWNs and review some of the QoS solutions proposed. We first provide a layer-wise classification of the existing QoS solutions, and then discuss each of these solutions.     

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.     

ANMP: ad hoc network management protocol

We present a protocol for managing mobile wireless ad hoc networks. The protocol uses hierarchical clustering of nodes to reduce the number of messages exchanged between the manager and the agents (mobiles). Clustering also enables the network to keep track of mobiles as they roam. The ad hoc network management protocol (ANMP) is fully compatible with simple management protocol, version 3 (SNMPv3) and uses the same protocol data units (PDUs) for data collection. The protocol also implements sophisticated security mechanisms that can be fine-tuned to meet specific requirements. Finally, we have implemented the protocol along with a graphical user interface that allows a manager to change the view or specify management parameters on the fly     

Opportunistic media access control and routing for delay-tolerant mobile ad hoc networks

In delay-tolerant mobile ad hoc networks, motion of network nodes, network sparsity and sporadic density can cause a lack of guaranteed connectivity. These networks experience significant link delay and their routing protocols must take a store-and-forward approach. In this paper, an opportunistic routing protocol is proposed, along with its compatible media access control, for non-real-time services in delay-tolerant networks. The scheme is mobility-aware such that each network node needs to know its own position and velocity. The media access control employs a four-fold handshake procedure to probe the wireless channel and cooperatively prioritize candidate nodes for packet replication. It exploits the broadcast characteristic of the wireless medium to utilize long-range but unreliable links. The routing process seizes opportunities of node contacts for data delivery. It takes a multiple-copy approach that is adaptive with node movements. Numerical results in mobile ad hoc networks and vehicular ad hoc networks show superior performance of the proposed protocol compared with other routing protocols. The mobility-aware media access control and routing scheme exhibits relatively small packet delivery delay and requires a modest amount of total packet replications/transmissions.     

Local data control and admission control for QoS support in wireless ad hoc networks

Wireless ad hoc networks consist of nodes having a self-centrically broadcasting nature of communication. To provide quality of service (QoS) for ad hoc networks, many issues are involved, including routing, medium-access control (MAC), resource reservation, mobility management, etc. Carefully designed distributed medium-access techniques must be used for channel resources, so that mechanisms are needed to efficiently recover from inevitable frame collisions. For ad hoc wireless networks with a contention-based distributed MAC layer, QoS support and guarantee become extremely challenging. In this paper, we address this challenging issue. We first consider MAC and resource-reservation aspects for QoS support in one-hop ad hoc wireless networks. We propose two local data-control schemes and an admission-control scheme for ad hoc networks with the IEEE 802.11e MAC standard. In the proposed fully distributed local data control schemes, each node maps the measured traffic-load condition into backoff parameters locally and dynamically. In the proposed distributed admission-control scheme, based on measurements, each node makes decisions on the acceptances/rejections of flows by themselves, without the presence of access points. The proposed mechanisms are evaluated via extensive simulations. Studies show that, with the proposed schemes, QoS can be guaranteed under a clear channel condition while maintaining a good utilization. Discussions on applying the proposed schemes into multihop ad hoc networks are also included.