Distributed Algorithms for Multiple-Access Channels
{'Code': '05010100', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Bruce H. Barnes', 'PO_EMAI': None, 'PO_PHON': None}
Computer networks have become very common.  It is very important to             develop methods which allow computers to efficiently communicate with           each other.  One low cast scheme is to have a single shared                     communication medium, called a multiple access channel, such that every         computer can receive all messages sent over the channel.  This scheme           is currently used by Ethernet and other networks.  If two or more               messages are sent simultaneously, they will interfere with each other,          and no useful information will be transmitted.  Efficient use of the            communication channel requires a coordination scheme which allows one           computer at a time to transmit.  The main goal of our research project          is to develop improved probabilisitic and deterministic algorithms              which coordinate the computers' access to the channel so that the               percentage of time in which useful information is transmitted is                maximized.  In addition, we plan to show that the algorithms employed           are nearly optimal, which will demonstrate the maximum possible                 effectiveness of multiple access channels.  We will also develop                algorithms for multiple access channels which give computers on the             network more information.  Our results on the performance of this more          powerful channel will indicate the effectiveness of improved channel            technology.
{'FirstName': 'Charles', 'LastName': 'Martel', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Charles Martel', 'EmailAddress': 'martel@cs.ucdavis.edu', 'NSF_ID': '000298850', 'StartDate': '06/01/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of California-Davis', 'CityName': 'DAVIS', 'ZipCode': '956186153', 'PhoneNumber': '5307547700', 'StreetAddress': '1850 RESEARCH PARK DR STE 300', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'California', 'StateCode': 'CA', 'CONGRESSDISTRICT': '04', 'CONGRESS_DISTRICT_ORG': 'CA04', 'ORG_UEI_NUM': 'TX2DAGQPENZ5', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF CALIFORNIA, DAVIS', 'ORG_PRNT_UEI_NUM': 'NUDGYLBB4S99'}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
[{'Code': '2860', 'Text': 'THEORY OF COMPUTING'}, {'Code': '9120', 'Text': 'CROSS-DIRECTORATE PROGRAMS'}]
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1987&All=true', 'xml': '8722848.xml'}