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

2011 11th International Symposium on Communications & Information Technologies (ISCIT)最新文献

筛选
英文 中文
Measuring anonymity using network coordinate systems 使用网络坐标系统测量匿名性
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089954
Thorsten Ries, R. State, T. Engel
{"title":"Measuring anonymity using network coordinate systems","authors":"Thorsten Ries, R. State, T. Engel","doi":"10.1109/ISCIT.2011.6089954","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089954","url":null,"abstract":"Popularity and awareness of anonymisation systems increased tremendously over the past years, however only a very few systems made it from research to production. These systems usually add intermediate nodes in the communication path aiming to hide user identities. Several attacks against these systems exist, like timing attacks or exploitation of latency information. In this paper, we propose an alternative approach to disclose users of current popular anonymisation systems in practice by the means of virtual network coordinate systems, a widely accepted method for latency prediction and network optimisation. Mapping physical nodes to a n-dimensional space can reveal a geographical proximity that is used to disclose users, who expect to stay anonymous. We define a model that leverages network coordinates in order to measure quantitatively the anonymity services and evaluate it on the Planet-Lab research network. The basic idea is to analyse the relative distance between nodes and to calculate the probability of nodes being hosted in the same location. Evaluation proves that our proposed model can be used as a measure of anonymity.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132499467","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
PAPR reduction with harmony annealing research for OFDM systems OFDM系统谐波退火降低PAPR的研究
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6092149
Jing Gao, Jinkuan Wang, Bin Wang, Xin Song
{"title":"PAPR reduction with harmony annealing research for OFDM systems","authors":"Jing Gao, Jinkuan Wang, Bin Wang, Xin Song","doi":"10.1109/ISCIT.2011.6092149","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092149","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) system has the problem of high peak-to-average power ratio (PAPR) due to its multiple sub-carriers. In general, partial transmitted sequence (PTS) technique is applied to obtain optimal PAPR reduction performance, but its exhausted search for the optimal phase factors must be accomplished accordingly. As the number of sub-blocks and phase factors increase, the computational complexity increases exponentially. In order to tackle this problem, a new method is proposed to find the sub-optimal phase factor using harmony annealing search. Comparison is performed between the proposed method and the various techniques developed previously. Simulation results show that the proposed algorithm can yield good tradeoff between PAPR reduction performance and computational complexity.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124423329","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
Active RFID positioning of vehicles in road traffic 道路交通中车辆的有源RFID定位
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089737
Enzhan Zhang, Yujun Kuang, Weili Jiang, M. Umer
{"title":"Active RFID positioning of vehicles in road traffic","authors":"Enzhan Zhang, Yujun Kuang, Weili Jiang, M. Umer","doi":"10.1109/ISCIT.2011.6089737","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089737","url":null,"abstract":"Vehicle positioning is critical for Inter-vehicle Communication, navigation, vehicle monitoring and tracking, which are regarded as the technology to make everyday-driving safer. Conventional positioning methods (for example GPS) have poor accuracy (approximately ten meters, D-GPS has higher accuracy about one or two meters.), and could not positioning onto the lane, which is not enough to satisfy vehicle safety requirements such as collision avoidance. RFID (Radio Frequency Identification) is an old but newly emerged technology. In this paper, we propose RFID technology into vehicle positioning to improve positioning performance. The idea of this positioning scheme is that the RFID tags are installed along lanes on road to form RFID matrix and the vehicle equipped with RFID readers locate itself by retrieving position information from tags around it, thus called Active RFID Positioning (ARP). The proposed ARP scheme not only dramatically improves the accuracy of positioning; it is also more practical as well for scenarios like tunnels or underground parking where GPS is not available now.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121235501","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}
引用次数: 35
An auxiliary unicode Han character lookup service based on glyph shape similarity 基于字形形状相似性的辅助unicode汉字符查找服务
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6092155
Jeng-Wei Lin, Feng-Sheng Lin
{"title":"An auxiliary unicode Han character lookup service based on glyph shape similarity","authors":"Jeng-Wei Lin, Feng-Sheng Lin","doi":"10.1109/ISCIT.2011.6092155","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092155","url":null,"abstract":"Most legacy computer systems only well support input and display of 20,902 Han characters (Hanzis for short) encoded in Unicode 1.0. In 2010, Unicode 6.0 has encoded 75,616 Hanzis. However, it is not easy to use these newly encoded Hanzis, even in the latest computers. Most of these newly encoded Hanzis are rarely used in daily lives. Some are only used in ancient literature or individual Sinospherical countries. Users may have confusion of their glyph shapes, pronunciations, meanings, and usages. Most Chinese IMEs (input method editors) require users to have good knowledge of Hanzis. As a result, users cannot input these Hanzis. We present an auxiliary Unicode Hanzi lookup service based on glyph shape similarity. One can key in a similar Hanzi by any IME to look up the wanted Hanzi. Each Unicode Hanzi is decomposed as a glyph expression. The similarity of glyph shapes of two Hanzis is calculated based on a derived edit distance on their glyph expressions. As a result, the system provides users a convenient way to look up unfamiliar Hanzis.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129150046","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
Multichannel non-persistent CSMA MAC schemes with reinforcement learning for cognitive radio networks 基于强化学习的认知无线网络多通道非持久CSMA MAC方案
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6092159
Yi Tang, D. Grace, T. Clarke, Jibo Wei
{"title":"Multichannel non-persistent CSMA MAC schemes with reinforcement learning for cognitive radio networks","authors":"Yi Tang, D. Grace, T. Clarke, Jibo Wei","doi":"10.1109/ISCIT.2011.6092159","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092159","url":null,"abstract":"This paper presents two multichannel non-persistent CSMA (M-np-CSMA) MAC schemes using Simple Reinforcement Learning and State-Action-Reward-State-Action (SARSA) learning respectively for distributed cognitive radio networks. The two learning schemes both use reinforcement learning to help the users learn the environment and historical transmissions. Compared with M-np-CSMA MAC protocol with random channel choice, the learning schemes can help the cognitive users choose the best channels which offer more spectrum access opportunities to sense and access. The results show that both learning schemes can effectively improve the throughput and decrease the packet delay at heavy traffic loads and with a large number of cognitive users. The Simple Reinforcement Learning scheme and SARSA scheme can achieves a 15% and 25% improvement in the maximum throughput respectively, compared with the M-np-CSMA without learning.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117268909","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
Improved roughening algorithm and hardware implementation for particle filter applied to bearings-only tracking 改进的粗化算法和硬件实现的粒子滤波应用于轴承跟踪
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089738
Shaohua Hong, Lin Wang
{"title":"Improved roughening algorithm and hardware implementation for particle filter applied to bearings-only tracking","authors":"Shaohua Hong, Lin Wang","doi":"10.1109/ISCIT.2011.6089738","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089738","url":null,"abstract":"In this paper, we propose an improved roughening algorithm and its hardware architecture to solve the sample impoverishment problem for particle filter (PF) applied to bearings-only tracking (BOT) problem. The reasonable distribution of the roughening jitter is calculated from the innovations and states related to the survived particles. Simulation results indicate that the PF with the proposed improved roughening algorithm outperforms the general PF and the PF with existing roughening algorithm. Experimental study shows that this roughening algorithm can be efficiently implemented in hardware and the PF with this roughening algorithm can effectively solve the BOT problem.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114259248","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
An improved routing protocol for power-line network based on AODV 一种改进的基于AODV的电力网路由协议
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089739
Wei Gao, Wenguang Jin, Hao Li
{"title":"An improved routing protocol for power-line network based on AODV","authors":"Wei Gao, Wenguang Jin, Hao Li","doi":"10.1109/ISCIT.2011.6089739","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089739","url":null,"abstract":"According to the topological feature of the power-line network, an improved On Demand Distance Vector (IPODV) routing is proposed to ensure an efficient data transmission. It is based on Ad hoc On-Demand Distance Vector (AODV) Routing which is a powerful routing protocol used in ad-hoc networks to deal with the fast changing logical topology. IPODV improves two modules of conventional AODV: neighbor table management and route maintenance mechanism. The improved neighbor table management is applied to select stable neighbors to participate in the route discovery. Meanwhile, the route maintenance mechanism is improved to reduce the routing maintenance overhead. It is shown by simulations and experiments that IPODV reduces the routing overhead and improves the stability of the routes compared to conventional AODV.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128176071","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}
引用次数: 10
Markov chain analysis of IEEE 802.11 wireless networks with greedy behavior and heterogeneous traffic 具有贪婪行为和异构流量的IEEE 802.11无线网络的马尔可夫链分析
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089956
Xijie Liu, T. Saadawi
{"title":"Markov chain analysis of IEEE 802.11 wireless networks with greedy behavior and heterogeneous traffic","authors":"Xijie Liu, T. Saadawi","doi":"10.1109/ISCIT.2011.6089956","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089956","url":null,"abstract":"In this paper, we investigate various greedy behavior scenarios that may appear in IEEE 802.11 wireless networks, and provide performances of the MAC layer using a two-dimensional Markov chain analytical model. We obtain the performance of greedy behaving nodes having different Poisson packet arriving rates for different wireless network topology structures and multiple greedy strategies. Besides the analytical results, we present also the simulation results.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123750447","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
An improved decoding algorithm for refined clipping noise in IDMA system with limited peak transmission 有限峰值传输IDMA系统中细化裁剪噪声的改进译码算法
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6092184
Yier Yan, Xueqin Jiang, M. Lee
{"title":"An improved decoding algorithm for refined clipping noise in IDMA system with limited peak transmission","authors":"Yier Yan, Xueqin Jiang, M. Lee","doi":"10.1109/ISCIT.2011.6092184","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6092184","url":null,"abstract":"In this work, we propose a novel algorithm to combat the clipping noise in Interleave-division multiple access (IDMA) which inherits a peak-to-average power ratio (PAPR) problem especially in large number of multiple accesses. Clipping transmission is efficiently applied to reduce the PAPR to cause the clipping noise which is a weak tradeoff [1][2] to its performance. The proposed algorithm consists of the ordering multiple access interferences and estimating the statistics of refined clipping noise in each detection. The reason is that the estimated statistics of interferences and clipping noise will be carried to the next iteration for updating the clipping noise. The simulation results show that the performance is similar to that of no limited transmission case.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131449349","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
Detecting bursts in P2P based semi-autonomous underwater acoustic sensor networks 基于P2P的半自主水声传感器网络突发检测
2011 11th International Symposium on Communications & Information Technologies (ISCIT) Pub Date : 2011-12-01 DOI: 10.1109/ISCIT.2011.6089740
Ming Xu, Guangzhong Liu
{"title":"Detecting bursts in P2P based semi-autonomous underwater acoustic sensor networks","authors":"Ming Xu, Guangzhong Liu","doi":"10.1109/ISCIT.2011.6089740","DOIUrl":"https://doi.org/10.1109/ISCIT.2011.6089740","url":null,"abstract":"Underwater Acoustic Sensor Networks (UW-ASNs) consist of a variable number of sensors and vehicles that are deployed to perform collaborative monitoring tasks over a given area through collecting monitored data or data streams. Detecting bursts in data streams of UW-ASNs is an important area of research with a wide range of applications. In this paper, we build semi-autonomous underwater acoustic sensor networks based on Peer-to-Peer (P2P) technology for sharing various UW-ASNs' information. In addition, we propose a novel approach for solving the problem of elastic burst detection in UW-ASNs based on evolutionary game theory. Extensive experiments have been carried out to assess the performance of the proposed method. The obtained results show that our burst detection method performs better than existing method with different data distributions.","PeriodicalId":226552,"journal":{"name":"2011 11th International Symposium on Communications & Information Technologies (ISCIT)","volume":"2000 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128272010","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学术文献互助群
群 号：481959085
Book学术官方微信