Search-quality tradeoffs for routing in non-ideal wireless networks

Chiranjeeb Buragohain, Divyakant Agrawal, Subhash Suri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Typical wireless routing protocols like AODV/DSR are not scalable to very large networks because they employ flooding for route discovery. Geographic routing protocols like GPSR are highly scalable because they require minimum control overhead, but depend on idealized link quality models (such as the unit disk model) which are not always applicable. We explore the routing spectrum between these two extremes under a realistic random link quality model. It is common wisdom that by adding limited flooding to a protocol like geographic routing improves quality. In this paper, we provide a formal and quantitative formulation of this trade-off, and show both analytically and experimentally that a significant improvement in path quality is possible by searching a narrow region around the geographic straight-line path between the source and destination. In particular, if the endto-end throughput is measured as the product of link reliabilities in a path, then we demonstrate that the path quality improves exponentially as the search region is broadened.

Original languageEnglish
Title of host publication2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006
Pages10-19
Number of pages10
Volume1
DOIs
Publication statusPublished - 1 Dec 2007
Externally publishedYes
Event2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006 - Reston, VA, United States
Duration: 25 Sep 200628 Sep 2006

Other

Other2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006
CountryUnited States
CityReston, VA
Period25/9/0628/9/06

Fingerprint

Wireless networks
Routing protocols
Throughput
Network protocols

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Buragohain, C., Agrawal, D., & Suri, S. (2007). Search-quality tradeoffs for routing in non-ideal wireless networks. In 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006 (Vol. 1, pp. 10-19). [4068103] https://doi.org/10.1109/SAHCN.2006.288404

Search-quality tradeoffs for routing in non-ideal wireless networks. / Buragohain, Chiranjeeb; Agrawal, Divyakant; Suri, Subhash.

2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006. Vol. 1 2007. p. 10-19 4068103.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Buragohain, C, Agrawal, D & Suri, S 2007, Search-quality tradeoffs for routing in non-ideal wireless networks. in 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006. vol. 1, 4068103, pp. 10-19, 2006 3rd Annual IEEE Communications Society on Sensor and Ad hoc Communications and Networks, Secon 2006, Reston, VA, United States, 25/9/06. https://doi.org/10.1109/SAHCN.2006.288404
Buragohain C, Agrawal D, Suri S. Search-quality tradeoffs for routing in non-ideal wireless networks. In 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006. Vol. 1. 2007. p. 10-19. 4068103 https://doi.org/10.1109/SAHCN.2006.288404
Buragohain, Chiranjeeb ; Agrawal, Divyakant ; Suri, Subhash. / Search-quality tradeoffs for routing in non-ideal wireless networks. 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006. Vol. 1 2007. pp. 10-19
@inproceedings{bb34e0c952844a678eacf7f148b03138,
title = "Search-quality tradeoffs for routing in non-ideal wireless networks",
abstract = "Typical wireless routing protocols like AODV/DSR are not scalable to very large networks because they employ flooding for route discovery. Geographic routing protocols like GPSR are highly scalable because they require minimum control overhead, but depend on idealized link quality models (such as the unit disk model) which are not always applicable. We explore the routing spectrum between these two extremes under a realistic random link quality model. It is common wisdom that by adding limited flooding to a protocol like geographic routing improves quality. In this paper, we provide a formal and quantitative formulation of this trade-off, and show both analytically and experimentally that a significant improvement in path quality is possible by searching a narrow region around the geographic straight-line path between the source and destination. In particular, if the endto-end throughput is measured as the product of link reliabilities in a path, then we demonstrate that the path quality improves exponentially as the search region is broadened.",
author = "Chiranjeeb Buragohain and Divyakant Agrawal and Subhash Suri",
year = "2007",
month = "12",
day = "1",
doi = "10.1109/SAHCN.2006.288404",
language = "English",
isbn = "1424406269",
volume = "1",
pages = "10--19",
booktitle = "2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006",

}

TY - GEN

T1 - Search-quality tradeoffs for routing in non-ideal wireless networks

AU - Buragohain, Chiranjeeb

AU - Agrawal, Divyakant

AU - Suri, Subhash

PY - 2007/12/1

Y1 - 2007/12/1

N2 - Typical wireless routing protocols like AODV/DSR are not scalable to very large networks because they employ flooding for route discovery. Geographic routing protocols like GPSR are highly scalable because they require minimum control overhead, but depend on idealized link quality models (such as the unit disk model) which are not always applicable. We explore the routing spectrum between these two extremes under a realistic random link quality model. It is common wisdom that by adding limited flooding to a protocol like geographic routing improves quality. In this paper, we provide a formal and quantitative formulation of this trade-off, and show both analytically and experimentally that a significant improvement in path quality is possible by searching a narrow region around the geographic straight-line path between the source and destination. In particular, if the endto-end throughput is measured as the product of link reliabilities in a path, then we demonstrate that the path quality improves exponentially as the search region is broadened.

AB - Typical wireless routing protocols like AODV/DSR are not scalable to very large networks because they employ flooding for route discovery. Geographic routing protocols like GPSR are highly scalable because they require minimum control overhead, but depend on idealized link quality models (such as the unit disk model) which are not always applicable. We explore the routing spectrum between these two extremes under a realistic random link quality model. It is common wisdom that by adding limited flooding to a protocol like geographic routing improves quality. In this paper, we provide a formal and quantitative formulation of this trade-off, and show both analytically and experimentally that a significant improvement in path quality is possible by searching a narrow region around the geographic straight-line path between the source and destination. In particular, if the endto-end throughput is measured as the product of link reliabilities in a path, then we demonstrate that the path quality improves exponentially as the search region is broadened.

UR - http://www.scopus.com/inward/record.url?scp=43849094964&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43849094964&partnerID=8YFLogxK

U2 - 10.1109/SAHCN.2006.288404

DO - 10.1109/SAHCN.2006.288404

M3 - Conference contribution

AN - SCOPUS:43849094964

SN - 1424406269

SN - 9781424406265

VL - 1

SP - 10

EP - 19

BT - 2006 3rd Annual IEEE Communications Society on Sensor and Adhoc Communications and Networks, Secon 2006

ER -