B. Adamson, Ta Chen, M. Fecko, I. Hokelek, M. Kaplan, S. Samtani, C. Shah
{"title":"A case study of emulation workflow: From scenario definition to route analysis in tactical wireless mobile networks","authors":"B. Adamson, Ta Chen, M. Fecko, I. Hokelek, M. Kaplan, S. Samtani, C. Shah","doi":"10.1109/MILCOM.2010.5680353","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680353","url":null,"abstract":"In this paper1, we present a case study of emulation workflow in tactical wireless mobile network. The main contribution of this paper is an XML schema which has been recently developed by the Naval Research Laboratory (NRL) to support high level scenario definition for mobile network emulators in a tool independent manner. In the scenario definition phase, a high level mobility scenario defined using the NRL's XML schema is converted to WISER's run-time emulation files. Using the nodes' locations and terrain information, the RF module performs the relevant calculations and outputs a topology script that depicts node positions and link characteristics (i.e. bandwidth, BER) for all node pairs. To demonstrate emulation scenario definition workflow, Dynamic Routing Control Agent (DRCA) along with the snapshot generation tool is selected as a case study. DRCA, which is a run-time agent, monitors network topology, traffic and capacity and sets the OSPF link metrics dynamically to control routing paths. A snapshot generation tool is integrated with the WISER SDT to identify significant changes in the network. An objective is to identify a small but representative set of snapshots that capture all of the key changes in network topology over the course of a scenario. The above mentioned tools, which are integrated within the WISER SDT, are used to define and analyze DRCA scenarios for the WISER emulation system. EMANE emulation workflow is also described to demonstrate that the NRL's emulation script schema can be used to define scenarios in a tool independent manner.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122750920","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":"Secure software attestation for military telesurgical robot systems","authors":"Kyle Coble, Weichao Wang, Bill Chu, Zhiwei Li","doi":"10.1109/MILCOM.2010.5679580","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5679580","url":null,"abstract":"Telesurgical robot systems (TRS) are often deployed in unattended environments such as battlefields or rural areas. Therefore, adversaries can easily access the devices, compromise the system, and install their own malware. If the integrity and health of the system software and configuration files are not verified before their usage, the safety and lives of the injured soldiers and patients may be in danger. Many existing software attestation mechanisms depend on the calculation delay to distinguish a correct memory image from a compromised system. We cannot directly apply this technique to transcontinental TRS when we consider the long transmission delay between the verifier and the prover. In this paper, we propose a software attestation mechanism that can distinguish between these two kinds of delay. A secure communication protocol among the verifier, telesurgical robot, and secure token of the remote medical personnel is designed. The safety of the approach is analyzed and its overhead is evaluated.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123801186","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":"Anonymity under flow insertion: A game theoretic approach","authors":"P. Venkitasubramaniam","doi":"10.1109/MILCOM.2010.5680085","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680085","url":null,"abstract":"The problem of anonymous wireless networking is considered when an adversary is capable of controlling a subset of routes in the network. For a desired quality-of-service (QoS), as measured by network throughput, the problem of maximizing anonymity is studied from a game-theoretic perspective. Anonymity is quantified using conditional entropy of the routes given the adversary's observation. The problem of optimizing anonymity is posed as a two player zero-sum game between the network designer and the adversary; the task of the adversary is to choose a subset of flows to control so that anonymity of routes is minimum whereas the task of the network designer is to maximize anonymity by choosing a subset of nodes to evade flow detection by generating independent transmission schedules. It is shown that a unique Nash equilibrium exists for the game in the class of randomized strategies. The Nash equilibrium conditions are then used to derive properties of the optimal strategies of the network designer and the adversary.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126288069","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}
N. Robert, J. Macker, D. Millar, C. R. William, I. Taylor
{"title":"XO: XMPP overlay service for distributed chat","authors":"N. Robert, J. Macker, D. Millar, C. R. William, I. Taylor","doi":"10.1109/MILCOM.2010.5680094","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680094","url":null,"abstract":"This work discusses the adaptation of group-oriented messaging and chat technology for operation in server-less, multicast-capable mobile wireless architectures. The main goals are to allow group messaging and chat sessions to fragment/coalesce, operate through disrupted TCP conditions, and improve bandwidth utilization when multicast is available. In addition, the solution demonstrates proxying and gateway methods to interoperate with existing client and server standards and software. The approach presents several innovations that extend and adapt eXtensible Messaging and Presence Protocol (XMPP) standards for incorporating group serverless chat and messaging within more challenging operational environments. While there is large body of work on messaging middleware solutions, this paper concentrates on the adaptation of specific XMPP standards for serverless, multicast operation. We discuss our working implementation prototype and present initial experimentation comparing client/server multi-user chat (MUC) operation to serverless multicast MUC within several mobile network scenarios. In addition, we demonstrate a gatewaying solution for serverless MUC systems to interoperate with conventional MUC server-based systems. The specific test scenarios are instrumented to operate within a wireless mobile emulation environment using mobile ad hoc network (MANET) unicast and multicast routing technology. This approach remains independent of any particular routing algorithm and the proxied XMPP protocol module allows for the deployment of existing real-world client software across all nodes of the network. The initial findings show the significant performance potential for serverless MUC extensions. In addition to these results, we discuss some ongoing design challenges and future planned work.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129587459","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":"Robust Training of a link adaptation cognitive engine","authors":"I. V. Haris, R. Buehrer","doi":"10.1109/MILCOM.2010.5680154","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680154","url":null,"abstract":"In this paper, we provide a new perspective and insight into the process of finding the maximal performing method using a Cognitive Engine (CE) for link adaptation. It is found that near maximal performance can be reached relatively fast, even when a small number of the available communication methods provide adequate performance. The parameters that affect the expected number of trials are fully discussed along with analytical and simulation results. Finally, we provide the novel Robust Training Algorithm (RoTA), which given at least one method that exceeds the minimum performing requirements, adaptively maintains a communication link with the minimum required performance. The RoTA allows the CE to both continue learning and maintain a stable link for mission-critical applications1.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129727325","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}
H. Agrawal, J. Alberi, L. Bahler, William Conner, Josephine Micallef, Alexandr Virodov, R. S. Shane
{"title":"Preventing insider malware threats using program analysis techniques","authors":"H. Agrawal, J. Alberi, L. Bahler, William Conner, Josephine Micallef, Alexandr Virodov, R. S. Shane","doi":"10.1109/MILCOM.2010.5679584","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5679584","url":null,"abstract":"Current malware detection tools focus largely on malicious code that is injected into target programs by outsiders by exploiting inadvertent vulnerabilities such as failing to guard against a buffer overflow or failure to properly validate a user input in those programs. Hardly any attention is paid to threats arising from software developers, who, with their intimate knowledge of the inner workings of those programs, can easily sneak logic bombs, Trojan horses, and backdoors in those programs. Traditional software validation techniques such as testing based on user requirements are unlikely to detect such malware, because normal use cases will not trigger them and thus will fail to expose them. The state-of-the-art in preventing such malware involves manual inspection of the target program, which is a highly tedious, time consuming, and error prone process. We propose a dynamic, test driven approach that automatically steers program analysts towards examining and discovering such insider malware threats. It uses program analysis techniques to identify program parts whose execution automatically guarantees execution of a large number of previously unexplored parts of the program. It effectively leads analysts into creating test cases which may trigger, in a protected test environment, any malware code hidden in that application as early as possible, so it can be removed from the application before it is deployed in the field. We also present a tool that helps translate this approach into practice.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129450934","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}
S. Mo, J. Gu, R. Ghanadan, M. Sherman, J. Farkas, J. Tranquilli, J. Niedzwiecki, B. Fette
{"title":"Multiuser detection enabled medium access control in mobile ad hoc networks","authors":"S. Mo, J. Gu, R. Ghanadan, M. Sherman, J. Farkas, J. Tranquilli, J. Niedzwiecki, B. Fette","doi":"10.1109/MILCOM.2010.5680185","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680185","url":null,"abstract":"Increasing spectral efficiency has been a constant challenge in wireless communications. Many military and commercial applications require that wireless networks operate in dynamic environments and provide high data rates. Multiuser detection (MUD) has been demonstrated to increase spectral efficiency by increasing spectrum reuse. Most MUD research to date has focused on the physical layer (PHY) technology. Our research has focused on design of an efficient wireless media access controller (MAC) for MUD enabled mobile ad-hoc networks (MANET). Beyond MUD, other issues addressed in this design include overhead efficiency, optimization of dynamic resource allocation, and support for dense topologies, mobility, scalability, and Quality of Service (QoS). The MAC design is used in the DARPA Interference Multiple Access (DEVIA) communications program. In this paper, a frame structure and architecture of the MAC design are presented. Technical challenges are discussed and motivating factors behind the design are highlighted. The MAC described in this paper has been prototyped and demonstrated in laboratory environment and field trial. Some test results are presented.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128241107","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}
I. de Arriba-Ruiz, F. Pérez-Martínez, J. Muñoz-Ferreras
{"title":"Multipath reflectivity estimation in urban environments for Synthetic Aperture Radar images","authors":"I. de Arriba-Ruiz, F. Pérez-Martínez, J. Muñoz-Ferreras","doi":"10.1109/MILCOM.2010.5680189","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680189","url":null,"abstract":"Synthetic Aperture Radar (SAR) images a target region reflectivity function in the multi-dimensional spatial domain of range and cross-range. SAR synthesizes a large aperture radar in order to achieve a finer azimuth resolution than the one provided by any on-board real antenna. Conventional SAR techniques assume a single reflection of transmitted waveforms from targets. Nevertheless, today's new scenes force SAR systems to work in urban environments. Consequently, multiple-bounce returns are added to direct-scatter echoes. We refer to these as ghost images, since they obscure true target image and lead to poor resolution. By analyzing the quadratic phase error (QPE), this paper demonstrates that Earth's curvature influences the defocusing degree of multipath returns. In addition to the QPE, other parameters such as integrated sidelobe ratio (ISLR), peak sidelobe ratio (PSLR), contrast (C) and entropy (E) provide us with the tools to identify direct-scatter echoes in images containing undesired returns coming from multipath.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124588019","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":"Hybrid opportunistic spectrum access and power allocation for secondary link communication","authors":"Q. Jin, Haixia Zhang, D. Yuan","doi":"10.1109/MILCOM.2010.5680305","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680305","url":null,"abstract":"In cognitive radio (CR) system, the spectrum band licensed to the primary link (PL) is usually divided into multiple sub-channels. Traditionally, the secondary link (SL) accesses the primary spectrum by either opportunistically selecting the idle sub-channels, called opportunistic spectrum access (OSA), or coexisting with the PL in the same band, called spectrum sharing (SS). In this paper, we propose a hybrid opportunistic spectrum access (H-OSA) scheme, in which the SL has the opportunity to access all the sub-channels based on the activity and interference threshold of the PL. Based on the lagrange dual-decomposition theory, the optimal power solution on each sub-channel is derived to maximize the ergodic capacity of the SL. Two cases are studied, i) perfect channel state information (CSI) is available at the SL, and ii) the SL has only imperfect CSI of the interference channels. The SL performance is analysed versus different activity and interference threshold of the PL. Our results indicate that the proposed scheme indeed improves the ergodic capacity of secondary link.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124952202","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":"Multistage cooperative broadcast using amplify-and-forward relays","authors":"Bhargava Yammanuru, B. Sirkeci-Mergen","doi":"10.1109/MILCOM.2010.5680475","DOIUrl":"https://doi.org/10.1109/MILCOM.2010.5680475","url":null,"abstract":"In this work we study the propagation of the signal in a cooperative network where a single source message is retransmitted by multiple stages (levels) of relays. Relays are assumed to have limited computational abilities and hence adopt the amplify-and-forward scheme. At each node, cooperative diversity is obtained by combining the signals from the multiple levels of relays (in different time slots) using a matched !lter. The levels are not predetermined and are formed based on the local decisions, hence the network is distributed. The retransmission criterion is based on the SNR (Signal-to-Noise Ratio) of the signal after the matched !ltering operation. If the received SNR is greater than the SNR threshold then the signal is retransmitted. The parameter SNR threshold plays a critical role in determining the broadcast rate. We provide the expressions for received signal at each node as the message is forwarded in the network. We study the channel and noise statistics for a speci!c realization of a network. We also recursively characterize the effective channel, accumulated noise and their statistics. Through these formulations, we study the effects of noise accumulation, the number of levels used in the signal combination, the decoding and retransmission threshold on the number of nodes that successfully receive the message.","PeriodicalId":330937,"journal":{"name":"2010 - MILCOM 2010 MILITARY COMMUNICATIONS CONFERENCE","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131303833","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}