Energy efficient percolation-driven flood routing for large-scale sensor networks

Gergely Vakulya, G. Simon

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

7 Citations (Scopus)

Abstract

Abstract-Flooding algorithms are widely used in ad-hoc sensor networks, especially as building blocks of more sophisticated routing protocols. A distributed percolation-driven energy efficient probabilistic flood routing algorithm is proposed, which provides large message delivery ratio with small number of sent messages, using neighborhood information only. The performance of the algorithm is analyzed and the theoretical results are verified through simulation examples.

Original languageEnglish
Title of host publicationProceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2008
Pages877-883
Number of pages7
Volume3
DOIs
Publication statusPublished - 2008
EventInternational Multiconference on Computer Science and Information Technology, IMCSIT 2008 - Wisla, Poland
Duration: Oct 20 2008Oct 22 2008

Other

OtherInternational Multiconference on Computer Science and Information Technology, IMCSIT 2008
CountryPoland
CityWisla
Period10/20/0810/22/08

Fingerprint

Sensor networks
Routing algorithms
Ad hoc networks
Routing protocols

ASJC Scopus subject areas

  • Computer Science Applications
  • Software

Cite this

Vakulya, G., & Simon, G. (2008). Energy efficient percolation-driven flood routing for large-scale sensor networks. In Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2008 (Vol. 3, pp. 877-883). [4747345] https://doi.org/10.1109/IMCSIT.2008.4747345

Energy efficient percolation-driven flood routing for large-scale sensor networks. / Vakulya, Gergely; Simon, G.

Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2008. Vol. 3 2008. p. 877-883 4747345.

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

Vakulya, G & Simon, G 2008, Energy efficient percolation-driven flood routing for large-scale sensor networks. in Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2008. vol. 3, 4747345, pp. 877-883, International Multiconference on Computer Science and Information Technology, IMCSIT 2008, Wisla, Poland, 10/20/08. https://doi.org/10.1109/IMCSIT.2008.4747345
Vakulya G, Simon G. Energy efficient percolation-driven flood routing for large-scale sensor networks. In Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2008. Vol. 3. 2008. p. 877-883. 4747345 https://doi.org/10.1109/IMCSIT.2008.4747345
Vakulya, Gergely ; Simon, G. / Energy efficient percolation-driven flood routing for large-scale sensor networks. Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2008. Vol. 3 2008. pp. 877-883
@inproceedings{b406122a7aa44087a8b24ab83ea0ecf0,
title = "Energy efficient percolation-driven flood routing for large-scale sensor networks",
abstract = "Abstract-Flooding algorithms are widely used in ad-hoc sensor networks, especially as building blocks of more sophisticated routing protocols. A distributed percolation-driven energy efficient probabilistic flood routing algorithm is proposed, which provides large message delivery ratio with small number of sent messages, using neighborhood information only. The performance of the algorithm is analyzed and the theoretical results are verified through simulation examples.",
author = "Gergely Vakulya and G. Simon",
year = "2008",
doi = "10.1109/IMCSIT.2008.4747345",
language = "English",
isbn = "9788360810149",
volume = "3",
pages = "877--883",
booktitle = "Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2008",

}

TY - GEN

T1 - Energy efficient percolation-driven flood routing for large-scale sensor networks

AU - Vakulya, Gergely

AU - Simon, G.

PY - 2008

Y1 - 2008

N2 - Abstract-Flooding algorithms are widely used in ad-hoc sensor networks, especially as building blocks of more sophisticated routing protocols. A distributed percolation-driven energy efficient probabilistic flood routing algorithm is proposed, which provides large message delivery ratio with small number of sent messages, using neighborhood information only. The performance of the algorithm is analyzed and the theoretical results are verified through simulation examples.

AB - Abstract-Flooding algorithms are widely used in ad-hoc sensor networks, especially as building blocks of more sophisticated routing protocols. A distributed percolation-driven energy efficient probabilistic flood routing algorithm is proposed, which provides large message delivery ratio with small number of sent messages, using neighborhood information only. The performance of the algorithm is analyzed and the theoretical results are verified through simulation examples.

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

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

U2 - 10.1109/IMCSIT.2008.4747345

DO - 10.1109/IMCSIT.2008.4747345

M3 - Conference contribution

SN - 9788360810149

SN - 9788360810149

VL - 3

SP - 877

EP - 883

BT - Proceedings of the International Multiconference on Computer Science and Information Technology, IMCSIT 2008

ER -