发布求助
文献互助 智能选刊 最新文献

2009 IEEE Sarnoff Symposium最新文献

筛选
英文 中文
Band-segment protection in multi-granular optical networks 多颗粒光网络中的带段保护
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850305
Yang Wang, Xiaojun Cao
{"title":"Band-segment protection in multi-granular optical networks","authors":"Yang Wang, Xiaojun Cao","doi":"10.1109/SARNOF.2009.4850305","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850305","url":null,"abstract":"Protections are traditionally realized at fiber level (e.g., link protection) or wavelength level (e.g., path protection) in wavelength routing networks. With the advancing of waveband switching (WBS) techniques, these schemes may fail to efficiently accommodate the major goal of minimizing the node size (i.e., port count) in WBS networks. To achieve both the survivability and port reduction, we introduce the band-segment (BS) concept in WBS networks by which we can operate the protection at waveband level thus saving ports. Accordingly, we propose shared and dedicated protection schemes using band-segments, namely shared band-segment protection (SBSP) and dedicated band-segment protection (DBSP) for WBS networks. Our simulation shows DBSP outperforms dedicated path protection dramatically in terms of port count, while SBSP can achieve both resource sharing and port reduction.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117186552","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
Resisting node spoofing attacks in random key predistribution schemes: A uniform design 随机密钥预分配方案中抵抗节点欺骗攻击的统一设计
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850379
K. Chan, F. Fekri
{"title":"Resisting node spoofing attacks in random key predistribution schemes: A uniform design","authors":"K. Chan, F. Fekri","doi":"10.1109/SARNOF.2009.4850379","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850379","url":null,"abstract":"Current key predistribution schemes for wireless sensor networks derive the merit of their performance based on the resilience of secure communication links to node-compromise attacks. As an adversarial entity gathers key information, it is able to mount attacks by spoofing or eavesdropping on networked communications with growing success. A powerful variety of attack is possible with a spoofed node, which is when the adversary is able to present itself as a legitimate identity in the network and not be detected. This work considers the security of wireless sensor networks with a priority on node-spoofing attacks. We propose node-spoofing attack models to classify various adversarial capabilities. We then propose two new key predistribution techniques as variants to random key predistribution, which provide improved resilience to node-spoofing attacks.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126863057","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}
引用次数: 2
A beaconless node velocity-based stable path routing protocol for mobile ad hoc networks 一种基于无信标节点速度的移动自组网稳定路径路由协议
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850273
N. Meghanathan
{"title":"A beaconless node velocity-based stable path routing protocol for mobile ad hoc networks","authors":"N. Meghanathan","doi":"10.1109/SARNOF.2009.4850273","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850273","url":null,"abstract":"All the stable path routing protocols proposed in the literature for mobile ad hoc networks (MANETs) require beacon exchange among the neighbor nodes in order to choose stable links and paths. We propose a beaconless node velocity-based stable path (NVSP) routing protocol for MANETs. NVSP is an on-demand routing protocol that uses the broadcast Route-Request query cycle to discover routes when required. During the propagation of the Route-Request (RREQ) messages, every forwarding node includes its current node velocity information in the RREQs. The bottleneck velocity of a path is the maximum of the velocity of an intermediate node on the path. The destination chooses the path with the smallest bottleneck velocity and sends a Route-Reply (RREP) packet on the chosen path. The lifetime of NVSP routes is 25–35% and 55–75% more than that of the routes chosen by the minimum-hop based Dynamic Source Routing (DSR) protocol in networks of low and high density respectively. The lifetime of routes chosen by NVSP is 60–70% of the route lifetime incurred by the Flow-Oriented Routing Protocol (FORP), the routing protocol observed to determine the sequence of most stable routes in MANETs. On the other hand, the end-to-end delay per data packet and the energy consumed per packet incurred by NVSP are significantly lower than that of FORP and are lower or equal to that incurred for DSR.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130112698","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}
引用次数: 16
Low-noise-figure photonic links without pre-amplification 无预放大的低噪声图光子链路
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850375
E. Ackerman, G. Betts, W. Burns, C. Cox, M. Phillips, H. Roussell
{"title":"Low-noise-figure photonic links without pre-amplification","authors":"E. Ackerman, G. Betts, W. Burns, C. Cox, M. Phillips, H. Roussell","doi":"10.1109/SARNOF.2009.4850375","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850375","url":null,"abstract":"Using optical fiber to retrieve signals from remote sensors has several advantages compared to remoting by means of metallic waveguides such as coaxial cable. Fiber-optic retrieval of an RF signal can be achieved by down-converting and digitizing the signal for conveyance by a digital fiber-optic link, or it can be achieved by conveying the RF signal over an analog fiber-optic link before digitization. The latter approach can be realized with a minimum of hardware and dc power required at the sensing site, provided that the analog fiber-optic link has a sufficiently low noise figure without a pre-amplifier. Early demonstrations of “amplifierless” analog fiber-optic links typically reported very high noise figures—in excess of 30 dB. In the last decade or so, several techniques have been developed to improve this situation. We describe five such techniques and show that they have resulted in much lower measured noise figures for amplifierless links. One technique, for example, has yielded noise figures ≪ 5 dB for amplifierless links at frequencies of up to 10 GHz. The existence of amplifierless links with such low noise figures may enable remote sensing of signals in situations where the size, weight, and power (SWAP) of the remote hardware is of primary concern.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131304638","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
Robust wireless localization to attacks on access points 强大的无线定位攻击接入点
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850372
Junliang Yang, Yingying Chen, V. Lawrence, Venkataraman Swaminathan
{"title":"Robust wireless localization to attacks on access points","authors":"Junliang Yang, Yingying Chen, V. Lawrence, Venkataraman Swaminathan","doi":"10.1109/SARNOF.2009.4850372","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850372","url":null,"abstract":"Trustworthy location information is important because it is a critical input to a wide variety of location-based applications. However, the localization infrastructure is vulnerable to physical attacks and consequently the localization results are affected. In this paper, we focus on achieving robust wireless localization when attacks are present on access points. We first investigate the effects of attacks on localization. We then derive an attack-resistant scheme that can be integrated with existing localization algorithms and are not algorithm-specific. Our attack-resistant scheme are based on K-means clustering analysis. We examined our approach using received signal strength (RSS) in widely used lateration-based algorithms. We validated our method in the ORBIT testbed with an IEEE 802.11 (Wi-Fi) network. Our experimental results demonstrate that our proposed approach can achieve comparable localization performance when under access-point attacks as compared to normal situations without attack.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134194818","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}
引用次数: 23
A Deficit Round Robin with Fragmentation scheduler for IEEE 802.16e Mobile WiMAX IEEE 802.16e移动WiMAX中带碎片调度的亏损轮询
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850308
C. So-In, R. Jain, A. Tamimi
{"title":"A Deficit Round Robin with Fragmentation scheduler for IEEE 802.16e Mobile WiMAX","authors":"C. So-In, R. Jain, A. Tamimi","doi":"10.1109/SARNOF.2009.4850308","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850308","url":null,"abstract":"Deficit Round Robin (DRR) is a fair packet-based scheduling discipline commonly used in wired networks where link capacities do not change with time. In wireless networks especially wireless broadband networks such as IEEE 802.16e Mobile WiMAX, the link capacity can change over time and also depends on the user location. Moreover, Mobile WiMAX allows packet fragmentation which violates the packet-based service concept of DRR. Therefore, the traditional DRR can not directly be used in such networks. Therefore, we introduce Deficit Round Robin with Fragmentation (DRRF) to allocate resources in a fair manner, while allowing for varying link capacity. Similar to DRR and General Processor Sharing (GPS), the DRRF achieves perfect fairness. DRRF results in a higher throughput than DRR while causing less overhead than GPS. In addition, we extend DRRF to support users with minimum reserved traffic rate, maximum sustained traffic rate and traffic priority.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"AES-15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126535735","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}
引用次数: 16
Radio irregularity problem in wireless sensor networks: New experimental results 无线传感器网络中的无线电不规则性问题:新的实验结果
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850343
N. Ababneh
{"title":"Radio irregularity problem in wireless sensor networks: New experimental results","authors":"N. Ababneh","doi":"10.1109/SARNOF.2009.4850343","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850343","url":null,"abstract":"A key design issue in wireless networks is represented by the irregular and dynamic radio coverage at each node. This is especially true for wireless sensor networks, which usually employ low quality radio modules to reduce the cost. It results in irregularity in radio coverage and variations in packet reception in different directions. Due to its likely impact on the upper layer protocols, many services, such as localization, routing and others, needs to be resilient to the irregular and dynamic radio propagation, and to include mechanisms to deal with these problems. As such, accurate models of radio propagation patterns are important for protocol design and evaluation. In this paper, measurements of radio propagation patterns have been carried out using the motes themselves. With empirical data obtained from the Mica2 platforms we were able to observe and further quantify such phenomena. The results demonstrate that the radio pattern is largely random; however, radio signal attenuation varies along different direction, and more importantly, is time-varying while stationary.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134370838","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}
引用次数: 30
Generalized discrete Fourier transform: Theory and design methods 广义离散傅里叶变换:理论与设计方法
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850333
A. Akansu, H. Agirman-Tosun
{"title":"Generalized discrete Fourier transform: Theory and design methods","authors":"A. Akansu, H. Agirman-Tosun","doi":"10.1109/SARNOF.2009.4850333","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850333","url":null,"abstract":"Constant amplitude transforms like discrete Fourier transform (DFT), Walsh transform, nonlinear phase Walsh-like transforms and Gold codes have been successfully used in many wire-line and wireless communications technologies including code division multiple access (CDMA), discrete multi-tone (DMT), and orthogonal frequency division multiplexing (OFDM) types. In this paper, we present a generalized framework for DFT called Generalized DFT (GDFT) with nonlinear phase by exploiting the phase space. It is shown that GDFT offers sizable performance improvements over Walsh, Gold and DFT codes in multi-carrier communications scenarios considered. We also highlight that known constant modulus code families are special solutions of the proposed GDFT framework. Moreover, we introduce practical design methods offering computationally efficient implementations for GDFT. We expect performance improvements in future communications systems employing GDFT intelligently.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121163939","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}
引用次数: 9
Comparison of SPARLS and RLS algorithms for adaptive filtering 自适应滤波中SPARLS和RLS算法的比较
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850336
B. Babadi, N. Kalouptsidis, V. Tarokh
{"title":"Comparison of SPARLS and RLS algorithms for adaptive filtering","authors":"B. Babadi, N. Kalouptsidis, V. Tarokh","doi":"10.1109/SARNOF.2009.4850336","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850336","url":null,"abstract":"In this paper, we overview the Low Complexity Recursive L1-Regularized Least Squares (SPARLS) algorithm proposed in [2], for the estimation of sparse signals in an adaptive filtering setting. The SPARLS algorithm is based on an Expectation-Maximization type algorithm adapted for online estimation. Simulation results for the estimation of multi-path wireless channels show that the SPARLS algorithm has significant improvement over the conventional widely-used Recursive Least Squares (RLS) algorithm, in terms of both mean squared error (MSE) and computational complexity.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115854768","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}
引用次数: 12
0.6V correlators for WLAN receivers 用于WLAN接收器的0.6V相关器
2009 IEEE Sarnoff Symposium Pub Date : 2009-03-30 DOI: 10.1109/SARNOF.2009.4850355
T. V. Abaya, D. Ancajas, A. Ballesil-Alvarez, Louis A. Alarcon
{"title":"0.6V correlators for WLAN receivers","authors":"T. V. Abaya, D. Ancajas, A. Ballesil-Alvarez, Louis A. Alarcon","doi":"10.1109/SARNOF.2009.4850355","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850355","url":null,"abstract":"We present low power correlator circuits for direct sequence spread spectrum receivers. We evaluated the effectiveness of three types of logic families (Static CMOS, CP, Domino) in correlator design. The correlator is simple in its implementation using only summer and delay elements. The circuits were implemented using standard threshold voltage transistors in 90nm CMOS and operated with 0.6V supply. Conclusions regarding power, delay and area trade-offs are made. Baseline circuits were the static CMOS. Simulation results show that a Domino logic implementation results in a least power consumption and delay for a modest trade-off in area, however this comes at the price of complexity. The CPL implementation results in a 30% decrease in area for the same power consumption with a three times increase in delay. The optimum correlator is a domino logic-based correlator that consumes 1.54uW of power with a delay of 1.845ns.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122808951","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
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信