2011 IEEE 36th Conference on Local Computer Networks最新文献

筛选
英文 中文
Testing embedded software by metamorphic testing: A wireless metering system case study 用变形测试测试嵌入式软件:一个无线计量系统的案例研究
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115306
Fei-Ching Kuo, T. Chen, W. K. Tam
{"title":"Testing embedded software by metamorphic testing: A wireless metering system case study","authors":"Fei-Ching Kuo, T. Chen, W. K. Tam","doi":"10.1109/LCN.2011.6115306","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115306","url":null,"abstract":"In this paper, we present our experience of testing wireless embedded software. We used a wireless metering system in operation, and its software as a case study to demonstrate how a property-based testing technique, called metamorphic testing, can be used in detecting software failures of this wireless embedded system. Our study shows that a careful design of test environments and selection of system properties will enable us to trace back the cause of failures and help in fault diagnosis and debugging.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117241758","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}
引用次数: 33
Comparison of Authenticated-Encryption schemes in Wireless Sensor Networks 无线传感器网络中认证加密方案的比较
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115506
M. Simplício, B. Oliveira, Paulo L. Barreto, C. Margi, T. Carvalho, M. Näslund
{"title":"Comparison of Authenticated-Encryption schemes in Wireless Sensor Networks","authors":"M. Simplício, B. Oliveira, Paulo L. Barreto, C. Margi, T. Carvalho, M. Näslund","doi":"10.1109/LCN.2011.6115506","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115506","url":null,"abstract":"Security is an important concern in any modern network. This also applies to Wireless Sensor Networks (WSNs), especially those used in applications that monitor sensitive information (e.g., health care applications). However, the highly constrained nature of sensors impose a difficult challenge: their reduced availability of memory, processing power and energy hinders the deployment of many modern cryptographic algorithms considered secure. For this reason, the choice of the most memory-, processing- and energy-efficient security solutions is of vital importance in WSNs. To date, several authors have developed extensive analyses comparing different encryption algorithms and key management schemes, while very little attention has been given to message authentication mechanisms. In this paper, we address this issues by identifying Authenticated Encryption with Associated Data (AEAD) schemes suitable for WSNs and by evaluating their features and performance on TelosB sensor nodes. As a result of this analysis, we identify the recommended choices depending on the characteristics of the target network.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128221685","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
On the empirical performance of self-calibrating WiFi location systems 自校准WiFi定位系统的实证性能研究
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115548
D. Turner, S. Savage, A. Snoeren
{"title":"On the empirical performance of self-calibrating WiFi location systems","authors":"D. Turner, S. Savage, A. Snoeren","doi":"10.1109/LCN.2011.6115548","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115548","url":null,"abstract":"The pervasive deployment of 802.11 in modern enterprise buildings has long made it an attractive technology for constructing indoor location services. To this end, a broad range of algorithms have been proposed to accurately estimate location from 802.11 signal strength measurements, some without requiring manual calibration for each physical location. Prior work suggests that many of these protocols can be highly effective — reporting median errors of under 2 meters in some instances. However, there are few studies validating these claims at scale, nor comparing the algorithms in a uniform, realistic environment. Our work provides precisely this kind of empirical evaluation in a realistic office building environment. Surprisingly, we find that median errors in our environment are consistently greater than 5 meters and, counter-intuitively, that simpler algorithms frequently outperform their more sophisticated counterparts. In analyzing our results, we argue that unrealistic assumptions about access point densities and underlying variability in the indoor environment may preclude highly accurate location estimates based on 802.11 signal strength.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129658494","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}
引用次数: 58
Environmental context aware trust in mobile P2P networks 移动P2P网络环境上下文感知信任
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115312
Upendra Rathnayake, V. Sivaraman, R. Boreli
{"title":"Environmental context aware trust in mobile P2P networks","authors":"Upendra Rathnayake, V. Sivaraman, R. Boreli","doi":"10.1109/LCN.2011.6115312","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115312","url":null,"abstract":"With the growing popularity and capabilities of mobile devices, peer-to-peer networking among such devices is increasingly of interest for mobile content sharing. One of the major challenges in practical use of Mobile Peer-to-Peer networks (MP2P) is the trust among peers. Traditionally, solutions in the state of the art have focused on a peer's past experience in evaluating trust of other peers, based on direct interactions. Previously unknown peers (with no history of direct interactions) are assessed based on third party recommendations, yet again requiring a peer to evaluate and find trustworthy recommenders. This reveals the fundamental need to find peers with honest intentions before any interaction. It becomes challenging when no known peers are in the vicinity, which is highly likely in an MP2P scenario. For a general mobile user, the probability of encountering trustworthy peers in particular situations or environmental contexts may be higher than in other contexts, e.g. in office than on the road while traveling. Further, observed peers which are co-located over a number of environmental contexts may have more in common and thus resulting a higher mutual trust. These facts can be utilized to enrich the trust derivation process in a decentralized manner. In this paper, we propose a generalized and a novel distributed mechanism to estimate the trust for peers using their encounter history in different environmental contexts, and a way to prioritize contexts depending on the level of association with them. When evaluated against real user data of the reality mining dataset, the results of the proposed mechanism show a significantly improved accuracy of trust evaluation compared to the state of the art.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130884049","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
Intrusion detection system using Optimum-Path Forest 采用最优路径森林的入侵检测系统
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115182
C. R. Pereira, R. Nakamura, J. Papa, K. Costa
{"title":"Intrusion detection system using Optimum-Path Forest","authors":"C. R. Pereira, R. Nakamura, J. Papa, K. Costa","doi":"10.1109/LCN.2011.6115182","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115182","url":null,"abstract":"Intrusion detection systems that make use of artificial intelligence techniques in order to improve effectiveness have been actively pursued in the last decade. Neural networks and Support Vector Machines have been also extensively applied to this task. However, their complexity to learn new attacks has become very expensive, making them inviable for a real time retraining. In this research, we introduce a new pattern classifier named Optimum-Path Forest (OPF) to this task, which has demonstrated to be similar to the state-of-the-art pattern recognition techniques, but extremely more efficient for training patterns. Experiments on public datasets showed that OPF classifier may be a suitable tool to detect intrusions on computer networks, as well as allow the algorithm to learn new attacks faster than the other techniques.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128853414","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
Probabilistic data collection protocols for energy harvesting sensor networks 能量采集传感器网络的概率数据收集协议
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115318
Masaya Yoshida, T. Kitani, M. Bandai, Takashi Watanabe, P. Chou, Winston K.G. Seah
{"title":"Probabilistic data collection protocols for energy harvesting sensor networks","authors":"Masaya Yoshida, T. Kitani, M. Bandai, Takashi Watanabe, P. Chou, Winston K.G. Seah","doi":"10.1109/LCN.2011.6115318","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115318","url":null,"abstract":"Energy harvesting has been studied as a candidate for powering next generation wireless sensor networks. The technologies that can harvest electric power from ambient energy sources include solar, vibration, heat and wind. However, sensor nodes powered by energy harvesting devices cannot always communicate with other nodes because the energy harvesting devices cannot provide a stable supply power. A node cannot know whether its neighboring nodes have enough energy to receive a data packet that it has transmitted. During the process of relaying the packet, each additional hop increases the overall probability of losing the packet. In this paper, we propose two data collection protocols for the energy harvesting wireless sensor networks called Probabilistic ReTransmission protocol (PRT) and PRT with Collision Consideration (PRT-CC). The idea is to derive the number of times to retransmit a packet based on the reception probability and the active intervals computed by the receivers themselves. In PRT-CC, each node computes the reception probability with packet collision consideration. The simulation results show that the proposed protocols achieve higher delivery ratio than the previous works (GR-DD and GR-DD-RT).","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"173 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123368547","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}
引用次数: 15
User-centric quality of service provisioning 以用户为中心的服务提供质量
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115317
Mark E. Culverhouse, B. Ghita, P. Reynolds
{"title":"User-centric quality of service provisioning","authors":"Mark E. Culverhouse, B. Ghita, P. Reynolds","doi":"10.1109/LCN.2011.6115317","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115317","url":null,"abstract":"Current Internet traffic includes a combination of peer to peer, web, and real time traffic which leads to unfair treatment for users or, when policed, an uneven distribution of resources to applications. This paper presents a novel extension to the Assured Forwarding per-hop-behaviour for a Diffserv-based network, enabling a more user-centric approach when provisioning for Quality of Service over IP networks. The proposed architecture, Congestion Aware Packet Scheduler (CAPS), is based on monitoring application-level performance metrics and adjusting resource allocation in order to optimise the end user resulting application performance while dynamically adapting to variable traffic conditions. The CAPS algorithm is validated through extensive simulations of a large Internet topology coupled with realistic traffic models. The results show that, irrespective of the combination of user traffic, the CAPS algorithm successfully manages the allocation of bandwidth across applications to provide the optimal aggregate-QoS, offering an improvement over alternative network configurations","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122502115","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
Sensor monitoring of bridge movement: A system architecture 桥梁运动的传感器监测:一个系统架构
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115553
Robert Brännström, Daniel Granlund
{"title":"Sensor monitoring of bridge movement: A system architecture","authors":"Robert Brännström, Daniel Granlund","doi":"10.1109/LCN.2011.6115553","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115553","url":null,"abstract":"This paper describes a sensor-based accelerometer monitoring system for bridge monitoring. A system with 18 sensors will be mounted on a 130-meter long cable-strayed bridge that is built during the summer of 2011. In order to monitor the natural frequency of the bridge (including vibrations and damping) the system should manage accelerometer readings at 50 Hz. The communication channel, sample rate requirements and number of sensors put limitations on the system architecture.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131419758","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
Efficient temporal compression in wireless sensor networks 无线传感器网络的有效时间压缩
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115508
Yao Liang
{"title":"Efficient temporal compression in wireless sensor networks","authors":"Yao Liang","doi":"10.1109/LCN.2011.6115508","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115508","url":null,"abstract":"Energy efficiency is critical in the design and deployment of wireless sensor networks. Data compression is a significant approach to reducing energy consumption of data gathering in multi-hop sensor networks. Existing compression algorithms, however, only apply to either lossless or lossy compression, but not to both. This paper presents a unified algorithmic framework to both lossless and lossy data compression, thus effectively supporting the desirable flexibility of choosing either lossless or lossy compression in an on-demand fashion based on given applications. We analytically prove that the performance of the proposed framework for lossless compression is superior to or at least equivalent to that of traditional predictive coding schemes regardless of any entropy encoders used. We demonstrate the merits of our proposed framework in comparison with other recently proposed compression algorithms for wireless sensor networks including LEC, S-LZW and LTC using various real-world sensor data sets.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121842913","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}
引用次数: 29
A power-aware framework for distributed data fusion application in wireless sensor networks 无线传感器网络中分布式数据融合的功率感知框架
2011 IEEE 36th Conference on Local Computer Networks Pub Date : 2011-10-04 DOI: 10.1109/LCN.2011.6115168
Zongqing Lu, Su-Lim Tan, J. Biswas
{"title":"A power-aware framework for distributed data fusion application in wireless sensor networks","authors":"Zongqing Lu, Su-Lim Tan, J. Biswas","doi":"10.1109/LCN.2011.6115168","DOIUrl":"https://doi.org/10.1109/LCN.2011.6115168","url":null,"abstract":"In this paper, PAFusion, a power-aware framework for distributed data fusion applications in wireless sensor networks is proposed. It is designed for mapping distributed data fusion application into networks. We have evaluated the performances of PAFusion compared to DFuse and optimal solution through simulation. The simulation results show PAFusion has better performances than DFuse and PAFusion has much less overhead and causes only slightly more transmission cost than optimal solution.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127991656","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
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学术官方微信