2013 IEEE International Conference on Sensing, Communications and Networking (SECON)最新文献

筛选
英文 中文
Adaptive antenna adjustment for 3D urban wireless mesh networks 三维城市无线网状网络自适应天线调整
2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6644977
Guoqing Yu, Wei Wang, Kim Leng Yong, B. Leong, Wei Tsang Ooi
{"title":"Adaptive antenna adjustment for 3D urban wireless mesh networks","authors":"Guoqing Yu, Wei Wang, Kim Leng Yong, B. Leong, Wei Tsang Ooi","doi":"10.1109/SAHCN.2013.6644977","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6644977","url":null,"abstract":"We design and evaluate a new type of wireless mesh nodes called Dyntenna nodes that are equipped with steerable omnidirectional antenna. Designed for 3D wireless mesh networks, these nodes adaptively adjust the antenna orientation to increase throughput by improving the Received Signal Strength Indicator (RSSI) reading between nodes. We demonstrate the importance of being able to programmatically orient the antenna, by presenting the measurement results from our 3D urban mesh testbed. We propose a simple antenna adjustment algorithm that can improve the throughput for 26% of one-hop paths and 35% of multi-hop paths by a median value of 31% and 46%, respectively. Our algorithm converges quickly and typically probes less than 10% of all possible antenna orientations on average.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122726692","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
On-mote compressive sampling to reduce power consumption for wireless sensors 实时压缩采样,减少无线传感器的功耗
2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6644998
Marc J. Rubin, T. Camp
{"title":"On-mote compressive sampling to reduce power consumption for wireless sensors","authors":"Marc J. Rubin, T. Camp","doi":"10.1109/SAHCN.2013.6644998","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6644998","url":null,"abstract":"In this article, we introduce a novel on-mote compressive sampling method called the Randomized Timing Vector algorithm (RTV). In addition to describing this new lightweight algorithm, we provide experimental results that compare RTV to the two existing on-mote compressive sampling algorithms that we are aware: Additive Random Sampling (ARS) and Sparse Binary Sampling (SBS). Experimentation involved three different steps. First, we tested and validated the three on-mote compressive sampling algorithms using a simplistic sinusoid produced by a signal generator. Second, we analyzed the power consumption of the three algorithms and compared them to full sampling. Lastly, we simulated the three algorithms on a real-world passive seismic dataset containing avalanche events collected in the mountains of Switzerland. Results from our experiments indicate that our novel and lightweight RTV algorithm outperforms ARS and SBS in at least two ways. First, unlike ARS and SBS, RTV does not falter at moderate to high sampling rates (e.g., 500 Hz or above). Second, RTV showed the greatest power savings since it eliminates costly floating point calculations and reduces ADC conversions.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122519281","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
How to jam without getting caught: Analysis and empirical study of stealthy periodic jamming 如何在不被发现的情况下干扰:隐身周期性干扰的分析与实证研究
2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6645021
Bruce DeBruhl, P. Tague
{"title":"How to jam without getting caught: Analysis and empirical study of stealthy periodic jamming","authors":"Bruce DeBruhl, P. Tague","doi":"10.1109/SAHCN.2013.6645021","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6645021","url":null,"abstract":"Despite the widespread commercial use of spread spectrum technology, advanced algorithms and modern hardware capabilities still allows efficient denial-of-service attacks against wireless communication systems using jamming. Much of the recent work on jamming mitigation has focused on how to adjust the transmitter-receiver system once a jamming attack has been detected. However, characterizing the detectability of certain classes of jamming attacks remains a largely unstudied problem. We aim to narrow this gap by analyzing the effect of a class of periodic jamming attacks on the attack detection metrics of packet delivery ratio (PDR) and received signal strength (RSS). We show that a well-designed jamming signal can effectively defeat RSS-based detection while causing a significant and often devastating reduction in PDR, demonstrating that RSS-based detection is insufficient. We further evaluate our claims through implementation of a periodic jammer using a wide range of signal parameters against a transmitter-receiver pair communicating using IEEE 802.15.4, demonstrating the validity of our analytical claims.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122922941","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}
引用次数: 14
On packet size and error correction optimisations in low-power wireless networks 低功耗无线网络中数据包大小和纠错优化
2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6644980
Claro Noda, K. S. Prabh, M. Alves, T. Voigt
{"title":"On packet size and error correction optimisations in low-power wireless networks","authors":"Claro Noda, K. S. Prabh, M. Alves, T. Voigt","doi":"10.1109/SAHCN.2013.6644980","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6644980","url":null,"abstract":"In wireless networks that operate in those bands where spectrum sharing occurs across a variety of wireless technologies, such as the license-free Industrial Scientific and Medical (ISM) bands, mitigating interference becomes challenging. Addressing interference is an important aspect for the design and development of solutions intended to satisfy the demands of applications requiring QoS guarantees. In this paper, we investigate dynamic radio resource adaptation techniques based on instantaneous spectrum usage. Using a novel metric to quantify the spectrum usage, we address packet size and error correction code overhead optimizations. On one hand, large payloads lead to energy and throughput gains due to the amortization of the transmission overheads, but on the other hand, larger payloads imply larger resource wastage in the event of packet collisions. Using real-world data, we found that payload size in the neighbourhood of 100 bytes leads to near-optimal performance in general in the IEEE 802.15.4 networks. Our data also shows that for very high interference scenarios, erasure codes capable of correcting 10% of the packet payload can provide an equivalent Signal to Interference plus Noise Ratio (SINR) gain of 25 dB with probability greater than 0.6. This is significant for interference management and for increasing spatial re-use by employing lower transmission power. We show that erasure codes drastically improve energy-efficiency and throughput of low-power wireless links. In the heavy interference regime, even though interference doubles the energy-per-usable-bit cost, erasure codes remain cost-effective for very large payload sizes, up-to 1500 bytes. Finally, we discuss interference-dependent dynamic adjustment of the correction capacity of erasure codes.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129414606","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}
引用次数: 27
Mobile video delivery via human movement 移动视频传输通过人体运动
2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6645011
G. Lee, S. Rallapalli, Wei Dong, Yi-Chao Chen, L. Qiu, Yin Zhang
{"title":"Mobile video delivery via human movement","authors":"G. Lee, S. Rallapalli, Wei Dong, Yi-Chao Chen, L. Qiu, Yin Zhang","doi":"10.1109/SAHCN.2013.6645011","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6645011","url":null,"abstract":"This paper proposes VideoFountain, a novel service that deploys kiosks at popular venues to store and transmit digital media to users' personal devices using Wi-Fi access points, which may not have Internet connectivity. We leverage mobile users to deliver content to these kiosks. A key component in this design is an in-depth understanding of user mobility. We gather real mobility traces from two largest location-based social networks (Foursquare and Gowalla) and analyze both macroscopic and microscopic human mobility in different cities. Based on the insights we gain, we study several algorithms to determine the initial placement of content and design routing algorithms to optimize the content delivery. We further consider several practical issues, such as how to incentivize users to forward content, how to manage copyrights, how to ensure security, and how to achieve service discovery. We demonstrate the feasibility of VideoFountain using trace-driven simulations.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129219845","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}
引用次数: 13
Exploring MAC parallelization on software defined radio platforms 探索软件无线电平台上的MAC并行化
J. Ansari, Xi Zhang, S. Gaikwad, P. Mähönen
{"title":"Exploring MAC parallelization on software defined radio platforms","authors":"J. Ansari, Xi Zhang, S. Gaikwad, P. Mähönen","doi":"10.1145/2627788.2627796","DOIUrl":"https://doi.org/10.1145/2627788.2627796","url":null,"abstract":"Recent years have witnessed a number of new and fairly complex MAC schemes for cognitive radios and other reconfigurable networks. These emerging MAC protocols impose increasing demands for flexibility, real-time response and a closer interaction between the MAC- and the physical layers. Different designs for Software Defined Radio (SDR) platforms have been investigated to realize these protocols. In this context, hardware acceleration and flexibility through hardware-software partitioning emerge as the major design considerations for prototyping and over-the-air evaluation. Following the hardware-software partitioning philosophy, this demonstration will show how MAC schemes can be decomposed into constituent functional components and how different MAC functionalities, when possible, are scheduled in a parallel fashion to enhance the execution efficiency and flexibility. In particular, we have enabled a dual-processor interrupt driven hardware architecture and supported a customized real-time Operating System (OS) kernel on the commercially available and widely used WARP SDR platform [1]. Moreover, we have adapted our framework for composing MAC protocols based on their elementary functionalities [2] to the dual-processor, OS-supported architecture on WARP boards. Our demonstration will highlight the benefits of parallelization and efficient scheduling of MAC processes in embedded realizations on SDR platforms in order to achieve a high degree of flexibility while satisfying the hard real-time constraints.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125602664","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
Combined secure storage and communication for the Internet of Things 结合物联网的安全存储和通信
2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6645024
I. E. Bagci, S. Raza, T. Chung, U. Roedig, T. Voigt
{"title":"Combined secure storage and communication for the Internet of Things","authors":"I. E. Bagci, S. Raza, T. Chung, U. Roedig, T. Voigt","doi":"10.1109/SAHCN.2013.6645024","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6645024","url":null,"abstract":"The future Internet of Things (IoT) may be based on the existing and established Internet Protocol (IP). Many IoT application scenarios will handle sensitive data. However, as security requirements for storage and communication are addressed separately, work such as key management or cryp-tographic processing is duplicated. In this paper we present a framework that allows us to combine secure storage and secure communication in the IP-based IoT. We show how data can be stored securely such that it can be delivered securely upon request without further cryptographic processing. Our prototype implementation shows that combined secure storage and communication can reduce the security-related processing on nodes by up to 71% and energy consumption by up to 32.1%.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131770280","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}
引用次数: 28
Sub-carrier Switch Off in OFDM-based wireless local area networks 基于ofdm的无线局域网中的子载波关闭
2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6645015
Thomas Nitsche, J. Widmer
{"title":"Sub-carrier Switch Off in OFDM-based wireless local area networks","authors":"Thomas Nitsche, J. Widmer","doi":"10.1109/SAHCN.2013.6645015","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6645015","url":null,"abstract":"OFDM based wireless communication systems split the available frequency band into so-called sub-carriers, and data is transmitted on each of these sub-carriers in parallel. With frequency selective fading, sub-carriers may experience different channel qualities. Thus, choosing a different modulation and coding scheme (MCS) per sub-carrier improves performance. However, this comes at an increase in transceiver complexity and no current wireless system adapts the MCS at such a fine granularity. Some OFDMA based systems such as LTE allow to adapt the MCS per user, whereas wireless local area networks as specified by IEEE 802.11 use the same MCS on every sub-carrier. The performance of such wireless systems that use a single MCS in a frequency selective fading channel can be significantly improved through Sub-Carrier Switch Off (SSO), a simple but powerful alternative to adaptive MCS. SSO deactivates weak sub-carriers that excessively raise the error probability to improve the overall throughput. In this paper, we implement and test SSO in a software-defined radio testbed based on the Wireless Open Access Research Platform (WARP). We present a novel light-weight method for selecting the sub-carriers to be switched off based on the per-sub-carrier channel quality. The results we obtain from our measurements indicate that throughput increases of up to 250% are possible and thus SSO is a highly promising and very low complexity mechanism for future wireless local area networks.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130759082","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}
引用次数: 3
Plankton: An efficient DTN routing algorithm 浮游生物:一个有效的DTN路由算法
2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6645027
Xiangfa Guo, M. Chan
{"title":"Plankton: An efficient DTN routing algorithm","authors":"Xiangfa Guo, M. Chan","doi":"10.1109/SAHCN.2013.6645027","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6645027","url":null,"abstract":"In this paper, we present an efficient routing algorithm, Plankton, for Delay/Disruptive Tolerant Network (DTN). Plankton utilizes replica control to reduce overhead and contact probability estimates to improve performance. Plankton has two major features. First, it uses a combination of both short-term bursty contacts and long-term association based statistics for contact prediction. Second, it dynamically adjusts replication quotas based on estimated contact probabilities and delivery probabilities. Our evaluation on extensive traces shows that Plankton achieves significantly better prediction accuracy than existing algorithms for contact probability prediction. In addition, we show that while Plankton incurs much lower communication overhead compared to Spray-and-Wait, MaxProp and RAPID with savings from 14% to 88%, it can also achieve similar if not better delivery ratios and latencies.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131034854","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}
引用次数: 24
Toward optimal sniffer-channel assignment for reliable monitoring in multi-channel wireless networks 多信道无线网络中嗅探器信道分配的优化研究
2013 IEEE International Conference on Sensing, Communications and Networking (SECON) Pub Date : 2013-06-24 DOI: 10.1109/SAHCN.2013.6644979
Dong-Hoon Shin, S. Bagchi, Chih-Chun Wang
{"title":"Toward optimal sniffer-channel assignment for reliable monitoring in multi-channel wireless networks","authors":"Dong-Hoon Shin, S. Bagchi, Chih-Chun Wang","doi":"10.1109/SAHCN.2013.6644979","DOIUrl":"https://doi.org/10.1109/SAHCN.2013.6644979","url":null,"abstract":"This paper studies the optimal sniffer-channel assignment for reliable monitoring in multi-channel wireless networks. This problem concerns how to deploy certain sniffers in a network (and tune their channels) so that they can overhear and verify communication among the other nodes, referred to as normal nodes. Prior works have studied the optimal sniffer-channel assignment, but they assume perfect sniffers. However, in practice, sniffers may probabilistically make errors in monitoring, e.g., due to poor reception and compromise by an adversary. Hence, to maintain acceptable monitoring quality, a node needs to be overheard by multiple sniffers. We show that the optimal sniffer-channel assignment with sniffer redundancy differs fundamentally from the previous works due to the absence of a desirable property called submodularity. As a result, in our problem, the prior approximation algorithms no longer maintain their performance guarantees. We propose a variety of approximation algorithms based on two approaches-greedy strategy and relaxation-and-rounding approach. We present an empirical performance analysis of the proposed algorithms through simulations in practical networks. Our results suggest that our two algorithms show a performance trade-off between coverage and running time and are therefore suitable for different kinds of deployment.","PeriodicalId":206294,"journal":{"name":"2013 IEEE International Conference on Sensing, Communications and Networking (SECON)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131871310","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}
引用次数: 7
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学术官方微信