{"title":"Facing the obstructed path problem in indoor TOA-based ranging between IEEE 802.11 nodes","authors":"M. Ciurana, F. Barceló","doi":"10.1109/PIMRC.2008.4699665","DOIUrl":null,"url":null,"abstract":"TOA-based technology represents an alternative to overcome the current limitations of the indoor positioning systems using IEEE 802.11 networks infrastructures. The authors propose a new TOA-based ranging technique, which is the essential step towards the pursued positioning system, but tests have confirmed that its accuracy drastically decreases when a severe material obstruction exists between the involved nodes. This contribution describes an approach to overcome this problem and proposes a ranging algorithm specifically designed for such situations. Tests performed with a developed ranging prototype demonstrate the validity of the proposed solution.","PeriodicalId":125554,"journal":{"name":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2008.4699665","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
TOA-based technology represents an alternative to overcome the current limitations of the indoor positioning systems using IEEE 802.11 networks infrastructures. The authors propose a new TOA-based ranging technique, which is the essential step towards the pursued positioning system, but tests have confirmed that its accuracy drastically decreases when a severe material obstruction exists between the involved nodes. This contribution describes an approach to overcome this problem and proposes a ranging algorithm specifically designed for such situations. Tests performed with a developed ranging prototype demonstrate the validity of the proposed solution.