Article

Free access

Efficient communication strategies for ad-hoc wireless networks (extended abstract)

Authors:

Micah Adler,

Christian ScheidelerAuthors Info & Claims

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

Pages 259 - 268

https://doi.org/10.1145/277651.277692

Published: 01 June 1998 Publication History

PDF eReader

References

[1]

N. Alon, A. Bar-Noy, N. Linial, D. Peleg. A lower bound for radio broadcast. J. Comput. Syst. Sci. 43(2), pp. 290-298, 1991.

Digital Library

Google Scholar

[2]

N. Alon, F.R.K. Chung, R.L. Graham. Routing permutations on graphs via matchings. SIAM J. Discr. Math. 7(3), pp. 513-530, 1994.

Digital Library

Google Scholar

[3]

R. Bar-Yehuda, O. Goldreich, A. Itai. On the time complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization.1. Comput. and Syst. Sci. 45, pp. 104-126, 1992.

Digital Library

Google Scholar

[4]

R. Bar-Yehuda, A. Israeli, A. Itai. Multiple communication in multihop radio networks. SIAM J. Comput. 22(4), pp. 875-887, 1993.

Digital Library

Google Scholar

[5]

S. Boztas. A robust nmlti-priority topology-independent transmission schedule for packet radio networks. Inf. Proc. Letters 55, pp. 291-295, 1995.

Digital Library

Google Scholar

[6]

D. Brushi, M. Del Pinto. Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10, pp. 129-135, 1997.

Digital Library

Google Scholar

[7]

K.-C. Chen. Medium access control of wireless LANs for mobile computing. IEEE Network 8(5), pp. 50-63, 1994.

Digital Library

Google Scholar

[8]

I. Chlamtac, A. Farago. Making transmission schedules immune to topology changes in multi-hop packet radio networks. IEEE/ACM Trans. Networking 2, pp. 23-29, 1994.

Digital Library

Google Scholar

[9]

I. Chlamtac, S. Kutten. On broadcasting in radio networks - problem analysis and protocol design. IEEE Trans. Commun. 33(12), 1985.

Crossref

Google Scholar

[10]

I. Chlamtac, S. Pinter. A distributed nodes organization algorithm for channel access in a multi-hop dynamic radio network. IEEE Trans. Comput. 36, pp. 728-737, 1987.

Digital Library

Google Scholar

[11]

I. Chlamtac, O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun. 39(3), pp. 426-433, 1991.

Crossref

Google Scholar

[12]

I. Cidon, M. Sidi. Distributed assignment algorithms for multihop packet radio networks. IEEE Trans. Comput. 38(10), pp. 1353-1361, 1989.

Digital Library

Google Scholar

[13]

R. Cole, B. Maggs, R. Sitaraman. Reconfiguring arrays with random faults. Manuscript, 1997.

Google Scholar

[14]

R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. VScking. Universal algorithms for store-and-forward and wormhole routing. In 28th Ann. A CM Symp. on Theory of Computing, pp. 356-365, 1996.

Digital Library

Google Scholar

[15]

S. Doter, E. Kranakis, D. Krizanc, D. Peleg. Bubbles: Adaptive routing scheme for high-speed dynamic networks. In Proc. of the 27th Ann. A CM Syrup. on Theory of Computing, pp. 528-537, 1995.

Digital Library

Google Scholar

[16]

B. Das, R. Sivakumar, V. Bharghavan. Routing in ad-hoc networks using a virtual backbone. To appear in IEEE ICSN 97.

Digital Library

Google Scholar

[17]

I. Gaber, Y. Mansour. Broadcast in radio networks. In SODA '95, pp. 577-582, 1995.

Digital Library

Google Scholar

[18]

R. Gallager. A perspective on multiaccess channels. IEEE Trans. Inform. Theory, Special Issue on Random Access Communications, 31, pp. 124-142, 1985.

Crossref

Google Scholar

[19]

The Mobile Communications Handbook. J.D. Gibson (Ed.), CRC Press, 1996.

Google Scholar

[20]

F.K. Hwang. the time complexity of deterministic broadcast radio networks. Discr. Appl. Math. 60, pp. 219-222, 1995.

Digital Library

Google Scholar

[21]

Mobile Computing, T. Imielinski, H. Korth (Eds.), Kluwer Academic Publishers, 1996.

Google Scholar

[22]

J.M. Jacobsmeyer. Congestion relief on power-controlled CDMA networks. IEEE J. Sel. Areas in Commun. 18(9), pp. 1758-1761, 1996.

Digital Library

Google Scholar

[23]

D.B. Johnson, D.A. Maltz. Protocols for adaptive wireless and mobile networking. IEEE Personal Comm. 3(1), 1996.

