Skip to main content

An Adaptive Subcarrier Sharing Scheme for OFDM-Based Cooperative Cognitive Radios

An Adaptive Subcarrier Sharing Scheme for
OFDM-Based Cooperative Cognitive Radios

MODULES :
·        Node  Formation
·        Primary System Rate and Outage Probability
·        Secondary System Rate and Outage Probability
·        Data transmission
DESCRIPTION:
NODE FORMATION:
The channels over the nodes are modeled as frequency non-selective Rayleigh block fading.The instantaneous channel gain for each subcarrier over different nodes.
Primary System Rate and Outage Probability:            
In other words instantaneous data rate with BER-SC increases, consequently outage probability decreases. With cooperation ST behaves as an adaptive DF relay so as to provide diversity gain to the primary system. we propose an adaptive subcarrier sharing scheme for OFDM-based cooperative cognitive radio system, wherein cognitive (secondary) system helps the primary system to achieve its target rate of communication in exchange for opportunistic spectrum sharing.

Secondary System Rate and Outage Probability:
          Secondary transmitter uses adaptive mode of transmission to relay the primary signal with higher throughput while maintaining the BER constrain. In this work, a joint optimization problem is formulated for selective subcarrier
pairing and power allocation, wherein secondary system uses fraction of its subcarriers to boost the performance.

Data Transmission:
          data transmission is performed hop by hop usually using the form of flooding in flat routing scheme, but only CHs perform the task of data transmission in clustering routing scheme, which can decrease hops from data source to the BS, accordingly decrease latency. In addition, only CHs perform the task of data transmission in clustering routing scheme, which can save a great deal of energy consumption.




Comments

Post a Comment

Popular posts from this blog

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search

Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search ABSTRACT: In this paper, With advances in geo-positioning technologies and geo-location services, there are a rapidly growing amount of spatiotextual objects collected in many applications such as location based services and social networks, in which an object is described by its spatial location and a set of keywords (terms). Consequently, the study of spatial keyword search which explores both location and textual description of the objects has attracted great attention from the commercial organizations and research communities. In the paper, we study two fundamental problems in the spatial keyword queries: top k spatial keyword search (TOPK-SK), and batch top k spatial keyword search (BTOPK-SK). Given a set of spatio-textual objects, a query location and a set of query keywords, the TOPK-SK retrieves the closest k objects each of which contains all keywords in the query. BTOPK-SK is the batch processing of sets...
Post a Comment
Read more

A simple and reliable touch sensitive security system CODING

#include <REGX51.H> #include "lcd.c" #define MAX_DELAY() delay(65000) sbit Vibra_Sense=P3^1; sbit Buz=P1^0; void intro() {  lcd_init();  lcd_str("Touch Sensitive ",0x80);  lcd_str("Security System ",0xc0);  MAX_DELAY();MAX_DELAY();  lcd_clr();  }  void main()  { unsigned int i = 0, j= 0; intro();    while(1)    { lcd_str("Security Syst On",0x80); lcd_str("No Vibra Detectd",0xc0); Buz = 1; if(Vibra_Sense == 1) { while(Vibra_Sense == 1) delay(1000); } else { while(Vibra_Sense == 0) delay(1000); } Buz = 0; lcd_str("Vibraton Detectd",0xc0);delay(65000); while(1);    }  }
Post a Comment
Read more

A Time Efficient Approach for Detecting Errors in Big Sensor Data on Cloud

A Time Efficient Approach for Detecting Errors in Big Sensor Data on Cloud Abstract                                                                                                                                                      ...
Post a Comment
Read more