Investigation of Indoor Propagation Algorithms for Localization Purposes: Simulation and Measurements of Indoor Propagation Algorithms for Localization Applications using Wall Correction Factors, Local Mean Power Estimation and Ray Tracing Validations
View/
obeidat, h.a.n.pdf (17.34Mb)
Download
Supervisor
Abd-Alhameed, Raed A.Noras, James M.
Jones, Steven M.R.
Keyword
Indoor path loss modelIndoor propagation
Received signal strength
RSS
Ray tracing
Local mean power
Millimetre wave
Wireless Local Area Network
WLAN
Line of SightLoSTime of ArrivalToAAngle of ArrivalAoA
Rights
The University of Bradford theses are licenced under a Creative Commons Licence.
Institution
University of BradfordDepartment
Faculty of Engineering and InformaticsAwarded
2018Metadata
Show full item recordAbstract
The objective of this work is to enhance the awareness of the indoor propagation behaviour, by a set of investigations including simulations and measurements. These investigations include indoor propagation behaviour, local mean power estimation, proposing new indoor path loss model and introducing a case study on 60 GHz propagation in indoor environments using ray tracing and measurements. A summary of propagation mechanisms and manifestations in the indoor environment is presented. This comprises the indoor localization techniques using channel parameters in terms of angle of arrival (AOA), time of arrival (TOA) and received signal strength (RSS). Different models of path loss, shadowing and fast fading mechanisms are explored. The concept of MIMO channels is studied using many types of deterministic channel modelling such as Finite Difference Time Domain, Ray tracing and Dominant path model. A comprehensive study on estimating local average of the received signal strength (RSS) for indoor multipath propagation is conducted. The effect of the required number of the RSS data and their Euclidian distances between the neighbours samples are investigated over 1D, 2D and 3D configurations. It was found that the effect of fast fading was reduced sufficiently using 2D horizontal’s arrangement with larger spacing configuration. A modified indoor path loss prediction model is presented namely effective wall loss model (EWLM). The modified model with wall correction factors is compared to other indoor path loss prediction models using simulation data (for 2.4, 5, 28, 60 and 73.5 GHz) and real-time measurements (for 2.4 and 5 GHz). Different operating frequencies and antenna polarizations are considered to verify the observations. In the simulation part, EWLM shows the best performance among other models. Similar observations were recorded from the experimental results. Finally, a detailed study on indoor propagation environment at 60 GHz is conducted. The study is supported by Line of Sight (LoS) and Non-LoS measurements data. The results were compared to the simulated ones using Wireless-InSite ray tracing software. Several experiments have confirmed the reliability of the modelling process based on adjusted material properties values from measurements.Type
ThesisQualification name
PhDCollections
Related items
Showing items related by title, author, creator and subject.
-
Localized Quality of Service Routing Algorithms for Communication Networks. The Development and Performance Evaluation of Some New Localized Approaches to Providing Quality of Service Routing in Flat and Hierarchical Topologies for Computer Networks.Quality of Service (QoS) routing considered as one of the major components of the QoS framework in communication networks. The concept of QoS routing has emerged from the fact that routers direct traffic from source to destination, depending on data types, network constraints and requirements to achieve network performance efficiency. It has been introduced to administer, monitor and improve the performance of computer networks. Many QoS routing algorithms are used to maximize network performance by balancing traffic distributed over multiple paths. Its major components include bandwidth, delay, jitter, cost, and loss probability in order to measure the end users¿ requirements, optimize network resource usage and balance traffic load. The majority of existing QoS algorithms require the maintenance of the global network state information and use it to make routing decisions. The global QoS network state needs to be exchanged periodically among routers since the efficiency of a routing algorithm depends on the accuracy of link-state information. However, most of QoS routing algorithms suffer from scalability problems, because of the high communication overhead and the high computation effort associated with marinating and distributing the global state information to each node in the network.The goal of this thesis is to contribute to enhancing the scalability of QoS routing algorithms. Motivated by this, the thesis is focused on localized QoS routing that is proposed to achieve QoS guarantees and overcome the problems of using global network state information such as high communication overhead caused by frequent state information updates, inaccuracy of link-state information for large QoS state update intervals and the route oscillating due to the view of state information. Using such an approach, the source node makes its own routing decisions based on the information that is local to each node in the path. Localized QoS routing does not need the global network state to be exchanged among network nodes because it infers the network state and avoids all the problems associated with it, like high communication and processing overheads and oscillating behaviour. In localized QoS routing each source node is required to first determine a set of candidate paths to each possible destination. In this thesis we have developed localized QoS routing algorithms that select a path based on its quality to satisfy the connection requirements. In the first part of the thesis a localized routing algorithm has been developed that relies on the average residual bandwidth that each path can support to make routing decisions. In the second part of the thesis, we have developed a localized delay-based QoS routing (DBR) algorithm which relies on a delay constraint that each path satisfies to make routing decisions. We also modify credit-based routing (CBR) so that this uses delay instead of bandwidth. Finally, we have developed a localized QoS routing algorithm for routing in two levels of a hierarchal network and this relies on residual bandwidth to make routing decisions in a hierarchical network like the internet. We have compared the performance of the proposed localized routing algorithms with other localized and global QoS routing algorithms under different ranges of workloads, system parameters and network topologies. Simulation results have indicated that the proposed algorithms indeed outperform algorithms that use the basics of schemes that currently operate on the internet, even for a small update interval of link state. The proposed algorithms have also reduced the routing overhead significantly and utilize network resources efficiently.
-
Investigating the relationship between the distribution of local semantic concepts and local keypoints for image annotationThe problem of image annotation has gained increasing attention from many researchers in computer vision. Few works have addressed the use of bag of visual words for scene annotation at region level. The aim of this paper is to study the relationship between the distribution of local semantic concepts and local keypoints located in image regions labelled with these semantic concepts. Based on this study, we investigate whether bag of visual words model can be used to efficiently represent the content of natural scene image regions, so images can be annotated with local semantic concepts. Also, this paper presents local from global approach which study the influence of using visual vocabularies generated from general scene categories to build bag of visual words at region level. Extensive experiments are conducted over a natural scene dataset with six categories. The reported results have shown the plausibility of using the BOW model to represent the semantic information of image regions.
-
Local adaptation (mostly) remains local: reassessing environmental associations of climate-related candidate SNPs in Arabidopsis halleriNumerous landscape genomic studies have identified single-nucleotide polymorphisms (SNPs) and genes potentially involved in local adaptation. Rarely, it has been explicitly evaluated whether these environmental associations also hold true beyond the populations studied. We tested whether putatively adaptive SNPs in Arabidopsis halleri (Brassicaceae), characterized in a previous study investigating local adaptation to a highly heterogeneous environment, show the same environmental associations in an independent, geographically enlarged set of 18 populations. We analysed new SNP data of 444 plants with the same methodology (partial Mantel tests, PMTs) as in the original study and additionally with a latent factor mixed model (LFMM) approach. Of the 74 candidate SNPs, 41% (PMTs) and 51% (LFMM) were associated with environmental factors in the independent data set. However, only 5% (PMTs) and 15% (LFMM) of the associations showed the same environment-allele relationships as in the original study. In total, we found 11 genes (31%) containing the same association in the original and independent data set. These can be considered prime candidate genes for environmental adaptation at a broader geographical scale. Our results suggest that selection pressures in highly heterogeneous alpine environments vary locally and signatures of selection are likely to be population-specific. Thus, genotype-by-environment interactions underlying adaptation are more heterogeneous and complex than is often assumed, which might represent a problem when testing for adaptation at specific loci.
