Efficient broadcasting and gathering in wireless ad-hoc networks

Melih Onus, Andrea Richa, Kishore Kothapalli, Christian Scheideler

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

25 Citations (Scopus)

Abstract

This paper considers the problem of broadcasting and information gathering in wireless ad-hoc networks, i.e. in wireless networks without any infrastructure in addition to the mobile hosts. Broadcasting is the problem of sending a packet from a source node in the network to all other nodes in the network. Information gathering is the problem of sending one packet each from a subset of the nodes to a single sink node in the network. Most of the proposed theoretical wireless network models oversimplify wireless communication properties. We will use a model that takes into account that nodes have different transmission and interference ranges, and we propose algorithms in this model that achieve a high time and work-efficiency. We present algorithms for broadcasting a single or multiple message(s), and for information gathering. Our algorithms have the advantage that they are very simple and self-stabilizing, and would therefore even work in a dynamic environment. Also, our algorithms require only a constant amount of storage at any host. Thus, our algorithms can be used in wireless systems with very simple devices, such as sensors.

Original languageEnglish (US)
Title of host publicationProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Pages346-351
Number of pages6
Volume2005
DOIs
StatePublished - 2005
Event8th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2005 - Las Vegas, NV, United States
Duration: Dec 7 2005Dec 9 2005

Other

Other8th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2005
CountryUnited States
CityLas Vegas, NV
Period12/7/0512/9/05

Fingerprint

Wireless ad hoc networks
Broadcasting
Wireless networks
Communication
Sensors

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Onus, M., Richa, A., Kothapalli, K., & Scheideler, C. (2005). Efficient broadcasting and gathering in wireless ad-hoc networks. In Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN (Vol. 2005, pp. 346-351). [1575848] https://doi.org/10.1109/ISPAN.2005.43

Efficient broadcasting and gathering in wireless ad-hoc networks. / Onus, Melih; Richa, Andrea; Kothapalli, Kishore; Scheideler, Christian.

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. Vol. 2005 2005. p. 346-351 1575848.

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

Onus, M, Richa, A, Kothapalli, K & Scheideler, C 2005, Efficient broadcasting and gathering in wireless ad-hoc networks. in Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. vol. 2005, 1575848, pp. 346-351, 8th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2005, Las Vegas, NV, United States, 12/7/05. https://doi.org/10.1109/ISPAN.2005.43
Onus M, Richa A, Kothapalli K, Scheideler C. Efficient broadcasting and gathering in wireless ad-hoc networks. In Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. Vol. 2005. 2005. p. 346-351. 1575848 https://doi.org/10.1109/ISPAN.2005.43
Onus, Melih ; Richa, Andrea ; Kothapalli, Kishore ; Scheideler, Christian. / Efficient broadcasting and gathering in wireless ad-hoc networks. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. Vol. 2005 2005. pp. 346-351
@inproceedings{a1295c6bd83b41bfa3c197c6b45852ac,
title = "Efficient broadcasting and gathering in wireless ad-hoc networks",
abstract = "This paper considers the problem of broadcasting and information gathering in wireless ad-hoc networks, i.e. in wireless networks without any infrastructure in addition to the mobile hosts. Broadcasting is the problem of sending a packet from a source node in the network to all other nodes in the network. Information gathering is the problem of sending one packet each from a subset of the nodes to a single sink node in the network. Most of the proposed theoretical wireless network models oversimplify wireless communication properties. We will use a model that takes into account that nodes have different transmission and interference ranges, and we propose algorithms in this model that achieve a high time and work-efficiency. We present algorithms for broadcasting a single or multiple message(s), and for information gathering. Our algorithms have the advantage that they are very simple and self-stabilizing, and would therefore even work in a dynamic environment. Also, our algorithms require only a constant amount of storage at any host. Thus, our algorithms can be used in wireless systems with very simple devices, such as sensors.",
author = "Melih Onus and Andrea Richa and Kishore Kothapalli and Christian Scheideler",
year = "2005",
doi = "10.1109/ISPAN.2005.43",
language = "English (US)",
isbn = "0769525091",
volume = "2005",
pages = "346--351",
booktitle = "Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN",

}

TY - GEN

T1 - Efficient broadcasting and gathering in wireless ad-hoc networks

AU - Onus, Melih

AU - Richa, Andrea

AU - Kothapalli, Kishore

AU - Scheideler, Christian

PY - 2005

Y1 - 2005

N2 - This paper considers the problem of broadcasting and information gathering in wireless ad-hoc networks, i.e. in wireless networks without any infrastructure in addition to the mobile hosts. Broadcasting is the problem of sending a packet from a source node in the network to all other nodes in the network. Information gathering is the problem of sending one packet each from a subset of the nodes to a single sink node in the network. Most of the proposed theoretical wireless network models oversimplify wireless communication properties. We will use a model that takes into account that nodes have different transmission and interference ranges, and we propose algorithms in this model that achieve a high time and work-efficiency. We present algorithms for broadcasting a single or multiple message(s), and for information gathering. Our algorithms have the advantage that they are very simple and self-stabilizing, and would therefore even work in a dynamic environment. Also, our algorithms require only a constant amount of storage at any host. Thus, our algorithms can be used in wireless systems with very simple devices, such as sensors.

AB - This paper considers the problem of broadcasting and information gathering in wireless ad-hoc networks, i.e. in wireless networks without any infrastructure in addition to the mobile hosts. Broadcasting is the problem of sending a packet from a source node in the network to all other nodes in the network. Information gathering is the problem of sending one packet each from a subset of the nodes to a single sink node in the network. Most of the proposed theoretical wireless network models oversimplify wireless communication properties. We will use a model that takes into account that nodes have different transmission and interference ranges, and we propose algorithms in this model that achieve a high time and work-efficiency. We present algorithms for broadcasting a single or multiple message(s), and for information gathering. Our algorithms have the advantage that they are very simple and self-stabilizing, and would therefore even work in a dynamic environment. Also, our algorithms require only a constant amount of storage at any host. Thus, our algorithms can be used in wireless systems with very simple devices, such as sensors.

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

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

U2 - 10.1109/ISPAN.2005.43

DO - 10.1109/ISPAN.2005.43

M3 - Conference contribution

AN - SCOPUS:33846995950

SN - 0769525091

SN - 9780769525099

VL - 2005

SP - 346

EP - 351

BT - Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

ER -