Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415810
J. Sliwa, B. Jasiul
This article tackles the problem of supplying the low level commanders with information from information sources located on higher command levels, distributed using Web services, the most commonly used technology in modern command and control systems. There has been proposed the Adaptation Framework For Web Services Provision (AFRO) that defines a mechanism for effective Web services invocation in tactical networks, which are considered disadvantaged in terms of available throughput, delay and error rate. Its implementation, in the form of AFRO Proxy performs so called adaptation actions, which are modifications of the SOAP XML messages by changing their encoding to more efficient or dropping information that are accepted to be removed by the service requester. The proposed adaptation mechanism gives promising effects for low level commanders located at the battlefield. They can be supplied with information generally available on high command levels, which, up to now, were very rarely distributed to tactical networks.
{"title":"Efficiency of dynamic content adaptation based on semantic description of web service call context","authors":"J. Sliwa, B. Jasiul","doi":"10.1109/MILCOM.2012.6415810","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415810","url":null,"abstract":"This article tackles the problem of supplying the low level commanders with information from information sources located on higher command levels, distributed using Web services, the most commonly used technology in modern command and control systems. There has been proposed the Adaptation Framework For Web Services Provision (AFRO) that defines a mechanism for effective Web services invocation in tactical networks, which are considered disadvantaged in terms of available throughput, delay and error rate. Its implementation, in the form of AFRO Proxy performs so called adaptation actions, which are modifications of the SOAP XML messages by changing their encoding to more efficient or dropping information that are accepted to be removed by the service requester. The proposed adaptation mechanism gives promising effects for low level commanders located at the battlefield. They can be supplied with information generally available on high command levels, which, up to now, were very rarely distributed to tactical networks.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"23 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84265690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415606
P. Charlesworth, S. M. Allen
Airborne communications nodes are often proposed as a component in future communications networks. This paper proposes that, in any ground network served by such a node, there is an optimum location for an airborne communications node. The paper examines the example of a Medium Altitude/Long Endurance (MALE) UAV carrying an airborne communications node which supports a community of mobile subscribers. Consider the case of a power-limited communications payload being flown on a UAV in support of a large community of mobile subscribers. Each subscriber is connected to the UAV payload by a two-way radio link. Radio links are only activated when there is traffic to be exchanged, thus the RF power demanded from the payload is changing regularly. An algorithm has been developed which attempts to maximize coverage of the subscriber community by moving the UAV between waypoints at which coverage is maximized. The algorithm, called Select Locally Optimum Waypoints (SLOW), estimates the future locations of subscribers from historic traffic and location data, and uses this information to move to waypoints at which the greatest number of links can be supported within the available RF power, and to the required signal quality. This improves the overall coverage of the subscriber community. This paper considers the performance of the algorithm in different conditions. Initially the performance of the algorithm is assessed against the maximum RF power available from the payload. The paper considers the case where all subscribers are given equal weighting, and then addresses the case where 20% of subscribers are given priority access to the payload. The paper also considers how the algorithm responds to different traffic patterns and concludes with a brief assessment of the airspace implications of allowing the UAV to track the mobile subscribers.
{"title":"Use of dynamic flight paths to enhance support to priority subscribers on a communications UAV","authors":"P. Charlesworth, S. M. Allen","doi":"10.1109/MILCOM.2012.6415606","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415606","url":null,"abstract":"Airborne communications nodes are often proposed as a component in future communications networks. This paper proposes that, in any ground network served by such a node, there is an optimum location for an airborne communications node. The paper examines the example of a Medium Altitude/Long Endurance (MALE) UAV carrying an airborne communications node which supports a community of mobile subscribers. Consider the case of a power-limited communications payload being flown on a UAV in support of a large community of mobile subscribers. Each subscriber is connected to the UAV payload by a two-way radio link. Radio links are only activated when there is traffic to be exchanged, thus the RF power demanded from the payload is changing regularly. An algorithm has been developed which attempts to maximize coverage of the subscriber community by moving the UAV between waypoints at which coverage is maximized. The algorithm, called Select Locally Optimum Waypoints (SLOW), estimates the future locations of subscribers from historic traffic and location data, and uses this information to move to waypoints at which the greatest number of links can be supported within the available RF power, and to the required signal quality. This improves the overall coverage of the subscriber community. This paper considers the performance of the algorithm in different conditions. Initially the performance of the algorithm is assessed against the maximum RF power available from the payload. The paper considers the case where all subscribers are given equal weighting, and then addresses the case where 20% of subscribers are given priority access to the payload. The paper also considers how the algorithm responds to different traffic patterns and concludes with a brief assessment of the airspace implications of allowing the UAV to track the mobile subscribers.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"16 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84460145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415870
Chitradeep Majumdar, S. Merchant, U. Desai
This paper proposes novel relaying schemes based on recently proposed Modified Alamouti Code and Time Switch Space Time Coding for a homogeneous sensor network architecture. New relaying schemes based on the incorporation of aforementioned techniques in a Sensor Network framework are considered. An exhaustive analysis in terms of the total energy consumption and delay characteristics as performance metric is investigated and quantified both for stand alone and clustered sensor networking scenario. Variable Rate M-QAM modulation schemes are considered for varying gateway distances. It is observed that for the standalone case, the proposed schemes can provide significant savings in terms of energy consumption as compared to non cooperative mode and conventional Alamouti scheme. For clustered case, conventional Alamouti based scheme outperforms the proposed relaying scheme up to a certain critical threshold distance beyond which the M-Alamouti based relaying schemes becomes slightly more efficient by 16 % when we have a single antenna gateway and cluster distance is 100m and gateway distance is 500 meter. Similar trend is observed when the distance between the clusters is increased from 100 to 200 meters. For a system with gateway having single and dual antennas the energy efficiency with respect to a non cooperative single antenna gateway system falls typically within a window of 70 to 90% for long haul distances around 320 m onwards.
{"title":"Novel energy efficient relaying schemes for wireless sensor networks","authors":"Chitradeep Majumdar, S. Merchant, U. Desai","doi":"10.1109/MILCOM.2012.6415870","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415870","url":null,"abstract":"This paper proposes novel relaying schemes based on recently proposed Modified Alamouti Code and Time Switch Space Time Coding for a homogeneous sensor network architecture. New relaying schemes based on the incorporation of aforementioned techniques in a Sensor Network framework are considered. An exhaustive analysis in terms of the total energy consumption and delay characteristics as performance metric is investigated and quantified both for stand alone and clustered sensor networking scenario. Variable Rate M-QAM modulation schemes are considered for varying gateway distances. It is observed that for the standalone case, the proposed schemes can provide significant savings in terms of energy consumption as compared to non cooperative mode and conventional Alamouti scheme. For clustered case, conventional Alamouti based scheme outperforms the proposed relaying scheme up to a certain critical threshold distance beyond which the M-Alamouti based relaying schemes becomes slightly more efficient by 16 % when we have a single antenna gateway and cluster distance is 100m and gateway distance is 500 meter. Similar trend is observed when the distance between the clusters is increased from 100 to 200 meters. For a system with gateway having single and dual antennas the energy efficiency with respect to a non cooperative single antenna gateway system falls typically within a window of 70 to 90% for long haul distances around 320 m onwards.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"26 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79481926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415667
Y. S. Khiabani, Shuangqing Wei
This paper focuses on the problem of sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first model the forward and feedback channels as erasure channels for both legitimate receiver (Bob) and an eavesdropper (Eve). In prior works, wiretap channel is modeled as statistically independent packet erasure channels for Bob and Eve. In this paper, we go beyond the state-of-the-art by addressing correlated erasure events across the wiretap channel. The created randomness is shared between two legitimate parties through ARQ transmission that will be mapped into a destination set using the first order digital filter with feedback. Then, we characterize Eve's information loss about this shared destination set, due to inevitable transmission errors that will be manipulated by privacy amplification to generate a series of secret keys about which Eve's knowledge remains negligible. We define two metrics to measure secrecy enhancement: outage probability and secret key rate. The resulting secrecy improvement is presented as a function of the correlation coefficients and the erasure probabilities for both channels. It is shown that secrecy improvement is achievable even when Eve has a better channel than the legitimate receiver, and her channel condition is unknown.
{"title":"ARQ-based key scheduling algorithm over correlated erasure channels","authors":"Y. S. Khiabani, Shuangqing Wei","doi":"10.1109/MILCOM.2012.6415667","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415667","url":null,"abstract":"This paper focuses on the problem of sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first model the forward and feedback channels as erasure channels for both legitimate receiver (Bob) and an eavesdropper (Eve). In prior works, wiretap channel is modeled as statistically independent packet erasure channels for Bob and Eve. In this paper, we go beyond the state-of-the-art by addressing correlated erasure events across the wiretap channel. The created randomness is shared between two legitimate parties through ARQ transmission that will be mapped into a destination set using the first order digital filter with feedback. Then, we characterize Eve's information loss about this shared destination set, due to inevitable transmission errors that will be manipulated by privacy amplification to generate a series of secret keys about which Eve's knowledge remains negligible. We define two metrics to measure secrecy enhancement: outage probability and secret key rate. The resulting secrecy improvement is presented as a function of the correlation coefficients and the erasure probabilities for both channels. It is shown that secrecy improvement is achievable even when Eve has a better channel than the legitimate receiver, and her channel condition is unknown.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85291368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415650
M. Rahmes, Kathy Wilder, J. Yates, K. Fox, Margaret M. Knepper, Jay K. Hackett
The ability to automatically predict likelihood of reaction to specific events and situational awareness is important to many military and commercial applications. Gauging population sentiment for targeted response areas and having the ability to predict or control sentiment within these areas is invaluable. Review of reception towards deployed forces must be analyzed, especially in areas vital for U.S. national interests. Predicting population behavior is critical for success and must include a qualitative as well as a quantitative solution. Additionally, a feedback mechanism is needed for periodically updating reception towards presence of U.S. Forces over time. We propose a method for predicting sentiment towards deployed U.S. Forces in near real time, to efficiently propitiate manpower resources, allocate equipment assets, and reduce cost of analyses. Sentiment prediction is becoming an increasingly important and feasible task based on social media, open source data, physical imagery and abundance of video data feeds. Predicting reaction to events can be time consuming. Locating the most likely affected areas is very tedious, requiring much human labor effort, and it is often difficult to obtain the best information on a timely basis. An efficient tool would be helpful to rapidly parse text that has been extracted from an intelligent algorithm in order to evaluate the population sentiment for the targeted area. Multiple data inputs and artificial intelligence (AI) algorithms are required in order to support sound decision making theory. The goal of our system, called GlobalSite, is to deliver trustworthy threat analysis systems and services that understand situations, while being a vital tool for continuing mission operations information.
{"title":"A qualitative and quantitative method for predicting sentiment toward deployed U.S. forces","authors":"M. Rahmes, Kathy Wilder, J. Yates, K. Fox, Margaret M. Knepper, Jay K. Hackett","doi":"10.1109/MILCOM.2012.6415650","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415650","url":null,"abstract":"The ability to automatically predict likelihood of reaction to specific events and situational awareness is important to many military and commercial applications. Gauging population sentiment for targeted response areas and having the ability to predict or control sentiment within these areas is invaluable. Review of reception towards deployed forces must be analyzed, especially in areas vital for U.S. national interests. Predicting population behavior is critical for success and must include a qualitative as well as a quantitative solution. Additionally, a feedback mechanism is needed for periodically updating reception towards presence of U.S. Forces over time. We propose a method for predicting sentiment towards deployed U.S. Forces in near real time, to efficiently propitiate manpower resources, allocate equipment assets, and reduce cost of analyses. Sentiment prediction is becoming an increasingly important and feasible task based on social media, open source data, physical imagery and abundance of video data feeds. Predicting reaction to events can be time consuming. Locating the most likely affected areas is very tedious, requiring much human labor effort, and it is often difficult to obtain the best information on a timely basis. An efficient tool would be helpful to rapidly parse text that has been extracted from an intelligent algorithm in order to evaluate the population sentiment for the targeted area. Multiple data inputs and artificial intelligence (AI) algorithms are required in order to support sound decision making theory. The goal of our system, called GlobalSite, is to deliver trustworthy threat analysis systems and services that understand situations, while being a vital tool for continuing mission operations information.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"55 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82323012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415795
Shane A. Fink, V. Chan, Christopher C. Yu
In some current mobile ad hoc network designs, we have observed that the link state update protocol may take up all the network throughput and leave little to no capacity for data transmission. In this paper we explore the throughput scaling necessary to maintain an updated topology in a fixed rate mobile infrastructureless wireless network. We use a mobility model where each node travels along a random chord on the circle formed by the maximum transmission radius of the fixed rate system. Combined with a constant velocity and assuming independent movement, this allows us to determine a distribution for the time tos disconnection in the network, or link coherence time. For all-to-all topology updates, where after each link disconnect every node updates every other node of its link state, we show that the per node throughput for maintaining topologyscales as Ω(η2). We then develop numeric results for rate scaling using IP packets sized for Ethernet, that is 12 kbit (1.5 kbyte) packets. For this random chord mobility model, we show throughput scaling for networks of 10 to 1000 nodes. We plot results for 95%, 99%, and 99.9% probabilities of successful protocol distribution (based on the link coherence time distribution and the throughput) and for ratios of transmission range to velocity of 1, 10, and 100. We show that even for networks where the ratio of transmission range to velocity is 100 (that is, the transmission range is 100 times the velocity), the throughput scales on the order of Mb/s for networks with more than 100 nodes. For a 99.9% probability of successful protocol distribution, a network of 100 nodes with a ratio of transmission range to velocity of 100 requires a throughput per node of over 220 Mbps. For the same network with 1000 nodes, a throughput per node of over 23 Gbps is necessary.
{"title":"Link state distribution rate scaling for maintaining topology in mobile wireless networks","authors":"Shane A. Fink, V. Chan, Christopher C. Yu","doi":"10.1109/MILCOM.2012.6415795","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415795","url":null,"abstract":"In some current mobile ad hoc network designs, we have observed that the link state update protocol may take up all the network throughput and leave little to no capacity for data transmission. In this paper we explore the throughput scaling necessary to maintain an updated topology in a fixed rate mobile infrastructureless wireless network. We use a mobility model where each node travels along a random chord on the circle formed by the maximum transmission radius of the fixed rate system. Combined with a constant velocity and assuming independent movement, this allows us to determine a distribution for the time tos disconnection in the network, or link coherence time. For all-to-all topology updates, where after each link disconnect every node updates every other node of its link state, we show that the per node throughput for maintaining topologyscales as Ω(η2). We then develop numeric results for rate scaling using IP packets sized for Ethernet, that is 12 kbit (1.5 kbyte) packets. For this random chord mobility model, we show throughput scaling for networks of 10 to 1000 nodes. We plot results for 95%, 99%, and 99.9% probabilities of successful protocol distribution (based on the link coherence time distribution and the throughput) and for ratios of transmission range to velocity of 1, 10, and 100. We show that even for networks where the ratio of transmission range to velocity is 100 (that is, the transmission range is 100 times the velocity), the throughput scales on the order of Mb/s for networks with more than 100 nodes. For a 99.9% probability of successful protocol distribution, a network of 100 nodes with a ratio of transmission range to velocity of 100 requires a throughput per node of over 220 Mbps. For the same network with 1000 nodes, a throughput per node of over 23 Gbps is necessary.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"97 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80550459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415576
G. Carl, J. V. Hook
As tactical military networks deploy new IP-capable radios (e.g., JTRS), it is expected that network connectivity will increase both within and among Service and Coalition networking domains (e.g., Army, Navy, NATO). Joint commanders will likely desire control of this increased connectivity to complete their mission goals. One mechanism known to (coarsely) manage multiple disparate IP networks is BGP routing policy. As such, this paper presents an experimental framework to estimate BGP's policy impacts on mission outcomes (e.g., expected Blue/Red casualties). In support of this effort, a testing platform was developed by integrating an agent-based combat simulation tool with a large-scale network emulation platform. Here, the simulation tool provides military mission modeling (e.g., force movements) and metrics (e.g., casualties counts) while the network emulation platform models the mission's underlying communications network (e.g., link characteristics, protocols, policy). Using this testbed, a sample military mission was evaluated over three communication architectures. The first architecture connected (Blue) mission units together using (fixed) point-to-point circuits, whereas the latter two used shortest-path (dynamic) routing and policy-based (dynamic) routing, respectively. It was found that both dynamically routed network architectures provided better Blue/Red casualty ratios and higher network reachability than the fixed, point-to-point network architecture. However, the addition of BGP policy did degrade performance relative to short-path routing. Furthermore, the degradation in mission and network performance did vary based on the BGP policies implemented. This paper's results imply that if policy-based routing is to be considered as a network management element for newly deployed joint IP networks, further experimental assessment is needed to understand the inter-relationships between BGP policy, mission outcomes, and network performance.
{"title":"Using hybrid simulation/emulation for experimental assessment of routing policy on mission outcomes","authors":"G. Carl, J. V. Hook","doi":"10.1109/MILCOM.2012.6415576","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415576","url":null,"abstract":"As tactical military networks deploy new IP-capable radios (e.g., JTRS), it is expected that network connectivity will increase both within and among Service and Coalition networking domains (e.g., Army, Navy, NATO). Joint commanders will likely desire control of this increased connectivity to complete their mission goals. One mechanism known to (coarsely) manage multiple disparate IP networks is BGP routing policy. As such, this paper presents an experimental framework to estimate BGP's policy impacts on mission outcomes (e.g., expected Blue/Red casualties). In support of this effort, a testing platform was developed by integrating an agent-based combat simulation tool with a large-scale network emulation platform. Here, the simulation tool provides military mission modeling (e.g., force movements) and metrics (e.g., casualties counts) while the network emulation platform models the mission's underlying communications network (e.g., link characteristics, protocols, policy). Using this testbed, a sample military mission was evaluated over three communication architectures. The first architecture connected (Blue) mission units together using (fixed) point-to-point circuits, whereas the latter two used shortest-path (dynamic) routing and policy-based (dynamic) routing, respectively. It was found that both dynamically routed network architectures provided better Blue/Red casualty ratios and higher network reachability than the fixed, point-to-point network architecture. However, the addition of BGP policy did degrade performance relative to short-path routing. Furthermore, the degradation in mission and network performance did vary based on the BGP policies implemented. This paper's results imply that if policy-based routing is to be considered as a network management element for newly deployed joint IP networks, further experimental assessment is needed to understand the inter-relationships between BGP policy, mission outcomes, and network performance.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"20 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83287412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415582
Dannie M. Stanley, Zhui Deng, Dongyan Xu, R. Porter, S. Snyder
Attackers can exploit vulnerable programs that are running with elevated permissions to insert kernel rootkits into a system. Security mechanisms have been created to prevent kernel rootkit implantation by relocating the vulnerable physical system to a guest virtual machine and enforcing a W ⊕ KX memory access control policy from the host virtual machine monitor. Such systems must also be able to identify and authorize the introduction of known-good kernel code. Previous works use cryptographic hashes to verify the integrity of kernel code at load-time. The hash creation and verification procedure depends on immutable kernel code. However, some modern kernels contain self-patching kernel code; they may overwrite executable instructions in memory after load-time. Such dynamic patching may occur for a variety of reason including: CPU optimizations, multiprocessor compatibility adjustments, and advanced debugging. The previous hash verification procedure cannot handle such modifications. We describe the design and implementation of a procedure that verifies the integrity of each modified instruction as it is introduced into the guest kernel. Our experiments with a self-patching Linux guest kernel show that our system can correctly detect and verify all valid instruction modifications and reject all invalid ones. In most cases our patch-level verification procedure incurs only nominal performance impact.
{"title":"Guest-transparent instruction authentication for self-patching kernels","authors":"Dannie M. Stanley, Zhui Deng, Dongyan Xu, R. Porter, S. Snyder","doi":"10.1109/MILCOM.2012.6415582","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415582","url":null,"abstract":"Attackers can exploit vulnerable programs that are running with elevated permissions to insert kernel rootkits into a system. Security mechanisms have been created to prevent kernel rootkit implantation by relocating the vulnerable physical system to a guest virtual machine and enforcing a W ⊕ KX memory access control policy from the host virtual machine monitor. Such systems must also be able to identify and authorize the introduction of known-good kernel code. Previous works use cryptographic hashes to verify the integrity of kernel code at load-time. The hash creation and verification procedure depends on immutable kernel code. However, some modern kernels contain self-patching kernel code; they may overwrite executable instructions in memory after load-time. Such dynamic patching may occur for a variety of reason including: CPU optimizations, multiprocessor compatibility adjustments, and advanced debugging. The previous hash verification procedure cannot handle such modifications. We describe the design and implementation of a procedure that verifies the integrity of each modified instruction as it is introduced into the guest kernel. Our experiments with a self-patching Linux guest kernel show that our system can correctly detect and verify all valid instruction modifications and reject all invalid ones. In most cases our patch-level verification procedure incurs only nominal performance impact.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"18 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81367576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415747
Jae-Joon Lee, Dongwook Kim, Jaesung Lim
Voice communication requires stricter QoS than other types of data communication. Thus, network operations, including the MAC layer protocol, should provide specific voice communication handling to meet voice application requirements. The current MIL-STD-188-220 does not guarantee the QoS of voice communication because of the round robin scheduling mechanism in network access control. Thus, we propose a hybrid MAC that provides adaptive virtual slots for voice messages on top of Deterministic Adaptable Priority Network Access Delay (DAP-NAD). In our proposed scheme, packet delay and jitter requirements of voice communication can be guaranteed, regardless of the number of stations in the network. Besides, the jitter tolerance time allows the other stations to adaptively transmit their data without disturbing voice communication and preserving data packet delay. The extensive simulation results show that the proposed scheme can guarantee quality of voice communication, regardless of network size.
{"title":"Adaptive virtual slot for enhancing QoS of voice communication in MIL-STD-188-220","authors":"Jae-Joon Lee, Dongwook Kim, Jaesung Lim","doi":"10.1109/MILCOM.2012.6415747","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415747","url":null,"abstract":"Voice communication requires stricter QoS than other types of data communication. Thus, network operations, including the MAC layer protocol, should provide specific voice communication handling to meet voice application requirements. The current MIL-STD-188-220 does not guarantee the QoS of voice communication because of the round robin scheduling mechanism in network access control. Thus, we propose a hybrid MAC that provides adaptive virtual slots for voice messages on top of Deterministic Adaptable Priority Network Access Delay (DAP-NAD). In our proposed scheme, packet delay and jitter requirements of voice communication can be guaranteed, regardless of the number of stations in the network. Besides, the jitter tolerance time allows the other stations to adaptively transmit their data without disturbing voice communication and preserving data packet delay. The extensive simulation results show that the proposed scheme can guarantee quality of voice communication, regardless of network size.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"118 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81455026","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2012-10-01DOI: 10.1109/MILCOM.2012.6415682
Feng Lin, Zhen Hu, R. Qiu, M. Wicks
Spectrum sensing is a fundamental problem in cognitive radio. How to sense the presence of primary user promptly in order to avoid the unexpected interference is a key issue to the system. The motivation of our work is to detect the primary user signal using small size data in short time. In this paper, a quickest detection based approach is proposed for spectrum sensing. This approach employs covariance matrix estimation instead of sample covariance matrix as the first step, then the core idea of sequential detection or quickest detection is borrowed and utilized here to improve the performance of traditional eigenvalue based MME and AGM detectors. The main advantage of the proposed approach is that it requires short data to detect quickly and it works at lower SNR environments than some traditional methods. A performance comparison between the proposed approach and other traditional methods is provided, by the simulation on captured digital TV (DTV) signal. The simulation results show this proposed approach exhibits performance improvement while the threshold keeps robust.
{"title":"A combination of quickest detection with oracle approximating shrinkage estimation and its application to spectrum sensing in cognitive radio","authors":"Feng Lin, Zhen Hu, R. Qiu, M. Wicks","doi":"10.1109/MILCOM.2012.6415682","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415682","url":null,"abstract":"Spectrum sensing is a fundamental problem in cognitive radio. How to sense the presence of primary user promptly in order to avoid the unexpected interference is a key issue to the system. The motivation of our work is to detect the primary user signal using small size data in short time. In this paper, a quickest detection based approach is proposed for spectrum sensing. This approach employs covariance matrix estimation instead of sample covariance matrix as the first step, then the core idea of sequential detection or quickest detection is borrowed and utilized here to improve the performance of traditional eigenvalue based MME and AGM detectors. The main advantage of the proposed approach is that it requires short data to detect quickly and it works at lower SNR environments than some traditional methods. A performance comparison between the proposed approach and other traditional methods is provided, by the simulation on captured digital TV (DTV) signal. The simulation results show this proposed approach exhibits performance improvement while the threshold keeps robust.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"19 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81564970","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
扫码关注我们
求助内容：
应助结果提醒方式：