Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258323
S. An
A scheme is proposed to generate a soft metric based on L hard decision diversity outputs. The performance of this scheme is studied and compared with existing schemes. The target system used for investigation is a slow frequency-hopped differential phase shift keying (FH/DPSK) system in the presence of partial band noise jamming (PBNJ). It is shown that a significant improvement in L-diversity hard decision systems can be achieved. It is demonstrated that, by using the proposed soft metric, the almost ideal performance can be achieved for FH/DPSK systems in the presence of PBNJ without relying on any jammer state information; nor is optimization for quantization step size or threshold needed in order to achieve a satisfactory performance.<>
{"title":"A new soft metric for FH/DPSK systems with coding and diversity in the presence of partial-band noise jamming","authors":"S. An","doi":"10.1109/MILCOM.1991.258323","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258323","url":null,"abstract":"A scheme is proposed to generate a soft metric based on L hard decision diversity outputs. The performance of this scheme is studied and compared with existing schemes. The target system used for investigation is a slow frequency-hopped differential phase shift keying (FH/DPSK) system in the presence of partial band noise jamming (PBNJ). It is shown that a significant improvement in L-diversity hard decision systems can be achieved. It is demonstrated that, by using the proposed soft metric, the almost ideal performance can be achieved for FH/DPSK systems in the presence of PBNJ without relying on any jammer state information; nor is optimization for quantization step size or threshold needed in order to achieve a satisfactory performance.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"15 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130910847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258417
R.R. Mankarious, W. Walker
The media resource controller (MRC) provides for packetized least-cost routing in heterogeneous media networks where the network topologies and conditions may be highly dynamic. Previous work has discussed the MRC and its approach to the routing problem when using multiple parameters obtained from radio links. The authors discuss the results of this strategy when applied to a real network operating under laboratory conditions. A brief review of the MRC and its routing principles is first presented. The effects of varying key parameters in the link cost determination are then shown. Results are discussed in terms of classical performance measures of delay and throughput. It is concluded that the MRC link cost assignment process allows multiple cost function parameters to be combined into a single estimate of link cost. By performing this combination, the overall throughput of the network can be increased significantly. For the same level of throughput, end-to-end delay can be decreased. By including an estimate of radio quality as an additional cost function parameter, the MRC network can rapidly route traffic around any poorly performing or jammed links.<>
{"title":"Performance of the media resource controller","authors":"R.R. Mankarious, W. Walker","doi":"10.1109/MILCOM.1991.258417","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258417","url":null,"abstract":"The media resource controller (MRC) provides for packetized least-cost routing in heterogeneous media networks where the network topologies and conditions may be highly dynamic. Previous work has discussed the MRC and its approach to the routing problem when using multiple parameters obtained from radio links. The authors discuss the results of this strategy when applied to a real network operating under laboratory conditions. A brief review of the MRC and its routing principles is first presented. The effects of varying key parameters in the link cost determination are then shown. Results are discussed in terms of classical performance measures of delay and throughput. It is concluded that the MRC link cost assignment process allows multiple cost function parameters to be combined into a single estimate of link cost. By performing this combination, the overall throughput of the network can be increased significantly. For the same level of throughput, end-to-end delay can be decreased. By including an estimate of radio quality as an additional cost function parameter, the MRC network can rapidly route traffic around any poorly performing or jammed links.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128885890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258222
R. Doyle, I. Shahnawaz, A. Sastry
The authors describe a simulation model developed to aid in the evaluation of distributed processing scenario in a highly dynamic environment such as a multihop packet radio network. The simulation model has a set of identical packet radio nodes, employs spread spectrum random access protocols, and has an error model that includes the effects of interference from concurrent transmission as well as that induced by an on-off partial band jammer. An abstract description of hierarchical primary and subtask structures has been devised wherein a distributed task is described by a script that specifies processing time, sequences of subtasks, and lengths of request and response messages. The features of multihop packet radio networks are described that are relevant to the effort. The details of the network simulation, including the transport features are given. The distributed task scenario description is outlined. Some typical numerical results obtained from simulations are presented.<>
{"title":"A simulation model for evaluation of distributed processing in multi-hop packet radio networks","authors":"R. Doyle, I. Shahnawaz, A. Sastry","doi":"10.1109/MILCOM.1991.258222","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258222","url":null,"abstract":"The authors describe a simulation model developed to aid in the evaluation of distributed processing scenario in a highly dynamic environment such as a multihop packet radio network. The simulation model has a set of identical packet radio nodes, employs spread spectrum random access protocols, and has an error model that includes the effects of interference from concurrent transmission as well as that induced by an on-off partial band jammer. An abstract description of hierarchical primary and subtask structures has been devised wherein a distributed task is described by a script that specifies processing time, sequences of subtasks, and lengths of request and response messages. The features of multihop packet radio networks are described that are relevant to the effort. The details of the network simulation, including the transport features are given. The distributed task scenario description is outlined. Some typical numerical results obtained from simulations are presented.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116506395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258422
A. Michelson, G. Rosen
Severely punctured versions of the well-known rate-1/2, constraint-length-seven convolutional code are considered. Severely punctured means that exactly half of the data normally transmitted is deleted, specifically, the entire output of one parity circuit or the other. Redundancy is conveyed only by the code tail. It is shown that, for maximum likelihood decoding of short to moderately long messages, significant coding gains can be achieved, 2 to 3.8 dB. Both simulation and analytical results are given. It is also shown that less severely punctured codes have minimum distance two, and, for one of the generators, the punctured codes are cyclic for certain message lengths.<>
{"title":"A severely punctured convolutional code-its performance and structure","authors":"A. Michelson, G. Rosen","doi":"10.1109/MILCOM.1991.258422","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258422","url":null,"abstract":"Severely punctured versions of the well-known rate-1/2, constraint-length-seven convolutional code are considered. Severely punctured means that exactly half of the data normally transmitted is deleted, specifically, the entire output of one parity circuit or the other. Redundancy is conveyed only by the code tail. It is shown that, for maximum likelihood decoding of short to moderately long messages, significant coding gains can be achieved, 2 to 3.8 dB. Both simulation and analytical results are given. It is also shown that less severely punctured codes have minimum distance two, and, for one of the generators, the punctured codes are cyclic for certain message lengths.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125847656","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258300
K. Parsa, D. Schilling
A necessary step in the design of high-speed adaptive meteor burst (MB) systems is to determine how the channel distorts the phase of the meteor signal. This aspect of the meteor burst channels is characterized. An enhanced MB channel model is developed. This is achieved by characterizing the MB Doppler spread, Doppler rate, head-echo induced phase jitter, and deriving simple mathematical expressions for them.<>
{"title":"Phase characterization of the meteor burst channel","authors":"K. Parsa, D. Schilling","doi":"10.1109/MILCOM.1991.258300","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258300","url":null,"abstract":"A necessary step in the design of high-speed adaptive meteor burst (MB) systems is to determine how the channel distorts the phase of the meteor signal. This aspect of the meteor burst channels is characterized. An enhanced MB channel model is developed. This is achieved by characterizing the MB Doppler spread, Doppler rate, head-echo induced phase jitter, and deriving simple mathematical expressions for them.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125510150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258393
Patrick Hosein, D. Schmidt
The authors describe the broadcast algorithm used in the Survivable Signaling Network (SSN). SSN provides the Nationwide Emergency Telecommunications System (NETS) a highly survivable and robust network for national security emergency preparedness calls being set up over AT&T Switched Network. SSN achieves this high survivability and robustness through the application of broadcast algorithms to disseminate network status and to ultimately determine the routing of signaling traffic. The SSN broadcast algorithm is based on the Arpanet broadcast algorithm. However, the long node and link recovery times inherent in the Arpanet algorithm are intolerable in telephone signaling. The SSN algorithm extends the Arpanet algorithm to provide a rapid recovery from node and link crashes. It accomplishes this in a simple fashion consistent with the Arpanet algorithm.<>
{"title":"Broadcasting topology information in the Survivable Signaling Network","authors":"Patrick Hosein, D. Schmidt","doi":"10.1109/MILCOM.1991.258393","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258393","url":null,"abstract":"The authors describe the broadcast algorithm used in the Survivable Signaling Network (SSN). SSN provides the Nationwide Emergency Telecommunications System (NETS) a highly survivable and robust network for national security emergency preparedness calls being set up over AT&T Switched Network. SSN achieves this high survivability and robustness through the application of broadcast algorithms to disseminate network status and to ultimately determine the routing of signaling traffic. The SSN broadcast algorithm is based on the Arpanet broadcast algorithm. However, the long node and link recovery times inherent in the Arpanet algorithm are intolerable in telephone signaling. The SSN algorithm extends the Arpanet algorithm to provide a rapid recovery from node and link crashes. It accomplishes this in a simple fashion consistent with the Arpanet algorithm.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126832804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258193
S. Pupolin, G. Guidotti
The authors have set up a simulation program to evaluate the throughput of a packet radio network (PRN) by comparing different routing strategies in both the static and dynamic PRN topology. They compare link access protocol efficiency of a system with spread spectrum modulation, forward error correction coding with an Aloha like protocol in a multihop network versus Aloha. Code division multiple access (CDMA) and conventional Aloha access techniques are compared, showing that CDMA gives a more reliable and higher throughput. Different routing strategies are compared with static and dynamic networks enabling the understanding of why some of them result in network congestion at lower throughput than others. A result is that for a 16 node network with a grid connectivity, the throughput is increased as soon as the network connectivity was reduced up to an optimum value.<>
{"title":"Throughput analysis in multihop packet radio networks","authors":"S. Pupolin, G. Guidotti","doi":"10.1109/MILCOM.1991.258193","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258193","url":null,"abstract":"The authors have set up a simulation program to evaluate the throughput of a packet radio network (PRN) by comparing different routing strategies in both the static and dynamic PRN topology. They compare link access protocol efficiency of a system with spread spectrum modulation, forward error correction coding with an Aloha like protocol in a multihop network versus Aloha. Code division multiple access (CDMA) and conventional Aloha access techniques are compared, showing that CDMA gives a more reliable and higher throughput. Different routing strategies are compared with static and dynamic networks enabling the understanding of why some of them result in network congestion at lower throughput than others. A result is that for a 16 node network with a grid connectivity, the throughput is increased as soon as the network connectivity was reduced up to an optimum value.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127761712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258364
C. Niznik
The mathematical research basis for a military strategic defense gateway protocol, the universal interface software (UIS) protocol, is composed of four algorithms. The UIS protocol contains a theoretical basis for determining the congestion controlled network operating point in the load, with a routing availability threshold. The performance evaluation is theoretically based on the extended time Petri net model. This enables the inclusion of: (1) the dynamic behavior of a network illustrated by the execution of network processes and, (2) the real-time asynchronous concurrent network behavior determined by the effectiveness of the synchronization between the processing computer nodes and gateway nodes. The four UIS parametric protocol algorithm processes are theoretically equated to the four Petri net model performance specifications to enable the transparent overlay of the UIS protocol on the SPF algorithm protocol performance evaluation data for ARPANET and MILNET gateway and IMP data.<>
{"title":"Theoretical performance evaluation of the universal interface software gateway protocol for SDI","authors":"C. Niznik","doi":"10.1109/MILCOM.1991.258364","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258364","url":null,"abstract":"The mathematical research basis for a military strategic defense gateway protocol, the universal interface software (UIS) protocol, is composed of four algorithms. The UIS protocol contains a theoretical basis for determining the congestion controlled network operating point in the load, with a routing availability threshold. The performance evaluation is theoretically based on the extended time Petri net model. This enables the inclusion of: (1) the dynamic behavior of a network illustrated by the execution of network processes and, (2) the real-time asynchronous concurrent network behavior determined by the effectiveness of the synchronization between the processing computer nodes and gateway nodes. The four UIS parametric protocol algorithm processes are theoretically equated to the four Petri net model performance specifications to enable the transparent overlay of the UIS protocol on the SPF algorithm protocol performance evaluation data for ARPANET and MILNET gateway and IMP data.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116890241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258305
M. Dankberg, S. Hart, K. Jaska, J. Tran, G. Young
The US Navy Fleet Satellite Communication System (FLTSAT) relies on a set of information exchange subsystems (IXS) to manage shared satellite resources. The navy has developed application specific IXS protocols for end-user communities. The goals are to develop a single common, interoperable IXS capable of serving the requirements of any user community; and simultaneously, to improve the quality of service offered to end-users. To meet these goals, ViaSat has developed a system called multi-user UHF Satcom for TDMA-1 (MUST). Through innovative multislot control, MUST is able to provide high-performance access to the TDMA-1 navy demand assignment multiple access (DAMA) waveform. Simulated performance comparisons show that MUST has the capability to provide over twice the throughput of OTCIXS II. In addition, it offers a wide variety of user-oriented services, such as voice, reliable packet transfer, and tactical data transfer.<>
{"title":"Next generation FLTSAT tactical network control","authors":"M. Dankberg, S. Hart, K. Jaska, J. Tran, G. Young","doi":"10.1109/MILCOM.1991.258305","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258305","url":null,"abstract":"The US Navy Fleet Satellite Communication System (FLTSAT) relies on a set of information exchange subsystems (IXS) to manage shared satellite resources. The navy has developed application specific IXS protocols for end-user communities. The goals are to develop a single common, interoperable IXS capable of serving the requirements of any user community; and simultaneously, to improve the quality of service offered to end-users. To meet these goals, ViaSat has developed a system called multi-user UHF Satcom for TDMA-1 (MUST). Through innovative multislot control, MUST is able to provide high-performance access to the TDMA-1 navy demand assignment multiple access (DAMA) waveform. Simulated performance comparisons show that MUST has the capability to provide over twice the throughput of OTCIXS II. In addition, it offers a wide variety of user-oriented services, such as voice, reliable packet transfer, and tactical data transfer.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132643256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258443
J. Larocca
The advanced single-channel antijam man-portable (ASCAMP) downlink is a custom-designed digital signal processor implemented in hardware that runs a tailored and efficient microcode. Appropriate sections of microcode are executed in response to the downlink requirements. The different processing functions, hardware design, and hardware implementation are discussed. The author points out the unique feature of reprogramming field programmable gate array (FPGA) hardware in order to accomplish different processing tasks with minimal hardware. Advantages and disadvantages of using FPGAs in the advanced SCAMP implementation and ideas for future development are mentioned. The ASCAMP (EHF satellite communication terminal) has stringent size, power, and weight specifications, making for a challenging design project. The downlink processor implementation has been optimized both in concept and design to meet these specifications.<>
{"title":"Hardware implementation of the advanced SCAMP downlink processor","authors":"J. Larocca","doi":"10.1109/MILCOM.1991.258443","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258443","url":null,"abstract":"The advanced single-channel antijam man-portable (ASCAMP) downlink is a custom-designed digital signal processor implemented in hardware that runs a tailored and efficient microcode. Appropriate sections of microcode are executed in response to the downlink requirements. The different processing functions, hardware design, and hardware implementation are discussed. The author points out the unique feature of reprogramming field programmable gate array (FPGA) hardware in order to accomplish different processing tasks with minimal hardware. Advantages and disadvantages of using FPGAs in the advanced SCAMP implementation and ideas for future development are mentioned. The ASCAMP (EHF satellite communication terminal) has stringent size, power, and weight specifications, making for a challenging design project. The downlink processor implementation has been optimized both in concept and design to meet these specifications.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"231 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132684284","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：