Pub Date : 2010-12-01DOI: 10.1109/MILCOM.2010.5680471
Z. Haas, Tuan-Che Chen
Cooperative communication is a promising way to reduce probability of packet loss. The massive deployment of nodes in wireless sensor network renders such networks especially attractive for exploiting the advantage of cooperative diversity. Similarly, when used appropriately, network coding could also improve the probability of correct reception. In this paper, we introduce the cluster-based Cooperative Coding (CC) protocol, which is based on the integration of cooperative communication and network coding. In particular, in the CC protocol, network nodes are grouped into multiple clusters and nodes within the same cluster cooperate in transmitting and receiving packets. Such an integration reduces the amount of redundant information being forwarded to ensure high probability of correct end-to-end reception, when link-level retransmission of erroneous packets is not allowed (i.e., no linklevel feedback). In particular, our analysis shows how to optimize the performance of the network by properly sizing the clusters. Compared to schemes without cooperation (whether with or without network coding), our simulation results demonstrate the significant performance improvement of the proposed scheme.
{"title":"Cluster-based cooperative communication with network coding in wireless networks","authors":"Z. Haas, Tuan-Che Chen","doi":"10.1109/MILCOM.2010.5680471","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680471","url":null,"abstract":"Cooperative communication is a promising way to reduce probability of packet loss. The massive deployment of nodes in wireless sensor network renders such networks especially attractive for exploiting the advantage of cooperative diversity. Similarly, when used appropriately, network coding could also improve the probability of correct reception. In this paper, we introduce the cluster-based Cooperative Coding (CC) protocol, which is based on the integration of cooperative communication and network coding. In particular, in the CC protocol, network nodes are grouped into multiple clusters and nodes within the same cluster cooperate in transmitting and receiving packets. Such an integration reduces the amount of redundant information being forwarded to ensure high probability of correct end-to-end reception, when link-level retransmission of erroneous packets is not allowed (i.e., no linklevel feedback). In particular, our analysis shows how to optimize the performance of the network by properly sizing the clusters. Compared to schemes without cooperation (whether with or without network coding), our simulation results demonstrate the significant performance improvement of the proposed scheme.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127848817","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 : 2010-11-07DOI: 10.1109/MILCOM.2010.5680360
Thuy D. Nguyen, Mark A. Gondree, D. Shifflett, Jean Khosalim, T. Levin, C. Irvine
The Monterey Security Architecture addresses the need to share high-value data across multiple domains of different classification levels while enforcing information flow policies. The architecture allows users with different security authorizations to securely collaborate and exchange information using commodity computers and familiar commercial client software that generally lack the prerequisite assurance and functional security protections. MYSEA seeks to meet two compelling requirements, often assumed to be at odds: enforcing critical, mandatory security policies, and allowing access and collaboration in a familiar work environment. Recent additions to the MYSEA design expand the architecture to support a cloud of cross-domain services, hosted within a federation of multilevel secure (MLS) MYSEA servers. The MYSEA cloud supports single-sign on, service replication, and network-layer quality of security service. This new cross-domain, distributed architecture follows the consumption and delivery model for cloud services, while maintaining the federated control model necessary to support and protect cross-domain collaboration within the enterprise. The resulting architecture shows the feasibility of high-assurance, cross-domain services hosted within a community cloud suitable for inter-agency, or joint, collaboration. This paper summarizes the MYSEA architecture and discusses MYSEA's approach to provide an MLS-constrained cloud computing environment.
{"title":"A cloud-oriented cross-domain security architecture","authors":"Thuy D. Nguyen, Mark A. Gondree, D. Shifflett, Jean Khosalim, T. Levin, C. Irvine","doi":"10.1109/MILCOM.2010.5680360","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680360","url":null,"abstract":"The Monterey Security Architecture addresses the need to share high-value data across multiple domains of different classification levels while enforcing information flow policies. The architecture allows users with different security authorizations to securely collaborate and exchange information using commodity computers and familiar commercial client software that generally lack the prerequisite assurance and functional security protections. MYSEA seeks to meet two compelling requirements, often assumed to be at odds: enforcing critical, mandatory security policies, and allowing access and collaboration in a familiar work environment. Recent additions to the MYSEA design expand the architecture to support a cloud of cross-domain services, hosted within a federation of multilevel secure (MLS) MYSEA servers. The MYSEA cloud supports single-sign on, service replication, and network-layer quality of security service. This new cross-domain, distributed architecture follows the consumption and delivery model for cloud services, while maintaining the federated control model necessary to support and protect cross-domain collaboration within the enterprise. The resulting architecture shows the feasibility of high-assurance, cross-domain services hosted within a community cloud suitable for inter-agency, or joint, collaboration. This paper summarizes the MYSEA architecture and discusses MYSEA's approach to provide an MLS-constrained cloud computing environment.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122397636","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 : 2010-10-31DOI: 10.1109/MILCOM.2010.5680362
Palanivel A. Kodeswaran, Wenjia Li, A. Joshi, Timothy W. Finin, F. Perich
Internet routers must adhere to many polices governing the selection of paths that meet potentially complex constraints on length, security, symmetry and organizational preferences. Many routing problems are caused by their misconfigura-tion, usually due to a combination of human errors and the lack of a high-level formal language for specifying routing policies that can be used to generate router configurations. We describe an approach that obviates many problems by using a declarative language for specifying network-wide routing policies to automatically configure routers and also inform software agents that can diagnose and correct networking problems. Our policy language is grounded in ontologies encoded in the Semantic Web language OWL, supporting machine understanding and interoperability. Polices expressed in it can be automatically compiled into low-level router configurations and intelligent agents can reason with them to diagnose and correct routing problems. We have prototyped the approach and evaluated the results both in a simulator and on a small physical network. Our results show that the framework performs well on a number of use cases, including checking for policy coherence, preventing asymmetric routing patterns, applying organizational preferences, and diagnosing and correcting failures.
{"title":"Enforcing secure and robust routing with declarative policies","authors":"Palanivel A. Kodeswaran, Wenjia Li, A. Joshi, Timothy W. Finin, F. Perich","doi":"10.1109/MILCOM.2010.5680362","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680362","url":null,"abstract":"Internet routers must adhere to many polices governing the selection of paths that meet potentially complex constraints on length, security, symmetry and organizational preferences. Many routing problems are caused by their misconfigura-tion, usually due to a combination of human errors and the lack of a high-level formal language for specifying routing policies that can be used to generate router configurations. We describe an approach that obviates many problems by using a declarative language for specifying network-wide routing policies to automatically configure routers and also inform software agents that can diagnose and correct networking problems. Our policy language is grounded in ontologies encoded in the Semantic Web language OWL, supporting machine understanding and interoperability. Polices expressed in it can be automatically compiled into low-level router configurations and intelligent agents can reason with them to diagnose and correct routing problems. We have prototyped the approach and evaluated the results both in a simulator and on a small physical network. Our results show that the framework performs well on a number of use cases, including checking for policy coherence, preventing asymmetric routing patterns, applying organizational preferences, and diagnosing and correcting failures.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128480579","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 : 2010-10-31DOI: 10.1109/MILCOM.2010.5680382
Bita Azimdoost, R. Hamid, J. Garcia-Luna-Aceves
We study the capacity of random wireless ad hoc networks when nodes are capable of multi-packet transmission and reception (MPTR). This paper extends the unified framework of (n, m, k)-cast by Wang et al. [6] for single-packet reception (SPR) at each node to the case of MPTR. (n, m, k)-cast considers all types of information dissemination including unicast routing, multicast routing, broadcasting and anycasting. In this context, n, m, and k represent the total number of nodes in the network, the number of destinations for each communication group and the actual number of destinations that receive the packets, respectively. We show that the capacity of a wireless ad hoc network of n nodes in which nodes have a communication range of r(n) and engage in an (n, m, k) -casting scales as Θ(n√mr3(n)/k), Θ(nr2(n)/k) and Θ(nr4(n)) bits per second when m = O(1/r2(n)), Ω(k) = 1/r2(n) = O(m) and k = Ω(1/r2(n)), respectively. We show that the use of MPTR leads to a gain of Θ(logn) compared to the capacity attained with multi-packet reception (MPR), and to a gain of Θ((logn)2) compared to the capacity attained with SPR, when Ω(√logn/n) = r(n) = O(√loglogn/3logn).
研究了随机无线自组织网络在节点具有多包收发能力时的容量问题。本文将Wang等[6]针对各节点单包接收(SPR)的统一框架(n, m, k)-cast扩展到MPTR情况。(n, m, k)-cast考虑所有类型的信息传播，包括单播路由、组播路由、广播和任意播。在此例中，n、m和k分别表示网络中节点总数、每个通信组的目的地址数量和实际接收数据包的目的地址数量。我们展示了n个节点的无线自组织网络的容量，其中节点的通信范围为r(n)，并且在m = O(1/r2(n))， Ω(k) = 1/r2(n) = O(m)和k = Ω(1/r2(n))时，节点的(n, m, k)投射尺度分别为Θ(n√mr3(n)/k)， Θ(nr2(n)/k)和Θ(nr4(n))位每秒。我们表明，与使用多包接收(MPR)获得的容量相比，使用MPTR可以获得Θ(logn)的增益，当Ω(√logn/n) = r(n) = O(√loglog /3logn)时，与使用SPR获得的容量相比，MPTR可以获得Θ((logn)2)的增益。
{"title":"Impact of multi-packet transmission and reception on the throughput capacity of wireless ad hoc networks","authors":"Bita Azimdoost, R. Hamid, J. Garcia-Luna-Aceves","doi":"10.1109/MILCOM.2010.5680382","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680382","url":null,"abstract":"We study the capacity of random wireless ad hoc networks when nodes are capable of multi-packet transmission and reception (MPTR). This paper extends the unified framework of (n, m, k)-cast by Wang et al. [6] for single-packet reception (SPR) at each node to the case of MPTR. (n, m, k)-cast considers all types of information dissemination including unicast routing, multicast routing, broadcasting and anycasting. In this context, n, m, and k represent the total number of nodes in the network, the number of destinations for each communication group and the actual number of destinations that receive the packets, respectively. We show that the capacity of a wireless ad hoc network of n nodes in which nodes have a communication range of r(n) and engage in an (n, m, k) -casting scales as Θ(n√mr<sup>3</sup>(n)/k), Θ(nr<sup>2</sup>(n)/k) and Θ(nr<sup>4</sup>(n)) bits per second when m = O(1/r<sup>2</sup>(n)), Ω(k) = 1/r<sup>2</sup>(n) = O(m) and k = Ω(1/r<sup>2</sup>(n)), respectively. We show that the use of MPTR leads to a gain of Θ(logn) compared to the capacity attained with multi-packet reception (MPR), and to a gain of Θ((logn)<sup>2</sup>) compared to the capacity attained with SPR, when Ω(√logn/n) = r(n) = O(√loglogn/3logn).","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114242200","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 : 2010-10-31DOI: 10.1109/MILCOM.2010.5680159
Hui Xu, J. Garcia-Luna-Aceves, H. Sadjadpour
Channel fading has been regarded as a negative factor for successful packet transmission. However, with deep fading, although collisions for a given transmission may exist, the capture effect can allow the transmission to succeed as long as the channel for the transmitted signal is strong enough and is weak enough for the interference signals. Accordingly, we propose an asynchronous medium access control (MAC) scheme that selects a packet with the highest success probability to be transmitted. We call this approach opportunistic interference management (OIM). The basic mechanism in OIM consists of probing the channel conditions for multiple neighbors concurrently, and then selecting to transmit those packets corresponding to the winners of the probing phase. OIM improves the probability of successful transmission and increases network throughput without adding extra delays for inter-nodal handshakes. Mathematical analysis and simulations are used to validate the advantages of OIM over the traditional packet-transmission scheme used in MAC protocols today.
{"title":"Exploiting the capture effect opportunistically in MANETs","authors":"Hui Xu, J. Garcia-Luna-Aceves, H. Sadjadpour","doi":"10.1109/MILCOM.2010.5680159","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680159","url":null,"abstract":"Channel fading has been regarded as a negative factor for successful packet transmission. However, with deep fading, although collisions for a given transmission may exist, the capture effect can allow the transmission to succeed as long as the channel for the transmitted signal is strong enough and is weak enough for the interference signals. Accordingly, we propose an asynchronous medium access control (MAC) scheme that selects a packet with the highest success probability to be transmitted. We call this approach opportunistic interference management (OIM). The basic mechanism in OIM consists of probing the channel conditions for multiple neighbors concurrently, and then selecting to transmit those packets corresponding to the winners of the probing phase. OIM improves the probability of successful transmission and increases network throughput without adding extra delays for inter-nodal handshakes. Mathematical analysis and simulations are used to validate the advantages of OIM over the traditional packet-transmission scheme used in MAC protocols today.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123575905","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 : 2010-10-31DOI: 10.1109/MILCOM.2010.5679529
M. Veyseh, J. Garcia-Luna-Aceves, H. Sadjadpour
Multiuser Diversity Medium Access or MDMA is a new cross-layer channel allocation scheme that exploits channel fading diversity and attains concurrency utilizing OFDMA in single-radio ad hoc networks. Channel throughput is enhanced by enabling concurrent transmissions from multiple nodes to the same receiver or from a single transmitter to multiple receivers over orthogonal Subchannels. Also, concurrency is attained when two hop away neighbors can utilize the same subchannel to transmit data to nodes not neighboring the other two hop neighbor. Each subchannel uses a portion of the available bandwidth and contains a grouping of subcarriers or tones which are orthogonal carriers of lower-rate input data streams. A new subchannel assignment algorithm based on Gibbs sampling is presented. This algorithm operates alongside the proposed MAC signaling to distribute subchannels among nodes to exploit channel fading condition on each communication link and to minimize hidden terminal interference. The new MAC addresses the synchronization requirements of OFDMA and the needs of the subchannel assignment algorithm. We present simulation results on the throughput gains obtained with our design compared to traditional channel assignment techniques for multi-channel networks.
{"title":"Multi-user diversity in single-radio OFDMA ad hoc networks based on Gibbs sampling","authors":"M. Veyseh, J. Garcia-Luna-Aceves, H. Sadjadpour","doi":"10.1109/MILCOM.2010.5679529","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5679529","url":null,"abstract":"Multiuser Diversity Medium Access or MDMA is a new cross-layer channel allocation scheme that exploits channel fading diversity and attains concurrency utilizing OFDMA in single-radio ad hoc networks. Channel throughput is enhanced by enabling concurrent transmissions from multiple nodes to the same receiver or from a single transmitter to multiple receivers over orthogonal Subchannels. Also, concurrency is attained when two hop away neighbors can utilize the same subchannel to transmit data to nodes not neighboring the other two hop neighbor. Each subchannel uses a portion of the available bandwidth and contains a grouping of subcarriers or tones which are orthogonal carriers of lower-rate input data streams. A new subchannel assignment algorithm based on Gibbs sampling is presented. This algorithm operates alongside the proposed MAC signaling to distribute subchannels among nodes to exploit channel fading condition on each communication link and to minimize hidden terminal interference. The new MAC addresses the synchronization requirements of OFDMA and the needs of the subchannel assignment algorithm. We present simulation results on the throughput gains obtained with our design compared to traditional channel assignment techniques for multi-channel networks.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132683994","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 : 2010-10-01DOI: 10.1109/MILCOM.2010.5680358
J. Wessel, Bryce L. Meyer
The characterization of software performance (SWP) in complex, service-oriented architecture (SOA)-based system of systems (SoS) environments is an emergent study area. This report focuses on both qualitative and quantitative ways of determining the current state of SWP in terms of both test coverage (what has been tested) and confidence (degree of testing) for SOA-based SoS environments. Practical tools and methodologies are offered to aid technical and programmatic managers in the form of a stepwise methodology toward SWP selection. Included are system architecture design considerations, resource limiters of SWP, test event design considerations, organizational and process suggestions toward improved SWP management and a matrix of measurement suggestions. Assuring mission success; Network-centric systems and technologies; System-level modeling and simulation; System of systems (SoS);Service Oriented Architecture (SOA)
{"title":"Assessing system software performance in complex system of systems environments","authors":"J. Wessel, Bryce L. Meyer","doi":"10.1109/MILCOM.2010.5680358","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680358","url":null,"abstract":"The characterization of software performance (SWP) in complex, service-oriented architecture (SOA)-based system of systems (SoS) environments is an emergent study area. This report focuses on both qualitative and quantitative ways of determining the current state of SWP in terms of both test coverage (what has been tested) and confidence (degree of testing) for SOA-based SoS environments. Practical tools and methodologies are offered to aid technical and programmatic managers in the form of a stepwise methodology toward SWP selection. Included are system architecture design considerations, resource limiters of SWP, test event design considerations, organizational and process suggestions toward improved SWP management and a matrix of measurement suggestions. Assuring mission success; Network-centric systems and technologies; System-level modeling and simulation; System of systems (SoS);Service Oriented Architecture (SOA)","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115224296","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 : 2010-10-01DOI: 10.1109/MILCOM.2010.5680222
C. Kao, C. Robertson
The Joint Tactical Information Distribution System (JTIDS) is the communication terminal of Link-16. When the double-pulse structure is chosen to transmit the Link-16 data, JTIDS is a hybrid direct sequence/fast frequency-hopping spread spectrum system with a sequential diversity of two. To minimize the effect of pulsed-noise interference (PNI), a noise-normalized diversity combining MSK chip demodulator is assumed in the JTIDS receiver. The symbol error rate (SER) performance of a coherently detected JTIDS-type waveform for the double-pulse structure with noise-normalization combining (NNC) in PNI is investigated in this paper. To facilitate the evaluation, perfect frequency de-hopping, sequence synchronization, chip synchronization, and 32-chip sequence descrambling are assumed. Furthermore, maximum-likelihood chip detection is assumed rather than maximum-likelihood chip-sequence detection since the former represents a more practical assumption for a JTIDS signal. The results obtained with NNC are compared to those without NNC, as well as to those with perfect side information. The results show that for a coherently detected JTIDS-type waveform with the double-pulse structure, NNC effectively mitigates the system degradation caused by PNI.
{"title":"Performance of a JTIDS-type waveform with noise-normalization combining in pulsed-noise interference","authors":"C. Kao, C. Robertson","doi":"10.1109/MILCOM.2010.5680222","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680222","url":null,"abstract":"The Joint Tactical Information Distribution System (JTIDS) is the communication terminal of Link-16. When the double-pulse structure is chosen to transmit the Link-16 data, JTIDS is a hybrid direct sequence/fast frequency-hopping spread spectrum system with a sequential diversity of two. To minimize the effect of pulsed-noise interference (PNI), a noise-normalized diversity combining MSK chip demodulator is assumed in the JTIDS receiver. The symbol error rate (SER) performance of a coherently detected JTIDS-type waveform for the double-pulse structure with noise-normalization combining (NNC) in PNI is investigated in this paper. To facilitate the evaluation, perfect frequency de-hopping, sequence synchronization, chip synchronization, and 32-chip sequence descrambling are assumed. Furthermore, maximum-likelihood chip detection is assumed rather than maximum-likelihood chip-sequence detection since the former represents a more practical assumption for a JTIDS signal. The results obtained with NNC are compared to those without NNC, as well as to those with perfect side information. The results show that for a coherently detected JTIDS-type waveform with the double-pulse structure, NNC effectively mitigates the system degradation caused by PNI.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117115105","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 : 2010-10-01DOI: 10.1109/MILCOM.2010.5680114
Zhen Hu, N. Guo, R. Qiu
This paper investigates the transmitted waveform optimization issues for wideband Multiple Input Single Output (MISO) cognitive radio. For cognitive radio, a spectral mask for the transmitted waveform is determined on spectrum sensing, and arbitrary transmitted spectral shaping is required. Meanwhile, the interferences from primary radios should be canceled at the receiver of cognitive radio. The contribution of this paper is to optimize the MISO cognitive radio communication link by jointly considering the optimization objective, the spectral mask constraint at the transmitter and the interference cancellation at the receiver. Meanwhile, reduction in transmitted peak power and quantization is still very desirable, being concerned about implementation complexity and power consumption. These motive us to consider various practical constraints for waveform optimization in the context of MISO cognitive radio. A number of solutions are provided in this paper in conjunction with numerical results showing the optimal wideband waveforms.
{"title":"Wideband waveform optimization for multiple input single output cognitive radio with practical considerations","authors":"Zhen Hu, N. Guo, R. Qiu","doi":"10.1109/MILCOM.2010.5680114","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680114","url":null,"abstract":"This paper investigates the transmitted waveform optimization issues for wideband Multiple Input Single Output (MISO) cognitive radio. For cognitive radio, a spectral mask for the transmitted waveform is determined on spectrum sensing, and arbitrary transmitted spectral shaping is required. Meanwhile, the interferences from primary radios should be canceled at the receiver of cognitive radio. The contribution of this paper is to optimize the MISO cognitive radio communication link by jointly considering the optimization objective, the spectral mask constraint at the transmitter and the interference cancellation at the receiver. Meanwhile, reduction in transmitted peak power and quantization is still very desirable, being concerned about implementation complexity and power consumption. These motive us to consider various practical constraints for waveform optimization in the context of MISO cognitive radio. A number of solutions are provided in this paper in conjunction with numerical results showing the optimal wideband waveforms.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120896851","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 : 2010-10-01DOI: 10.1109/MILCOM.2010.5680416
H. Yao, Y. Kochman, G. Wornell
We focus on the problem of real-time streaming over a blockage channel with long feedback delay, as arises in real-time satellite communication from a comm-on-the-move (COTM) terminal. For this problem, we introduce a definition of delay that captures the real-time nature of the problem, which we show grows at least as fast as O(log(k)) for memoryless channels, where k corresponds to the number of packets in the transmission. Moreover, we show that a tradeoff exists between this delay and a natural notion of throughput that captures the bandwidth requirements of the communication. We develop and analyze an efficient “multi-burst” transmission protocol for achieving good delay-throughput tradeoffs within this framework, which we show can be augmented with coding for additional performance gains. Simulations validate the new protocols on channels with and without memory.
{"title":"Delay-throughput tradeoff for streaming over blockage channels with delayed feedback","authors":"H. Yao, Y. Kochman, G. Wornell","doi":"10.1109/MILCOM.2010.5680416","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680416","url":null,"abstract":"We focus on the problem of real-time streaming over a blockage channel with long feedback delay, as arises in real-time satellite communication from a comm-on-the-move (COTM) terminal. For this problem, we introduce a definition of delay that captures the real-time nature of the problem, which we show grows at least as fast as O(log(k)) for memoryless channels, where k corresponds to the number of packets in the transmission. Moreover, we show that a tradeoff exists between this delay and a natural notion of throughput that captures the bandwidth requirements of the communication. We develop and analyze an efficient “multi-burst” transmission protocol for achieving good delay-throughput tradeoffs within this framework, which we show can be augmented with coding for additional performance gains. Simulations validate the new protocols on channels with and without memory.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127506308","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
扫码关注我们
求助内容：
应助结果提醒方式：