Article

Free access

Broadcast in radio networks

Authors:

Iris Gaber,

Yishay MansourAuthors Info & Claims

SODA '95: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

Pages 577 - 585

Published: 22 January 1995 Publication History

PDF eReader

References

[1]

Noga Alon, Amotz Bar-Noy, Nati Linial, and David Peleg. A lower bound for radio broadcast. In Journal of Computer and System Sciences d3, pages 290-298, 1991.

Digital Library

Google Scholar

[2]

Noga Alon, Amotz Bar-Noy, Nati Linial, and David Peleg. Single round simulation on radio networks. In Journal of Algorithms, 13, pages 188-210, 1992.

Digital Library

Google Scholar

[3]

Baruch Awerbuch and David Peleg. Sparse partitions. In 31st Annual Symposium on Foundations of Computer Science, pages 503-513, 1990.

Google Scholar

[4]

Baruch Awerbuch and David Peleg. Synchronization with polylogarithmic overload. In 31st Annual Symposium on Foundations of Computer Science, pages 514- 522, 1990.

Google Scholar

[5]

Y. Afek and M. Ricklin. Sparser: A paradigm for running distributed algorithms. In Journal of Algorithms, volume 14, pages 316-328, 1993.

Digital Library

Google Scholar

[6]

Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. On the time-complexity of broadcast in radio networks: An exponential gap between determinism and randomization. In Proceedings of the 6th Annual A CM Symposium on Principles of Distributed Computing, pages 98-108. ACM, August 1987.

Digital Library

Google Scholar

[7]

I. Chlamtac and S. Kutten. An efficient broadcast protocol embedded in multi-hop radio networks. In COMPCON Uonf. Proceedings, Fall 1984.

Google Scholar

[8]

I. Chlamtac and S. Kutten. On broadcasting in radio networks- problem analysis and protocol design. In IEEE Trans. on Comm., page Vo133 No. 12, Dec. 1985.

Google Scholar

[9]

Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Algorithms. MIT Press, 1990.

Google Scholar

[10]

I. Chlamtac and O. Weinstein. Distributed 'wave' broadcasting in mobile multi-hop radio networks. In INFOCOM, pages 82-89, 1987.

Google Scholar

[11]

I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. In INFOCOM, pages 874-881, 1987.

Google Scholar

[12]

E. Kushilevitz and Y. Mansour. An ft(D log n) lower bound for broadcast in radio networks. In Proceedings of the 12ta Annual A CM Symposium on Principles of Distributed Computing, Ithaca, New York, pages 65- 73, 1993.

Digital Library

Google Scholar

Cited By

View all

Collins ACzyzowicz JGasieniec LKosowski AMartin R(2011)Synchronous rendezvous for location-aware agentsProceedings of the 25th international conference on Distributed computing10.5555/2075029.2075084(447-459)Online publication date: 20-Sep-2011
https://dl.acm.org/doi/10.5555/2075029.2075084
Xin QZhang YXiang J(2009)Minimum-latency gossiping in multi-hop wireless mesh networksProceedings of the 2009 IEEE international conference on Communications10.5555/1817770.1818238(5191-5195)Online publication date: 14-Jun-2009
https://dl.acm.org/doi/10.5555/1817770.1818238
Elkin MKortsarz G(2007)An improved algorithm for radio broadcastACM Transactions on Algorithms10.1145/1186810.11868183:1(1-21)Online publication date: 2-Feb-2007
https://dl.acm.org/doi/10.1145/1186810.1186818
Show More Cited By

Index Terms

Recommendations

Cooperation in Cognitive Radio Networks
SBRC '14: Proceedings of the 2014 Brazilian Symposium on Computer Networks and Distributed Systems

The operation of cognitive radio (CR) networks involves opportunistic access to the spectrum licensed to primary users (PUs) by secondary users (SUs). Traditionally, this access is performed in such a way that the PUs suffer minimal interference to ...
Energy-efficient broadcast in multihop cognitive radio networks

