Simulated Annealing Based Multi-constrained QoS Routing in Mobile ad hoc Networks

Multi-constrained quality-of-service routing (QoSR) is to find a feasible path that satisfies multiple constraints simultaneously, which is a big challenge for mobile ad hoc networks (MANETs) where the topology may change constantly. It has been proved that such a problem is NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this problem. However, existing solutions, most of which suffered either from excessive computational complexities or from low performance were proposed only for wired networks and cannot be used directly in wireless MANETs. In this paper a novel QoS routing algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The paper outlines simulated annealing algorithm and analyzes the problems met when we apply it to QoSR in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.     

The revisit of QoS routing based on non‐linear Lagrange relaxation

The development of efficient quality of service (QoS) routing algorithms in a high‐speed networking or the next generation IP networking environment is a very important and at the same time very difficult task due to the need to provide divergent services with multiple QoS requirements. Recently, a heuristic algorithm H_MCOP, which is based on a non‐linear Lagrange relaxation (NLR) technique, has been proposed to resolve the contradiction between the time complexity and the quality of solution. Even though H_MCOP has demonstrated outstanding capability of finding feasible solutions to the multi‐path constrained (MCP) problem, it has not exploited the full capability that an NLR‐based technique could offer. In this paper, we propose a new NLR‐based heuristic called NLR_MCP, in which the search process is interpreted from a probability's perspective. Simulation results indicate that NLR_MCP can achieve a higher probability of finding feasible solutions than H_MCOP. We also verify that the performance improvement of a MCP heuristic has a tremendous impact on the performance of a higher level heuristic that uses a MCP heuristic as the basic step. Copyright © 2006 John Wiley & Sons, Ltd.     

Delay constraint multipath routing for wireless multimedia ad hoc networks

According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node‐disjoint or link‐disjoint multipaths will be built through the route computation. The simulation and test results show that QoS‐MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end‐to‐end delay of QoS‐MOLSR is four times less than the optimized link state routing. Copyright © 2014 John Wiley & Sons, Ltd.     

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.     

On-demand SIR and bandwidth-guaranteed routing with transmit power assignment in ad hoc mobile networks

In this paper, we propose a novel on-demand quality-of-service (QoS) routing protocol, SBR [signal-to-interference (SIR) and bandwidth routing], which explicitly fulfills both SIR and bandwidth requirements from different multimedia users in ad hoc mobile networks. With SBR, bandwidth reservation is made by allocating time slots and SIR reservation is ensured by assigning adequate powers at the intermediate nodes between a source and a destination. The power-assignment method used in SBR supports finding routes that satisfy the SIR requirements as well as reduces the level of prevailing interference that necessarily occurs in multiple-access wireless networks. SBR also has a new backup capability of establishing multiple paths, even for a single connection, when the route search cannot find a single path that supports the QoS requirements, which contributes to reducing the probability of call denials in constructing the route due to a lack of suitable paths. Extensive simulations show that SBR significantly reduces the ratio of unsuccessful calls with modest routing overhead.     

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

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

A reinforcement learning ticket-based probing path discovery scheme for MANETs

In this paper, a path discovery scheme which supports QoS routing in mobile ad hoc networks (MANETs) in the presence of imprecise information is investigated. The aim is to increase the probability of success in finding feasible paths and reduce average path cost of a previously proposed ticket based probing (TBP) path discovery scheme. The proposed scheme integrates the original TBP scheme with a reinforcement learning method called the on-policy first-visit Monte Carlo (ONMC) method. We investigate the performance of the ONMC method in the presence of imprecise information. Our numerical study shows that, in respect to a flooding based algorithm, message overhead reduction can be achieved with marginal difference in the path search ability and additional computational and storage requirements. When the average message overhead of the ONMC method is reduced to the same order of magnitude of the original TBP, the ONMC method gains an improvement of 28% in success ratio and 7% reduction in the average path cost over the original TBP.     

Route Stability Based QoS Routing in Mobile Ad Hoc Networks

To provide high quality communications service among mobile wireless devices is basically a challenging task in wireless ad hoc networks. In this paper, we propose a Route Stability based QoS Routing (RSQR) protocol in Mobile Ad Hoc Networks (MANETs) which is an extension of QoS routing with throughput and delay constraints. Ensuring a data path to be valid for sufficiently longer period of time is a very difficult problem in MANET due to its highly dynamic nature. We propose a simple model for computing link stability and route stability based on received signal strengths. By including some extra fields in route request/reply packets, the route stability information can be utilized to select a route with higher stability among all the feasible routes between a given source destination pair. Further, inclusion of a signal strength based admission control enhances the performance of the routing. Results of our experiments show performance improvements in terms of packet delivery ratio, control overhead and average end-to-end delay in comparison with a QoS routing protocol proposed by Q. Xue and A. Ganz.     

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.