scispace - formally typeset
Journal ArticleDOI

SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks

Reads0
Chats0
TLDR
This paper proposes a simple opportunistic adaptive routing protocol (SOAR) to explicitly support multiple simultaneous flows in wireless mesh networks and shows that SOAR significantly outperforms traditional routing and a seminal opportunistic routing protocol, ExOR, under a wide range of scenarios.
Abstract
Multihop wireless mesh networks are becoming a new attractive communication paradigm owing to their low cost and ease of deployment. Routing protocols are critical to the performance and reliability of wireless mesh networks. Traditional routing protocols send traffic along predetermined paths and face difficulties in coping with unreliable and unpredictable wireless medium. In this paper, we propose a simple opportunistic adaptive routing protocol (SOAR) to explicitly support multiple simultaneous flows in wireless mesh networks. SOAR incorporates the following four major components to achieve high throughput and fairness: 1) adaptive forwarding path selection to leverage path diversity while minimizing duplicate transmissions, 2) priority timer-based forwarding to let only the best forwarding node forward the packet, 3) local loss recovery to efficiently detect and retransmit lost packets, and 4) adaptive rate control to determine an appropriate sending rate according to the current network conditions. We implement SOAR in both NS-2 simulation and an 18-node wireless mesh testbed. Our extensive evaluation shows that SOAR significantly outperforms traditional routing and a seminal opportunistic routing protocol, ExOR, under a wide range of scenarios.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Elastic sketch: adaptive and fast network-wide measurements

TL;DR: The Elastic sketch is proposed, which is adaptive to currently traffic characteristics, generic to measurement tasks and platforms, and implemented on six platforms to process typical measurement tasks.
Journal ArticleDOI

A Survey on Opportunistic Routing in Wireless Communication Networks

TL;DR: This paper provides a taxonomy for opportunistic routing proposals, based on their routing objectives as well as the optimization tools and approaches used in the routing design, and identifies and discusses the main future research directions related to the opportunistic routed design, optimization, and deployment.
Proceedings ArticleDOI

SourceSync: a distributed wireless architecture for exploiting sender diversity

TL;DR: The paper shows that SourceSync improves the performance of opportunistic routing protocols, and increases the throughput of 802.11 last hop diversity protocols by allowing multiple APs to transmit simultaneously to a client, thereby harnessing sender diversity.
Journal ArticleDOI

Spatial Reusability-Aware Routing in Multi-Hop Wireless Networks

TL;DR: It is argued that by carefully considering spatial reusability of the wireless communication media, one can tremendously improve the end-to-end throughput in multi-hop wireless networks and compare them with existing single-path routing and anypath routing protocols, respectively.
Journal ArticleDOI

Opportunistic Routing in Wireless Networks: Models, Algorithms, and Classifications

TL;DR: The fundamental idea of OR and its important issues are explained, and different protocols from each category are illustrated and compared to improve the transmission reliability and network throughput.
References
More filters
Proceedings ArticleDOI

Ad-hoc on-demand distance vector routing

TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Proceedings ArticleDOI

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Posted Content

A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems

TL;DR: A quantitative measure called Indiex of FRairness, applicable to any resource sharing or allocation problem, which is independent of the amount of the resource, and boundedness aids intuitive understanding of the fairness index.
Proceedings ArticleDOI

A high-throughput path metric for multi-hop wireless routing

TL;DR: Measurements taken from a 29-node 802.11b test-bed demonstrate the poor performance of minimum hop-count, illustrate the causes of that poor performance, and confirm that ETX improves performance.
Proceedings ArticleDOI

Routing in multi-radio, multi-hop wireless mesh networks

TL;DR: A new metric for routing in multi-radio, multi-hop wireless networks with stationary nodes called Weighted Cumulative ETT (WCETT) significantly outperforms previously-proposed routing metrics by making judicious use of the second radio.