Broadcast is an important operation in Cognitive Radio Networks (CRNs). How to achieve broadcast in an energy-efficient way is important since users in CRNs are usually battery-powered. Existing single-channel broadcast mechanisms are not suitable for ...
Agnostic broadcast rendezvous for cognitive radio networks using channel hopping
LCN '12: Proceedings of the 2012 IEEE 37th Conference on Local Computer Networks (LCN 2012)

Cognitive radios (CRs) are a promising solution for the spectrum scarcity problem. These radios access the spectrum in an opportunistic manner in order to take advantage of frequency bands, i.e. channels, left unused by primary users while not ...

Comments

Information & Contributors

Information

Published In

SODA '95: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms

January 1995

654 pages

ISBN:0898713498

Chairman:
Kenneth Clarkson

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 22 January 1995

Check for updates

Qualifiers

Article

Conference

SODA95

Sponsor:

SIGACT
SIAM

SODA95: Conference on Discrete Algorithms

January 22 - 24, 1995

California, San Francisco, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

32
Total Citations
View Citations
413
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)9

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Collins ACzyzowicz JGasieniec LKosowski AMartin R(2011)Synchronous rendezvous for location-aware agentsProceedings of the 25th international conference on Distributed computing10.5555/2075029.2075084(447-459)Online publication date: 20-Sep-2011
https://dl.acm.org/doi/10.5555/2075029.2075084
Xin QZhang YXiang J(2009)Minimum-latency gossiping in multi-hop wireless mesh networksProceedings of the 2009 IEEE international conference on Communications10.5555/1817770.1818238(5191-5195)Online publication date: 14-Jun-2009
https://dl.acm.org/doi/10.5555/1817770.1818238
Elkin MKortsarz G(2007)An improved algorithm for radio broadcastACM Transactions on Algorithms10.1145/1186810.11868183:1(1-21)Online publication date: 2-Feb-2007
https://dl.acm.org/doi/10.1145/1186810.1186818
Lou WWu J(2007)Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double CoverageIEEE Transactions on Mobile Computing10.1109/TMC.2007.316:2(148-163)Online publication date: 1-Feb-2007
https://dl.acm.org/doi/10.1109/TMC.2007.31
Durresi AParuchuri VDurresi MBarolli L(2006)QoS-energy aware broadcast for heterogeneous wireless ad hoc networksJournal of Mobile Multimedia10.5555/2010524.20105302:4(344-358)Online publication date: 1-Dec-2006
https://dl.acm.org/doi/10.5555/2010524.2010530
Kesselman AKowalski D(2006)Fast distributed algorithm for convergecast in ad hoc geometric radio networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2005.11.00466:4(578-585)Online publication date: 1-Apr-2006
https://dl.acm.org/doi/10.1016/j.jpdc.2005.11.004
Elsässer RGąsieniec L(2006)Radio communication in random graphsJournal of Computer and System Sciences10.1016/j.jcss.2005.09.00372:3(490-506)Online publication date: 1-May-2006
https://dl.acm.org/doi/10.1016/j.jcss.2005.09.003
Sinha KSrimani P(2006)Deterministic Broadcast and Gossiping Algorithms for Ad hoc NetworksThe Journal of Supercomputing10.1007/s11227-006-6255-337:2(115-144)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.1007/s11227-006-6255-3
Cicalese FManne FXin Q(2006)Faster centralized communication in radio networksProceedings of the 17th international conference on Algorithms and Computation10.1007/11940128_35(339-348)Online publication date: 18-Dec-2006
https://dl.acm.org/doi/10.1007/11940128_35
Manne FXin Q(2006)Optimal gossiping with unit size messages in known topology radio networksProceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking10.1007/11922377_11(125-134)Online publication date: 2-Jul-2006
https://dl.acm.org/doi/10.1007/11922377_11
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Cooperation in Cognitive Radio Networks

Energy-efficient broadcast in multihop cognitive radio networks

Agnostic broadcast rendezvous for cognitive radio networks using channel hopping

Comments

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Cooperation in Cognitive Radio Networks

Energy-efficient broadcast in multihop cognitive radio networks

Agnostic broadcast rendezvous for cognitive radio networks using channel hopping

Comments

Information

Published In

Sponsors

Publisher

Publication History

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations