Pub Date : 1991-11-04DOI: 10.1109/MILCOM.1991.258271
Qiang Wang, T. Gulliver, L. Mason, V. Bhargava
Results of a study into the performance of slow frequency hopping M-ary differential phase shift keying (MDPSK) signaling in the presence of both tone jamming and Gaussian noise are presented. Previous work has been extended by considering larger signal sets and skewed differential phases with unequal decision regions. Probability distributions are used instead of calculating a set of probabilities over symmetrical decision regions. This allows the optimization of the decision regions in tone jamming from the equal regions used in Gaussian noise environments. The error performance when a frequency offsets exists between the jamming tone and MDPSK carrier is also considered.<>
{"title":"Performance of SFH/MDPSK in tone interference and Gaussian noise","authors":"Qiang Wang, T. Gulliver, L. Mason, V. Bhargava","doi":"10.1109/MILCOM.1991.258271","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258271","url":null,"abstract":"Results of a study into the performance of slow frequency hopping M-ary differential phase shift keying (MDPSK) signaling in the presence of both tone jamming and Gaussian noise are presented. Previous work has been extended by considering larger signal sets and skewed differential phases with unequal decision regions. Probability distributions are used instead of calculating a set of probabilities over symmetrical decision regions. This allows the optimization of the decision regions in tone jamming from the equal regions used in Gaussian noise environments. The error performance when a frequency offsets exists between the jamming tone and MDPSK carrier is also considered.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"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":"133191128","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.258255
C. Niznik, J. Frank
The basic computer network testbed facility centralized core distributed inner core (CCDIC) simulation protocol characteristics are an emulation of real time, heavy load, simultaneous, synchronous and asynchronous parallel inputs in a deadlock and livelock free, contention resolved manner. The centralized distributed stars topology representation of the testbed configuration enables network growth with a topology comfortable to congestion prevention and control at various levels of service. The CCDIC protocol, a congestion-controlled, buffer management protocol, prevents the throughput degradation which is allowed to occur in the discrete event simulation illustrated in the performance comparison. A neural network forecaster protocol, within the CCDIC simulation framework, enables intelligent decision processes. The geometric CCDIC protocol structure enforces optimal Ada CCDIC software implementation for execution of message operation on processors and connectivity between analyzer resources.<>
{"title":"Test bed computer network centralized core and distributed inner core simulation protocol organization, development, and performance evaluation realizing a neural network forecaster","authors":"C. Niznik, J. Frank","doi":"10.1109/MILCOM.1991.258255","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258255","url":null,"abstract":"The basic computer network testbed facility centralized core distributed inner core (CCDIC) simulation protocol characteristics are an emulation of real time, heavy load, simultaneous, synchronous and asynchronous parallel inputs in a deadlock and livelock free, contention resolved manner. The centralized distributed stars topology representation of the testbed configuration enables network growth with a topology comfortable to congestion prevention and control at various levels of service. The CCDIC protocol, a congestion-controlled, buffer management protocol, prevents the throughput degradation which is allowed to occur in the discrete event simulation illustrated in the performance comparison. A neural network forecaster protocol, within the CCDIC simulation framework, enables intelligent decision processes. The geometric CCDIC protocol structure enforces optimal Ada CCDIC software implementation for execution of message operation on processors and connectivity between analyzer resources.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"41 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":"131901151","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.258360
P. Leahy
Recent developments in electronic key management systems offer the opportunity for improved security and administrative effectiveness with lower operational cost. Key distribution is a subset of a total information management system designed to provide responsive and efficient use of communications resources. The IRIS crypto-material management system (CMMS) supports the communications management system (CMS) to provide an integrated communications and security management function. The author describes the hardware and software architecture that provides security and INFOSEC protection for the critical key management functions. Distribution of keying material in black form significantly reduces the risk of compromise. The CMMS is a portable-data-terminal-based software program used to perform the cryptonet engineering and the net management functions of the CMS. Operational requirements include planning for key distribution, cryptonet reconfiguration due to force restructuring, compromise recovery, reporting, accounting of all crypto material, and personal security information.<>
{"title":"INFOSEC considerations for tactical key management in the IRIS radio system","authors":"P. Leahy","doi":"10.1109/MILCOM.1991.258360","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258360","url":null,"abstract":"Recent developments in electronic key management systems offer the opportunity for improved security and administrative effectiveness with lower operational cost. Key distribution is a subset of a total information management system designed to provide responsive and efficient use of communications resources. The IRIS crypto-material management system (CMMS) supports the communications management system (CMS) to provide an integrated communications and security management function. The author describes the hardware and software architecture that provides security and INFOSEC protection for the critical key management functions. Distribution of keying material in black form significantly reduces the risk of compromise. The CMMS is a portable-data-terminal-based software program used to perform the cryptonet engineering and the net management functions of the CMS. Operational requirements include planning for key distribution, cryptonet reconfiguration due to force restructuring, compromise recovery, reporting, accounting of all crypto material, and personal security information.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"47 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":"134395181","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.258419
C. Kain, P.P. Buchynsky
It is noted that there has been increased activity recently in developing computer algorithms that can automatically reconstruct messages received over record communications systems. These algorithms exploit the redundancy available when either multiple copies are transmitted or the message is expanded in the phonetic alphabet. The authors describe the characteristics of the communications systems which provide the input sequences to, and which are likely to impact the design of, message reconstruction algorithms. They discuss the potential variability of the received sequences and describe, in some cases, when the use of certain techniques is not appropriate. Particular attention is given to error control, anomalies, and cross-channel correction.<>
{"title":"Message reconstruction design criteria","authors":"C. Kain, P.P. Buchynsky","doi":"10.1109/MILCOM.1991.258419","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258419","url":null,"abstract":"It is noted that there has been increased activity recently in developing computer algorithms that can automatically reconstruct messages received over record communications systems. These algorithms exploit the redundancy available when either multiple copies are transmitted or the message is expanded in the phonetic alphabet. The authors describe the characteristics of the communications systems which provide the input sequences to, and which are likely to impact the design of, message reconstruction algorithms. They discuss the potential variability of the received sequences and describe, in some cases, when the use of certain techniques is not appropriate. Particular attention is given to error control, anomalies, and cross-channel correction.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"34 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":"123150816","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.258284
C. M. Barnhart, J. Wieselthier, A. Ephremides
The authors address the problem of link activation or scheduling in multihop packet radio networks, a contention-free form of channel access that is appropriate for many military communication applications. This problem, in almost all of its forms, is a combinatorial-optimization problem of high complexity. They approach this problem by the use of a Hopfield neural network model in which the method of Lagrange multipliers is used to dynamically vary the values of the coefficients used in the connection weights. Extensive software simulation results demonstrate the effectiveness of this approach in producing schedules of optimal length. Issues associated with the extension of this approach to the joint routing/scheduling problem are discussed.<>
{"title":"Neural network techniques for scheduling and routing problems in multihop radio networks","authors":"C. M. Barnhart, J. Wieselthier, A. Ephremides","doi":"10.1109/MILCOM.1991.258284","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258284","url":null,"abstract":"The authors address the problem of link activation or scheduling in multihop packet radio networks, a contention-free form of channel access that is appropriate for many military communication applications. This problem, in almost all of its forms, is a combinatorial-optimization problem of high complexity. They approach this problem by the use of a Hopfield neural network model in which the method of Lagrange multipliers is used to dynamically vary the values of the coefficients used in the connection weights. Extensive software simulation results demonstrate the effectiveness of this approach in producing schedules of optimal length. Issues associated with the extension of this approach to the joint routing/scheduling problem are discussed.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"107 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":"131988172","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.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.258237
F. Kiel
With a deregulated multivendor situation with a strong request for integrated voice and data services on international corporate/private networks, network management based on Telecommunication Management Network principles has become a priority issue for the European carriers and large multinational enterprises. This trend is accompanied by numerous standardization activities and development of basic TMN products. The framework for TMN was set by the recommendation M.30 issued by CCITT, the major standardization body for TMN.<>
{"title":"Status and evolution of TMN in the European economy","authors":"F. Kiel","doi":"10.1109/MILCOM.1991.258237","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258237","url":null,"abstract":"With a deregulated multivendor situation with a strong request for integrated voice and data services on international corporate/private networks, network management based on Telecommunication Management Network principles has become a priority issue for the European carriers and large multinational enterprises. This trend is accompanied by numerous standardization activities and development of basic TMN products. The framework for TMN was set by the recommendation M.30 issued by CCITT, the major standardization body for TMN.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"90 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":"116586909","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.258355
L. Walker
The author identifies critical issues in meeting the communications requirements for distributed command and control and highlights the impact of failing to adequately satisfy this requirement. The seven critical issues presented in prioritized order of importance are detectability, availability, data rate, security, impact on mobility, skill for operation, and network management. The basic precept of distributed command and control is to enhance the survival of the command and control system.<>
{"title":"Critical communications issues for distributed command land control","authors":"L. Walker","doi":"10.1109/MILCOM.1991.258355","DOIUrl":"https://doi.org/10.1109/MILCOM.1991.258355","url":null,"abstract":"The author identifies critical issues in meeting the communications requirements for distributed command and control and highlights the impact of failing to adequately satisfy this requirement. The seven critical issues presented in prioritized order of importance are detectability, availability, data rate, security, impact on mobility, skill for operation, and network management. The basic precept of distributed command and control is to enhance the survival of the command and control system.<<ETX>>","PeriodicalId":212388,"journal":{"name":"MILCOM 91 - Conference record","volume":"50 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":"114708541","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：