1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia


Opción 1: Descargar recurso

Opción 2: Descargar recurso

Detalles del recurso

Descripción

This thesis proposes and analyzes data fusion algorithms that operate on the physical layer of a wireless sensor network, in the context of three applications of cognitive radios: 1. Cooperative spectrum sensing via binary consensus; 2. Multiple transmitter localization and communication footprint identification; 3.Target self-localization using beacon nodes. For the first application, a co-phasing based data combining scheme is studied under imperfect channel knowledge. The evolution of network consensus state is modeled as a Markov chain, and the average transition probability matrix is derived. Using this, the average hitting time and average consensus duration are obtained, which are used to determine and optimize the performance of the consensus procedure. Second, using the fact that a typical communication footprint map admits a sparse representation, two novel compressed sensing based schemes are proposed to construct the map using 1-bit decisions from sensors deployed in a geographical area. The number of transmitters is determined using the K-means algorithm and a circular fitting technique, and a design procedure is proposed to determine the power thresholds for signal detection at sensors. Third, an algorithm is proposed for self-localization of a target node using power measurements from beacon nodes transmitting from known locations. The geographical area is overlaid with a virtual grid, and the problem is treated as one of testing overlapping subsets of grid cells for the presence of the target node. The column matching algorithm from group testing literature is considered for devising the target localization algorithm. The average probability of localizing the target within a grid cell is derived using the tools from Poisson point processes and order statistics. This quantity is used to determine the minimum required node density to localize the target within a grid cell with high probability. The performance of all the proposed algorithms is illustrated through Monte Carlo simulations.

Pertenece a

ETD at Indian Institute of Science  

Autor(es)

Venugopalakrishna, Y R - 

Id.: 70104558

Idioma: inglés (Estados Unidos)  - 

Versión: 1.0

Estado: Final

Palabras claveCognitive Radios - 

Tipo de recurso: Thesis  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

Requerimientos técnicos:  Browser: Any - 

Relación: [References] G27571

Fecha de contribución: 10-ene-2018

Contacto:

Localización:

Otros recursos que te pueden interesar

  1. Spectrum Sensing in Cognitive Radios using Distributed Sequential Detection Cognitive Radios are emerging communication systems which efficiently utilize the unused licensed ra...
  2. Spectrum Sensing Receivers for Cognitive Radio Cognitive radios require spectral occupancy information in a given location, to avoid any interferen...
  3. Architecture and Design of Wide Band Spectrum Sensing Receiver for Cognitive Radio Systems To explore spectral opportunities in wideband regime for cognitive radio we need a wideband spectrum...
  4. Introducing Hierarchy in Energy Games International audience
  5. FPGA-based Implementation of Multiple PHY Layers of IEEE 802.15.4 Targeting SDR Platform International audience

Otros recursos de la mismacolección

  1. On Network Coding and Network-Error Correction The paradigm of network coding was introduced as a means to conserve bandwidth (or equivalently incr...
  2. Quantum Algorithmic Engineering with Photonic Integrated Circuits Integrated quantum photonics show monolithic waveguide chips to be a promising platform for realizin...
  3. Multi-Antenna Communication Receivers Using Metaheuristics and Machine Learning Algorithms In this thesis, our focus is on low-complexity, high-performance detection algorithms for multi-ante...
  4. Fast, Scalable, Contention-Based Algorithms for Multi-Node Selection in OFDMA and Cooperative Wireless Systems Opportunistic selection algorithms have grown in importance as next generation wireless systems stri...
  5. Design and Development of a Passive Infra-Red-Based Sensor Platform for Outdoor Deployment This thesis presents the development of a Sensor Tower Platform (STP) comprised of an array of Passi...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.