{"title":"Data embedding for secure communications","authors":"J. Gibson, M.G. Kokes","doi":"10.1109/MILCOM.2002.1180476","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1180476","url":null,"abstract":"We expand on a new technique for embedding digital information into G.711 encoded speech signals for the purpose of secure data communication. Using the method of types as a tool to analyze the statistical nature of a digital speech signal, we demonstrate a scheme that is capable of embedding tip to 1.6 kbits/sec of additional information into a host signal at an average embedded error rate of 10/sup -4/. This additional bandwidth can be used for the purpose of secure communications and has some intrinsic properties that are very attractive for the proposed application. We suggest such a scheme as a possibility for use in existing telecommunications networks. The overall goal of this approach is to increase the data throughput of a given channel without increasing the transmitted data rate or changing the transmission codes, network protocols or source compression methods. In accomplishing this task, we offer the embedded data stream as a transport for an encrypted signal and argue that the resulting mechanism represents a quite natural multilevel approach to secure communication.","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133146819","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}
{"title":"Towards the scalable implementation of a user level anomaly detection system","authors":"R. Chinchani, S. Upadhyaya, K. Kwiat","doi":"10.1109/MILCOM.2002.1179706","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1179706","url":null,"abstract":"Traditional intrusion detection systems can be broadly classified as misuse and anomaly detectors. Misuse detectors attempt detection by matching the current system/user activity against known signatures and patterns. As opposed to this, anomaly detection works by developing a reference graph and comparing the ongoing activity against it. Any significant deviation is flagged as an intrusion. Anomaly detection is more promising because of its potential to detect unseen types of attacks. However, both techniques have conventionally relied on audit trails sampled deep inside the system via probes and the sheer size of the data allows only after-the-fact and off line detection. In recent past, there have been efforts to capture the semantics of system activity for more rapid detection and this can typically be done at levels closer to the user. In our earlier works related to this effort, we presented a scheme and a reasoning framework to detect intrusions based on the encapsulated user intent. This paper addresses the scalability and implementation aspects of the system by introducing concepts such as workspaces and meta-operations. Although this security system is a general anomaly detection system, it is amenable to operator fault recovery. While encryption provides secure communication channels, it leaves the end points exposed. Our security system has the additional capability of handling insider attacks relevant in this context.","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133768400","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}
{"title":"Reliable multicast for flat hierarchy networks based on adaptive air caching","authors":"K. Manousakis, J. Baras","doi":"10.1109/MILCOM.2002.1179666","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1179666","url":null,"abstract":"The evolution of satellite networks in the commercial and military world has pushed the research community towards the solution of important problems related to this kind of network. One of those important problems is how to design an efficient reliable multicast protocol in a network where there is no hierarchy involved, and the link presents characteristics like high propagation delay and high BER. The existing reliable multicast protocols cannot be applied in the case of flat hierarchy networks, since those are based on intermediate receivers and local recovery techniques. So, we introduce the air caching technique, which serves as a fast access memory that is realized on the air and contains packets for the recovery of corrupted or erroneous data packets at the receivers. In this paper we present some of the protocols that we designed and are based on air caching combined with FEC and ARQ. In the past we have presented protocols that are based on those techniques but the characteristics of the air cache were constant. In this paper we propose RM protocols, which are based on adaptive air caching, where the size and/or content of the air cache change dynamically based on feedback information. Our goal is to improve the delay and/or bandwidth usage characteristics of the nonadaptive air cache RM protocols.","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124237262","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}
{"title":"Multiple-access interference suppression for OFDM systems based on Doppler shifts","authors":"J. Namgoong, T. Wong, J. Lehnert","doi":"10.1109/MILCOM.2002.1180505","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1180505","url":null,"abstract":"We consider multiuser communications in an additive white Gaussian noise (AWGN) channel in the presence of significant Doppler shifts. It is well-known that the time asynchrony between users in a direct-sequence (DS) code-division multiple-access (CDMA) system allows for interference suppression. Similarly, the different Doppler shifts of received signals from a multiuser channel can be exploited in the frequency domain to achieve interference suppression. We show that this can be achieved with multicarrier CDMA (MC-CDMA). The relationship between the interference suppression capability and the Doppler shifts is studied in terms of signal-to-interference ratio (SIR).","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114369191","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}
{"title":"A QoS framework for heavy-tailed traffic over the wireless Internet","authors":"Z. Shao, U. Madhow","doi":"10.1109/MILCOM.2002.1179649","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1179649","url":null,"abstract":"In this paper, we propose a QoS framework for wireless data applications that accounts for the heavy-tailed nature of Internet traffic. Instead of the conventional wisdom of provisioning more conservatively for such traffic, we investigate scheduling strategies that implicitly penalize the long transactions (e.g., long file transfers) that contribute to the heavy tails, while providing good performance to short transactions (e.g., a short Web page download). The proposed framework is illustrated by the simple model of a bottleneck link, at which transactions (e.g., TCP connections) whose lengths follow a heavy-tailed distribution begin according to a Poisson process. The link scheduler we investigate is the foreground-background (FB) scheduler, which serves, in each transmission slot, the transaction that has received the least service thus far. Comparing the conventional round robin (RR) scheduler with the FB scheduler, we find that the FB scheduler requires much fewer network resources to attain a given QoS. After showing the efficacy of the FB scheduler for a single bottleneck link, we consider a wireless link shared by multiple users, where further gains are obtained by using multiuser diversity, exploiting the differences in the qualities of the channel seen by different users. We generalize our notion of QoS for this scenario, in a manner consistent with the notion of proportional fairness (PF), and investigate scheduling using an appropriate combination of PF across users, and FB across transactions for a given user.","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115061244","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}
{"title":"Turbo product coding in frequency-hop wireless communications with partial-band interference","authors":"M. Pursley, J. S. Skinner","doi":"10.1109/MILCOM.2002.1179571","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1179571","url":null,"abstract":"A class of turbo product codes is investigated for applications to slow-frequency-hop spread-spectrum communications over channels with partial-band interference and thermal noise. The partial-band interference is modeled as band-limited white noise, and decoders with and without side information are examined. The primary results are for noncoherent demodulation of binary orthogonal signals, but results are also presented for coherent demodulation of antipodal signals. Comparisons with previous results for other turbo codes are presented. It is shown that, in some situations, a system with a commercial off-the-shelf turbo product code achieves performance that is better than previously published results for parallel-concatenated turbo codes of approximately the same rate. It is also shown that the performance of the commercial decoder can be enhanced by the use of side information that is developed in the demodulator.","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117258894","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}
Peter Sholander, Andreas Yankopolus, Paul Coccoli, Siamak S. Tabrizi
{"title":"Experimental comparison of hybrid and proactive MANET routing protocols","authors":"Peter Sholander, Andreas Yankopolus, Paul Coccoli, Siamak S. Tabrizi","doi":"10.1109/MILCOM.2002.1180495","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1180495","url":null,"abstract":"The paper describes an experimental implementation of a QoS-aware hybrid routing protocol that uses a flexible mix of proactive and reactive routing techniques within mobile ad hoc networks (MANETs). After a brief review of the benefits and applications of proactive, reactive (on-demand) and hybrid routing, the architectural details and protocol operation of Scientific Research Corporation's \"wireless ad hoc routing protocol\" (WARP) are given. The paper then discusses the laboratory testing methodology used during the development of WARP, and gives an experimental comparison of WARP with a proactive routing protocol, namely optimized link state routing (OLSR).","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124133926","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}
{"title":"Middleware-based approach for preventing distributed deny of service attacks","authors":"Wei Yu, D. Xuan, Wei Zhao","doi":"10.1109/MILCOM.2002.1179635","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1179635","url":null,"abstract":"We extend our previous study on VPOE (virtual private operation environment) to provide DDOS (distributed denial of service) prevention in a distributed heterogeneous environment (Wei Yu et al., IEEE Trans. on Systems, Man, and Cybernetics, 2002). We introduce our integrated middleware-based defense system to support this service by studying two important components, middleware box and domain agent. Our technology includes the following: (1) we adopt network-based middlewares which are realized by special devices inserted in various locations of the network and which cooperate to achieve the defense mission objectives; (2) we take generic primitive and role-based approaches; with network primitives, middlewares are programmable entities and can change their roles during the system run-time according to the system defense requirements; (3) we take generic signaling control protocols by which middlewares can cooperate with each other effectively to achieve the high defense performance globally. Middlewares provide transparent services to applications and make our solution both upward and downward compatible. Thus, our technology can easily be deployed with the current infrastructures. By using the generic middleware box control protocols and network primitives, the middleware boxes can cooperatively share the countermeasure information and easily change their roles in run-time to prevent DDOS attacks efficiently. In this sense, our defense system can adaptively deploy the defense strategy according to the dynamic network attack situation. As a result, our technology is effective and can be used in a large system.","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774566","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}
{"title":"Performance analysis of a new header compression scheme for TCP streams in IP based wireless networks","authors":"P. Camarda, S. Petrizzelli","doi":"10.1109/MILCOM.2002.1180453","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1180453","url":null,"abstract":"In this paper, a new header compression scheme for TCP streams, as a specific header compression profile within the IETF ROHC platform, is proposed and analyzed through simulations by the Network Simulator. The proposed scheme is based on the distinct management of DATA and ACK streams associated to the TCP connection and it exploits a robust header encoding technique (W-LSB) for reducing the effect of error propagation. The achieved results, in terms of throughput, overhead and goodput, reported as a function of bandwidth and BER and compared with the results obtained without compression, allow its to evaluate the performance of the proposed compression scheme in a realistic and dynamic environment.","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128425200","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}
{"title":"Adaptive, iterative, reduced-rank equalization for MIMO channels","authors":"Yakun Sun, M. Honig, V. Tripathi","doi":"10.1109/MILCOM.2002.1179617","DOIUrl":"https://doi.org/10.1109/MILCOM.2002.1179617","url":null,"abstract":"We present an adaptive iterative (turbo) decision feedback equalizer (DFE) for multi-input multi-output (MIMO) channels with intersymbol interference (ISI) and multiple receiver antennas. After initial training, the filters are computed directly from the received data and soft outputs of the MAP decoder according to a least squares (LS) cost criterion. The performance is compared with reduced-rank LS estimation methods, based on the multistage Wiener filter (MSWF). Numerical results show that the reduced-rank turbo DFE provides a substantial performance improvement relative to the full-rank turbo DFE with limited training. In addition, the reduced-rank filters can significantly reduce the computational complexity when the number of filter coefficients is large.","PeriodicalId":191931,"journal":{"name":"MILCOM 2002. Proceedings","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127352798","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}