Pub Date : 2019-09-01DOI: 10.1109/Sarnoff47838.2019.9067818
Washington Medina, Francisco Novillo, Eduardo Chancay, Juan M. Romero-Arguello
Applying the Cognitive Radio paradigm to short-range systems inside buildings, it is intended to control two major drawbacks. The first one refers to controlling the efficiency in the use of the spectrum in interior scenarios, and the second is to overcome the inconvenience in the quality of service that arises when there are large quantities of short-range systems interfering with each other. Estimating the effective spectrum available inside a smart building is a big challenge. To do so, we must consider the deployment of users of the primary system, whose band would be reused. Large amounts of spectral opportunities have been found for the primary band, especially on the lower floors of the building. However, when considering the effect of shadowing on the interior of the building, it is shown that effective spectrum availability decreases.
{"title":"Discovering Shadowing Effects Over Effective Spectrum Availability Inside Smart Buildings for Cognitive Short Range Systems Operation","authors":"Washington Medina, Francisco Novillo, Eduardo Chancay, Juan M. Romero-Arguello","doi":"10.1109/Sarnoff47838.2019.9067818","DOIUrl":"https://doi.org/10.1109/Sarnoff47838.2019.9067818","url":null,"abstract":"Applying the Cognitive Radio paradigm to short-range systems inside buildings, it is intended to control two major drawbacks. The first one refers to controlling the efficiency in the use of the spectrum in interior scenarios, and the second is to overcome the inconvenience in the quality of service that arises when there are large quantities of short-range systems interfering with each other. Estimating the effective spectrum available inside a smart building is a big challenge. To do so, we must consider the deployment of users of the primary system, whose band would be reused. Large amounts of spectral opportunities have been found for the primary band, especially on the lower floors of the building. However, when considering the effect of shadowing on the interior of the building, it is shown that effective spectrum availability decreases.","PeriodicalId":306134,"journal":{"name":"2019 IEEE 40th Sarnoff Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130189645","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 : 2019-09-01DOI: 10.1109/Sarnoff47838.2019.9067821
Kervins Nicolas, Yi Wang, G. Giakos
Bitcoin is a well-known cryptocurrency in which records of transactions are maintained by a P2P network to create a distributed ledger. Due to the complex nature of maintaining highly efficient, transparent and speed transactions between nodes, security is one of the primary concerns of this system. The most prominent modern-day attacks to this system are the selfish mining and double spending attacks. This survey is organized around the aspects pertaining to countermeasures of selfish mining and double spending attacks. We selected a total of 20 primary studies from recent years as a result of a systematic analysis approach. In this study we will aim to classify, analyze, and evaluate these proposed methods in order to create a secure blockchain system. These countermeasures are being developed and are being experimented with in order to mitigate and/or even eliminate these attacks from occurring. These proposed frameworks and research papers will outline the keys to improving the blockchain architecture with code scripts and design parameters to increase the functionality of the blockchain. We aim to identify implications of these countermeasures to address vulnerabilities in the blockchain network for future research on this topic.
{"title":"Comprehensive Overview of Selfish Mining and Double Spending Attack Countermeasures","authors":"Kervins Nicolas, Yi Wang, G. Giakos","doi":"10.1109/Sarnoff47838.2019.9067821","DOIUrl":"https://doi.org/10.1109/Sarnoff47838.2019.9067821","url":null,"abstract":"Bitcoin is a well-known cryptocurrency in which records of transactions are maintained by a P2P network to create a distributed ledger. Due to the complex nature of maintaining highly efficient, transparent and speed transactions between nodes, security is one of the primary concerns of this system. The most prominent modern-day attacks to this system are the selfish mining and double spending attacks. This survey is organized around the aspects pertaining to countermeasures of selfish mining and double spending attacks. We selected a total of 20 primary studies from recent years as a result of a systematic analysis approach. In this study we will aim to classify, analyze, and evaluate these proposed methods in order to create a secure blockchain system. These countermeasures are being developed and are being experimented with in order to mitigate and/or even eliminate these attacks from occurring. These proposed frameworks and research papers will outline the keys to improving the blockchain architecture with code scripts and design parameters to increase the functionality of the blockchain. We aim to identify implications of these countermeasures to address vulnerabilities in the blockchain network for future research on this topic.","PeriodicalId":306134,"journal":{"name":"2019 IEEE 40th Sarnoff Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128316610","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 : 2019-09-01DOI: 10.1109/Sarnoff47838.2019.9067820
Y. Yaman, P. Spasojevic
Availability of large array usage in millimeter wave communications gives the opportunity to create narrow beams that yield to high antenna gains. However, in some cases, wider beams are of interest in order to increase the coverage area or reduce the outages caused by the channel variations. To address this need, beam broadening approaches with no increase in the hardware complexity have been described without studying the implementation difficulties. This paper proposes a simplified broadening model while adopting a strategy in which neighbor beams are concatenated to create a wider beam dividing the antenna into subarrays. The beamwidth and power loss analysis along with the beam broadening bounds in the design parameters are expressed in detail. Next, introduced broadening model is integrated to the hybrid beamforming system without changing its hardware structure. Simulation results that verify the analytical expressions for both broadening system and its hybrid beamforming implementation are provided.
{"title":"Varying the Beamwidth of Hybrid Beamforming for mmWave Communications","authors":"Y. Yaman, P. Spasojevic","doi":"10.1109/Sarnoff47838.2019.9067820","DOIUrl":"https://doi.org/10.1109/Sarnoff47838.2019.9067820","url":null,"abstract":"Availability of large array usage in millimeter wave communications gives the opportunity to create narrow beams that yield to high antenna gains. However, in some cases, wider beams are of interest in order to increase the coverage area or reduce the outages caused by the channel variations. To address this need, beam broadening approaches with no increase in the hardware complexity have been described without studying the implementation difficulties. This paper proposes a simplified broadening model while adopting a strategy in which neighbor beams are concatenated to create a wider beam dividing the antenna into subarrays. The beamwidth and power loss analysis along with the beam broadening bounds in the design parameters are expressed in detail. Next, introduced broadening model is integrated to the hybrid beamforming system without changing its hardware structure. Simulation results that verify the analytical expressions for both broadening system and its hybrid beamforming implementation are provided.","PeriodicalId":306134,"journal":{"name":"2019 IEEE 40th Sarnoff Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122537267","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 : 2019-09-01DOI: 10.1109/Sarnoff47838.2019.9067812
Zongwen Tang, P. Spasojevic, Chryssalenia Koumpouzi, F. Dagefu
Internet of Things (IoT) applications are anticipated to bloom in the future, and two popular industry areas related to Internet of Things (IoT) are smart houses and smart factories. To make a home or factory smart, hundreds or thousands of sensors need to work and communicate together with simple, secure and stable connectivity. Thus, the design of smart homes and smart factories relies on wireless sensor networks, whose transmission is often characterized to be sporadic. Classical approaches to multiuser communications rely on tight time synchronization achieved by employing coordinating infrastructure, but in a mass sensor transmission system, sensors may communicate with each other directly without relying on coordinating mechanisms. Our study explores the possibilities of simple and reliable multiuser detection in DS-CDMA system for few data and short distance mass sensor connectivity with joint synchronization of data. Furthermore, we discussed a scenario where spreading sequences are overused. We show that our system has strong potential for excellent mass sensors detection performance without synchronizing infrastructure.
{"title":"Simultaneous Synchronization and Detection in Loosely Synchronized Tiny Packet Networks","authors":"Zongwen Tang, P. Spasojevic, Chryssalenia Koumpouzi, F. Dagefu","doi":"10.1109/Sarnoff47838.2019.9067812","DOIUrl":"https://doi.org/10.1109/Sarnoff47838.2019.9067812","url":null,"abstract":"Internet of Things (IoT) applications are anticipated to bloom in the future, and two popular industry areas related to Internet of Things (IoT) are smart houses and smart factories. To make a home or factory smart, hundreds or thousands of sensors need to work and communicate together with simple, secure and stable connectivity. Thus, the design of smart homes and smart factories relies on wireless sensor networks, whose transmission is often characterized to be sporadic. Classical approaches to multiuser communications rely on tight time synchronization achieved by employing coordinating infrastructure, but in a mass sensor transmission system, sensors may communicate with each other directly without relying on coordinating mechanisms. Our study explores the possibilities of simple and reliable multiuser detection in DS-CDMA system for few data and short distance mass sensor connectivity with joint synchronization of data. Furthermore, we discussed a scenario where spreading sequences are overused. We show that our system has strong potential for excellent mass sensors detection performance without synchronizing infrastructure.","PeriodicalId":306134,"journal":{"name":"2019 IEEE 40th Sarnoff Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122853005","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 : 2019-09-01DOI: 10.1109/Sarnoff47838.2019.9067828
Janusz Kusyk, M. U. Uyar, Kelvin Ma, Kevin Budhu, Eltan Samoylov, Joseph Plishka, G. Bertoli, J. Boksiner, Dilip K. Guha
A self-organizing swarm of autonomous unmanned areal vehicles (UAVs) can provide a quick response to cyber-attacks in austere civilian and military environments. However, if a UAV swarm relies on centralized control, synchronization of swarm members, pre-planned actions or rule-based systems, it may not provide adequate and timely response against cyber attacks. We introduce game theory (GT) and biology inspired flight control algorithms to be run by each autonomous UAV to detect, localize and counteract rogue electromagnetic signal emitters. Each UAV positions itself such that the swarm tracks mobile adversaries while maintaining uniform node distribution and connectivity of the mobile ad-hoc network (MANET). UAVs use only their respective local neighbor information to determine their individual actions. Simulation experiments in OPNET show that our algorithms can provide an adequate area coverage over mobile interference sources. Our solution can be employed for civilian and military applications that require agile responses in dynamic environments.
{"title":"Game Theory and Biology Inspired Flight Control for Autonomous UAVs Operating in Contested Environments","authors":"Janusz Kusyk, M. U. Uyar, Kelvin Ma, Kevin Budhu, Eltan Samoylov, Joseph Plishka, G. Bertoli, J. Boksiner, Dilip K. Guha","doi":"10.1109/Sarnoff47838.2019.9067828","DOIUrl":"https://doi.org/10.1109/Sarnoff47838.2019.9067828","url":null,"abstract":"A self-organizing swarm of autonomous unmanned areal vehicles (UAVs) can provide a quick response to cyber-attacks in austere civilian and military environments. However, if a UAV swarm relies on centralized control, synchronization of swarm members, pre-planned actions or rule-based systems, it may not provide adequate and timely response against cyber attacks. We introduce game theory (GT) and biology inspired flight control algorithms to be run by each autonomous UAV to detect, localize and counteract rogue electromagnetic signal emitters. Each UAV positions itself such that the swarm tracks mobile adversaries while maintaining uniform node distribution and connectivity of the mobile ad-hoc network (MANET). UAVs use only their respective local neighbor information to determine their individual actions. Simulation experiments in OPNET show that our algorithms can provide an adequate area coverage over mobile interference sources. Our solution can be employed for civilian and military applications that require agile responses in dynamic environments.","PeriodicalId":306134,"journal":{"name":"2019 IEEE 40th Sarnoff Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114682531","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 : 2019-09-01DOI: 10.1109/Sarnoff47838.2019.9067816
Jorge Gonzalez, Joshua Clymer, Chad A. Bollmann
This work presents two explanatory mathematical models explaining how network traffic features that display Gaus-sian tendencies in single devices and small networks aggregate to alpha-stable processes in larger networks. The first model shows how self-similarity originates from an impulsive-noise-based representation of individual processes. A second model uses renewal processes to justify impulsive process aggregation to alpha-stable or Gaussian end states and permits estimating network traffic alpha-stable rates of convergence. We develop a model based on this first method to empirically validate this aggregation approach.
{"title":"Towards An Explanatory Model for Network Traffic","authors":"Jorge Gonzalez, Joshua Clymer, Chad A. Bollmann","doi":"10.1109/Sarnoff47838.2019.9067816","DOIUrl":"https://doi.org/10.1109/Sarnoff47838.2019.9067816","url":null,"abstract":"This work presents two explanatory mathematical models explaining how network traffic features that display Gaus-sian tendencies in single devices and small networks aggregate to alpha-stable processes in larger networks. The first model shows how self-similarity originates from an impulsive-noise-based representation of individual processes. A second model uses renewal processes to justify impulsive process aggregation to alpha-stable or Gaussian end states and permits estimating network traffic alpha-stable rates of convergence. We develop a model based on this first method to empirically validate this aggregation approach.","PeriodicalId":306134,"journal":{"name":"2019 IEEE 40th Sarnoff Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115929625","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 : 2019-09-01DOI: 10.1109/Sarnoff47838.2019.9067814
Haochen Pan, Yingjian Wu, Lewis Tseng, M. Rahman, Nakjung Choi
Recently, multiple research teams aimed to address the scalability and fault-tolerance issues of Network Functions (NFs) by implementing a storage system (or distributed shared object) to share state across NF instances. Each system demonstrated promising performance under specific scenarios. However, there are many more technical challenges to be addressed to build a production-ready storage system for NFs.In this paper, we enumerate these challenges, explain how some of them were addressed by previous systems, and discuss alternative promising solutions to tackle them. Most challenges remain as open problems, while others deserve more thorough study. The first goal of the paper is to provide a broad research agenda around this topic, by discussing more problems than solutions. Moreover, we advocate that the first step towards a production-ready system is to build a realistic yet extensible benchmarking tool to deploy, test, and analyze "network function storages" comprehensively. Toward this end, we present our tool – Network Function Storage Benchmarking (NFSB). Finally, we present some preliminary results using NFSB.
{"title":"A First Step Towards Production-Ready Network Function Storage: Benchmarking with NFSB","authors":"Haochen Pan, Yingjian Wu, Lewis Tseng, M. Rahman, Nakjung Choi","doi":"10.1109/Sarnoff47838.2019.9067814","DOIUrl":"https://doi.org/10.1109/Sarnoff47838.2019.9067814","url":null,"abstract":"Recently, multiple research teams aimed to address the scalability and fault-tolerance issues of Network Functions (NFs) by implementing a storage system (or distributed shared object) to share state across NF instances. Each system demonstrated promising performance under specific scenarios. However, there are many more technical challenges to be addressed to build a production-ready storage system for NFs.In this paper, we enumerate these challenges, explain how some of them were addressed by previous systems, and discuss alternative promising solutions to tackle them. Most challenges remain as open problems, while others deserve more thorough study. The first goal of the paper is to provide a broad research agenda around this topic, by discussing more problems than solutions. Moreover, we advocate that the first step towards a production-ready system is to build a realistic yet extensible benchmarking tool to deploy, test, and analyze \"network function storages\" comprehensively. Toward this end, we present our tool – Network Function Storage Benchmarking (NFSB). Finally, we present some preliminary results using NFSB.","PeriodicalId":306134,"journal":{"name":"2019 IEEE 40th Sarnoff Symposium","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117086152","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
扫码关注我们
求助内容：
应助结果提醒方式：