2016 IEEE 37th Sarnoff Symposium最新文献

筛选
英文 中文
Distributed spectrum monitoring and surveillance using a cognitive radio based testbed 基于认知无线电的分布式频谱监测和监视测试平台
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846736
Oluwaseyi Omotere, W. Oduola, Nan Zou, Xiangfang Li, Lijun Qian, D. Kataria
{"title":"Distributed spectrum monitoring and surveillance using a cognitive radio based testbed","authors":"Oluwaseyi Omotere, W. Oduola, Nan Zou, Xiangfang Li, Lijun Qian, D. Kataria","doi":"10.1109/SARNOF.2016.7846736","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846736","url":null,"abstract":"This paper described the development and implementation of a distributed spectrum monitoring and surveillance testbed for identifying and locating RF signals using the Universal Software Radio Peripheral (USRP). We use a centralized RF trace collection testbed to establish the baseline, and we focus on distributed RF trace collection. Challenges associated with synchronization is identified and candidate solutions are discussed. The distributed testbed was implemented using NI USRPs (293×/295×) with LabVIEW. The complex nature of implementing the distributed case necessitate the choice of LabVIEW because of the versatile features provided. Potential applications are discussed and sample traces are demonstrated.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126326137","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}
引用次数: 8
Lowest-cost network node identification for data caching for information centric networks 用于信息中心网络的数据缓存的最低成本网络节点标识
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846754
Zhengqi Jiang, Di Wu, R. Rojas-Cessa
{"title":"Lowest-cost network node identification for data caching for information centric networks","authors":"Zhengqi Jiang, Di Wu, R. Rojas-Cessa","doi":"10.1109/SARNOF.2016.7846754","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846754","url":null,"abstract":"We present the lowest-path cost to destination scheme for identification of the most suitable node for data caching. The scheme identifies the network node that yields the lowest-cost path for delivering data to demanding users. This scheme is applied to information centric networks (ICN) that consider two different data consumption modes: frequently and sporadically. We consider the use of Software-Defined Networking (SDN) to realize the distribution of data on identified network nodes and enable routing towards ICN caching nodes. We apply two different methods to evaluate the path costs: Dijkstra algorithm and Integer Linear Programming (ILP). Our results show that both adopted schemes provide similar results, converging into the identification of the same ICN caching nodes. We provide example of different scenarios and resulting costs. We also apply the proposed scheme to identify a stand-by node in case the most economical nodes fails, using the proposed scheme. We show that there is a trade-off between the extent of demand and the location of routers in the network.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125740226","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}
引用次数: 1
Configuring and controlling a software defined network with a Pica8 switch 用Pica8交换机配置和控制软件定义网络
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846732
Jason Loux, Dawei Li, Jie Wu
{"title":"Configuring and controlling a software defined network with a Pica8 switch","authors":"Jason Loux, Dawei Li, Jie Wu","doi":"10.1109/SARNOF.2016.7846732","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846732","url":null,"abstract":"Current network protocols are exceedingly strict, making the administrative duties of network providers difficult. The switches that control a network rely on stringent definitions, usually defined by the company who designed the switch, with which they can forward packets. Software Defined Networking (SDN) is a concept which allows control over the operations of a switch via remote software applications. But just how much control can we exhibit while writing these applications? And how well does a particular switch respond to this control? Using a Pica8 3297 OpenFlow switch in conjunction with five PowerEdge R210 severs and a Cisco switch, we analyze the response time and the control that the switch maintains while controlled by the Ryu SDN framework.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130643833","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}
引用次数: 1
Rescuing moribund NVM-based sensor nodes by an energy-efficient WCV routing algorithm 基于高效的WCV路由算法拯救垂死的nvm传感器节点
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846730
Chi-Heng Lee, Tseng-Yi Chen, Shuo-Han Chen, H. Wei, Heng-Yin Chen, W. Shih
{"title":"Rescuing moribund NVM-based sensor nodes by an energy-efficient WCV routing algorithm","authors":"Chi-Heng Lee, Tseng-Yi Chen, Shuo-Han Chen, H. Wei, Heng-Yin Chen, W. Shih","doi":"10.1109/SARNOF.2016.7846730","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846730","url":null,"abstract":"Sensor devices have been widely applied to variety applications, including internet of things (IoT), cyber physical systems (CPS) and environmental monitoring systems. Because all sensing data in such applications are very important for data analysis and mining in a host machine, sensor devices are equipped with non-volatile memory (NVM) [1] and nonvolatile processor [2], [3] to prevent sensing data in sensor nodes from data loss. As a result, sensing data can be permanently stored in a sensor device without the risk of data loss even if the battery of the sensor device is run out. Based on such observations, the lifetime of a sensor network should be redefined due to non-volatile technologies, such as NVM and NV processor. Conventionally, the lifetime of a sensor network is the time at which the first sensor node uses up its battery due to the consideration of sensor network QoS [4], [5]. However, since sensing data can be permanently stored in a local drive, the lifetime of a sensor network should be redefined as the time at which the first out-of-date data is produced in a sensor node. If the battery of a sensor node is run out but the sensor node does not contain any out-of-date data, the sensor node will be regarded as a moribund node. If all moribund nodes can be rescued by a rechargeable technology, the sensor network will be immortal. Such observations motivate us to design an energy-efficient solution to achieve the goal of immortal sensor network by exploiting the benefits of wireless charging vehicle.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121058409","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}
引用次数: 0
Improving timeliness of information through replicating requests 通过复制请求提高信息的时效性
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846775
Caleb Skinner, Yu Sang, Bo Ji
{"title":"Improving timeliness of information through replicating requests","authors":"Caleb Skinner, Yu Sang, Bo Ji","doi":"10.1109/SARNOF.2016.7846775","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846775","url":null,"abstract":"The Internet of Things has created an influx of data-generating devices. Applications that use these devices require the generated data to be transmitted in a timely manner. In this paper, we consider a Pull model, where remote clients will send requests to retrieve the information generated by multiple sources from the same random process. We assume that the update processes and response times of different sources are different. The timeliness, measured by age of information, depends not only on the freshness of information at the sources but also on the response times. Getting information from a fresh source with a large response time may lead to a larger age of information compared to getting information from a slightly less fresh source with a much smaller response time. Hence, an important objective is to optimize the timeliness of information obtained by the clients, accounting for the tradeoff between the freshness at the sources and the response times. We propose a replication scheme that improves age of information by replicating requests to multiple sources and waiting for a certain number of responses. We show through simulation that depending on the system parameters, the number of responses to wait for could be different for optimizing the information timeliness.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124056449","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}
引用次数: 4
Frame-based temporal occupancy characterization for compliance enforcement in opportunistic spectrum access networks 机会频谱接入网络中基于帧的时间占用特性
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846748
Sean Rocke, A. Wyglinski
{"title":"Frame-based temporal occupancy characterization for compliance enforcement in opportunistic spectrum access networks","authors":"Sean Rocke, A. Wyglinski","doi":"10.1109/SARNOF.2016.7846748","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846748","url":null,"abstract":"Multi-channel access and spectrum agility represent significant challenges to temporal occupancy modelling for compliance enforcement of individual users/networks in opportunistic spectrum access (OSA) scenarios. In previous work, temporal occupancy estimation within spectrum bands was examined, when there was no requirement to track individual user/network behaviors. This approach was in line with the predominantly licensed-based access models where individual users/networks did not need to be tracked. However, depending upon the specific measurement objectives, discrimination between different users/networks may be required. In envisioned OSA scenarios, such tracking may be more difficult, given the dynamics of proposed OSA techniques, as well as the different network management infrastructures. In this work, the random temporal sampling approach for estimation of temporal spectrum occupancy parameters is expanded. A frame-based sampling inversion technique for spectrum occupancy estimation is proposed, which can be used for estimating temporal parameters for a given user/network of interest. In this approach, parameters from randomly sampled frames are used to characterize temporal occupancy. The performance of the proposed approach is examined for temporal occupancy characterization, including circumstances where the monitoring node misses frames due to the sampling design, sensor limitations or through error conditions on a given channel. The work further motivates the use of probabilistic characterization of spectrum occupancy for compliance enforcement, given the non-deterministic behavior of dynamic spectrum access mechanisms in emerging wireless network deployment scenarios.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117233980","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}
引用次数: 0
Universal filtered multicarrier systems: Testbed deployment of a 5G waveform candidate 通用滤波多载波系统:5G候选波形的试验台部署
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846772
Selahattin Gökceli, Buse Canli, Günes Karabulut-Kurt
{"title":"Universal filtered multicarrier systems: Testbed deployment of a 5G waveform candidate","authors":"Selahattin Gökceli, Buse Canli, Günes Karabulut-Kurt","doi":"10.1109/SARNOF.2016.7846772","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846772","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) technique, with a broad usage in recent communication technologies, provides a good performance that is mostly appropriate for target quality of service levels. Yet, it will not be effective for future requirements due to its synchronization and spectral efficiency related communication system drawbacks. To address these issues, universal filtered multi-carrier (UFMC) technique has been proposed. Specifically, UFMC's less strict synchronization requirements and its increased spectral efficiency compared to the OFDM render it very desirable for 5G. In this study, UFMC is implemented by using software defined radios in real-time for the first time in the literature. With an effective synchronization solution, UFMC's design issues are tackled and a proper design model that is feasible for 5G requirements is demonstrated. Two methods are proposed for improvement of channel estimation and pilot usage for synchronization process. Moreover, as shown with real-time experiments, by carefully adjusting UFMC parameters, UFMC outperforms OFDM that is implemented in same configuration.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130052916","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}
引用次数: 11
Improving the 3-star approximation algorithm for relay node placement in wireless sensor network 改进无线传感器网络中继节点放置的3星逼近算法
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846724
Shuo-Han Chen, Tseng-Yi Chen, H. Wei, T. Hsu, Chen-Hung Huang, W. Shih
{"title":"Improving the 3-star approximation algorithm for relay node placement in wireless sensor network","authors":"Shuo-Han Chen, Tseng-Yi Chen, H. Wei, T. Hsu, Chen-Hung Huang, W. Shih","doi":"10.1109/SARNOF.2016.7846724","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846724","url":null,"abstract":"A Wireless Sensor Network (WSN) is composed by a larger number of low-power sensor nodes to gather environmental information and forward those gathered information wirelessly to a base station. However, due to the limited communication range of sensor nodes, relay nodes need to be included in order to make the whole WSN connected. Relay nodes are typically more advanced and more expensive than sensor nodes. Therefore, developing strategies to deploy relay nodes effectively and minimize the number of relay nodes has always been a hot research topic, also known as the Steiner Tree Problem with Minimum number of Steiner Points (SMT-MSP), which is proved to be NP-hard by previous work. In this paper, we analyze and improve the 3-star approximation algorithm by reducing the time complexity from O(n3) to O(n log n) with identical performance ratio. Experiments are conducted to verify the correctness of the proposed algorithm.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132244368","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}
引用次数: 0
Language of choice: On embedding choice-related semantics in a realizable protocol 选择语言:在可实现的协议中嵌入与选择相关的语义
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846760
Robinson Udechukwu, Shireesh Bhat, R. Dutta, G. Rouskas
{"title":"Language of choice: On embedding choice-related semantics in a realizable protocol","authors":"Robinson Udechukwu, Shireesh Bhat, R. Dutta, G. Rouskas","doi":"10.1109/SARNOF.2016.7846760","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846760","url":null,"abstract":"Choice-based future Internet architectures, in which choice is offered for fine-grained network services to different traffic flows, have been proposed in the literature. Such choice-based architectures have been envisioned in literature as realizing an economy of networking services that can give rise to a beneficial ecosystem of providers and consumers over time. Such an architecture would use an economy plane to allow service providers and customers to exchange information about available service alternatives, complete purchase and payment interactions, and use purchased services. While samples of such semantics have been proposed in these previous works, embedding them in specific realizations by defining messages to be exchanged and their syntax is a separate challenge, in which the needs for efficiency, ease of implementation, and extensibility, all need to be balanced. In this paper, we present the design of a possible embedding of the entities, and a functionally complete set of interactions, comprising a choice-based architecture. Further, to show the practical realizability of this embedding, we report on a prototype built on the GENI environment, and our experience in confronting real-world design issues. The prototype showcases new service models for value-added transport in such an architecture.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121286253","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}
引用次数: 6
DroidDeepLearner: Identifying Android malware using deep learning DroidDeepLearner:使用深度学习识别Android恶意软件
2016 IEEE 37th Sarnoff Symposium Pub Date : 2016-09-01 DOI: 10.1109/SARNOF.2016.7846747
Zi Wang, Juecong Cai, Sihua Cheng, Wenjia Li
{"title":"DroidDeepLearner: Identifying Android malware using deep learning","authors":"Zi Wang, Juecong Cai, Sihua Cheng, Wenjia Li","doi":"10.1109/SARNOF.2016.7846747","DOIUrl":"https://doi.org/10.1109/SARNOF.2016.7846747","url":null,"abstract":"With the proliferation of Android apps, encounters with malicious apps (malware) by mobile users are on the rise as vulnerabilities in the Android platform system are exploited by malware authors to access personal or sensitive information with ill intentions, often with financial gain in mind. To uphold security integrity and maintain user confidence, various approaches have been studied in the field of malware detection. As malware become more capable at hiding its malicious intent through the use of code obfuscation, it becomes imperative for malware detection techniques to keep up with the pace of malware changes. Currently, most of the existing malware detection approaches for Android platform use semantic pattern matching, which is highly effective but is limited to what the computers have encountered before. However, their performance degrades significantly when it comes to identifying malicious apps they have never tackled before. In this paper, we propose DroidDeepLearner, an Android malware characteri-zation and identification approach that uses deep learning algorithm to address the current need for malware detection to become more autonomous at learning to solve problems with less human intervention. Experimental results have shown that the DroidDeepLearner approach achieves good performance when compared to the existing widely used malware detection approaches.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"89 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126108174","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}
引用次数: 51
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信