2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications最新文献

筛选
英文 中文
On the performance of dimension estimation-based spectrum sensing for cognitive radio 基于维数估计的认知无线电频谱感知性能研究
B. Zayen, A. Hayar
{"title":"On the performance of dimension estimation-based spectrum sensing for cognitive radio","authors":"B. Zayen, A. Hayar","doi":"10.1109/PIMRC.2011.6140003","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6140003","url":null,"abstract":"In this paper, we will derive closed-form expressions of false alarm probabilities for a given threshold for the dimension estimation-based detector (DED) using Akaike information criterion (AIC) and the minimum description length (MDL) criterion. Specifically, the DED algorithm will be formulated as a binary hypothesis test using AIC and MDL curves. Based on the proposed statistic test, we will express the probability of false alarm of the DED algorithm for a fixed threshold using the cumulative density function (CDF) for the distribution of Tracy-Widom of order two. The derived analytical decision thresholds are verified with Monte-Carlo simulations and a comparison between simulation and analytical results to confirm the theoretical results are presented. These results confirm the very good match between simulation and theoretic results.","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114579187","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
Limitations of trust management schemes in VANET and countermeasures VANET信任管理方案的局限性及对策
Zhen Huang, S. Ruj, M. A. Cavenaghi, A. Nayak
{"title":"Limitations of trust management schemes in VANET and countermeasures","authors":"Zhen Huang, S. Ruj, M. A. Cavenaghi, A. Nayak","doi":"10.1109/PIMRC.2011.6139695","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6139695","url":null,"abstract":"Vehicular networks ensure that the information received from any vehicle is promptly and correctly propagated to nearby vehicles, to prevent accidents. A crucial point is how to trust the information transmitted, when the neighboring vehicles are rapidly changing and moving in and out of range. Current trust management schemes for vehicular networks establish trust by voting on the decision received by several nodes, which might not be required for practical scenarios. It might just be enough to check the validity of incoming information. Due to the ephemeral nature of vehicular networks, reputation schemes for mobile ad hoc networks (MANETs) cannot be applied to vehicular ad hoc networks (VANET). We point out several limitations of trust management schemes for VANET. In particular, we identify the problem of information cascading and oversampling, which commonly arise in social networks. Oversampling is a situation in which a node observing two or more nodes, takes into consideration both their opinions equally without knowing that they might have influenced each other in decision making. We show that simple voting for decision making, leads to oversampling and gives incorrect results. We propose an algorithm to overcome this problem in VANET. This is the first paper which discusses the concept of cascading effect and oversampling effects to ad hoc networks.","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"39 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131603432","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}
引用次数: 31
A state classification method based on space-time signal processing using SVM for wireless monitoring systems 一种基于空时信号处理的支持向量机无线监测系统状态分类方法
Jihoon Hong, T. Ohtsuki
{"title":"A state classification method based on space-time signal processing using SVM for wireless monitoring systems","authors":"Jihoon Hong, T. Ohtsuki","doi":"10.1109/PIMRC.2011.6139913","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6139913","url":null,"abstract":"In this paper we focus on improving state classification methods that can be implemented in elderly care monitoring systems. The authors group has previously proposed an indoor monitoring and security system (array sensor) that uses only one array antenna as the receiver. The clear advantages over conventional systems are improvement of privacy concern from the usage of closed-circuit television (CCTV) cameras, and elimination of installation difficulties. Our approach is different from the previous detection method which uses an array of sensors and a threshold that can classify only two states: nothing and something happening. In this paper, we present a state classification method that uses only one feature obtained from the radio wave propagation, and assisted by multiclass support vector machines (SVM) to classify the occurring states. The feature is the first eigenvector that spans the signal subspace of interest. The proposed method can be applied to not only indoor environments but also outdoor environments such as vehicle monitoring system. We performed experiments to classify seven states in an indoor setting: “No event,” “Walking,” “Entering into a bathtub,” “Standing while showering,” “Sitting while showering,” “Falling down,” and “Passing out;” and two states in an outdoor setting: “Normal state” and “Abnormal state.” The experimental results show that we can achieve 96.5 % and 100 % classification accuracy for indoor and outdoor settings, respectively.","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"1 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":"130894875","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}
引用次数: 19
Maximum-likelihood MIMO detection using adaptive hybrid tree search 基于自适应混合树搜索的最大似然MIMO检测
Kuei-Chiang Lai, Jiun-Jie Jia, Li-Wei Lin
{"title":"Maximum-likelihood MIMO detection using adaptive hybrid tree search","authors":"Kuei-Chiang Lai, Jiun-Jie Jia, Li-Wei Lin","doi":"10.1109/PIMRC.2011.6139754","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6139754","url":null,"abstract":"A hybrid tree search algorithm is described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in the breadth-first (BF) manner until the probability that the current most likely path is correct exceeds a specified threshold, at which point the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast to the sphere decoding (SD) algorithm, the proposed algorithm uses the BF stage to enhance the accuracy of the initial DF search direction, by exploiting the diversity inherent in the SM scheme. Simulation results demonstrate that the proposed algorithm achieves a significantly lower complexity than the SD algorithm in many scenarios of practical interest.","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"1 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":"130031611","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
Efficient solution to decrease the effect of DoS attack against IP address ownership proof in Mobile IPv6 有效的解决方案,以减少DoS攻击对IP地址所有权证明在移动IPv6的影响
Kentaroh Toyoda, Yuta Kamiguchi, Shinichiro Inoue, I. Sasase
{"title":"Efficient solution to decrease the effect of DoS attack against IP address ownership proof in Mobile IPv6","authors":"Kentaroh Toyoda, Yuta Kamiguchi, Shinichiro Inoue, I. Sasase","doi":"10.1109/PIMRC.2011.6139694","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6139694","url":null,"abstract":"In Mobile IPv6(MIPv6), a Mobile Node(MN) communicating with the Correspondent Node(CN) cannot prove the ownership of the claimed IP address. If a malicious node impersonates victim's IP address, it could hijack the session or forward packets to non-existing destination or other nodes. Currently, in order for a MN to prove the ownership of its own IP address, it is considered to use Feige-Fiat-Shamir (FFS) identification scheme [1]. However, there is one serious problem. In this scheme, a CN has to verify all of the Binding Update requests, and this leads to DoS(Denial of Service) attack. This paper shows a method which mitigates the effect of the DoS attack by making the challenge twice in a transaction. We make the first challenge easily verified to exclude the malicious nodes and the second one much more difficult than the first one to avoid impersonation. This method can efficiently exclude the malicious nodes which do not have proper IP addresses by verifying the first challenge. Furthermore, by making the challenge twice, our scheme can decrease the probability of impersonation over the previous scheme for equivalent calculation amount. By the computer simulation, we show that the proposed scheme is efficient to decrease the effect of the DoS attack and the probability of impersonation compared to the previous scheme.","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"1 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":"130035982","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
UWB localization algorithm to improve accuracy under NLOS environment NLOS环境下提高精度的超宽带定位算法
K. Enda, R. Kohno
{"title":"UWB localization algorithm to improve accuracy under NLOS environment","authors":"K. Enda, R. Kohno","doi":"10.1109/PIMRC.2011.6139686","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6139686","url":null,"abstract":"The present paper considers how to improve estimation accuracy in a time of arrival (TOA) localization system using UWB in a non-line-of-sight (NLOS) environment for a sensor network. This algorithm consists of step-by-step compensation on the basis of two approaches considering a reference position which is estimated from data affected by NLOS delay. The first consideration consists of determining NLOS delays for each node, performing compensation to alleviate the effect on line of sight (LOS) nodes through a step-by-step compensation for the NLOS delay. The second consideration consists of compensating the effect of NLOS delay on the position determined on the basis of node distribution and geometrical relations of the estimated positions. Using these considerations, we show that the proposed algorithm outperforms the conventional algorithm in terms of estimation accuracy.","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"3 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":"127619290","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 nearest transmitter classification method for VLC based positioning system 基于VLC定位系统的最近发射机分类方法
Chinnapat Sertthin, T. Ohtsuki, O. Takyu, T. Fujii, Y. Umeda
{"title":"A nearest transmitter classification method for VLC based positioning system","authors":"Chinnapat Sertthin, T. Ohtsuki, O. Takyu, T. Fujii, Y. Umeda","doi":"10.1109/PIMRC.2011.6139702","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6139702","url":null,"abstract":"Nearest transmitter information is a mandatory requirement for utilizing Switching Estimated Receiver Position (SwERP) scheme, of which was proposed to enhance accuracy of Visible Light ID (VLID) positioning system. The conventional approach is achieved by controlling Sensitivity (RxS) limit. Conversely, general distance estimation by optical received power can also be used. Both of the mentioned methods have disadvantage on implementation complexity and inaccuracy due to noise fluctuation, respectively. In this paper, we propose a nearest transmitter classification (NTC) method by utilizing Optical Orthogonal Code (OOC) with On-Off Keying (OOK) modulation at transmitters (Txs), and perform oversampling at a receiver (Rx) to overcome the limitation of bandwidth resolution (B). The results confirm that the proposed method can classify the nearest Tx accurately, with some tradeoff with computation complexity from the increment of oversampling factor (Oc).","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"6 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":"133064778","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
Energy-efficient beacon-less protocol for WSN 无线传感器网络节能无信标协议
I. Amadou, G. Chelius, F. Valois
{"title":"Energy-efficient beacon-less protocol for WSN","authors":"I. Amadou, G. Chelius, F. Valois","doi":"10.1109/PIMRC.2011.6140118","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6140118","url":null,"abstract":"Energy-efficient communication protocol is a primary design goal for Wireless Sensor Networks (WSNs). Many efforts have been done to save energy: MAC with duty cycle, energy-aware routing protocols, data aggregation schemes, etc. Recently, beacon-less strategies have emerged as new direction to improve considerably the WSN lifetime. However, the main contributions are not suitable to real radio environments because of hole avoiding strategies based on either planarization or explicit neighbor solicitations. We propose PFMAC (Pizza- Forwarding Medium Access Control), which combines beacon-less geo-routing and energy efficient MAC protocol via a cross-layer design to save more energy with higher reliability. PFMAC supports radio interferences, asymmetric radio links, etc. PFMAC supports a greedy forwarding strategy and, a reactive and optimized neighborhood discovery at 2-hop to deal with holes. Intensive simulations are proposed to highlight the behavior and the performance of PFMAC compared to BOSS over BMAC.","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"280 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127287251","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
A new proposal for reliable unicast and multicast transport in Delay Tolerant Networks 延迟容忍网络中可靠单播和组播传输的新方案
Arshad Ali, T. Chahed, E. Altman, M. Panda, L. Sassatelli
{"title":"A new proposal for reliable unicast and multicast transport in Delay Tolerant Networks","authors":"Arshad Ali, T. Chahed, E. Altman, M. Panda, L. Sassatelli","doi":"10.1109/PIMRC.2011.6139673","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6139673","url":null,"abstract":"We propose a new scheme for reliable transport, both for unicast and multicast flows, in Delay Tolerant Networks (DTNs). Reliability is ensured through the use of Global Selective ACKnowledgements (G-SACKs) which contain detailed (and potentially global) information about the receipt of packets at all the destinations. The motivation for using G-SACKs comes from the observation that one should take the maximum advantage of the contact opportunities which occur quite infrequently in DTNs. We also propose sharing of “packet header space” with G-SACK information and allow for random linear coding at the relay nodes. Our results from extensive simulations of the proposed scheme quantify the gains due to each new feature.","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127594695","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
User position aware multicell beamforming for a distributed antenna system 分布式天线系统的用户位置感知多小区波束形成
T. Le, M. R. Nakhai
{"title":"User position aware multicell beamforming for a distributed antenna system","authors":"T. Le, M. R. Nakhai","doi":"10.1109/PIMRC.2011.6139736","DOIUrl":"https://doi.org/10.1109/PIMRC.2011.6139736","url":null,"abstract":"Implementing a distributed antenna system (DAS) improves system capacity and reduces transmit power. One challenge in a DAS is intercell interference due to simultaneously supporting multiple users with the same carrier frequency. We propose a multicell beamforming (MBF) technique to remove intercell interference amongst coordinated cells within a DAS. As the MBF technique requires circulations of users' data amongst groups of cells, we introduce a user position aware (UPA) MBF algorithm to reduce backhaul burden. Our proposed UPA MBF scheme guarantees a consistent quality of service to users irrespective of their locations within a cell with minimum total transmit power across base stations of a DAS. An effective sum rate formula is also derived to evaluate the backhaul effects on these schemes.","PeriodicalId":262660,"journal":{"name":"2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126423132","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学术文献互助群
群 号:481959085
Book学术官方微信