Google Scholar

[24]

C. Kaklamanis, A.R. Karlin, F.T. Leighton, V. Milenkovic, P. Raghavan, S.B. Rao, C. Thomborson, A. Trantilas. Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors. In Pwc. of the 1990 IEEE 31st Ann. Syrup. on Foundations o/ Computer Science, pp. 285-296, 1990.

Google Scholar

[25]

L.M. Kirousis, E. Kranakis, D. Krizanc, A. Pelc. Power consumption in packet radio networks. In STA CS '97.

Digital Library

Google Scholar

[26]

n. Kushilevitz, Y. Mansour. An f#(nlog(N/n)) lower bound for broadcast in radio networks. In PODC '93.

Digital Library

Google Scholar

[27]

F.T. Leighton, B.M. Maggs, S.B. Rao. Universal packet routing algorithms. In Proc. o/ the 29th Ann. Syrup. on Foundations o} Computer Science, pp. 256-271, 1988.

Crossref

Google Scholar

[28]

A. Myles, D.B. Johnson, C.E. Perkins. A mobile host protocol supporting route optimization and authentication. IEEE J. Sel. Areas in Commun., special issue on Mobile and Wireless Computing Networks, 13(5), pp. 839-349, 1995.

Digital Library

Google Scholar

[29]

F. Meyer auf der Heide, C. ScheideIer. Deterministic routing with bounded buffers: Turning offiine into online protocols. In Proc. o/ the 37th Ann. IEEE Syrup. on Foundations o# Computer Science, pp. 370-379, 1996.

Digital Library

Google Scholar

[30]

P. Piret. On the connectivity of radio networks. IEEE Trans. on Inform. Theory 37(5), pp. 1490-1492, 1991.

Crossref

Google Scholar

[31]

M.J. Post, P.E. Sarachik, A.S. Kershenbaum. A distributed evolutionary algorithm for reorganizing network communications. In Proc. IEEE MILCOM, 1985.

Crossref

Google Scholar

[32]

Y. Rabani, t#. Tardos. Distributed packet switching in arbitrary networks. In 28th Ann. A CM Syrup. on Theory of Computing, pp. 366-375, 1996.

Digital Library

Google Scholar

[33]

R. Raghavan. Robust Algorithms for Packet Routing in a Mesh. In Proc. of the l st Ann. Syrup. on Parallel Algorithms and Architectures, pp. 344-350, 1989.

Digital Library

Google Scholar

[34]

K. Ravishankar, S. Singh. Asymptotically optimal gossiping in radio networks. Discr. Appl. Math. 61, pp. 61-82, 1995.

Digital Library

Google Scholar

[35]

L.G. Roberts. Aloha Packet System with and without Slots and Capture, ASS Notes 8, Advanced Research Projects Agency, Network Information Center, Stanford Research Institute, Stanford, CA, 1972.

Google Scholar

[36]

A. Sen, M. Huson. A new model for scheduling packet radio networks. In Proc. of the 15th Ann. Joint Conf. o# the IEEE Computer and Communication Societies INFO- COM, pp. 1116-1124, 1996.

Digital Library

Google Scholar

[37]

S. Ulukus, R.D. Yates. Stochastic power control for cellular radio systems. Dept. of Electrical and Computer Engineering, Rutgers University, NJ. Submitted to IEEE Trans. Commun., September 1996.

Google Scholar

[38]

L.G. Valiant. A scheme for fast parallel communication. SIAM J. on Comput. 11(2), pp. 350-361, 1982.

Crossref

Google Scholar

[39]

O. Weinstein. The wave expansion approach to broadcasting in multihop networks, M.Sc. Thesis, Computer Science Dept., Technion, Haifa, Israel, 1987.

Google Scholar

Cited By

View all

Li K(2010)Design and performance evaluation of communication algorithms in multihop wireless networks with multiple channelsInternational Journal of Parallel, Emergent and Distributed Systems10.1080/1744576090354827525:6(465-488)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1080/17445760903548275
Furuzumi YNakamoto Y(2009)Node relocation algorithms for improving communications quality in ad hoc networks2009 International Symposium on Autonomous Decentralized Systems10.1109/ISADS.2009.5207393(1-5)Online publication date: Mar-2009
https://doi.org/10.1109/ISADS.2009.5207393
Clementi AMonti APasquale FSilvestri R(2009)Broadcasting in dynamic radio networksJournal of Computer and System Sciences10.1016/j.jcss.2008.10.00475:4(213-230)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1016/j.jcss.2008.10.004
Show More Cited By

Index Terms

Efficient communication strategies for ad-hoc wireless networks (extended abstract)
1. Networks
  1. Network protocols
2. Theory of computation
  1. Models of computation
    1. Abstract machines

Recommendations

An efficient cluster-based communication protocol for wireless sensor networks

A wireless sensor network is a network of large numbers of sensor nodes, where each sensor node is a tiny device that is equipped with a processing, sensing subsystem and a communication subsystem. The critical issue in wireless sensor networks is how ...
Power-efficient communication algorithms for wireless mobile sensor networks
PE-WASUN '04: Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks

One important issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is a scarce resource in a sensor node. Many protocols have been proposed for data-gathering between wireless sensor nodes. ...
Energy efficient routing in wireless sensor and wireless ad hoc networks

Comments

Information & Contributors

Information

Published In

SPAA '98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures

June 1998

312 pages

ISBN:0897919890

DOI:10.1145/277651

Chairmen:
Gary Miller
Carnegie Mellon Univ., Pittsburgh, PA
,
Phillip B. Gibbons
Bell Labs

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1998

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA/PODC98

Sponsor:

SPAA/PODC98: 10th Annual ACM Symposium on Parallel Algorithms and Architectures/Symposium on Principles of Distributed Computing

June 28 - July 2, 1998

Puerto Vallarta, Mexico

Acceptance Rates

SPAA '98 Paper Acceptance Rate 30 of 84 submissions, 36%;

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
650
Total Downloads

Downloads (Last 12 months)72
Downloads (Last 6 weeks)7

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li K(2010)Design and performance evaluation of communication algorithms in multihop wireless networks with multiple channelsInternational Journal of Parallel, Emergent and Distributed Systems10.1080/1744576090354827525:6(465-488)Online publication date: 1-Dec-2010
https://dl.acm.org/doi/10.1080/17445760903548275
Furuzumi YNakamoto Y(2009)Node relocation algorithms for improving communications quality in ad hoc networks2009 International Symposium on Autonomous Decentralized Systems10.1109/ISADS.2009.5207393(1-5)Online publication date: Mar-2009
https://doi.org/10.1109/ISADS.2009.5207393
Clementi AMonti APasquale FSilvestri R(2009)Broadcasting in dynamic radio networksJournal of Computer and System Sciences10.1016/j.jcss.2008.10.00475:4(213-230)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.1016/j.jcss.2008.10.004
Clementi AMonti APasquale FPasquale F(2007)Optimal gossiping in directed geometric radio networks in presence of dynamical faultsProceedings of the 32nd international conference on Mathematical Foundations of Computer Science10.5555/2392236.2392290(430-441)Online publication date: 26-Aug-2007
https://dl.acm.org/doi/10.5555/2392236.2392290
Clementi APasquale FMonti ASilvestri RGupta IWattenhofer R(2007)Communication in dynamic radio networksProceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing10.1145/1281100.1281131(205-214)Online publication date: 12-Aug-2007
https://dl.acm.org/doi/10.1145/1281100.1281131
Clementi AMonti APasquale FSilvestri R(2007)Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical FaultsMathematical Foundations of Computer Science 200710.1007/978-3-540-74456-6_39(430-441)Online publication date: 2007
https://doi.org/10.1007/978-3-540-74456-6_39
Chatzigiannakis IKokkinos PZaroliagis CBao LLassous I(2006)Routing protocols for efficient communication in wireless ad-hoc networksProceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks10.1145/1163610.1163625(90-97)Online publication date: 6-Oct-2006
https://dl.acm.org/doi/10.1145/1163610.1163625
Onus MRicha AKothapalli KScheideler C(2005)Efficient Broadcasting and Gathering in Wireless Ad-Hoc NetworksProceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks10.1109/ISPAN.2005.43(346-351)Online publication date: 7-Dec-2005
https://dl.acm.org/doi/10.1109/ISPAN.2005.43
Kumar VMarathe MParthasarathy SSrinivasan AMunro I(2004)End-to-end packet-scheduling in wireless ad-hoc networksProceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/982792.982945(1021-1030)Online publication date: 11-Jan-2004
https://dl.acm.org/doi/10.5555/982792.982945
Volbert KBasagni SPhillips C(2004)Experimental analysis of adjustable sectorized topologies for static ad hoc networksProceedings of the 2004 joint workshop on Foundations of mobile computing10.1145/1022630.1022646(102-111)Online publication date: 1-Oct-2004
https://dl.acm.org/doi/10.1145/1022630.1022646
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

An efficient cluster-based communication protocol for wireless sensor networks

Power-efficient communication algorithms for wireless mobile sensor networks

Energy efficient routing in wireless sensor and wireless ad hoc networks