Pub Date : 2017-07-01DOI: 10.1109/ISCC.2017.8024619
Pablo Graubner, Markus Sommer, M. Hollick, Bernd Freisleben
Software-defined networking paradigms have found their way into wireless edge networks, allowing network slicing, mobility management, and resource allocation. This paper presents dynamic role assignment as a novel approach to software-defined network topology management for wireless edge devices, such as laptops, tablets and smartphones. It combines the centralized control of wireless Network Interface Controller (NIC) modes with Network Function Virtualization (NFV) to integrate network topology transitions as well as network service and application service placement within a single mechanism. Our proposal is evaluated with respect to latency, bandwidth, and power consumption of the edge nodes. The experimental results show significant differences in both bandwidth (up to 18%) and power consumption (up to 15%) for playing different roles, and when using (a) a web proxy and (b) an intrusion prevention system as examples of application services.
{"title":"Dynamic role assignment in Software-Defined Wireless Networks","authors":"Pablo Graubner, Markus Sommer, M. Hollick, Bernd Freisleben","doi":"10.1109/ISCC.2017.8024619","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024619","url":null,"abstract":"Software-defined networking paradigms have found their way into wireless edge networks, allowing network slicing, mobility management, and resource allocation. This paper presents dynamic role assignment as a novel approach to software-defined network topology management for wireless edge devices, such as laptops, tablets and smartphones. It combines the centralized control of wireless Network Interface Controller (NIC) modes with Network Function Virtualization (NFV) to integrate network topology transitions as well as network service and application service placement within a single mechanism. Our proposal is evaluated with respect to latency, bandwidth, and power consumption of the edge nodes. The experimental results show significant differences in both bandwidth (up to 18%) and power consumption (up to 15%) for playing different roles, and when using (a) a web proxy and (b) an intrusion prevention system as examples of application services.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131830426","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024508
Berkin Guler, Öznur Özkasap
The prominent cloud services rely on geographically distributed nodes running replication and other fault-tolerance mechanisms so as to provide flawless availability and dependability. In this paper, we address the communication cost of the well known primary-backup replication protocol, and propose compressed periodic incremental checkpoint algorithms to achieve improved throughput. We set up a replicated key-value store on geographically distributed nodes of the PlanetLab platform, and developed compressed incremental checkpointing algorithms to support primary-backup replication. By considering performance metrics of interest including blocking time, checkpointing time, compression ratio, compression/ decompression times, we conducted a comprehensive analysis. We used the well-known benchmarking tool YCSB and established different sample workloads to test where each workload represents diverse plots. Our findings indicate that Zstd is the most competent compression method under all scenarios and through comparing with an uncompressed approach we point out that compressing the communication data disseminated from the primary replica coupled with the periodic incremental checkpointing algorithm not only decreases the average blocking time up to 5% but it also improves the overall system throughput by 4% compared to the no compression case.
{"title":"Compressed incremental checkpointing for efficient replicated key-value stores","authors":"Berkin Guler, Öznur Özkasap","doi":"10.1109/ISCC.2017.8024508","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024508","url":null,"abstract":"The prominent cloud services rely on geographically distributed nodes running replication and other fault-tolerance mechanisms so as to provide flawless availability and dependability. In this paper, we address the communication cost of the well known primary-backup replication protocol, and propose compressed periodic incremental checkpoint algorithms to achieve improved throughput. We set up a replicated key-value store on geographically distributed nodes of the PlanetLab platform, and developed compressed incremental checkpointing algorithms to support primary-backup replication. By considering performance metrics of interest including blocking time, checkpointing time, compression ratio, compression/ decompression times, we conducted a comprehensive analysis. We used the well-known benchmarking tool YCSB and established different sample workloads to test where each workload represents diverse plots. Our findings indicate that Zstd is the most competent compression method under all scenarios and through comparing with an uncompressed approach we point out that compressing the communication data disseminated from the primary replica coupled with the periodic incremental checkpointing algorithm not only decreases the average blocking time up to 5% but it also improves the overall system throughput by 4% compared to the no compression case.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134483533","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024552
N. Amdouni, T. Aguili
Taking into account quality of transmission (QoT) constraints, wavelength continuity constraint and wavelength integrity constraint when solving the Routing and Wavelength Assignment (RWA) problem in Wavelength-Division Multiplexing (WDM) transparent networks leads to inefficient utilization of network resources and results in higher rejection ratio. This is especially severe when dynamic traffic is considered. In this paper, we investigate the problem of improving network resources utilization efficiency by applying rerouting and set-up delay tolerance, a metric of Service Level Agreement (SLA) that has been exploited in literature for improvement in network performances, taking into account the aforementioned constraints. Moreover, we investigate further improvement in the duration of the service disruption period due to rerouting. As far as we know, this is the first study that exploits traffic rerouting for network with QoT constraints provisioned with set-up delay tolerance to get further improvement in network performances. The performances of the proposed algorithms are evaluated and discussed through extensive numerical experiments. Significant improvements are demonstrated, either in terms of rejection ratio or in terms of service disruption period, in comparison with previously proposed algorithms.
在解决波分复用(wavelength - division Multiplexing, WDM)透明网络中的路由与波长分配(Routing and wavelength Assignment, RWA)问题时，由于考虑传输质量(QoT)约束、波长连续性约束和波长完整性约束，导致网络资源利用率低下，拒绝率较高。当考虑动态流量时，这种情况尤其严重。在本文中，考虑到上述约束，我们研究了通过应用重路由和设置延迟容限(服务水平协议(SLA)的度量)来提高网络资源利用效率的问题，该度量已在文献中用于提高网络性能。此外，我们还调查了由于重新路由而导致的服务中断时间的进一步改善。据我们所知，这是第一个利用具有设置延迟容限的QoT约束的网络的流量重路由来进一步提高网络性能的研究。通过大量的数值实验对所提出算法的性能进行了评价和讨论。与先前提出的算法相比，无论是在拒绝率方面还是在服务中断时间方面，都证明了显著的改进。
{"title":"On the impact of traffic rerouting and set-up delay tolerance on connection provisioning in dynamic WDM transparent networks with QoT constraints","authors":"N. Amdouni, T. Aguili","doi":"10.1109/ISCC.2017.8024552","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024552","url":null,"abstract":"Taking into account quality of transmission (QoT) constraints, wavelength continuity constraint and wavelength integrity constraint when solving the Routing and Wavelength Assignment (RWA) problem in Wavelength-Division Multiplexing (WDM) transparent networks leads to inefficient utilization of network resources and results in higher rejection ratio. This is especially severe when dynamic traffic is considered. In this paper, we investigate the problem of improving network resources utilization efficiency by applying rerouting and set-up delay tolerance, a metric of Service Level Agreement (SLA) that has been exploited in literature for improvement in network performances, taking into account the aforementioned constraints. Moreover, we investigate further improvement in the duration of the service disruption period due to rerouting. As far as we know, this is the first study that exploits traffic rerouting for network with QoT constraints provisioned with set-up delay tolerance to get further improvement in network performances. The performances of the proposed algorithms are evaluated and discussed through extensive numerical experiments. Significant improvements are demonstrated, either in terms of rejection ratio or in terms of service disruption period, in comparison with previously proposed algorithms.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113982966","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024520
S. Evangelatos, Zannis Kalampoukis, Ioanna Fergadioti, Stelios Christofi, B. Karakostas, Y. Zorgios
In this paper, we address the problem of evaluating the aggregated services offered to the user through a multimodal travel planner. The effective design of a multimodal travel planner is considered a complex task since it requires the identification of the best possible route that combines segments of different transport modes. We describe a novel architecture and its respective connectivity infrastructure that incorporates all available travel-related services through the integration of several application programming interfaces (APIs) and we analyze its robustness regarding unplanned service interruptions using well-known mathematical tools such as the Stochastic Automata Networks. Additionally, we demonstrate the system's availability and effectiveness through realistic measurements obtained from the testing environments of various Global Distribution Systems (GDSs) and transport operators that result in the enhancement of the required Quality of Service (QoS) and Experience (QoE) for such intelligent systems.
{"title":"Service availability analysis of a multimodal travel planner using Stochastic Automata","authors":"S. Evangelatos, Zannis Kalampoukis, Ioanna Fergadioti, Stelios Christofi, B. Karakostas, Y. Zorgios","doi":"10.1109/ISCC.2017.8024520","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024520","url":null,"abstract":"In this paper, we address the problem of evaluating the aggregated services offered to the user through a multimodal travel planner. The effective design of a multimodal travel planner is considered a complex task since it requires the identification of the best possible route that combines segments of different transport modes. We describe a novel architecture and its respective connectivity infrastructure that incorporates all available travel-related services through the integration of several application programming interfaces (APIs) and we analyze its robustness regarding unplanned service interruptions using well-known mathematical tools such as the Stochastic Automata Networks. Additionally, we demonstrate the system's availability and effectiveness through realistic measurements obtained from the testing environments of various Global Distribution Systems (GDSs) and transport operators that result in the enhancement of the required Quality of Service (QoS) and Experience (QoE) for such intelligent systems.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114496633","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024575
J. Cichon, Maciej Gebala, M. Zawada
We consider the problem of reliable and minimal delay transmission in a wireless sensor network that uses time division in order to schedule its node-to-node communication in time-bounded manner. We propose an algorithm that uses the message acknowledgment method and solves this problem. We show bounds for its expected value of message delivery time. Moreover, our algorithm is based on simple state machine that do not require much computational power, thus could be executed on very weak devices.
{"title":"Fault tolerant protocol for data collecting in wireless sensor networks","authors":"J. Cichon, Maciej Gebala, M. Zawada","doi":"10.1109/ISCC.2017.8024575","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024575","url":null,"abstract":"We consider the problem of reliable and minimal delay transmission in a wireless sensor network that uses time division in order to schedule its node-to-node communication in time-bounded manner. We propose an algorithm that uses the message acknowledgment method and solves this problem. We show bounds for its expected value of message delivery time. Moreover, our algorithm is based on simple state machine that do not require much computational power, thus could be executed on very weak devices.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114502946","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024715
Hussain Albarakati, A. Amamra, Raafat S. Elfouly, R. Ammar
Underwater sensor networks are bounded by data sensing, transmitting, and forwarding limitations. The transmitting of large volumes of data can require a large amount of time and power. This has led researchers to focus on the new technology of underwater computing systems, in which information is extracted under the water using embedded processors via data mining and/or data compression. In this paper, a set of underwater embedded system (UWES) architectures is developed that can handle different network configurations. These developed architectures have a single processing node and are assumed to be homogenous. An architecture is selected to match a given set of requirements including data rate, processing node capabilities, gathering nodes capabilities, and water depth. Analytical models are developed for each type of architecture, which estimate both end to end delay and power consumption. Simulations that verify the results and evaluate the performance of the architectures are also provided.
{"title":"Reconfigurable underwater embedded systems architectures","authors":"Hussain Albarakati, A. Amamra, Raafat S. Elfouly, R. Ammar","doi":"10.1109/ISCC.2017.8024715","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024715","url":null,"abstract":"Underwater sensor networks are bounded by data sensing, transmitting, and forwarding limitations. The transmitting of large volumes of data can require a large amount of time and power. This has led researchers to focus on the new technology of underwater computing systems, in which information is extracted under the water using embedded processors via data mining and/or data compression. In this paper, a set of underwater embedded system (UWES) architectures is developed that can handle different network configurations. These developed architectures have a single processing node and are assumed to be homogenous. An architecture is selected to match a given set of requirements including data rate, processing node capabilities, gathering nodes capabilities, and water depth. Analytical models are developed for each type of architecture, which estimate both end to end delay and power consumption. Simulations that verify the results and evaluate the performance of the architectures are also provided.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123596121","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024667
Ahmed Soua, R. Soua
In wireless hostile environments such as tunnels, tall buildings, undergrounds and dense vegetation where Global Positioning System (GPS) signals can be unavailable, vehicles are prevented from exchanging accurate positions. Hence critical information may be lost or misled. To overcome these limitations, this paper proposes an innovative technique for localization estimation called SuPRANO, a Semi-suPervised manifold leaRning based locAlization algorithm for vehicular NetwOrks. The key innovation in our technique is leverage the theory of semi-supervised learning. Specifically, SuPRANO employs a certain number of well localized vehicles, called leading vehicles, that collect signal measurements from non-localized vehicles (non leading vehicles) to estimate the position of these latter. The resulting technique is naturally realistic and performs very well.
{"title":"SuPRANO: On the localization of connected vehicles in hostile environments: A Semi-suPervised manifold leaRning technique","authors":"Ahmed Soua, R. Soua","doi":"10.1109/ISCC.2017.8024667","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024667","url":null,"abstract":"In wireless hostile environments such as tunnels, tall buildings, undergrounds and dense vegetation where Global Positioning System (GPS) signals can be unavailable, vehicles are prevented from exchanging accurate positions. Hence critical information may be lost or misled. To overcome these limitations, this paper proposes an innovative technique for localization estimation called SuPRANO, a Semi-suPervised manifold leaRning based locAlization algorithm for vehicular NetwOrks. The key innovation in our technique is leverage the theory of semi-supervised learning. Specifically, SuPRANO employs a certain number of well localized vehicles, called leading vehicles, that collect signal measurements from non-localized vehicles (non leading vehicles) to estimate the position of these latter. The resulting technique is naturally realistic and performs very well.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124679095","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024677
S. Tolba, R. Ammar
Underwater robotic swarms have more challenging operating conditions when compared to their ground counterparts. One such major limitation is vastness of the oceanic environment, which significantly increases the possibility of losing swarm members. Although swarms can tolerate losses, if care is not taken in the design of swarm-level behaviors, they can cause a complete failure of the mission. An additional design factor for such systems is, therefore, the spatial constrained-ness of the swarm. Virtual Tether Search (VTS) has been developed to address this concern. Robots use a virtual tether attached to the drop-off location along with dead-reckoning to stay within a maximum-radius distance from that location. Constrained Spiral Flocking (CSF), a previously developed algorithm, Robotic Particle Swarm Optimization (R-PSO), and Simple Sweeping (SSW) are compared to VTS and pros and cons of each algorithm are highlighted. VTS is shown to have a superior behavior in terms of omni-directionality and loss-prevention at the expense of relatively slow, but guaranteed convergence.
{"title":"Virtual Tether Search: A self-constraining search algorithm for swarms in an open ocean","authors":"S. Tolba, R. Ammar","doi":"10.1109/ISCC.2017.8024677","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024677","url":null,"abstract":"Underwater robotic swarms have more challenging operating conditions when compared to their ground counterparts. One such major limitation is vastness of the oceanic environment, which significantly increases the possibility of losing swarm members. Although swarms can tolerate losses, if care is not taken in the design of swarm-level behaviors, they can cause a complete failure of the mission. An additional design factor for such systems is, therefore, the spatial constrained-ness of the swarm. Virtual Tether Search (VTS) has been developed to address this concern. Robots use a virtual tether attached to the drop-off location along with dead-reckoning to stay within a maximum-radius distance from that location. Constrained Spiral Flocking (CSF), a previously developed algorithm, Robotic Particle Swarm Optimization (R-PSO), and Simple Sweeping (SSW) are compared to VTS and pros and cons of each algorithm are highlighted. VTS is shown to have a superior behavior in terms of omni-directionality and loss-prevention at the expense of relatively slow, but guaranteed convergence.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121607346","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024603
Yuhang Ye, Brian A. Lee, R. Flynn, Niall Murray, Yuansong Qiao
Named Data Networking (NDN) is a promising Future Internet architecture to support efficient content distribution. Specifically, P2P may gain benefits from NDN, as NDN inherently provides a flexible forwarding plane for multi-source and multi-path communications. Existing studies in this area have proposed solutions, but these are adversely affected by link latency. This leads to illogical resource allocation and low link utilization for P2P. In this paper, we propose a new Heterogeneous-Latency Adaptive Forwarding (HLAF) strategy for peer-assisted video streaming in NDN. In peer-assisted video streaming, users (peers) proactively share the available content to others. By measuring the performance of forwarding interfaces, using both the level of congestion and the round-trip time, HLAF enables efficient P2P communication, which minimizes the latency and enhances the throughput. The experimental results show that the proposed strategy can enhance the peers' Quality of Experience (QoE).
{"title":"HLAF: Heterogeneous-Latency Adaptive Forwarding strategy for Peer-Assisted Video Streaming in NDN","authors":"Yuhang Ye, Brian A. Lee, R. Flynn, Niall Murray, Yuansong Qiao","doi":"10.1109/ISCC.2017.8024603","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024603","url":null,"abstract":"Named Data Networking (NDN) is a promising Future Internet architecture to support efficient content distribution. Specifically, P2P may gain benefits from NDN, as NDN inherently provides a flexible forwarding plane for multi-source and multi-path communications. Existing studies in this area have proposed solutions, but these are adversely affected by link latency. This leads to illogical resource allocation and low link utilization for P2P. In this paper, we propose a new Heterogeneous-Latency Adaptive Forwarding (HLAF) strategy for peer-assisted video streaming in NDN. In peer-assisted video streaming, users (peers) proactively share the available content to others. By measuring the performance of forwarding interfaces, using both the level of congestion and the round-trip time, HLAF enables efficient P2P communication, which minimizes the latency and enhances the throughput. The experimental results show that the proposed strategy can enhance the peers' Quality of Experience (QoE).","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129822196","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 : 2017-07-01DOI: 10.1109/ISCC.2017.8024573
Andrea Pinna, Giuseppe Portaluri, S. Giordano
This paper introduces a feasibility study of a low cost and power effective wireless acoustic sensor network for shooter localization. Currently deployed sensors for this application use a time domain gunshot signal analysis and high sampling rates, in the order of MS/s. We investigate an alternative Short Time Fourier Transform with a lower sampling rate (250 kS/s). We focus on a single channel single sensor approach for shooter ranging and we provide new experimental data. We implement a centralized gateway on top of the open and programmable board named ZedBoard. Our approach localizes the shooter with a distance error that ranges between roughly half and three meters, so the results are encouraging for further studies.
{"title":"Shooter localization in wireless acoustic sensor networks","authors":"Andrea Pinna, Giuseppe Portaluri, S. Giordano","doi":"10.1109/ISCC.2017.8024573","DOIUrl":"https://doi.org/10.1109/ISCC.2017.8024573","url":null,"abstract":"This paper introduces a feasibility study of a low cost and power effective wireless acoustic sensor network for shooter localization. Currently deployed sensors for this application use a time domain gunshot signal analysis and high sampling rates, in the order of MS/s. We investigate an alternative Short Time Fourier Transform with a lower sampling rate (250 kS/s). We focus on a single channel single sensor approach for shooter ranging and we provide new experimental data. We implement a centralized gateway on top of the open and programmable board named ZedBoard. Our approach localizes the shooter with a distance error that ranges between roughly half and three meters, so the results are encouraging for further studies.","PeriodicalId":106141,"journal":{"name":"2017 IEEE Symposium on Computers and Communications (ISCC)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130260408","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
扫码关注我们
求助内容：
应助结果提醒方式：