Article

Free access

Comparison of routing metrics for static multi-hop wireless networks

Authors:

Richard Draves,

Jitendra Padhye,

Brian ZillAuthors Info & Claims

SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

Pages 133 - 144

https://doi.org/10.1145/1015467.1015483

Published: 30 August 2004 Publication History

Abstract

Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to poor throughput. A routing algorithm can select better paths by explicitly taking the quality of the wireless links into account. In this paper, we conduct a detailed, empirical evaluation of the performance of three link-quality metrics---ETX, per-hop RTT, and per-hop packet pair---and compare them against minimum hop count. We study these metrics using a DSR-based routing protocol running in a wireless testbed. We find that the ETX metric has the best performance when all nodes are stationary. We also find that the per-hop RTT and per-hop packet-pair metrics perform poorly due to self-interference. Interestingly, the hop-count metric outperforms all of the link-quality metrics in a scenario where the sender is mobile.

References

[1]

A. Adya, P. Bahl, J. Padhye, A. Wolman, and L. Zhou. A multi-radio unification protocol for IEEE 802.11 wireless networks. In BroadNets, 2004.

Digital Library

[2]

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient overlay networks. In SOSP, 2001.

Digital Library

[3]

AODV@IETF. http://moment.cs.ucsb.edu/aodv-ietf/.

[4]

B. Awerbuch, D. Holmer, and H. Rubens. High throughput route selection in mult-rate ad hoc wireless networks. Technical report, Johns Hopkins CS Dept, March 2003. v 2.

[5]

P. Bardford and M. Crovella. Generating representative web workloads for network and server performance evaluation. In SIGMERICS, Nov. 1998.

Digital Library

[6]

Bay area wireless users group. http://www.bawug.org/.

[7]

J. Broch, D. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In MOBICOM, Oct. 1998.

Digital Library

[8]

D. De Couto. Personal communication, Nov. 2003.

[9]

D. De Couto, D. Aguayo, J. Bicket, and R. Morris. High-throughput path metric for multi-hop wireless routing. In MOBICOM, Sep 2003.

Digital Library

[10]

R. Draves, J. Padhye, and B. Zill. The architecture of the Link Quality Source Routing Protocol. Technical Report MSR-TR-2004-57, Microsoft Research, 2004.

[11]

T. Goff, N. Abu-Aahazaleh, D. Phatak, and R. Kahvecioglu. Preemptive routing in ad hoc networks. In MOBICOM, 2001.

Digital Library

[12]

Y.-C. Hu and D. B. Johnson. Design and demonstration of live audio and video over multi-hop wireless networks. In MILCOM, 2002.

[13]

P. Huang and J. Heidemann. Capturing tcp burstiness for lightweight simulation. In SCS Multiconference on Distributed Simulation, Jan. 2001.

[14]

R. Jain. The Art of Computer Systems Performance Analysis. John Wiley and Sons, Inc., 1991.

[15]

D. B. Johnson and D. A. Maltz. Dynamic source routing in ad-hoc wireless networks. In T. Imielinski and H. Korth, editors, Mobile Computing. Kluwer Academic Publishers, 1996.

[16]

R. Karrer, A. Sabharwal, and E. Knightly. Enabling Large-scale Wireless Broadband: The Case for TAPs. In HotNets, Nov 2003.

[17]

S. Keshav. A Control-theoretic approach to flow control. In SIGCOMM, Sep 1991.

Digital Library

[18]

A. Khanna and J. Zinky. The Revised ARPANET Routing Metric. In SIGCOMM, 1989.

Digital Library

[19]

L. Krishnamurthy. Personal communication, Dec. 2003.

[20]

J. Moy. OSPF Version 2. RFC2328, April 1998.

[21]

K. Park, G. Kim, and M. Crovella. On the relationship between file sizes, transport protocols and self-similar network tarffic. In ICNP, 1996.

Digital Library

[22]

V. D. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. In INFOCOM, Apr 1997.

Digital Library

[23]

C. E. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance vector routing (dsdv) for mobile computeres. In SIGCOMM, Sep. 1994.

Digital Library

[24]

C. E. Perkins and E. M. Royer. Ad-hoc on-demand distance vector routing. In WMCSA, Feb 1999.

Digital Library

[25]

R. Punnose, P. Nitkin, J. Borch, and D. Stancil. Optimizing wireless network protocols using real time predictive propagation modeling. In RAWCON, Aug 1999.

[26]

MIT roofnet. http://www.pdos.lcs.mit.edu/roofnet/.

[27]

Seattle wireless. http://www.seattlewireless.net/.

[28]

A. Woo, T. Tong, and D. Culler. Taming the underlying challenges of reliable multihop routing in sensor networks. In SenSys, Nov 2003.

Digital Library

[29]

J. Zhao and R. Govindan. Understanding packet delivery performance in dense wireless sensor networks. In SenSys, Nov. 2003.

Digital Library

Cited By

Zhang YSrikanteswara SFeng HArrobo GSpoczynski MHimayat NMoltchanov DGlazkov R(2023)Dynamic Pervasive Compute Orchestration using Information Centric Network2023 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC55385.2023.10118796(1-6)Online publication date: Mar-2023
https://doi.org/10.1109/WCNC55385.2023.10118796
Wieme JBaert MHoebeke J(2022)Relay selection in Bluetooth Mesh networks by embedding genetic algorithms in a Digital Communication Twin2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)10.1109/WoWMoM54355.2022.00087(561-566)Online publication date: Jun-2022
https://doi.org/10.1109/WoWMoM54355.2022.00087
Kumaraguru SJebarani M(2021)Trust aware routing using sunflower sine cosine-based stacked autoencoder approach for EEG signal classification in WSNJournal of High Speed Networks10.3233/JHS-210654(1-19)Online publication date: 7-Jul-2021
https://doi.org/10.3233/JHS-210654
Show More Cited By

