Pub Date : 2012-10-29DOI: 10.1109/MILCOM.2012.6415772
E. Chow, F. Vatan, George Paloulian, Steve Frisbie, Zuzana Srostlik, V. Kalomiris, D. Apgar
Today's advanced network management systems can automate many aspects of the tactical networking operations within a military domain. However, automation of joint and coalition tactical networking across multiple domains remains challenging. Due to potentially conflicting goals and priorities, human agreement is often required before implementation into the network operations. This is further complicated by incompatible network management systems and security policies, rendering it difficult to implement automatic network management, thus requiring manual human intervention to the communication protocols used at various network routers and endpoints. This process of manual human intervention is tedious, error-prone, and slow. In order to facilitate a better solution, we are pursuing a technology which makes network management automated, reliable, and fast. Automating the negotiation of the common network communication parameters between different parties is the subject of this paper. We present the technology that enables inter-force dynamic communication resource negotiations to enable ad-hoc inter-operation in the field between force domains, without pre-planning. It also will enable a dynamic response to changing conditions within the area of operations. Our solution enables the rapid blending of intra-domain policies so that the forces involved are able to inter-operate effectively without overwhelming each other's networks with in-appropriate or unwarranted traffic. It will evaluate the policy rules and configuration data for each of the domains, then generate a compatible inter-domain policy and configuration that will update the gateway systems between the two domains.
{"title":"Dynamic communication resource negotiations","authors":"E. Chow, F. Vatan, George Paloulian, Steve Frisbie, Zuzana Srostlik, V. Kalomiris, D. Apgar","doi":"10.1109/MILCOM.2012.6415772","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415772","url":null,"abstract":"Today's advanced network management systems can automate many aspects of the tactical networking operations within a military domain. However, automation of joint and coalition tactical networking across multiple domains remains challenging. Due to potentially conflicting goals and priorities, human agreement is often required before implementation into the network operations. This is further complicated by incompatible network management systems and security policies, rendering it difficult to implement automatic network management, thus requiring manual human intervention to the communication protocols used at various network routers and endpoints. This process of manual human intervention is tedious, error-prone, and slow. In order to facilitate a better solution, we are pursuing a technology which makes network management automated, reliable, and fast. Automating the negotiation of the common network communication parameters between different parties is the subject of this paper. We present the technology that enables inter-force dynamic communication resource negotiations to enable ad-hoc inter-operation in the field between force domains, without pre-planning. It also will enable a dynamic response to changing conditions within the area of operations. Our solution enables the rapid blending of intra-domain policies so that the forces involved are able to inter-operate effectively without overwhelming each other's networks with in-appropriate or unwarranted traffic. It will evaluate the policy rules and configuration data for each of the domains, then generate a compatible inter-domain policy and configuration that will update the gateway systems between the two domains.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"13 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88030020","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-29DOI: 10.1109/MILCOM.2012.6415584
Chandana K. K. Jayasooriya, H. Kwon, R. Syslo, Yang-Ki Hong, Jaejin Lee, G. Abo
This paper presents a high-efficiency ferrite meander antenna (HEMA), which can be used to realize a 2 × 2 multiple-input-multiple-output (MIMO) communication system when it is used both at the transmitter and the receiver end. This antenna is designed to operate at 2.45 GHz center frequency (fc). It consists of two spatially separated half-cycle microstrip meander structures. Instead of using ferrite material for the entire substrate, it is used only beneath each meander structure. A standard FR-4 substrate is used as a system board. Impedance bandwidth and the radiation patterns of the fabricated antenna are measured and compared with those of the simulation results. The -10 dB impedance bandwidth of the fabricated antenna is 262 MHz, whereas the simulated bandwidth is 235 MHz. According to the simulations, the gain and the efficiency of the antenna are 2.2 dB and 81%, respectively. The efficiency of the antenna is confirmed by measurements. By using the simulated radiation patterns, correlation between the radiation patterns is calculated and used in generating the channel matrix. Mutual impedance of the antennas and the antenna efficiency are also included in the channel matrix, which in turn is used in bit error rate (BER) and ergodic capacity simulations. BER and ergodic capacity are used as performance metrics. The effect of antenna efficiency, mutual impedance of the antennas, and correlation between radiation patterns on system performance are presented.
{"title":"High-efficiency ferrite meander antenna (HEMA) for LTE applications","authors":"Chandana K. K. Jayasooriya, H. Kwon, R. Syslo, Yang-Ki Hong, Jaejin Lee, G. Abo","doi":"10.1109/MILCOM.2012.6415584","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415584","url":null,"abstract":"This paper presents a high-efficiency ferrite meander antenna (HEMA), which can be used to realize a 2 × 2 multiple-input-multiple-output (MIMO) communication system when it is used both at the transmitter and the receiver end. This antenna is designed to operate at 2.45 GHz center frequency (fc). It consists of two spatially separated half-cycle microstrip meander structures. Instead of using ferrite material for the entire substrate, it is used only beneath each meander structure. A standard FR-4 substrate is used as a system board. Impedance bandwidth and the radiation patterns of the fabricated antenna are measured and compared with those of the simulation results. The -10 dB impedance bandwidth of the fabricated antenna is 262 MHz, whereas the simulated bandwidth is 235 MHz. According to the simulations, the gain and the efficiency of the antenna are 2.2 dB and 81%, respectively. The efficiency of the antenna is confirmed by measurements. By using the simulated radiation patterns, correlation between the radiation patterns is calculated and used in generating the channel matrix. Mutual impedance of the antennas and the antenna efficiency are also included in the channel matrix, which in turn is used in bit error rate (BER) and ergodic capacity simulations. BER and ergodic capacity are used as performance metrics. The effect of antenna efficiency, mutual impedance of the antennas, and correlation between radiation patterns on system performance are presented.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"30 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84378302","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-29DOI: 10.1109/MILCOM.2012.6415745
Kanghee Lee, H. Kwon, Wenhao Xiong, Hyunggi Kim, Sangku Lee
A noncooperative amplify-and-forward (AF) wireless relay network consisting of a one-source-one-destination pair and N relays is investigated. The objective of this paper is to analytically derive the explicit optimal noncooperative relay amplifying matrices (or vector) under both jamming and no-jamming environments, with the relay power constraint based on the minimum mean square error (MMSE) criterion. The MMSE cost function behaviors will be analytically and numerically investigated using the relay amplifying vectors derived. Finally, the relay selection scheme for the noncooperative AF wireless relay network is presented using the maximum signal-to-noise ratio (SNR) criterion under both jamming and no-jamming environments.
{"title":"Relay selection for AF SISO wireless relay networks under jamming environment with relay power constraint","authors":"Kanghee Lee, H. Kwon, Wenhao Xiong, Hyunggi Kim, Sangku Lee","doi":"10.1109/MILCOM.2012.6415745","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415745","url":null,"abstract":"A noncooperative amplify-and-forward (AF) wireless relay network consisting of a one-source-one-destination pair and N relays is investigated. The objective of this paper is to analytically derive the explicit optimal noncooperative relay amplifying matrices (or vector) under both jamming and no-jamming environments, with the relay power constraint based on the minimum mean square error (MMSE) criterion. The MMSE cost function behaviors will be analytically and numerically investigated using the relay amplifying vectors derived. Finally, the relay selection scheme for the noncooperative AF wireless relay network is presented using the maximum signal-to-noise ratio (SNR) criterion under both jamming and no-jamming environments.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"26 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88798908","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-29DOI: 10.1109/MILCOM.2012.6415567
J. Trubuil, A. Goalic, N. Beuzelin
The TRIDENT (TRansmission d'Images et de Données EN Temps réeel) project was launched a few years ago by GESMA (Groupe d'Etudes Sous Marine de l'Atlantique). The initial objectives were to develop a multiple-rate underwater acoustic link for images, text and data transmission. Later, the speech option was added, and more recently channel coding options have been introduced to the TRIDENT platform. Convolutional codes (CC) and Reed Solomon (RS) block codes were then checked, but these simple codes were not able to significantly improve the Bit Error Rate (BER) at the channel decoding output. For this reason, GESMA decided to introduce turbo codes options, more specifically the Reed Solomon Block Turbo Codes (RS-BTC), to enhance the channel decoding efficiency. The data transmitted are interleaved and frame recovery is performed in reception. After system validation in static conditions, in the Penfeld river in Brest, France, sea trials were conducted in the Bay of Brest in dynamic conditions. This paper presents various possibilities offered by the platform for images and speech transmissions and the RS-BTC channel coding options.
TRIDENT (TRansmission d’images et de donnsames EN Temps rsameel)项目是几年前由GESMA (Groupe d’etudes Sous Marine de l’atlantico)发起的。最初的目标是开发用于图像、文本和数据传输的多速率水声链路。后来，语音选项被添加，最近信道编码选项被引入到TRIDENT平台。然后检查卷积码(CC)和里德所罗门(RS)分组码，但这些简单的码不能显著提高信道解码输出的误码率(BER)。因此，GESMA决定引入turbo码选项，更具体地说是Reed Solomon Block turbo codes (RS-BTC)，以提高信道解码效率。传输的数据是交错的，接收时进行帧恢复。系统在静态条件下验证后，在法国布雷斯特的彭菲尔德河进行了海试，在动态条件下在布雷斯特湾进行了海试。本文介绍了图像和语音传输平台提供的各种可能性以及RS-BTC信道编码选项。
{"title":"An overview of channel coding for underwater acoustic communications","authors":"J. Trubuil, A. Goalic, N. Beuzelin","doi":"10.1109/MILCOM.2012.6415567","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415567","url":null,"abstract":"The TRIDENT (TRansmission d'Images et de Données EN Temps réeel) project was launched a few years ago by GESMA (Groupe d'Etudes Sous Marine de l'Atlantique). The initial objectives were to develop a multiple-rate underwater acoustic link for images, text and data transmission. Later, the speech option was added, and more recently channel coding options have been introduced to the TRIDENT platform. Convolutional codes (CC) and Reed Solomon (RS) block codes were then checked, but these simple codes were not able to significantly improve the Bit Error Rate (BER) at the channel decoding output. For this reason, GESMA decided to introduce turbo codes options, more specifically the Reed Solomon Block Turbo Codes (RS-BTC), to enhance the channel decoding efficiency. The data transmitted are interleaved and frame recovery is performed in reception. After system validation in static conditions, in the Penfeld river in Brest, France, sea trials were conducted in the Bay of Brest in dynamic conditions. This paper presents various possibilities offered by the platform for images and speech transmissions and the RS-BTC channel coding options.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"73 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83964076","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-29DOI: 10.1109/MILCOM.2012.6415618
A. Masilamani, J. Garcia-Luna-Aceves
The Virtual Coordinate Multiple Access (VCMA) protocol is introduced and analyzed. VCMA is a medium access control protocol that defines transmissions schedules dynamically based on the assignment and exchange of virtual coordinates relative to an elected root node in a mesh network. VCMA is shown to attain feasible transmission schedules within a finite time, and its channel access delay properties are analyzed. The performance of the VCMA is compared with the performance of 802.11 DCF, which is a contention based MAC protocol; the five-phase reservation (FPRP) protocol, which is a schedule-based MAC protocol based on reserving time slots over fixed-length frames; and the node activation multiple access (NAMA) protocol, which is representative of distributed transmission scheduling based on probabilistic elections per slot. The performance comparison shows that VCMA attains much higher throughput than 802.11 DCF, FPRP or NAMA, and that it has lower variance in channel access intervals than contention-based schemes and schedule-based protocols based on probabilistic elections or reservations carried out in fixed-length frames.
{"title":"VCMA: Efficient channel access in wireless mesh networks using virtual coordinates","authors":"A. Masilamani, J. Garcia-Luna-Aceves","doi":"10.1109/MILCOM.2012.6415618","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415618","url":null,"abstract":"The Virtual Coordinate Multiple Access (VCMA) protocol is introduced and analyzed. VCMA is a medium access control protocol that defines transmissions schedules dynamically based on the assignment and exchange of virtual coordinates relative to an elected root node in a mesh network. VCMA is shown to attain feasible transmission schedules within a finite time, and its channel access delay properties are analyzed. The performance of the VCMA is compared with the performance of 802.11 DCF, which is a contention based MAC protocol; the five-phase reservation (FPRP) protocol, which is a schedule-based MAC protocol based on reserving time slots over fixed-length frames; and the node activation multiple access (NAMA) protocol, which is representative of distributed transmission scheduling based on probabilistic elections per slot. The performance comparison shows that VCMA attains much higher throughput than 802.11 DCF, FPRP or NAMA, and that it has lower variance in channel access intervals than contention-based schemes and schedule-based protocols based on probabilistic elections or reservations carried out in fixed-length frames.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"24 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90169949","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-29DOI: 10.1109/MILCOM.2012.6415839
Rumi Ghosh, J. Garcia-Luna-Aceves
We present LVRI, a hybrid link-state routing protocol based on exchange of link states in a region of interest. The region of interest (ROI) is defined as a connected component of the network that includes the source, destination nodes and the nodes that act as relays for the data. An ROI is established on-demand and exists as long as there are data to be sent. Each node in the region of interest constructs a source-routing tree from proactive link state updates sent within the ROI and maintains paths to all the nodes in the ROI. Simulations in mobile scenarios show LVRI has much lower end-to-end delay compared to traditional proactive and on-demand protocols such as OLSR and AODV. The delivery ratio of LVRI is comparable to that of OLSR and AODV but with a significantly lower control overhead.
{"title":"Link state routing in regions of interest","authors":"Rumi Ghosh, J. Garcia-Luna-Aceves","doi":"10.1109/MILCOM.2012.6415839","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415839","url":null,"abstract":"We present LVRI, a hybrid link-state routing protocol based on exchange of link states in a region of interest. The region of interest (ROI) is defined as a connected component of the network that includes the source, destination nodes and the nodes that act as relays for the data. An ROI is established on-demand and exists as long as there are data to be sent. Each node in the region of interest constructs a source-routing tree from proactive link state updates sent within the ROI and maintains paths to all the nodes in the ROI. Simulations in mobile scenarios show LVRI has much lower end-to-end delay compared to traditional proactive and on-demand protocols such as OLSR and AODV. The delivery ratio of LVRI is comparable to that of OLSR and AODV but with a significantly lower control overhead.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"82 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85236631","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-29DOI: 10.1109/MILCOM.2012.6415654
Damien Roque, C. Siclet, J. Brossier
In this paper, we consider a mobile ad-hoc radio network in an urban area. The propagation environment between two endpoints can be modeled by a double-Rayleigh fading multipath channel. Such a mobile scenario justifies the use of filter bank based multicarrier (FBMC) transmission systems. This technique generalizes traditional cyclic prefix orthogonal frequency-division multiplexing (CP-OFDM), allowing the design of non-rectangular pulse shape filters. We show that this approach leads to a better interference mitigation in time-variant channels. We restrict our study to short filters and single-tap per sub-channel equalization in order to preserve a low-complexity transmultiplexer. In this study, we compare FBMC with short filters to CP-OFDM in terms of coded bit-error-rate performances, using a realistic mobile-to-mobile channel model.
{"title":"A low-complexity multicarrier scheme with LDPC coding for mobile-to-mobile environment","authors":"Damien Roque, C. Siclet, J. Brossier","doi":"10.1109/MILCOM.2012.6415654","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415654","url":null,"abstract":"In this paper, we consider a mobile ad-hoc radio network in an urban area. The propagation environment between two endpoints can be modeled by a double-Rayleigh fading multipath channel. Such a mobile scenario justifies the use of filter bank based multicarrier (FBMC) transmission systems. This technique generalizes traditional cyclic prefix orthogonal frequency-division multiplexing (CP-OFDM), allowing the design of non-rectangular pulse shape filters. We show that this approach leads to a better interference mitigation in time-variant channels. We restrict our study to short filters and single-tap per sub-channel equalization in order to preserve a low-complexity transmultiplexer. In this study, we compare FBMC with short filters to CP-OFDM in terms of coded bit-error-rate performances, using a realistic mobile-to-mobile channel model.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"59 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2012-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74492336","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.6415861
Sung-Hyung Lee, Hyun-Jin Lee, Jae-Hyun Kim, Mijeong Hoh, Sang-heon Shin, Taewan Kim, B. Roh
This paper proposes silence drop first algorithm(SDF) for the active buffer management. This algorithm finds and drops silence packet rather than talkspurt packet in the queue for resolving buffer overflow of queue. This algorithm can serve more simultaneous user while maintain voice service quality with same link capacity. Simulations with voice codec of G.711 and G.729a are performed in this paper. The simulation results shows that SDF can serve more users than drop-tail and drop-head, whose are general active buffer management algorithms for voice application used in commercial and military router. By using proposed SDF algorithm, the voice capacity is increased by 84.21% with G.729a and 38.5% with G.711. Also, SDF algorithm loosens the silence packet inter-arrival time limit to service target number of users.
{"title":"Active buffer management algorithm for silence suppressed voice applications","authors":"Sung-Hyung Lee, Hyun-Jin Lee, Jae-Hyun Kim, Mijeong Hoh, Sang-heon Shin, Taewan Kim, B. Roh","doi":"10.1109/MILCOM.2012.6415861","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415861","url":null,"abstract":"This paper proposes silence drop first algorithm(SDF) for the active buffer management. This algorithm finds and drops silence packet rather than talkspurt packet in the queue for resolving buffer overflow of queue. This algorithm can serve more simultaneous user while maintain voice service quality with same link capacity. Simulations with voice codec of G.711 and G.729a are performed in this paper. The simulation results shows that SDF can serve more users than drop-tail and drop-head, whose are general active buffer management algorithms for voice application used in commercial and military router. By using proposed SDF algorithm, the voice capacity is increased by 84.21% with G.729a and 38.5% with G.711. Also, SDF algorithm loosens the silence packet inter-arrival time limit to service target number of users.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"2 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75161107","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.6415684
T. R. Mason, C. H. Weaver, Marc A. Camacho
Recent trends within the US military seek to leverage the rapid pace of commercial-off-the-shelf (COTS) platforms for military use. The US Army in particular has started efforts to define a Common Operating Environment (COE) that establishes standards and architectures allowing for a high degree of modularity and enabling hardware-agnostic software development. To reduce development costs and time to deploy systems, the COE aims to make use of COTS components when possible, integrating custom and military-off-the-shelf components as necessary. To accomplish its goals effectively, the COE must enable software developers with a uniform method of access to important resources including communications links, military standard data formats, and positioning, navigation, and timing (PNT) information. In support of the US Army Product Director, Position Navigation and Timing (PD PNT) as a part of the Military GPS User Equipment (MGUE) program, The Johns Hopkins University Applied Physics Laboratory (JHU/APL) has specified and prototyped the interfaces and infrastructure for PNT-enabled applications on a COTS device running the stock Android® Operating System (OS) to communicate with a military-grade PNT device. This work proposes and demonstrates Application Programming Interfaces (API) by which applications can access PNT information and an Interface Control Document (ICD) for communications with a PNT device as a baseline for the PNT portion of the COE-Handheld computing environment (CE). This paper discusses four aspects of the work: a PNT API, a device-to-handheld ICD, a prototype implementation of the Android® services and PNT device software, and a demonstration of applications using the API. An additional task to prototype an enclosure for the external device also supported this work but is not discussed here. The prototype implementation successfully demonstrated Android® applications using PNT data from external precise positioning service (PPS) receivers.
{"title":"Position, navigation, and timing in the Common Operating Environment: Prototyping the PNT User equipment Modernization Architecture","authors":"T. R. Mason, C. H. Weaver, Marc A. Camacho","doi":"10.1109/MILCOM.2012.6415684","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415684","url":null,"abstract":"Recent trends within the US military seek to leverage the rapid pace of commercial-off-the-shelf (COTS) platforms for military use. The US Army in particular has started efforts to define a Common Operating Environment (COE) that establishes standards and architectures allowing for a high degree of modularity and enabling hardware-agnostic software development. To reduce development costs and time to deploy systems, the COE aims to make use of COTS components when possible, integrating custom and military-off-the-shelf components as necessary. To accomplish its goals effectively, the COE must enable software developers with a uniform method of access to important resources including communications links, military standard data formats, and positioning, navigation, and timing (PNT) information. In support of the US Army Product Director, Position Navigation and Timing (PD PNT) as a part of the Military GPS User Equipment (MGUE) program, The Johns Hopkins University Applied Physics Laboratory (JHU/APL) has specified and prototyped the interfaces and infrastructure for PNT-enabled applications on a COTS device running the stock Android® Operating System (OS) to communicate with a military-grade PNT device. This work proposes and demonstrates Application Programming Interfaces (API) by which applications can access PNT information and an Interface Control Document (ICD) for communications with a PNT device as a baseline for the PNT portion of the COE-Handheld computing environment (CE). This paper discusses four aspects of the work: a PNT API, a device-to-handheld ICD, a prototype implementation of the Android® services and PNT device software, and a demonstration of applications using the API. An additional task to prototype an enclosure for the external device also supported this work but is not discussed here. The prototype implementation successfully demonstrated Android® applications using PNT data from external precise positioning service (PPS) receivers.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"158 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":"75390818","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.6415590
J. Sonnenberg, D. Chester, J. E. Schroeder, K. Olds
Cognitive engines have been under study and development for a number of years as a technique for addressing the needs of cognitive radios [1,2,3]. More recently there has been effort to expand the role of the cognitive engine to address the needs of a network of cognitive radios [4,5]. Haykin [6] has demonstrated that there is a significant difference between a network of cognitive radios and a cognitive radio network. This paper addresses three questions: 1. What are the significant functional and parametric differences between cognitive algorithms that deal with optimizing the operations of a cognitive radio and cognitive algorithms that optimize the operations of a cognitive radio network? 2. What are the trade-offs in applying the various algorithms to each task? 3. Which algorithms are optimal for the networking tasks? This paper identifies a set of parameters that characterize candidate algorithms and explores the benefits and drawbacks of each for cognitive network tasks. We propose a tiered architecture of cognitive engine algorithms that work in tandem to optimize the use of cognitive networked radios for the optimal success of the networked mission.
{"title":"Quantifying the relative merits of genetic and swarm algorithms for network optimization in cognitive radio networks","authors":"J. Sonnenberg, D. Chester, J. E. Schroeder, K. Olds","doi":"10.1109/MILCOM.2012.6415590","DOIUrl":"https://doi.org/10.1109/MILCOM.2012.6415590","url":null,"abstract":"Cognitive engines have been under study and development for a number of years as a technique for addressing the needs of cognitive radios [1,2,3]. More recently there has been effort to expand the role of the cognitive engine to address the needs of a network of cognitive radios [4,5]. Haykin [6] has demonstrated that there is a significant difference between a network of cognitive radios and a cognitive radio network. This paper addresses three questions: 1. What are the significant functional and parametric differences between cognitive algorithms that deal with optimizing the operations of a cognitive radio and cognitive algorithms that optimize the operations of a cognitive radio network? 2. What are the trade-offs in applying the various algorithms to each task? 3. Which algorithms are optimal for the networking tasks? This paper identifies a set of parameters that characterize candidate algorithms and explores the benefits and drawbacks of each for cognitive network tasks. We propose a tiered architecture of cognitive engine algorithms that work in tandem to optimize the use of cognitive networked radios for the optimal success of the networked mission.","PeriodicalId":18720,"journal":{"name":"MILCOM 2012 - 2012 IEEE Military Communications Conference","volume":"39 6","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2012-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72564055","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
扫码关注我们
求助内容：
应助结果提醒方式：