Algorithmic aspects of radio communication

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithmic aspects of radio communication

Full text

Pdf (106 KB)

Source

Workshop on Discrete Algothrithms and Methods for MOBILE Computing and Communications archive
Proceedings of the fifth international workshop on Foundations of mobile computing table of contents

Toronto, Canada

Pages 1-2

Year of Publication: 2008

ISBN:978-1-60558-244-3

Author

Andrzej Pelc

Universite du Quebec en Outaouais, Gatineau, PQ, Canada

Sponsors

ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 44, Citation Count: 0

Additional Information:

abstract index terms

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1400863.1400864 What is a DOI?

ABSTRACT

We consider communication in radio networks modeled either as arbitrary graphs, or as collections of points in the plane, equipped with given ranges of reachability. We survey results concerning the time of broadcasting and gossiping in such networks under different communication scenarios, emphasizing trade-offs between time of communication and the amount of knowledge about the network that is available to nodes.

INDEX TERMS

Primary Classification:
F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
F.2.2 Nonnumerical Algorithms and Problems
Subjects: Computations on discrete structures