Index Terms

Comparison of routing metrics for static multi-hop wireless networks
1. Networks
  1. Network architectures

Recommendations

Comparison of routing metrics for static multi-hop wireless networks

Routing protocols for wireless ad hoc networks have traditionally focused on finding paths with minimum hop count. However, such paths can include slow or lossy links, leading to poor throughput. A routing algorithm can select better paths by explicitly ...
On-demand multicast routing protocol in multihop wireless mobile networks

An ad hoc network is a dynamically reconfigurable wireless network with no fixed infrastructure or central administration. Each host is mobile and must act as a router. Routing and multicasting protocols in ad hoc networks are faced with the challenge ...
Efficient Packet Routing in Highly Mobile Wireless Networks

Traditional mobile ad-hoc network (MANET) and delay tolerant network (DTN) routing schemes work properly only under the limited assumptions. MANET routing schemes are designed for densely populated networks while DTN routing schemes were developed for ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGCOMM '04: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications

August 2004

402 pages

ISBN:1581138628

DOI:10.1145/1015467

General Chair:
Raj Yavatkar
Intel Corporation
,
Program Chairs:
Ellen Zegura
Georgia Institute of Technology
,
Jennifer Rexford
AT&T Labs -- Research

ACM SIGCOMM Computer Communication Review Volume 34, Issue 4
October 2004
385 pages
ISSN:0146-4833
DOI:10.1145/1030194
Issue’s Table of Contents

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 August 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGCOMM04

Sponsor:

SIGCOMM04: ACM SIGCOMM 2004 Conference

August 30 - September 3, 2004

Oregon, Portland, USA

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

736
Total Citations
View Citations
4,692
Total Downloads

Downloads (Last 12 months)119
Downloads (Last 6 weeks)15

Reflects downloads up to 18 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang YSrikanteswara SFeng HArrobo GSpoczynski MHimayat NMoltchanov DGlazkov R(2023)Dynamic Pervasive Compute Orchestration using Information Centric Network2023 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC55385.2023.10118796(1-6)Online publication date: Mar-2023
https://doi.org/10.1109/WCNC55385.2023.10118796
Wieme JBaert MHoebeke J(2022)Relay selection in Bluetooth Mesh networks by embedding genetic algorithms in a Digital Communication Twin2022 IEEE 23rd International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM)10.1109/WoWMoM54355.2022.00087(561-566)Online publication date: Jun-2022
https://doi.org/10.1109/WoWMoM54355.2022.00087
Kumaraguru SJebarani M(2021)Trust aware routing using sunflower sine cosine-based stacked autoencoder approach for EEG signal classification in WSNJournal of High Speed Networks10.3233/JHS-210654(1-19)Online publication date: 7-Jul-2021
https://doi.org/10.3233/JHS-210654
Nita-Rotaru CDong JCurtmola R(2021)Secure Routing in Wireless Mesh NetworksEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-642-27739-9_884-2(1-6)Online publication date: 26-Jan-2021
https://doi.org/10.1007/978-3-642-27739-9_884-2
Curtmola RDong JNita-Rotaru C(2021)Security of Wireless Mesh Networks (General Overview)Encyclopedia of Cryptography, Security and Privacy10.1007/978-3-642-27739-9_56-2(1-6)Online publication date: 9-Jan-2021
https://doi.org/10.1007/978-3-642-27739-9_56-2
Macabale NVillasoto ARivera JVentanilla ATalplacido MSevilla AGarcia J(2020)CRADLE: Cross-Layer Design for Load-Aware Routing in IEEE 802.11-based Wireless Mesh and Sensor Networks2020 10th Annual Computing and Communication Workshop and Conference (CCWC)10.1109/CCWC47524.2020.9031245(0970-0974)Online publication date: Jan-2020
https://doi.org/10.1109/CCWC47524.2020.9031245
Patil PDeshpande RMane P(2020)Trust and Opportunity Based Routing Framework in Wireless Sensor Network Using Hybrid Optimization AlgorithmWireless Personal Communications10.1007/s11277-020-07579-6Online publication date: 20-Jun-2020
https://doi.org/10.1007/s11277-020-07579-6
Millán PAliagas CMolina CMeseguer ROchoa SSantos R(2019)Predicting Topology Propagation Messages in Mobile Ad Hoc Networks: The Value of HistorySensors10.3390/s2001002420:1(24)Online publication date: 19-Dec-2019
https://doi.org/10.3390/s20010024
Bautista OSaputro NAkkaya KUluagac SPoor VHan Z(2019)A novel routing metric for IEEE 802.11s-based swarm-of-drones applicationsProceedings of the 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services10.1145/3360774.3368197(514-521)Online publication date: 12-Nov-2019
https://dl.acm.org/doi/10.1145/3360774.3368197
Jannesari ASarram MSheikhpour R(2019)A Novel Network Coding Algorithm to Improve TCP in Wireless NetworksWireless Personal Communications10.1007/s11277-019-06781-5Online publication date: 20-Sep-2019
https://doi.org/10.1007/s11277-019-06781-5
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents