A Distributed Channel-Access Protocol for Fully-Connected Networks with Mobile Nodes

Authors:
Y. I. Gold;W. R. Franta;S. Moran
Affiliations:
Department of Electrical Engineering and Computer Science, University of Connecticut;-;-
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 5
Cited 1

Waiting Lines and Times in a System with Polling

Journal of the ACM (JACM)
Local Networks: Motivation, Technology and Performance

Local Networks: Motivation, Technology and Performance
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Some theoretical aspects of position-location problems

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Dynamic allocation of satellite capacity through packet reservation

AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition

A Scheduling-Function-Based Distributed Access Protocol that Uses CDM to Relay Control Information in a Network with Hidden Nodes

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

Abstract

We present a theoretical description and analysis of a collision-free channel-access protocol for a shared channel with "mobile" nodes that are all within range and in line-of-sight of each other, in arbitrarily changing spatial (one-, two-or three-dimensional) configurations.