Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415842
Hellen Maziku, S. Shetty, Keesook J. Han, Tamara Rogers
The ability to localize Internet hosts is appealing for a range of applications from online advertising to localizing cyber attacks. Recently, measurement-based approaches have been proposed to accurately identify the location of Internet hosts. These approaches typically produce erroneous results due to measurement errors. In this paper, we propose an Enhanced Learning Classifier approach for estimating the geolocation of Internet hosts with increased accuracy. Our approach extends an exisiting machine learning based approach by extracting six features from network measurements and implementing a new landmark selection policy. These enhancements allow us to mitigate problems with measurement errors and reduces average error distance in estimating location of Internet hosts. To demonstrate the accuracy of our approach, we evaluate the performance on network routers using ping measurements from PlanetLab nodes with known geographic placement. Our results demonstrate that our approach improves average accuracy by geolocating internet hosts 100 miles closer to the true geographic location versus prior measurement-based approaches.
{"title":"Enhancing the classification accuracy of IP geolocation","authors":"Hellen Maziku, S. Shetty, Keesook J. Han, Tamara Rogers","doi":"10.1109/MILCOM.2012.6415842","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415842","url":null,"abstract":"The ability to localize Internet hosts is appealing for a range of applications from online advertising to localizing cyber attacks. Recently, measurement-based approaches have been proposed to accurately identify the location of Internet hosts. These approaches typically produce erroneous results due to measurement errors. In this paper, we propose an Enhanced Learning Classifier approach for estimating the geolocation of Internet hosts with increased accuracy. Our approach extends an exisiting machine learning based approach by extracting six features from network measurements and implementing a new landmark selection policy. These enhancements allow us to mitigate problems with measurement errors and reduces average error distance in estimating location of Internet hosts. To demonstrate the accuracy of our approach, we evaluate the performance on network routers using ping measurements from PlanetLab nodes with known geographic placement. Our results demonstrate that our approach improves average accuracy by geolocating internet hosts 100 miles closer to the true geographic location versus prior measurement-based approaches.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"6 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81946605","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415608
Sébastien Marcille, P. Ciblat, C. Martret
This paper deals with multiuser resource allocation (power, bandwidth, constellation size, and code rate) for an OFDMA system using HARQ in the context of Rayleigh distributed channel. We assume that the resource manager (base station or cluster head) only knows the channel statistics of the active links. Then, an optimal algorithm for minimizing the total transmitted power under per user goodput constraints is proposed. Extension to imperfect feedback on HARQ scheme is also performed. This algorithm can be especially applied to military ad hoc wireless networks.
{"title":"Optimal resource allocation in HARQ-based OFDMA wireless networks","authors":"Sébastien Marcille, P. Ciblat, C. Martret","doi":"10.1109/MILCOM.2012.6415608","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415608","url":null,"abstract":"This paper deals with multiuser resource allocation (power, bandwidth, constellation size, and code rate) for an OFDMA system using HARQ in the context of Rayleigh distributed channel. We assume that the resource manager (base station or cluster head) only knows the channel statistics of the active links. Then, an optimal algorithm for minimizing the total transmitted power under per user goodput constraints is proposed. Extension to imperfect feedback on HARQ scheme is also performed. This algorithm can be especially applied to military ad hoc wireless networks.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"14 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81995318","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415586
V. Weerackody, E. Cuevas
Satellite Communications on-the-move (SOTM) networks are being deployed to provide various broadband communication services. Typically, an SOTM network consists of a large number of small aperture terminals deployed over a wide geographical area. These terminals are intended to operate over geostationary orbit satellites. To utilize network resources efficiently, these networks may employ time- and frequency-division multiple access methods. Also, SOTM terminals may operate using a range of antenna aperture sizes and may require different transmit power levels to meet various user's data rate needs. Additionally, antenna pointing errors of the terminals may contribute to a time-varying interference pattern from the SOTM network to a victim receiver in another satellite network. This paper provides a methodology to analyze the time-varying interference resulting from an MF-TDMA network consisting of such terminals. This methodology has been submitted for consideration by ITU-R Working Party 4A.
{"title":"Adjacent satellite interference from a network Of MF-TDMA satellite communications on-the-move terminals","authors":"V. Weerackody, E. Cuevas","doi":"10.1109/MILCOM.2012.6415586","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415586","url":null,"abstract":"Satellite Communications on-the-move (SOTM) networks are being deployed to provide various broadband communication services. Typically, an SOTM network consists of a large number of small aperture terminals deployed over a wide geographical area. These terminals are intended to operate over geostationary orbit satellites. To utilize network resources efficiently, these networks may employ time- and frequency-division multiple access methods. Also, SOTM terminals may operate using a range of antenna aperture sizes and may require different transmit power levels to meet various user's data rate needs. Additionally, antenna pointing errors of the terminals may contribute to a time-varying interference pattern from the SOTM network to a victim receiver in another satellite network. This paper provides a methodology to analyze the time-varying interference resulting from an MF-TDMA network consisting of such terminals. This methodology has been submitted for consideration by ITU-R Working Party 4A.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"302 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78436709","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415673
J. McDermott, B. Montrose, Margery Li, J. Kirby, Myong H. Kang
In conventional military computing, security separation is provided by cryptography, for data in motion and data at rest. Security separation for data under computation is provided by separate hardware. Cloud computing shares hardware for all data under computation, so a new approach to security separation is needed for military clouds. Cryptographic separation of data under computation is not practical with current technology, so the separation must be accomplished by software, i.e. the virtualization infrastructure. The strongest known means of software separation is the separation kernel. Separation kernels are special virtual machine monitors (VMMs) that are small enough and simple enough to be mathematically verified. Unfortunately, strict separation kernels cannot virtualize the complex modern commodity hardware and guest virtual machine (VM) operating systems that are essential to cloud computing. The best alternative to a strict separation kernel is a a separation VMM. A separation VMM relaxes the strict size and simplicity goals of a separation kernel just far enough to be able to support commodity hardware and guest operating systems. Because they address all of the features of commodity hardware, separation VMMs are too large for formal mathematical verification. However, separation VMMs are small enough and simple enough to be completely specified by semiformal means, i.e. they are smaller and simpler than conventional VMMs. A separation VMM has a complete systematic assurance argument that it isolates guest VMs from each other and strongly protects itself from tampering. A separation VMM provides the strongest separation of cloud VMs that is consistent with virtualizing complex commodity operating systems, on shared complex commodity hardware.
{"title":"The Xenon separation VMM: Secure virtualization infrastructure for military clouds","authors":"J. McDermott, B. Montrose, Margery Li, J. Kirby, Myong H. Kang","doi":"10.1109/MILCOM.2012.6415673","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415673","url":null,"abstract":"In conventional military computing, security separation is provided by cryptography, for data in motion and data at rest. Security separation for data under computation is provided by separate hardware. Cloud computing shares hardware for all data under computation, so a new approach to security separation is needed for military clouds. Cryptographic separation of data under computation is not practical with current technology, so the separation must be accomplished by software, i.e. the virtualization infrastructure. The strongest known means of software separation is the separation kernel. Separation kernels are special virtual machine monitors (VMMs) that are small enough and simple enough to be mathematically verified. Unfortunately, strict separation kernels cannot virtualize the complex modern commodity hardware and guest virtual machine (VM) operating systems that are essential to cloud computing. The best alternative to a strict separation kernel is a a separation VMM. A separation VMM relaxes the strict size and simplicity goals of a separation kernel just far enough to be able to support commodity hardware and guest operating systems. Because they address all of the features of commodity hardware, separation VMMs are too large for formal mathematical verification. However, separation VMMs are small enough and simple enough to be completely specified by semiformal means, i.e. they are smaller and simpler than conventional VMMs. A separation VMM has a complete systematic assurance argument that it isolates guest VMs from each other and strongly protects itself from tampering. A separation VMM provides the strongest separation of cloud VMs that is consistent with virtualizing complex commodity operating systems, on shared complex commodity hardware.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"22 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76061332","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415882
Zheng Chang, T. Ristaniemi
This work addresses the radio resource allocation (RRA) problem for cooperative relay assisted OFDMA wireless networks. The relays adopt the decode-and-forward protocol and can cooperatively assist the transmission from source to destination. The RRA scheme addresses practical implementation issues of resource allocation in OFDMA networks: the inaccuracy of channel-state information (CSI) available to the source. Instead, the source only knows estimated channel status and distributions of related estimation errors. The objective is to maximize the system throughput of the source-to-destination link under various constraints. Since the optimization problem is known as NP-hard, we divide the original problem to three subproblems including relay selection, subcarrier and power allocations. We derive theoretical expressions for the solutions and illustrate them through simulations. Results validate clearly that our proposed RRA algorithm can enhance the performance of system with imperfect CSI compared to the other newly proposed resource allocation schemes.
{"title":"Resource allocation for cooperative relay-assisted OFDMA networks with imperfect CSI","authors":"Zheng Chang, T. Ristaniemi","doi":"10.1109/MILCOM.2012.6415882","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415882","url":null,"abstract":"This work addresses the radio resource allocation (RRA) problem for cooperative relay assisted OFDMA wireless networks. The relays adopt the decode-and-forward protocol and can cooperatively assist the transmission from source to destination. The RRA scheme addresses practical implementation issues of resource allocation in OFDMA networks: the inaccuracy of channel-state information (CSI) available to the source. Instead, the source only knows estimated channel status and distributions of related estimation errors. The objective is to maximize the system throughput of the source-to-destination link under various constraints. Since the optimization problem is known as NP-hard, we divide the original problem to three subproblems including relay selection, subcarrier and power allocations. We derive theoretical expressions for the solutions and illustrate them through simulations. Results validate clearly that our proposed RRA algorithm can enhance the performance of system with imperfect CSI compared to the other newly proposed resource allocation schemes.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"272 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76403576","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415636
Seongah Jeong, Keonkook Lee, Joonhyuk Kang, Youngseok Baek, B. Koo
In this paper, we consider a cooperative jammer to improve secrecy of the wireless transmission in a cellular downlink network. The private message intended for a single user should be kept from the remainder of the users who are regarded as internal eavesdroppers. To improve the secrecy of the intended user, we propose an employment of a helper with multiple antennas and design its optimal transmit beamforming vector. Specifically, the helper node generates the artificial interference to the internal eavesdroppers and so enhances the security by increasing the ambiguity at the eavesdroppers. Based on a framework of power gain region in [1], we optimize the transmission strategy for the helper which maximizes the secrecy capacity of the intended user. The analytical and simulation results show that the proposed scheme enhances the secrecy capacity. In addition, all users whose secrecy rates are zero with no helper's cooperation can achieve the positive secrecy rate by the proposed scheme.
{"title":"Cooperative jammer design in cellular network with internal eavesdroppers","authors":"Seongah Jeong, Keonkook Lee, Joonhyuk Kang, Youngseok Baek, B. Koo","doi":"10.1109/MILCOM.2012.6415636","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415636","url":null,"abstract":"In this paper, we consider a cooperative jammer to improve secrecy of the wireless transmission in a cellular downlink network. The private message intended for a single user should be kept from the remainder of the users who are regarded as internal eavesdroppers. To improve the secrecy of the intended user, we propose an employment of a helper with multiple antennas and design its optimal transmit beamforming vector. Specifically, the helper node generates the artificial interference to the internal eavesdroppers and so enhances the security by increasing the ambiguity at the eavesdroppers. Based on a framework of power gain region in [1], we optimize the transmission strategy for the helper which maximizes the secrecy capacity of the intended user. The analytical and simulation results show that the proposed scheme enhances the secrecy capacity. In addition, all users whose secrecy rates are zero with no helper's cooperation can achieve the positive secrecy rate by the proposed scheme.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"34 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79171678","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415564
P. Shahan, D. Heide, Aaron E. Cohen
In this paper a novel technique for implementing heavily bit error protected 8 and 12 kilobits per second (kbps) voice coder (vocoder) based on a 2.4 kbps vocoder specified in Tactical Secure Voice Cryptographic Interoperability Specification (TSVCIS) is compared to the current 16 kbps Continuously Variable Slope Delta Modulation (CVSD) used in several legacy military radios and the Single Channel Ground and Airborne Radio System (SINCGARS). TSVCIS voice significantly outscored CVSD in terms of quality, using the Mean Opinion Score (MOS) and Diagnostic Acceptability Measure (DAM), and intelligibility, from the Diagnostic Rhyme Test (DRT). These tests show that TSVCIS voice delivers significantly higher quality and intelligibility than CVSD when transmitted over noisy communication channels.
{"title":"Comparison of TSVCIS voice at 8000 and 12000 bps VERSUS CVSD at 16000 bps","authors":"P. Shahan, D. Heide, Aaron E. Cohen","doi":"10.1109/MILCOM.2012.6415564","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415564","url":null,"abstract":"In this paper a novel technique for implementing heavily bit error protected 8 and 12 kilobits per second (kbps) voice coder (vocoder) based on a 2.4 kbps vocoder specified in Tactical Secure Voice Cryptographic Interoperability Specification (TSVCIS) is compared to the current 16 kbps Continuously Variable Slope Delta Modulation (CVSD) used in several legacy military radios and the Single Channel Ground and Airborne Radio System (SINCGARS). TSVCIS voice significantly outscored CVSD in terms of quality, using the Mean Opinion Score (MOS) and Diagnostic Acceptability Measure (DAM), and intelligibility, from the Diagnostic Rhyme Test (DRT). These tests show that TSVCIS voice delivers significantly higher quality and intelligibility than CVSD when transmitted over noisy communication channels.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"24 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75163635","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415793
Hao Feng, L. Cimini
There has been a growing interest in designing relay deployment strategies for cooperative wireless networks. In this paper, we focus on multi-hop, cluster-based, linear networks. Several relay selection strategies are applied to achieve the cooperative diversity benefits. We derive the number of hops that minimizes the end-to-end outage probability. On the other hand, if the required overhead for cooperation is considered, increasing the number of relays in each cluster can degrade the performance. Using an information-theoretic approach, we also investigate the number of relays that maximizes the throughput. Simulation results are presented to verify the analysis.
{"title":"On optimum relay deployment in a multi-hop linear network with cooperation","authors":"Hao Feng, L. Cimini","doi":"10.1109/MILCOM.2012.6415793","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415793","url":null,"abstract":"There has been a growing interest in designing relay deployment strategies for cooperative wireless networks. In this paper, we focus on multi-hop, cluster-based, linear networks. Several relay selection strategies are applied to achieve the cooperative diversity benefits. We derive the number of hops that minimizes the end-to-end outage probability. On the other hand, if the required overhead for cooperation is considered, increasing the number of relays in each cluster can degrade the performance. Using an information-theoretic approach, we also investigate the number of relays that maximizes the throughput. Simulation results are presented to verify the analysis.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"9 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76475403","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415693
Cem Tekin, M. Liu
In this paper we consider decentralized multi-user online learning of unused spectrum bands as an opportunistic spectrum access (OSA) problem. There is a set of M secondary users exploiting the spectrum opportunities in K channels. We develop a distributed algorithm for the secondary users that will learn the optimal allocation with logarithmic regret. Thus, our algorithm achieves the fastest convergence rate to the optimal allocation. In a more general framework, our algorithm gives an order optimal solution to the decentralized multi-player multi-armed bandit problem with general reward functions.
{"title":"Online learning in decentralized multi-user spectrum access with synchronized explorations","authors":"Cem Tekin, M. Liu","doi":"10.1109/MILCOM.2012.6415693","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415693","url":null,"abstract":"In this paper we consider decentralized multi-user online learning of unused spectrum bands as an opportunistic spectrum access (OSA) problem. There is a set of M secondary users exploiting the spectrum opportunities in K channels. We develop a distributed algorithm for the secondary users that will learn the optimal allocation with logarithmic regret. Thus, our algorithm achieves the fastest convergence rate to the optimal allocation. In a more general framework, our algorithm gives an order optimal solution to the decentralized multi-player multi-armed bandit problem with general reward functions.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"79 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83798067","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 : 2012-10-01DOI: 10.1109/MILCOM.2012.6415768
K. Y. Jo, D. M. Cascio
This paper presents satellite loading methodologies for loading satellite communications (SATCOM) requirements on commercial Ka-band satellites in contested environments experiencing jamming. Future high-capacity Ka-band commercial satellites will rely on ground concentration nodes (GCNs) and adaptive coding and modulation (ACM) techniques to provide digital video broadcasting/return channel via satellite (DVB/RCS) services for forward and return links to achieve high throughput. Traffic flows between user beams are coordinated through GCNs thus requiring double hops for peer-to-peer traffic while reachback traffic requires single hops relying on terrestrial networks. Cell-like user beams are assembled in arrays designed to enhance user coverage and supportability. Optimal satellite loading in the presence of uplink jamming is derived to minimize satellite and terminals powers and to maximize the supported data rates. Throughput degradation in contested environments results when the transponders begin to operate in a non-linear mode approaching saturation.
{"title":"Performance of Combatant Command satellite (COCOMSat) communications in contested environments","authors":"K. Y. Jo, D. M. Cascio","doi":"10.1109/MILCOM.2012.6415768","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415768","url":null,"abstract":"This paper presents satellite loading methodologies for loading satellite communications (SATCOM) requirements on commercial Ka-band satellites in contested environments experiencing jamming. Future high-capacity Ka-band commercial satellites will rely on ground concentration nodes (GCNs) and adaptive coding and modulation (ACM) techniques to provide digital video broadcasting/return channel via satellite (DVB/RCS) services for forward and return links to achieve high throughput. Traffic flows between user beams are coordinated through GCNs thus requiring double hops for peer-to-peer traffic while reachback traffic requires single hops relying on terrestrial networks. Cell-like user beams are assembled in arrays designed to enhance user coverage and supportability. Optimal satellite loading in the presence of uplink jamming is derived to minimize satellite and terminals powers and to maximize the supported data rates. Throughput degradation in contested environments results when the transponders begin to operate in a non-linear mode approaching saturation.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"55 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83810626","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
扫码关注我们
求助内容：
应助结果提醒方式：