Adaptive geographic routing in wireless sensor networks

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

2 Citations (Scopus)

Abstract

Geographic routing protocols exploit node positions on the Euclidean plane to route packets in multi-hop networks. Their potential lies in forgoing the overhead of building routing structures for instance in the form of link-state tables. At the same time their performance suffers from local dead ends and missing or inaccurate node coordinates. These issues have been addressed by various means, most notably by falling back to face routing on a planarized network graph or to a backup routing infrastructure such as a minimum spanning tree. Existing solutions however are not geared towards finding efficient paths or result in a considerable - often upfront and global - communication overhead. We propose assisting geographic routing adaptively by resorting to an on-demand route discovery only when and where it becomes necessary to sustain its greedy forwarding functionality. Simulating practically relevant qualities of dead ends and location inaccuracies, we show how the overhead of our method to deal with such cases remains localized and limited. We claim that our results make geographic routing more practicable particularly in wireless sensor networks that are deployed in immobile large-scale meshes and characterized by locally varying network conditions.

Original languageEnglish
Title of host publicationMSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems
Pages91-100
Number of pages10
DOIs
Publication statusPublished - 2010 Dec 21
Externally publishedYes
Event13th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2010 - Bodrum, Turkey
Duration: 2010 Oct 172010 Oct 21

Other

Other13th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2010
CountryTurkey
CityBodrum
Period10/10/1710/10/21

Fingerprint

Routing protocols
Wireless Sensor Networks
Wireless sensor networks
Routing
Communication
Euclidean plane
Minimum Spanning Tree
Multi-hop
Vertex of a graph
Inaccurate
Routing Protocol
Tables
Infrastructure
Mesh
Path
Necessary
Graph in graph theory

Keywords

  • adaptability
  • geographic routing
  • geometric routing
  • position-based routing
  • self-adaptation
  • wireless sensor network

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Modelling and Simulation

Cite this

Abe, R., & Honiden, S. (2010). Adaptive geographic routing in wireless sensor networks. In MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems (pp. 91-100) https://doi.org/10.1145/1868521.1868538

Adaptive geographic routing in wireless sensor networks. / Abe, Rey; Honiden, Shinichi.

MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems. 2010. p. 91-100.

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

Abe, R & Honiden, S 2010, Adaptive geographic routing in wireless sensor networks. in MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems. pp. 91-100, 13th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2010, Bodrum, Turkey, 10/10/17. https://doi.org/10.1145/1868521.1868538
Abe R, Honiden S. Adaptive geographic routing in wireless sensor networks. In MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems. 2010. p. 91-100 https://doi.org/10.1145/1868521.1868538
Abe, Rey ; Honiden, Shinichi. / Adaptive geographic routing in wireless sensor networks. MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems. 2010. pp. 91-100
@inproceedings{e44461a0c6fb41e68b3e595866b62f28,
title = "Adaptive geographic routing in wireless sensor networks",
abstract = "Geographic routing protocols exploit node positions on the Euclidean plane to route packets in multi-hop networks. Their potential lies in forgoing the overhead of building routing structures for instance in the form of link-state tables. At the same time their performance suffers from local dead ends and missing or inaccurate node coordinates. These issues have been addressed by various means, most notably by falling back to face routing on a planarized network graph or to a backup routing infrastructure such as a minimum spanning tree. Existing solutions however are not geared towards finding efficient paths or result in a considerable - often upfront and global - communication overhead. We propose assisting geographic routing adaptively by resorting to an on-demand route discovery only when and where it becomes necessary to sustain its greedy forwarding functionality. Simulating practically relevant qualities of dead ends and location inaccuracies, we show how the overhead of our method to deal with such cases remains localized and limited. We claim that our results make geographic routing more practicable particularly in wireless sensor networks that are deployed in immobile large-scale meshes and characterized by locally varying network conditions.",
keywords = "adaptability, geographic routing, geometric routing, position-based routing, self-adaptation, wireless sensor network",
author = "Rey Abe and Shinichi Honiden",
year = "2010",
month = "12",
day = "21",
doi = "10.1145/1868521.1868538",
language = "English",
isbn = "9781450302746",
pages = "91--100",
booktitle = "MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems",

}

TY - GEN

T1 - Adaptive geographic routing in wireless sensor networks

AU - Abe, Rey

AU - Honiden, Shinichi

PY - 2010/12/21

Y1 - 2010/12/21

N2 - Geographic routing protocols exploit node positions on the Euclidean plane to route packets in multi-hop networks. Their potential lies in forgoing the overhead of building routing structures for instance in the form of link-state tables. At the same time their performance suffers from local dead ends and missing or inaccurate node coordinates. These issues have been addressed by various means, most notably by falling back to face routing on a planarized network graph or to a backup routing infrastructure such as a minimum spanning tree. Existing solutions however are not geared towards finding efficient paths or result in a considerable - often upfront and global - communication overhead. We propose assisting geographic routing adaptively by resorting to an on-demand route discovery only when and where it becomes necessary to sustain its greedy forwarding functionality. Simulating practically relevant qualities of dead ends and location inaccuracies, we show how the overhead of our method to deal with such cases remains localized and limited. We claim that our results make geographic routing more practicable particularly in wireless sensor networks that are deployed in immobile large-scale meshes and characterized by locally varying network conditions.

AB - Geographic routing protocols exploit node positions on the Euclidean plane to route packets in multi-hop networks. Their potential lies in forgoing the overhead of building routing structures for instance in the form of link-state tables. At the same time their performance suffers from local dead ends and missing or inaccurate node coordinates. These issues have been addressed by various means, most notably by falling back to face routing on a planarized network graph or to a backup routing infrastructure such as a minimum spanning tree. Existing solutions however are not geared towards finding efficient paths or result in a considerable - often upfront and global - communication overhead. We propose assisting geographic routing adaptively by resorting to an on-demand route discovery only when and where it becomes necessary to sustain its greedy forwarding functionality. Simulating practically relevant qualities of dead ends and location inaccuracies, we show how the overhead of our method to deal with such cases remains localized and limited. We claim that our results make geographic routing more practicable particularly in wireless sensor networks that are deployed in immobile large-scale meshes and characterized by locally varying network conditions.

KW - adaptability

KW - geographic routing

KW - geometric routing

KW - position-based routing

KW - self-adaptation

KW - wireless sensor network

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

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

U2 - 10.1145/1868521.1868538

DO - 10.1145/1868521.1868538

M3 - Conference contribution

SN - 9781450302746

SP - 91

EP - 100

BT - MSWiM'10 - Proceedings of the 13th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems

ER -