2010 Fifth International Conference on Systems and Networks Communications最新文献

筛选
英文 中文
Localization Using Multisensor Fusion of IMM Fixed Lag Smoother in a Cricket Sensor Network 基于IMM固定滞后平滑的多传感器融合定位蟋蟀传感器网络
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.26
H. Song, V. Shin
{"title":"Localization Using Multisensor Fusion of IMM Fixed Lag Smoother in a Cricket Sensor Network","authors":"H. Song, V. Shin","doi":"10.1109/ICSNC.2010.26","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.26","url":null,"abstract":"We propose an approach for estimating the location of target moving over a time delayed sensor field via a distributed interacting multiple model fixed-lag smoother in conjunction with multiple pseudo measurements obtained using a trilateration positioning algorithm. Proposed pseudo measurements that indirectly measure the target position are defined using the results of trilateration positioning method, in a Cricket sensor network, as single nodes only can measure the distance to the target, the nodes need to form groups of three to be able to perform trilateration. Also, since the trilateration method ignores distance-measurement errors, adequate error covariance information is estimated for pseudo measurement model using a self-tuning method. Each distinct group makes local pseudo measurements with a time delay and fused using matrix weight fusion. Based on these algorithms, localization performance enhancement of a moving target is achieved.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133709442","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 Cross-Layer Subcarrier Allocation Scheme with QoS Guarantee and Fairness in IEEE 802.16e System IEEE 802.16e系统中具有QoS保证和公平性的跨层子载波分配方案
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.62
Feng-Ming Yang, T. Cheng, Jean-Lien C. Wu, Wei-Mei Chen
{"title":"A Cross-Layer Subcarrier Allocation Scheme with QoS Guarantee and Fairness in IEEE 802.16e System","authors":"Feng-Ming Yang, T. Cheng, Jean-Lien C. Wu, Wei-Mei Chen","doi":"10.1109/ICSNC.2010.62","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.62","url":null,"abstract":"Due to the limited bandwidth usage of wireless transmission, one of the major research topics is how to make a higher system throughput to support the multiple users based on limited bandwidth resources. This paper proposed a cross-layer subcarrier permutation mechanism (CLSP) and designed the service scheduling in the IEEE 802.16e system. The simulation results showed that when the throughput of system transmission become completely in use, the throughput of cross-layer proportional fair subcarrier permute mechanism is 28 percent more than the throughput of PUSC (Partial Usage of sub-channels) model formed by the IEEE 802.16e committee. In the user capacity, the number of users of cross-layer proportional fair subcarrier permute mechanism is 17 percent more than the number of users of PUSC. Moreover, cross-layer proportional fair subcarrier permute mechanism has a lower delay time as well as a long-term fairness among different users during the different service flows simulation.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134486887","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
Dynamics of Feedback-Induced Packet Delay in Power-Law Networks 幂律网络中反馈诱导的分组延迟动力学
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.64
Takahiro Hirayama, S. Arakawa, Ken-ichi Arai, M. Murata
{"title":"Dynamics of Feedback-Induced Packet Delay in Power-Law Networks","authors":"Takahiro Hirayama, S. Arakawa, Ken-ichi Arai, M. Murata","doi":"10.1109/ICSNC.2010.64","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.64","url":null,"abstract":"Measurement studies of the Internet topology revealed that the degree distributions of the Internet topologies follow a power law. That is, existing probability of nodes having k links is proportional to k^{−γ}. However, only the power-law degree distribution does not determine network-level performance of networking methods. That is, the structural characteristics of topologies other than the degree distribution are essential to discuss the behavior of networking methods. In this paper, we investigate traffic dynamics on ISP’s router-level topology where the degree distribution exhibits power-law attribute and each of the nodes interacts via end-to-end flow control functionality. We show packet delay dynamics on the BA topology generated by the BA model and the ISP’s router-level topology. Simulation results show that the end-to-end packet delay distributions exhibit a heavy tail by the TCP model. Moreover, the number of links that are highly fluctuated is more than twice comparing to the results of the stop-and-wait model. Even in this case, the modularity structure of the ISP topology reduces the number of highly fluctuated link comparing to the results of the BA topology.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132084345","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
AES Performance Analysis on Several Programming Environments, Operating Systems or Computational Platforms AES在多种编程环境、操作系统或计算平台上的性能分析
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.33
R. Tomoiaga, M. Stratulat
{"title":"AES Performance Analysis on Several Programming Environments, Operating Systems or Computational Platforms","authors":"R. Tomoiaga, M. Stratulat","doi":"10.1109/ICSNC.2010.33","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.33","url":null,"abstract":"Advanced Encryption Standard’s performance is changing depending on the platform it is run. In doing these benchmarks, we observed the behavior of AES algorithm on several programming environments, on different operating systems and on various computational platforms concluding that not all of them offer the same performance. We noticed, in doing these tests, that the best performance is offered by CUDA environment using the Graphic Processing Unit.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115980303","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
Modeling Energy Consumption of Wireless Sensor Networks by SystemC 基于SystemC的无线传感器网络能耗建模
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.20
W. Du, F. Mieyeville, D. Navarro
{"title":"Modeling Energy Consumption of Wireless Sensor Networks by SystemC","authors":"W. Du, F. Mieyeville, D. Navarro","doi":"10.1109/ICSNC.2010.20","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.20","url":null,"abstract":"Energy consumption is one of the most important metrics in wireless sensor networks because of the limited power supply in sensor nodes. Many efforts have been taken to reduce the energy consumption of the hardware, software, communication protocols and applications. Simulation is widely used to evaluate the performance of these new designs. Thus, it is necessary to accurately model the energy consumption during the simulation of WSN. In this paper, an energy model for WSN is proposed. It has been implemented in IDEA1, a simulator for WSN developed by SystemC and C++. It enables the energy estimation of both the hardware components of an individual node and the whole sensor network. It can be easily calibrated to different types of node if the electrical characteristics of the hardware components are available. An application based on IEEE 802.15.4 and MICAz motes is studied to demonstrate the capability of the energy model.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114731900","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}
引用次数: 47
CUPID - Communication Pattern Informed Duty Cycling in Sensor Networks 丘比特——传感器网络中通知占空比的通信模式
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.17
Daniel Kruger, D. Pfisterer, S. Fischer
{"title":"CUPID - Communication Pattern Informed Duty Cycling in Sensor Networks","authors":"Daniel Kruger, D. Pfisterer, S. Fischer","doi":"10.1109/ICSNC.2010.17","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.17","url":null,"abstract":"Now that sensor networks are gradually deployed in commercial settings, they must live up to many expectations, particularly offering both years of unattended operation and low-delay event reporting. However, experiences from real-world trials have shown that decent trade-offs between these two conflicting goals are hard to find. In this paper, we show how staggered wake-ups achieve this. We call this low-delay and low-power duty cycle management scheme CUPID because its parameterization is based on the expected communication patterns in the network, duty-cycle and latency requirements. We show by simulations and real-world experiments with more than 150 nodes that our scheme significantly reduces the packet delay for low-duty cycle settings, especially in large networks.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116245902","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
An Approach for Protecting Privacy on Social Networks 一种保护社交网络隐私的方法
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.30
Asim Sinan Yuksel, Mehmet Erkan Yuksel, A. Zaim
{"title":"An Approach for Protecting Privacy on Social Networks","authors":"Asim Sinan Yuksel, Mehmet Erkan Yuksel, A. Zaim","doi":"10.1109/ICSNC.2010.30","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.30","url":null,"abstract":"Social networking has become a part of our life. We redundantly share our personal information with people in social networks and Internet. These networks allow users to share just about everything: data, photos, videos, favorite music, status updates, and more applications. Sharing large amounts of information causes privacy and security problems for users in these networks. To prevent privacy problems, we can provide built-in applications that help to protect our privacy by limiting the friends who get access to our personal information. Many users still do not make use of these applications. Users fail to use the application either because they are not aware that it exists or because of the tedious process that is involved when manually grouping friends into different categories to form a friends list. The privacy problem has prompted us to provide a solution that offers the social networks users an opportunity to protect their privacy. In this study, a privacy and security technique, its algorithm and design were mentioned. Our approach proposes an API, which provides grouping of friends through an automated system into different social groups by analyzing the user’s social graph and depending on what common information they would like to share that should not be accessed by other friends. We assume that a user shares the same information in a group, as we call social circles. Finding these social circles will help users to group their friends easily and meaningfully.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129564292","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
Multiple Loop Antenna against Skimming Attack 多环路天线抗掠读攻击
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.28
Ricardo Malherbi Martins, S. Bacquet, Jacques Reverdy
{"title":"Multiple Loop Antenna against Skimming Attack","authors":"Ricardo Malherbi Martins, S. Bacquet, Jacques Reverdy","doi":"10.1109/ICSNC.2010.28","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.28","url":null,"abstract":"In this paper, new models of antennas are studied and implemented in order to prevent RFID passive cards from skimming attacks. Their effectiveness is proved thanks to measurement confirming the simulation tools prediction. With our countermeasure antenna design, an RFID card cannot be easily skimmed, without a well positioning of the skimmer, even in short ranges (","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129186201","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
Server Impersonation Attacks and Revisions to SLAP, RFID Lightweight Mutual Authentication Protocol RFID轻量级互认证协议SLAP的服务器模拟攻击与修订
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.29
Mete Akgun, M. Çaglayan
{"title":"Server Impersonation Attacks and Revisions to SLAP, RFID Lightweight Mutual Authentication Protocol","authors":"Mete Akgun, M. Çaglayan","doi":"10.1109/ICSNC.2010.29","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.29","url":null,"abstract":"In this paper, we analyze the security of the lightweight RFID mutual authentication protocol called SLAP proposed by Godor et al. at Globecom 2008. It is claimed that SLAP can resist the well-known attacks and does not demand high computational capacity. We present server impersonation attacks against SLAP in which an adversary that does not know the internal state of the tag can easily impersonate the valid back-end to valid tag. This attack also breaks synchronization between back-end and tag. We also propose a revised mutual authentication protocol that eliminates the vulnerabilities of the SLAP.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133095091","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 Data Collection and Lifetime Improvement in Wireless Sensor Networks through Data Imputation 基于数据输入的无线传感器网络鲁棒数据采集和寿命改进
2010 Fifth International Conference on Systems and Networks Communications Pub Date : 2010-08-22 DOI: 10.1109/ICSNC.2010.16
Jong Chern Lim, C. Bleakley
{"title":"Robust Data Collection and Lifetime Improvement in Wireless Sensor Networks through Data Imputation","authors":"Jong Chern Lim, C. Bleakley","doi":"10.1109/ICSNC.2010.16","DOIUrl":"https://doi.org/10.1109/ICSNC.2010.16","url":null,"abstract":"In this paper, a data imputation method, which can achieve robust data collection and also extend network lifetime for Wireless Sensor Networks, is proposed. Due to the lossy nature of the wireless medium, it is common for packets to be lost. In order to provide some reliability for the application layer, a data imputation method which predicts the data values contained in missing packets is proposed. The method is able to maximize the use of both temporal and spatial predictors. The proposed imputation method improves accuracy by up to 73% when compared with a previously proposed imputation method. The method can also be used to reduce the number of retransmissions in the network by up to 12% at the cost of a small increase in error, thus increasing the network lifetime of the wireless sensor network.","PeriodicalId":152012,"journal":{"name":"2010 Fifth International Conference on Systems and Networks Communications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122077449","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}
引用次数: 5
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学术官方微信