{"title":"Statistical-QoS based gaming for optimal power allocations over virtualized wireless relay networks supporting multimedia services","authors":"Qixuan Zhu, Xi Zhang","doi":"10.1109/MILCOM.2015.7357434","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357434","url":null,"abstract":"Cooperative communication is one of the efficient techniques to support statistical delay-bounded quality-of-service (QoS) multimedia (audio/video) services over mobile wireless networks by employing relay nodes, which forward the signal received from source node to the destination. Wireless network virtualization provides another efficient technique to implement the data transmissions by enabling multiple virtual wireless networks (VWNs) to be mapped onto one physical substrate wireless network (SWN), increasing the utilization efficiency of SWN. Applying the cooperative communication to virtual wireless networks provides a significant improvement on time-sensitive multimedia services in order to support the diverse quality of service requirements over mobile wireless networks. One of the most important challenges of this application lies in how to efficiently allocate the wireless resources of physical wireless networks to the multiple virtual wireless network users, taking into account the statistical delay-bounded QoS for the multimedia information transmission. To overcome this difficulty, in this paper we propose a novel game-theory based scheme to resolve the wireless resources allocation problem in terms of transmit power, aiming at maximizing the effective-capacity to guarantee the statistical delay-bounded QoS for wireless multimedia communications. We formulate this wireless resources allocation problem as follows. A mobile user starts with asking for the cooperation from the other virtual users in the same virtual network to be as its relay nodes. When at least one virtual user agrees to cooperate, the mobile user executes the following two gaming processes. First, the mobile user bids for the source-node-transmit-power resources from SWN. Second, at the same time the mobile user bids for the relay-transmit-power from those cooperated virtual users, coordinating with the first bid strategies to maximize its payoff (performance-gain minus cost) in each bid round. The extensive simulation results obtained validate and evaluate our proposed schemes.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124911492","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}
Ankush Singla, Anand Mudgerikar, I. Papapanagiotou, A. Yavuz
{"title":"HAA: Hardware-Accelerated Authentication for internet of things in mission critical vehicular networks","authors":"Ankush Singla, Anand Mudgerikar, I. Papapanagiotou, A. Yavuz","doi":"10.1109/MILCOM.2015.7357624","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357624","url":null,"abstract":"Modern vehicles are being equipped with advanced sensing and communication technologies, which enable them to connect to surrounding entities. In military vehicular networks, it is vital to prevent adversaries from manipulating critical messages via cryptographic protection (e.g., digital signatures) and at the same time to minimize the impact introduced by crypto operations (e.g., delay). Hence, their communication must be delay-aware, scalable and secure. In this paper, we developed Hardware-Accelerated Authentication (HAA) that enables practical realization of delay-aware signatures for vehicular networks. Specifically, we developed a cryptographic hardware-acceleration framework for Rapid Authentication (RA) [1], which is a delay-aware offline-online signature scheme for command and control systems. We showed that HAA can significantly improve the performance of offline-online constructions under high message throughput, which is an important property for vehicular networks. HAA-2048 (GPU) is ×18, ×6, and ×3 times faster than the current CPU implementation of RSA, ECDSA and RA, respectively, for the same level of security.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114262186","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":"Resilient internetwork routing over heterogeneous mobile military networks","authors":"L. Landmark, Erlend Larsen, M. Hauge, Ø. Kure","doi":"10.1109/MILCOM.2015.7357474","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357474","url":null,"abstract":"Mobile networks in the military tactical domain, include a range of radio networks with very diverse characteristics and which may be employed differently from operation to operation. When interconnecting networks with dissimilar characteristics (e.g. capacity, range, mobility) a difficult trade-off is to fully utilize the diverse network characteristics while minimizing the cost. To support the ever increasing requirements for future operations it is necessary to provide tools to quickly alter the rule-set during an ongoing operation, due to a change in operation and/or to support different needs. Our contribution is a routing protocol which targets these challenges. We propose an architecture to connect networks with different characteristics. One key point is that low capacity links/networks segments can be included in the heterogeneous network, these segments are protected from overload by controlling where and when signaling/data traffic is sent. The protocol supports traffic policing, including resource reservation. The other key point is the ability to quickly alter the network policy (rules-set) including QoS support during an operation or from operation to operation.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128472483","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}
Zheng Chang, Qianqian Zhang, Xijuan Guo, Zhenyu Zhou, T. Ristaniemi
{"title":"Energy efficient resource allocation for OFDMA two-way relay networks with channel estimation error","authors":"Zheng Chang, Qianqian Zhang, Xijuan Guo, Zhenyu Zhou, T. Ristaniemi","doi":"10.1109/MILCOM.2015.7357502","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357502","url":null,"abstract":"In this work, we consider the practical issues of resource allocation problem in OFDMA two-way relay networks: the inaccuracy of channel-state information (CSI) available to the transmitters. Instead, only the estimated channel status is known by the transmitters. In this context, a joint optimization of subcarrier pairing and allocation, relay selection and transmit power allocation is formulated in the OFDMA two-way amplify-and-forward relay networks. Moreover, to ensure the Quality of Service (QoS) requirement, the energy consumption must be minimized without compromising the QoS. Therefore, by applying convex optimization techniques, energy efficient algorithms are developed with the objective to minimize the total transmit power while guaranteeing the required data rates. Through simulation studies, energy consumption performance of the systems under the proposed schemes are investigated. It is shown that the proposed scheme can improve the energy consumption performance without scarifying the QoS.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126253437","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":"PIM-MANET: Extension to PIM for multicast routing in MANETs","authors":"R. Amin, G. Kuperman","doi":"10.1109/MILCOM.2015.7357428","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357428","url":null,"abstract":"This paper presents a novel multicast routing protocol for wireless mobile ad hoc networks (MANETs) that uses distribution trees to efficiently forward multicast traffic. The proposed multicast routing protocol is built as a MANET extension to the popular Protocol Independent Multicast (PIM) routing protocol used in wired networks; hence, we call our scheme PIM-MANET. Similar to PIM, PIM-MANET is agnostic of the unicast routing protocol that is used to connect users in the network. PIM-MANET extends PIM to the wireless domain by implementing required features such as Duplicate Packet Detection (DPD) to avoid routing loops, removing extraneous messaging, and using a novel tree creation mechanism to form multicast trees that achieve better performance in presence of asymmetric links. We implement the PIM-MANET protocol as a routing daemon for the Linux environment and show the benefits of our approach over currently used MANET multicast protocols.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131744505","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. Horsmanheimo, A. Hujanen, L. Tuomimäki, Jarkko Kylmala
{"title":"CAST - RCS tool for modelling versatile size targets","authors":"S. Horsmanheimo, A. Hujanen, L. Tuomimäki, Jarkko Kylmala","doi":"10.1109/MILCOM.2015.7357588","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357588","url":null,"abstract":"Radar cross section (RCS) and inverse synthetic aperture radar (ISAR) are two important application areas for computation intensive RCS tools. Their objective is to control RCS signature in case of different types of mono-static and bistatic radars. To follow the quick development of radar technology, we need more flexible and more accurate RCS calculation tools. In this paper, we introduce CAST application and its techniques to compute RCS of different sized objects and their surroundings. For RCS and SAR analysis, we have added environment as a new spatiotemporal parameter in addition to traditional material and geometry design parameters.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133723511","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":"On capacity merits of spectrally efficient FDM","authors":"David Rainnie, Yi Feng, J. Bajcsy","doi":"10.1109/MILCOM.2015.7357506","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357506","url":null,"abstract":"This paper explores the potential benefit of recently proposed spectrally-efficient frequency-division multiplexing systems (SEFDM), when compared to traditional orthogonal frequency-division multiplexing (OFDM) systems. First, the considered SEFDM channel model is described, then we obtain an expression for the capacity of this channel in case of un-precoded transmission. We evaluate the channel capacity for various practical continuous-time modulation pulses. Numerical capacity results indicate that SEFDM can lead to channel capacity improvement over OFDM for some considered pulses, especially at relatively high SNR's.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"22 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116825169","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":"Augmenting OLSR with Priority Aware Dynamic Routing for heterogeneous networking","authors":"G. Elmasry, Benjamin J. Haan, R. J. McCabe","doi":"10.1109/MILCOM.2015.7357476","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357476","url":null,"abstract":"Optimized Link State Routing (OLSR) has many advantages over other routing protocols for use within MANETs. However, it also has its limitations and cannot easily adapt in real time to the highly dynamic nature of heterogeneous military MANETs. This paper discusses the augmentation of OLSR with a reactive routing algorithm referred to as Priority Aware Dynamic Routing (PADR). PADR along with OLSR forms a hybrid routing approach where routes may be chosen based on metrics that are difficult to account for by proactive routing alone; such as mobility, changing mission needs, dynamic resource allocation, and RF contention. The proposed hybrid approach is designed to operate at the cipher text IP layer and is capable of routing over a single MANET subnet or over multiple heterogeneous subnets.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127279918","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 distributed storage for information dissemination and retrieval at the tactical edge","authors":"R. Johnston, Sun-il Kim","doi":"10.1109/MILCOM.2015.7357419","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357419","url":null,"abstract":"Information (and its timely delivery) has always been one of the most critical tactical assets. Today, we have the technology to deploy data collection and retrieval systems all the way from mission headquarters down to the lowest levels of echelon. Due to the lower echelons proximity to the adversary, protecting the information is one of the most important issues in designing such systems. In this paper, we describe a secure distributed storage scheme to be used especially at and near the tactical edge. The scheme does so through a peer-to-peer overlay and storage protocol designed to run on existing networked systems. We utilize a structured overlay that is dynamically organized in a layered, hierarchical manner based on the existing military command structure (e.g. fire-team, squad, battalion, etc.). These layers are used as storage sites for pieces of data near the layer at which that data is needed. The data is generated and distributed via an information dispersal algorithm (IDA) utilizing an erasure code such as the common Cauchy Reed-Solomon (RS). Through the use of this IDA, the data pieces are organized across neighboring layers to maximize locality. This organization also prevents a compromise within one layer from compromising data in that layer. Multiple layers would have to be compromised for a single datum to become compromised. As a result, both security and survivability of the data is improved compared to the typical remote server-client model. We present an overview of this approach along with our experimental results on hardware performance of commercial off-the-shelf (COTS) mobile devices. The recorded overhead (encoding/ decoding times and associated data sizes) show that such a scheme can be utilized with little increase in overall latency.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129264154","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}
Ahmed H. Anwar, Janiece Kelly, George K. Atia, Mina Guirguis
{"title":"Stealthy edge decoy attacks against dynamic channel assignment in wireless networks","authors":"Ahmed H. Anwar, Janiece Kelly, George K. Atia, Mina Guirguis","doi":"10.1109/MILCOM.2015.7357521","DOIUrl":"https://doi.org/10.1109/MILCOM.2015.7357521","url":null,"abstract":"Dynamic channel assignment algorithms allow wireless nodes to select their communication channels based on the state of the network to reduce interference between the nodes and improve the overall network performance. They have been shown to outperform static channel assignment policies and thus are playing a critical role in Software Defined Networks (SDNs). In this paper, we examine the security of dynamic channel assignment algorithms against stealthy decoy attacks in which the attacker induces channel conflicts on a selective set of edges. When an edge is attacked, the victim nodes search for and switch to a different channel to use, possibly causing their neighbors to switch as well. As the effect of the attack propagates through the network, the performance of the network is severely degraded. The decisions of which edges to attack and what channels to use in creating conflicts are the solutions of various Markov Decision Processes (MDP) problems in which the attacker's goal is to maximize the number of conflicts in the network subject to an attack cost. We apply approximate policy iteration methods to identify suboptimal, albeit efficient, attack policies. Our results show that our exposed attack policy outperforms other attack policies and adapts to the cost of the attack.","PeriodicalId":241952,"journal":{"name":"MILCOM 2015 - 2015 IEEE Military Communications Conference","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122654984","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}