An adaptive framework for QoS routing through multiple paths in ad hoc wireless networks

Abstract

We propose an adaptive framework for computing multiple paths in temporal and spatial domains to transmit a large volume of data packets from a source s to a destination d in ad hoc wireless networks. The objective is to achieve quality of service (QoS) by minimizing end-to-end delay for packet delivery. We consider two aspects in this framework. The first aspect is to perform preemptive route rediscoveries before the occurrence of route errors while transmitting a large volume of data from s to d: This helps us to find out dynamically a series of possible paths in temporal domain to complete the data transfer. The second aspect is to select multiple paths in spatial domain for data transfer at any instant of time, and to distribute the data packets in sequential blocks over those paths in order to reduce congestion and end-to-end delay. A notion of link stability and path stability is also defined, and a unified mechanism is proposed to address the above two aspects that relies on evaluating a path based on link and path stability. Our solution method uses Lagrangean relaxation and subgradient heuristics to solve an optimization formulation of the problem in order to compute the paths and the corresponding data distribution, both in temporal and spatial domains. Simulation experiments demonstrate that the proposed framework helps in significantly reducing the end-to-end delay and the required number of routerediscoveries.

Routing protocols in ad hoc networks: A survey

“…Adaptive QoS routing framework through multiple paths [36]: Das et al observe that when communication takes place between source-destination pairs, an interruption may occur in case of a link breakage due to various reasons. This interruption leads to degraded QoS as the user has to wait till another route is discovered.…”

Energy efficient multi-path communication for time-critical applications in underwater sensor networks

“…The dense node deployment in wireless sensor networks makes multi-path routing a natural and promising technique to cope with the unreliable network environments. Research efforts have been made using multi-path routing to improve the robustness of data delivery [36,41], to balance traffic load and power consumption among nodes [13,37], to reduce end-to-end delays and the frequency of route discoveries [8,24], and to improve the network security [22,18], etc. The focus of our work in this paper is not to propose a new multi-path routing protocol.…”

An efficient N-to-1 multipath routing protocol in wireless sensor networks

“…In order to evaluate the impact of the edge density on the performance, we vary the transmission range in different experiments to adjust the edge density in the network. We tried four different transmission ranges, 15, 20, 25, and 30 meters 4 . Table I summarizes some topological parameters of the networks simulated when using different transmission ranges, including average node degree d (i.e., average number of neighbors a node has) and average network diameter D (i.e., maximum hop count from any sensor node to the BS based on shortest path routing).…”

“…Multipath routing has been a promising technique in mobile ad hoc networks in order to aggregate limited bandwidth, to smooth traffic burstiness, to alleviate network congestion, and to improve fault tolerance, and most importantly, to improve reliability [4], [18]. Several multipath routing protocols have been proposed to find multiple disjoint or partially disjoint paths between a single source and destination pair [5], [6], [15], [20].…”

“…While most of multipath routing protocols are source-initiated and aim to find multiple disjoint or partially disjoint paths between a single source-destination pair [4], [5], [15], [20], the distinct feature of our N-to-1 multipath discovery protocol is that it is receiver-initiated (i.e., BS initiated) and at the end of one route discovery process, the protocol finds every sensor node a set of node-disjoint paths to the BS simultaneously. It is highly efficient, with an average overhead of less than one routing message per path.…”