Voronoi-Hamming Algorithms for Optimizing Channel Selection From the Radio Frequency Transmission Hypercube

Award Information
Agency: Department of Defense
Branch: Air Force
Contract: FA8750-04-C-0020
Agency Tracking Number: O032-1002
Amount: $99,999.00
Phase: Phase I
Program: SBIR
Awards Year: 2003
Solicitation Year: N/A
Solicitation Topic Code: N/A
Solicitation Number: N/A
Small Business Information
THE RIGHT STUFF OF TAHOE, INC.
The Right Place, 3341 Adler Court, Reno, NV, 89503
DUNS: 011369266
HUBZone Owned: N
Woman Owned: N
Socially and Economically Disadvantaged: N
Principal Investigator
 Laurence LaForge
 President
 (775) 322-5186
 Larry@The-Right-Stuff.com
Business Contact
 James Turner
Title: Vice President, Product D
Phone: (775) 322-5186
Email: James.Turner@The-Right-Stuff.com
Research Institution
N/A
Abstract
Advancing and applying our recent NASA-sponsored research for deep space avionics, we propose to develop new algorithms which - provably, autonomously, and in the presence of faults i) optimize the selection of channels from the radio frequencyTransmission Hypercube, as it is termed in the OSD03-026 solicitation, in order to ii) connect healthy nodes into a working network quorum, and iii) keep them connected. To this end, we crystallize objectives for channel capacity (throughput) and latency(packet delay) in the language of optimization. Maximizing aggregate Shannon capacity (Eqns (11), (12)), our scalable algorithms will adaptively activate and deactivate channels, subject to constraints on channel bandwidth, number of channels, and per-bandlimits on signal power and noise. Similarly, and in the presence of faulty nodes and channels, our distributed algorithms will minimize latency (network radius or diameter, Eqn (1)). Where throughput and latency can be viewed as constraints, our algorithmswill also solve dual problems whose objective is to minimize consumption of channel resources, such as power (Eqn (13)). Our approach blends information theory with breakthroughs in the mathematics of connectivity, especially 1.2.6) optimal routing enabledby Hamming graphs and 1.2.7) Voronoi algorithms from computational geometry.

* information listed above is at the time of submission.

Agency Micro-sites

SBA logo
Department of Agriculture logo
Department of Commerce logo
Department of Defense logo
Department of Education logo
Department of Energy logo
Department of Health and Human Services logo
Department of Homeland Security logo
Department of Transportation logo
Environmental Protection Agency logo
National Aeronautics and Space Administration logo
National Science Foundation logo
US Flag An Official Website of the United States Government