Gossiping with unit messages in known radio networks

Leszek Gasieniec; Igor Potapov

doi:10.1007/978-0-387-35608-2_17

Gossiping with unit messages in known radio networks

Leszek Gasieniec, Igor Potapov

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

54 Scopus citations

Abstract

A gossiping is a communication primitive in which each node of the network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping problem in known ad hoc radio networks, where during each transmission only unit messages originated at any node of the network can be transmitted successfully. We survey a number of radio network topologies. Assuming that the size (a number of nodes) of the network is n we show that the exact complexity of radio gossiping in stars is 2n-1, in rings is 2n±O(l), and on a line of processors is 3n ± O(1). We later prove that radio gossiping in free trees is harder and it requires at least 3 1/6 n - 16 time steps to be completed. For free trees we also show a gossiping algorithm with time complexity 5n + 8. In conclusion we prove that in general graphs radio gossiping requires ω(n log n) time, and we propose radio gossiping algorithm that works in time O(n log² n).

Original language	English (US)
Title of host publication	Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002)
Publisher	Springer New York LLC
Pages	193-205
Number of pages	13
ISBN (Print)	9781475752755
DOIs	https://doi.org/10.1007/978-0-387-35608-2_17
State	Published - 2002
Externally published	Yes
Event	IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002 - Montreal, QC, Canada Duration: Aug 25 2002 → Aug 30 2002

Publication series

Name	IFIP Advances in Information and Communication Technology
Volume	96
ISSN (Print)	1868-4238

Conference

Conference	IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002
Country/Territory	Canada
City	Montreal, QC
Period	8/25/02 → 8/30/02

ASJC Scopus subject areas

Information Systems
Computer Networks and Communications
Information Systems and Management

Access to Document

10.1007/978-0-387-35608-2_17

Cite this

Gasieniec, L., & Potapov, I. (2002). Gossiping with unit messages in known radio networks. In Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002) (pp. 193-205). (IFIP Advances in Information and Communication Technology; Vol. 96). Springer New York LLC. https://doi.org/10.1007/978-0-387-35608-2_17

Gossiping with unit messages in known radio networks. / Gasieniec, Leszek; Potapov, Igor.
Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002). Springer New York LLC, 2002. p. 193-205 (IFIP Advances in Information and Communication Technology; Vol. 96).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Gasieniec, L & Potapov, I 2002, Gossiping with unit messages in known radio networks. in Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002). IFIP Advances in Information and Communication Technology, vol. 96, Springer New York LLC, pp. 193-205, IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002, Montreal, QC, Canada, 8/25/02. https://doi.org/10.1007/978-0-387-35608-2_17

Gasieniec L, Potapov I. Gossiping with unit messages in known radio networks. In Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002). Springer New York LLC. 2002. p. 193-205. (IFIP Advances in Information and Communication Technology). doi: 10.1007/978-0-387-35608-2_17

Gasieniec, Leszek ; Potapov, Igor. / Gossiping with unit messages in known radio networks. Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002). Springer New York LLC, 2002. pp. 193-205 (IFIP Advances in Information and Communication Technology).

@inproceedings{c8a5c17748c148839728631c5338b831,

title = "Gossiping with unit messages in known radio networks",

abstract = "A gossiping is a communication primitive in which each node of the network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping problem in known ad hoc radio networks, where during each transmission only unit messages originated at any node of the network can be transmitted successfully. We survey a number of radio network topologies. Assuming that the size (a number of nodes) of the network is n we show that the exact complexity of radio gossiping in stars is 2n-1, in rings is 2n±O(l), and on a line of processors is 3n ± O(1). We later prove that radio gossiping in free trees is harder and it requires at least 3 1/6 n - 16 time steps to be completed. For free trees we also show a gossiping algorithm with time complexity 5n + 8. In conclusion we prove that in general graphs radio gossiping requires ω(n log n) time, and we propose radio gossiping algorithm that works in time O(n log2 n).",

author = "Leszek Gasieniec and Igor Potapov",

note = "Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002 ; Conference date: 25-08-2002 Through 30-08-2002",

year = "2002",

doi = "10.1007/978-0-387-35608-2_17",

language = "English (US)",

isbn = "9781475752755",

series = "IFIP Advances in Information and Communication Technology",

publisher = "Springer New York LLC",

pages = "193--205",

booktitle = "Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002)",

}

TY - GEN

T1 - Gossiping with unit messages in known radio networks

AU - Gasieniec, Leszek

AU - Potapov, Igor

PY - 2002

Y1 - 2002

N2 - A gossiping is a communication primitive in which each node of the network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping problem in known ad hoc radio networks, where during each transmission only unit messages originated at any node of the network can be transmitted successfully. We survey a number of radio network topologies. Assuming that the size (a number of nodes) of the network is n we show that the exact complexity of radio gossiping in stars is 2n-1, in rings is 2n±O(l), and on a line of processors is 3n ± O(1). We later prove that radio gossiping in free trees is harder and it requires at least 3 1/6 n - 16 time steps to be completed. For free trees we also show a gossiping algorithm with time complexity 5n + 8. In conclusion we prove that in general graphs radio gossiping requires ω(n log n) time, and we propose radio gossiping algorithm that works in time O(n log2 n).

AB - A gossiping is a communication primitive in which each node of the network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping problem in known ad hoc radio networks, where during each transmission only unit messages originated at any node of the network can be transmitted successfully. We survey a number of radio network topologies. Assuming that the size (a number of nodes) of the network is n we show that the exact complexity of radio gossiping in stars is 2n-1, in rings is 2n±O(l), and on a line of processors is 3n ± O(1). We later prove that radio gossiping in free trees is harder and it requires at least 3 1/6 n - 16 time steps to be completed. For free trees we also show a gossiping algorithm with time complexity 5n + 8. In conclusion we prove that in general graphs radio gossiping requires ω(n log n) time, and we propose radio gossiping algorithm that works in time O(n log2 n).

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

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

U2 - 10.1007/978-0-387-35608-2_17

DO - 10.1007/978-0-387-35608-2_17

M3 - Conference contribution

AN - SCOPUS:84891098644

SN - 9781475752755

T3 - IFIP Advances in Information and Communication Technology

SP - 193

EP - 205

BT - Foundations of Information Technology in the Era of Network and Mobile Computing - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP Int. Conference on Theoretical Computer Science (TCS 2002)

PB - Springer New York LLC

T2 - IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science, TCS 2002

Y2 - 25 August 2002 through 30 August 2002

ER -

Gossiping with unit messages in known radio networks

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this