Pub Date : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945394
L. Pillutla, Bhuvan Joshi
In this paper we consider the problem of spectrum sensing in cognitive radio networks which involves detection of primary (licensed) users (PUs) by secondary (unlicensed) users (SUs), who are interested in transmitting their data opportunistically. To facilitate accurate detection of PUs by the fusion center (FC) based on the energy measurements received from the chosen set of SUs, we formulate an optimization problem for selection of SUs and the number of samples they need to collect of the underlying spectrum. By assuming that the FC uses a sequential probability ratio test (SPRT) for performing spectrum sensing we formulate the problem of joint optimization over subset of SUs and the number of samples each of the SU in the chosen subset needs to collect, so that a composite cost function is maximized. For the computation of the optimal subset of SUs and the number of samples each SU has to collect we propose an algorithm based on DSO, in which optimization over the subset of SUs and the number of samples is done successively till convergence to the optimal set of values is achieved. Our simulation results demonstrate the efficacy of the proposed optimization approach based on SPRT as against that of a fixed sample size test at the FC. Specifically, the average number of samples required for an SPRT is much lower than that of a fixed sample size test for given values of probability of detection and probability of false alarm. The simulation results also confirm tracking ability of the proposed DSO based algorithms, in response to variations in the corresponding channel gains between the SUs and the FC.
{"title":"Sequential cooperative spectrum sensing in cognitive radio networks: Optimal selection of secondary users and their spectral measurements","authors":"L. Pillutla, Bhuvan Joshi","doi":"10.1109/COMSNETS.2017.7945394","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945394","url":null,"abstract":"In this paper we consider the problem of spectrum sensing in cognitive radio networks which involves detection of primary (licensed) users (PUs) by secondary (unlicensed) users (SUs), who are interested in transmitting their data opportunistically. To facilitate accurate detection of PUs by the fusion center (FC) based on the energy measurements received from the chosen set of SUs, we formulate an optimization problem for selection of SUs and the number of samples they need to collect of the underlying spectrum. By assuming that the FC uses a sequential probability ratio test (SPRT) for performing spectrum sensing we formulate the problem of joint optimization over subset of SUs and the number of samples each of the SU in the chosen subset needs to collect, so that a composite cost function is maximized. For the computation of the optimal subset of SUs and the number of samples each SU has to collect we propose an algorithm based on DSO, in which optimization over the subset of SUs and the number of samples is done successively till convergence to the optimal set of values is achieved. Our simulation results demonstrate the efficacy of the proposed optimization approach based on SPRT as against that of a fixed sample size test at the FC. Specifically, the average number of samples required for an SPRT is much lower than that of a fixed sample size test for given values of probability of detection and probability of false alarm. The simulation results also confirm tracking ability of the proposed DSO based algorithms, in response to variations in the corresponding channel gains between the SUs and the FC.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127680936","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945376
S. Girisankar, Tram Truong Huu, G. Mohan
Wavelength division multiplexing (WDM) based optical networks have been shown to be an attractive “green” solution for cloud data center networks because of its high bisection bandwidth, low power consumption and low complexity of network wiring. In addition to the circuit-switched nature of optical networks, the high degree of the optical switch and dynamic arrival of traffic flows make the problem of flow scheduling in optical data centers becomes very challenging. It has to consider not only the flow admission control but also wavelength assignment for the lightpaths. In this paper, we address the problem of flow scheduling in optical data centers. We first develop an optimization programming formulation that aims at maximizing the revenue for cloud providers in a long run. Since solving the optimization formulation is computationally prohibitive, we develop heuristic scheduling algorithms based on the congestion factor of traffic flows. We design a Software Defined Network framework that integrates the proposed algorithms to perform flow scheduling in optical data center networks. We evaluate the proposed algorithms through comprehensive simulations and compare their performance against that of a baseline algorithm. The results show that the proposed algorithms achieve good performance improvement compared to the baseline algorithm.
{"title":"SDN-based dynamic flow scheduling in optical data centers","authors":"S. Girisankar, Tram Truong Huu, G. Mohan","doi":"10.1109/COMSNETS.2017.7945376","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945376","url":null,"abstract":"Wavelength division multiplexing (WDM) based optical networks have been shown to be an attractive “green” solution for cloud data center networks because of its high bisection bandwidth, low power consumption and low complexity of network wiring. In addition to the circuit-switched nature of optical networks, the high degree of the optical switch and dynamic arrival of traffic flows make the problem of flow scheduling in optical data centers becomes very challenging. It has to consider not only the flow admission control but also wavelength assignment for the lightpaths. In this paper, we address the problem of flow scheduling in optical data centers. We first develop an optimization programming formulation that aims at maximizing the revenue for cloud providers in a long run. Since solving the optimization formulation is computationally prohibitive, we develop heuristic scheduling algorithms based on the congestion factor of traffic flows. We design a Software Defined Network framework that integrates the proposed algorithms to perform flow scheduling in optical data center networks. We evaluate the proposed algorithms through comprehensive simulations and compare their performance against that of a baseline algorithm. The results show that the proposed algorithms achieve good performance improvement compared to the baseline algorithm.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127638652","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945359
G. Ramachandran, F. Yang, Piers W. Lawrence, Sam Michiels, W. Joosen, D. Hughes
The Internet of Things (IoT) is being applied in a wide variety of applications, which demand a range of networking support. This includes wide area communication networks. Novel long range network technologies such as LoRa and Sigfox are emerging, but they remain difficult to deploy and configure for end-users who are not specialists in embedded systems. This paper addresses this problem by introducing μPnP-WAN, which combines the ease of use of the μPnP peripheral system, with the long range LoRa network to realise the first true plug-and-play solution for long-range sensing and actuation. Our evaluation shows that μPnP-WAN can achieve a range of up to 3.5 kilometers in ad-hoc suburban deployments and multi-year battery lifetime. Furthermore, our deployment of μPnP-WAN device in DR Congo to monitor the temperature of blood fridges shows the effectiveness of μPnP-WAN device in real-world application scenarios.
{"title":"μPnP-WAN: Experiences with LoRa and its deployment in DR Congo","authors":"G. Ramachandran, F. Yang, Piers W. Lawrence, Sam Michiels, W. Joosen, D. Hughes","doi":"10.1109/COMSNETS.2017.7945359","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945359","url":null,"abstract":"The Internet of Things (IoT) is being applied in a wide variety of applications, which demand a range of networking support. This includes wide area communication networks. Novel long range network technologies such as LoRa and Sigfox are emerging, but they remain difficult to deploy and configure for end-users who are not specialists in embedded systems. This paper addresses this problem by introducing μPnP-WAN, which combines the ease of use of the μPnP peripheral system, with the long range LoRa network to realise the first true plug-and-play solution for long-range sensing and actuation. Our evaluation shows that μPnP-WAN can achieve a range of up to 3.5 kilometers in ad-hoc suburban deployments and multi-year battery lifetime. Furthermore, our deployment of μPnP-WAN device in DR Congo to monitor the temperature of blood fridges shows the effectiveness of μPnP-WAN device in real-world application scenarios.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125998027","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}
Enabling the device-to-device (D2D) communication in the cellular network (CN) induces the problem of interference. This paper proposes a scheme of controlling the power of the D2D user equipments (DUEs) by switching D2D transmitter on the basis of receiver-sensitivity. The performance of the proposed scheme has been evaluated in slow fading environment, with the assumptions that the proximity gains, instantaneous gains between base station (BS) and mobile user equipments (UEs) is available at the BS and that the D2D users (DUs) are moving slowly. It has been shown that the cell sum-rate increases significantly compared to conventional CN infrastructure without degrading the performance of the cellular users.
{"title":"Interference reduction by switching the underlaying transmitter in D2D communications","authors":"Chaudhari Mahesh Shamrao, Prashant Kumar, Preetam Kumar","doi":"10.1109/COMSNETS.2017.7945421","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945421","url":null,"abstract":"Enabling the device-to-device (D2D) communication in the cellular network (CN) induces the problem of interference. This paper proposes a scheme of controlling the power of the D2D user equipments (DUEs) by switching D2D transmitter on the basis of receiver-sensitivity. The performance of the proposed scheme has been evaluated in slow fading environment, with the assumptions that the proximity gains, instantaneous gains between base station (BS) and mobile user equipments (UEs) is available at the BS and that the D2D users (DUs) are moving slowly. It has been shown that the cell sum-rate increases significantly compared to conventional CN infrastructure without degrading the performance of the cellular users.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123161223","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945377
Faezeh Hajiaghajani, S. Biswas
This paper presents a multicast Delay Tolerant Network (DTN) routing protocol with the goal of maximizing an economic gain for Device-to-Device (D2D) commercial content dissemination. The defined economic gain is a composite routing performance index, which combines revenue from delivery, and forwarding cost from disseminating commercial content such as coupons. Majority of existing approaches, due to lack of gain-awareness, cannot control the economic gain of dissemination, as defined in this context. In the proposed approach, which is inspired by Q-learning, nodes are able to learn a set of forwarding actions which lead to a higher expected reward, i.e., gain. Due to the online learning framework, this Q-learning based Gain-aware Routing (QGR) protocol is expected to be robust in diverse and dynamic mobility environments. Using the DTN simulation software ONE, we run experiments for functional validation and performance evaluation of the proposed protocol with respect to two existing competitive protocols under different protocol constraints and mobility scenarios.
{"title":"Learning based gain-aware content dissemination in delay tolerant networks","authors":"Faezeh Hajiaghajani, S. Biswas","doi":"10.1109/COMSNETS.2017.7945377","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945377","url":null,"abstract":"This paper presents a multicast Delay Tolerant Network (DTN) routing protocol with the goal of maximizing an economic gain for Device-to-Device (D2D) commercial content dissemination. The defined economic gain is a composite routing performance index, which combines revenue from delivery, and forwarding cost from disseminating commercial content such as coupons. Majority of existing approaches, due to lack of gain-awareness, cannot control the economic gain of dissemination, as defined in this context. In the proposed approach, which is inspired by Q-learning, nodes are able to learn a set of forwarding actions which lead to a higher expected reward, i.e., gain. Due to the online learning framework, this Q-learning based Gain-aware Routing (QGR) protocol is expected to be robust in diverse and dynamic mobility environments. Using the DTN simulation software ONE, we run experiments for functional validation and performance evaluation of the proposed protocol with respect to two existing competitive protocols under different protocol constraints and mobility scenarios.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131400670","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945369
Joe H. Novak, S. Kasera
Active queue management (AQM) algorithms preemptively drop packets to prevent unnecessary delays through a network while keeping utilization high. Many AQM ideas have been proposed, but none have been widely adopted because these rely on pre-specification or pre-tuning of parameters and thresholds that do not necessarily adapt to dynamic network conditions. We develop an AQM algorithm that relies only on network runtime measurements and a natural threshold, the knee on the delay-utilization curve. We call our AQM algorithm Delay Utilization Knee (DUK) based on its key characteristic of keeping the system operating at the knee of the delay-utilization curve. We implement and evaluate DUK in the Linux kernel in a testbed, that we build, and in the ns-3 network simulator. We find that DUK can attain reduced queuing delay and reduced flow completion times compared to other algorithms with virtually no reduction in link utilization under varying network conditions.
{"title":"Auto-tuning active queue management","authors":"Joe H. Novak, S. Kasera","doi":"10.1109/COMSNETS.2017.7945369","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945369","url":null,"abstract":"Active queue management (AQM) algorithms preemptively drop packets to prevent unnecessary delays through a network while keeping utilization high. Many AQM ideas have been proposed, but none have been widely adopted because these rely on pre-specification or pre-tuning of parameters and thresholds that do not necessarily adapt to dynamic network conditions. We develop an AQM algorithm that relies only on network runtime measurements and a natural threshold, the knee on the delay-utilization curve. We call our AQM algorithm Delay Utilization Knee (DUK) based on its key characteristic of keeping the system operating at the knee of the delay-utilization curve. We implement and evaluate DUK in the Linux kernel in a testbed, that we build, and in the ns-3 network simulator. We find that DUK can attain reduced queuing delay and reduced flow completion times compared to other algorithms with virtually no reduction in link utilization under varying network conditions.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"104 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131752465","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945456
A. Ranjan, P. Misra, H. B. Sahu
Characterization of communication links in wireless sensor networks (WSN) deployed in mine environment is of paramount importance for achieving reliable network performance. Inaccurate communication model may lead to the inferior performance of protocols designed hence may exhibit inconsistent behavior due to link degradation. It is thus significant to account for propagation factors that affect link performance of WSNs in underground mine environments. This work details observations from experimental measurements carried out in both metalliferous and coal mines to characterize the characteristics of communication links in WSNs. Based on the experimental research common denominator characteristics such as mine tunnel size, tunnel irregularities and mine infrastructure contributing to significant link degradation in WSNs in underground mines is discussed.
{"title":"On the importance of link characterization for wireless sensor networks in underground mines","authors":"A. Ranjan, P. Misra, H. B. Sahu","doi":"10.1109/COMSNETS.2017.7945456","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945456","url":null,"abstract":"Characterization of communication links in wireless sensor networks (WSN) deployed in mine environment is of paramount importance for achieving reliable network performance. Inaccurate communication model may lead to the inferior performance of protocols designed hence may exhibit inconsistent behavior due to link degradation. It is thus significant to account for propagation factors that affect link performance of WSNs in underground mine environments. This work details observations from experimental measurements carried out in both metalliferous and coal mines to characterize the characteristics of communication links in WSNs. Based on the experimental research common denominator characteristics such as mine tunnel size, tunnel irregularities and mine infrastructure contributing to significant link degradation in WSNs in underground mines is discussed.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128329247","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945406
Vikas Arya, P. Jishnu, K. P. Ray
Radars are known for target detection but with time it found applications in other areas as well. In this paper, we demonstrate a method to send data over radar signal for communication without interfering with the original purpose of target detection. The proposed radar system is implemented using software defined radio (SDR).
{"title":"Study and analysis of DSB-SC-FMCW radar in SDR platform","authors":"Vikas Arya, P. Jishnu, K. P. Ray","doi":"10.1109/COMSNETS.2017.7945406","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945406","url":null,"abstract":"Radars are known for target detection but with time it found applications in other areas as well. In this paper, we demonstrate a method to send data over radar signal for communication without interfering with the original purpose of target detection. The proposed radar system is implemented using software defined radio (SDR).","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116609811","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945397
A. Mishra, Debmalya Mallick, Mareesh Issar, Poonam Singh
This paper presents the performance analysis of decode-and-forward (DF) relaying system in presence of both channel estimation error (CEE) and radio frequency impairments (RFI). First, the end-to-end signal-to-noise-plus-distortion-and-error ratio (SNDER) expression is derived, followed by an exact closed-form outage probability (OP) expression for Nakagami-m fading channel. As a special case, the OP analysis for Rayleigh fading channel is also provided. From the derived expressions, the relation amongst CEE and RFI is analyzed. For a complete study, the high SNR analysis of the derived equations is also carried out. The analytical results have been verified using the Monte Carlo simulations. Finally, intriguing results are presented with the help of plots shown in the numerical analysis.
{"title":"Performance analysis of dual-hop DF relaying systems in the combined presence of CEE and RFI","authors":"A. Mishra, Debmalya Mallick, Mareesh Issar, Poonam Singh","doi":"10.1109/COMSNETS.2017.7945397","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945397","url":null,"abstract":"This paper presents the performance analysis of decode-and-forward (DF) relaying system in presence of both channel estimation error (CEE) and radio frequency impairments (RFI). First, the end-to-end signal-to-noise-plus-distortion-and-error ratio (SNDER) expression is derived, followed by an exact closed-form outage probability (OP) expression for Nakagami-m fading channel. As a special case, the OP analysis for Rayleigh fading channel is also provided. From the derived expressions, the relation amongst CEE and RFI is analyzed. For a complete study, the high SNR analysis of the derived equations is also carried out. The analytical results have been verified using the Monte Carlo simulations. Finally, intriguing results are presented with the help of plots shown in the numerical analysis.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116476630","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 : 1900-01-01DOI: 10.1109/COMSNETS.2017.7945428
Sushrut Vaidya, Taha Khot
The airborne Traffic Alert and Collision Avoidance System (TCAS) is the current standard for detecting and avoiding potential mid-air collisions. Based on information received from nearby aircraft, TCAS issues Traffic Advisories (TAs) to alert pilots about potential conflicts. If an impending collision threat arises, TCAS provides Resolution Advisories (RAs) involving vertical maneuvers (such as Climb or Descend) to help resolve the threat. The TCAS logic primarily uses a parameter Tau, which is a measure of the time to the closest point of approach, in terms of range or vertical separation, between the two aircraft. In this paper, we use particle kinematics-based simulations to generate two-aircraft mid-air encounters with different geometries and closure rates, and we assess and compare the performance of collision threat detection criteria that employ conventional and modified definitions of Tau as well as a criterion that closely models the logic of TCAS. We analyze encounters between jet airliners, as well as those between jet airliners and small general aviation aircraft in urban airspace. Low closure rate encounters are also considered. Performance of different threat detection criteria is assessed by calculating the range and vertical separation between aircraft at the instant of RA generation. The modified Tau definitions provide greater separations than the conventional ones. The criterion that closely models the threat detection logic of TCAS provides intermediate levels of separation.
{"title":"Analysis of the Tau concept used in aircraft collision avoidance through kinematic simulations","authors":"Sushrut Vaidya, Taha Khot","doi":"10.1109/COMSNETS.2017.7945428","DOIUrl":"https://doi.org/10.1109/COMSNETS.2017.7945428","url":null,"abstract":"The airborne Traffic Alert and Collision Avoidance System (TCAS) is the current standard for detecting and avoiding potential mid-air collisions. Based on information received from nearby aircraft, TCAS issues Traffic Advisories (TAs) to alert pilots about potential conflicts. If an impending collision threat arises, TCAS provides Resolution Advisories (RAs) involving vertical maneuvers (such as Climb or Descend) to help resolve the threat. The TCAS logic primarily uses a parameter Tau, which is a measure of the time to the closest point of approach, in terms of range or vertical separation, between the two aircraft. In this paper, we use particle kinematics-based simulations to generate two-aircraft mid-air encounters with different geometries and closure rates, and we assess and compare the performance of collision threat detection criteria that employ conventional and modified definitions of Tau as well as a criterion that closely models the logic of TCAS. We analyze encounters between jet airliners, as well as those between jet airliners and small general aviation aircraft in urban airspace. Low closure rate encounters are also considered. Performance of different threat detection criteria is assessed by calculating the range and vertical separation between aircraft at the instant of RA generation. The modified Tau definitions provide greater separations than the conventional ones. The criterion that closely models the threat detection logic of TCAS provides intermediate levels of separation.","PeriodicalId":168357,"journal":{"name":"2017 9th International Conference on Communication Systems and Networks (COMSNETS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129599165","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
扫码关注我们
求助内容：
应助结果提醒方式：