Cooperative rotational sweep schemes for geographic routing

Jung-Tsung Tsai, Yunghsiang S. Han

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

Abstract

Geographic routing operates with minimum local state information but requires a recovery method to bypass network voids. Under unit disk assumption (UDA) for connection between wireless nodes, recovery approaches based on rotational sweep algorithms with sweep curves can be employed to achieve packet delivery guarantee as well as low routing path hop counts. However, they are questionably applicable under more practical non UDA, let alone support the guarantee. For practical use, we propose a cooperative rotational sweep method operated in conjunction with the original one. Under a relaxed UDA by which connection between a pair of nodes within unit distance depends on path loss and Raleigh fading power, simulation results show that proposed schemes are able to achieve an extremely high routing success probability at the cost of the size of packet overhead carrying a recent history of visited nodes, essentially demonstrating a feasible tradeoff of memory length for routing success rates.

Original languageEnglish
Title of host publication2016 IEEE International Conference on Communications, ICC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479966646
DOIs
Publication statusPublished - 2016 Jul 12
Event2016 IEEE International Conference on Communications, ICC 2016 - Kuala Lumpur, Malaysia
Duration: 2016 May 222016 May 27

Publication series

Name2016 IEEE International Conference on Communications, ICC 2016

Other

Other2016 IEEE International Conference on Communications, ICC 2016
CountryMalaysia
CityKuala Lumpur
Period16/5/2216/5/27

Fingerprint

Recovery
History
Data storage equipment

Keywords

  • Geographic routing
  • ad hoc network
  • rotational sweep algorithm
  • sweep curve
  • unit disk assumption

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Tsai, J-T., & Han, Y. S. (2016). Cooperative rotational sweep schemes for geographic routing. In 2016 IEEE International Conference on Communications, ICC 2016 [7511314] (2016 IEEE International Conference on Communications, ICC 2016). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2016.7511314

Cooperative rotational sweep schemes for geographic routing. / Tsai, Jung-Tsung; Han, Yunghsiang S.

2016 IEEE International Conference on Communications, ICC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. 7511314 (2016 IEEE International Conference on Communications, ICC 2016).

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

Tsai, J-T & Han, YS 2016, Cooperative rotational sweep schemes for geographic routing. in 2016 IEEE International Conference on Communications, ICC 2016., 7511314, 2016 IEEE International Conference on Communications, ICC 2016, Institute of Electrical and Electronics Engineers Inc., 2016 IEEE International Conference on Communications, ICC 2016, Kuala Lumpur, Malaysia, 16/5/22. https://doi.org/10.1109/ICC.2016.7511314
Tsai J-T, Han YS. Cooperative rotational sweep schemes for geographic routing. In 2016 IEEE International Conference on Communications, ICC 2016. Institute of Electrical and Electronics Engineers Inc. 2016. 7511314. (2016 IEEE International Conference on Communications, ICC 2016). https://doi.org/10.1109/ICC.2016.7511314
Tsai, Jung-Tsung ; Han, Yunghsiang S. / Cooperative rotational sweep schemes for geographic routing. 2016 IEEE International Conference on Communications, ICC 2016. Institute of Electrical and Electronics Engineers Inc., 2016. (2016 IEEE International Conference on Communications, ICC 2016).
@inproceedings{01d522014bc14ccb8784c7cf6fb62621,
title = "Cooperative rotational sweep schemes for geographic routing",
abstract = "Geographic routing operates with minimum local state information but requires a recovery method to bypass network voids. Under unit disk assumption (UDA) for connection between wireless nodes, recovery approaches based on rotational sweep algorithms with sweep curves can be employed to achieve packet delivery guarantee as well as low routing path hop counts. However, they are questionably applicable under more practical non UDA, let alone support the guarantee. For practical use, we propose a cooperative rotational sweep method operated in conjunction with the original one. Under a relaxed UDA by which connection between a pair of nodes within unit distance depends on path loss and Raleigh fading power, simulation results show that proposed schemes are able to achieve an extremely high routing success probability at the cost of the size of packet overhead carrying a recent history of visited nodes, essentially demonstrating a feasible tradeoff of memory length for routing success rates.",
keywords = "Geographic routing, ad hoc network, rotational sweep algorithm, sweep curve, unit disk assumption",
author = "Jung-Tsung Tsai and Han, {Yunghsiang S.}",
year = "2016",
month = "7",
day = "12",
doi = "10.1109/ICC.2016.7511314",
language = "English",
series = "2016 IEEE International Conference on Communications, ICC 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "2016 IEEE International Conference on Communications, ICC 2016",

}

TY - GEN

T1 - Cooperative rotational sweep schemes for geographic routing

AU - Tsai, Jung-Tsung

AU - Han, Yunghsiang S.

PY - 2016/7/12

Y1 - 2016/7/12

N2 - Geographic routing operates with minimum local state information but requires a recovery method to bypass network voids. Under unit disk assumption (UDA) for connection between wireless nodes, recovery approaches based on rotational sweep algorithms with sweep curves can be employed to achieve packet delivery guarantee as well as low routing path hop counts. However, they are questionably applicable under more practical non UDA, let alone support the guarantee. For practical use, we propose a cooperative rotational sweep method operated in conjunction with the original one. Under a relaxed UDA by which connection between a pair of nodes within unit distance depends on path loss and Raleigh fading power, simulation results show that proposed schemes are able to achieve an extremely high routing success probability at the cost of the size of packet overhead carrying a recent history of visited nodes, essentially demonstrating a feasible tradeoff of memory length for routing success rates.

AB - Geographic routing operates with minimum local state information but requires a recovery method to bypass network voids. Under unit disk assumption (UDA) for connection between wireless nodes, recovery approaches based on rotational sweep algorithms with sweep curves can be employed to achieve packet delivery guarantee as well as low routing path hop counts. However, they are questionably applicable under more practical non UDA, let alone support the guarantee. For practical use, we propose a cooperative rotational sweep method operated in conjunction with the original one. Under a relaxed UDA by which connection between a pair of nodes within unit distance depends on path loss and Raleigh fading power, simulation results show that proposed schemes are able to achieve an extremely high routing success probability at the cost of the size of packet overhead carrying a recent history of visited nodes, essentially demonstrating a feasible tradeoff of memory length for routing success rates.

KW - Geographic routing

KW - ad hoc network

KW - rotational sweep algorithm

KW - sweep curve

KW - unit disk assumption

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

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

U2 - 10.1109/ICC.2016.7511314

DO - 10.1109/ICC.2016.7511314

M3 - Conference contribution

AN - SCOPUS:84981351812

T3 - 2016 IEEE International Conference on Communications, ICC 2016

BT - 2016 IEEE International Conference on Communications, ICC 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -