COLLISION-RESOLUTION ALGORITHM REQUEST CHANNEL DEMAND ASSIGNED NETWORK PROTOCOLS

INNOVATIVE TREE COLLISION-RESOLUTION ALGORITHMS WILL BE DEVELOPED FOR RANDOM-ACCESS COMMUNICATION OVER MULTIPLE PARALLEL CHANNELS. THE GOAL IS TO DEVELOP METHODS WHICH ACHIEVE STABLE THROUGHPUTS THAT ARE SIGNIFICANTLY HIGHER THAN THE MAXIMUM THROUGHPUT OF ALOHA RANDOM ACCESS SCHEMES. THESE INNOVATIVE RANDOM-ACCESS PROCEDURES WILL BE INCORPORATED AS THE CONNECTION REQUEST PROCEDURE IN A DEMAND-ASSIGNED CHANNEL SHARING PROTOCOL THAT PROVIDES INTEGRATED DATA MESSAGE AND VOICE SERVICES IN A LAND MOBILE SATELLITE ENVIRONMENT. THE GOAL IS TO DEVELOP PROTOCOLS WHICH ARE BOTH INSENSITIVE TO FADING CHANNEL ERRORS AND THAT ARE CAPABLE OF EFFECTIVELY HANDLING TRANSIENT TRAFFIC UPSURGES. THE RESEARCH EFFORT IN PHASE I IS TO PERFORM MATHEMATICAL ANALYSIS AND COMPUTER SIMULATION OF THESE METHODS TO PROVE FEASIBILITY. PHASE II INVOLVES FURTHER OPTIMIZATION AND DETAILED NETWORK PROTOCOL DESIGN, PROTOCOL VERIFICATION AND SOFTWARE DEVELOPMENT.