Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850279
M. Ivrlac, J. Nossek
Both in the signal processing and in the information theory literature, it is common to assume that the array gain of antenna arrays grows linearly with the number of antennas. However, such an assertion is valid only when the antennas are uncoupled. When antenna coupling is present and properly taken into account by the signal processing algorithms, we show that both the transmit and the receive array gain can grow super-linearly with the number of antennas. In special cases, the receive array gain can even grow exponentially with the antenna number. These results are exciting, for they imply that the potential of radio communication systems which use more than one antenna at the receiver or the transmitter, is likely to be much higher than previously reported.
{"title":"Transmit and receive array gain of uniform linear arrays of isotrops","authors":"M. Ivrlac, J. Nossek","doi":"10.1109/SARNOF.2009.4850279","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850279","url":null,"abstract":"Both in the signal processing and in the information theory literature, it is common to assume that the array gain of antenna arrays grows linearly with the number of antennas. However, such an assertion is valid only when the antennas are uncoupled. When antenna coupling is present and properly taken into account by the signal processing algorithms, we show that both the transmit and the receive array gain can grow super-linearly with the number of antennas. In special cases, the receive array gain can even grow exponentially with the antenna number. These results are exciting, for they imply that the potential of radio communication systems which use more than one antenna at the receiver or the transmitter, is likely to be much higher than previously reported.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"93 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129419706","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}
Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850276
R. Marin-Lopez, Fernando Pereñíguez, Y. Ohba, Fernando Bernal, A. F. Gómez Skarmeta
In this paper we propose an architecture aimed for reducing the latency of network access authentication based on the Extensible Authentication Protocol (EAP). The architecture is based on the design of a new EAP method for which a standalone authenticator is used, and does not require any change to the EAP specification or the specifications of EAP lower-layers such as IEEE 802.11 and IEEE 802.16e. We also show
{"title":"A transport-based architecture for fast re-authentication in wireless networks","authors":"R. Marin-Lopez, Fernando Pereñíguez, Y. Ohba, Fernando Bernal, A. F. Gómez Skarmeta","doi":"10.1109/SARNOF.2009.4850276","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850276","url":null,"abstract":"In this paper we propose an architecture aimed for reducing the latency of network access authentication based on the Extensible Authentication Protocol (EAP). The architecture is based on the design of a new EAP method for which a standalone authenticator is used, and does not require any change to the EAP specification or the specifications of EAP lower-layers such as IEEE 802.11 and IEEE 802.16e. We also show","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123116207","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}
Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850353
L. Vangelista, M. Rotoloni
In this paper the second generation digital terrestrial distribution system standardized by the Digital Video Broadcasting Consortium (DVB-T2) is considered and, in particular, we focus on the new structure of the P1 training symbol. Two algorithms making use of this symbol are proposed and analyzed, one for the recovery of the carrier frequency offset, the other for the channel estimation. In particular, their performances are evaluated, theoretically and via simulations, and finally compared to the respective Cramer Rao Lower Bound (CRLB). The results show the two algorithms perform very close to the respective CRLB.
{"title":"On the analysis of P1 symbol performance for DVB-T2","authors":"L. Vangelista, M. Rotoloni","doi":"10.1109/SARNOF.2009.4850353","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850353","url":null,"abstract":"In this paper the second generation digital terrestrial distribution system standardized by the Digital Video Broadcasting Consortium (DVB-T2) is considered and, in particular, we focus on the new structure of the P1 training symbol. Two algorithms making use of this symbol are proposed and analyzed, one for the recovery of the carrier frequency offset, the other for the channel estimation. In particular, their performances are evaluated, theoretically and via simulations, and finally compared to the respective Cramer Rao Lower Bound (CRLB). The results show the two algorithms perform very close to the respective CRLB.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116764915","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}
Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850358
Y. Kondareddy, N. Andrews, P. Agrawal
Cognitive radio networks deal with opportunistic spectrum access leading to greater utilization of the spectrum. The extent of utilization depends on the primary user's traffic and also on the way the spectrum is accessed by the primary and secondary users. In this paper Continuous-time Markov chains are used to model the spectrum access. The proposed three-dimensional model represents a more accurate cognitive system than the existing models with increased spectrum utilization and than the random and reservation based spectrum access. A non-random access method is proposed to remove the forced termination states. In addition, call dropping and blocking probabilities are reduced. It is further shown that channel utilization is higher than random access and reservation based access.
{"title":"On the capacity of secondary users in a cognitive radio network","authors":"Y. Kondareddy, N. Andrews, P. Agrawal","doi":"10.1109/SARNOF.2009.4850358","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850358","url":null,"abstract":"Cognitive radio networks deal with opportunistic spectrum access leading to greater utilization of the spectrum. The extent of utilization depends on the primary user's traffic and also on the way the spectrum is accessed by the primary and secondary users. In this paper Continuous-time Markov chains are used to model the spectrum access. The proposed three-dimensional model represents a more accurate cognitive system than the existing models with increased spectrum utilization and than the random and reservation based spectrum access. A non-random access method is proposed to remove the forced termination states. In addition, call dropping and blocking probabilities are reduced. It is further shown that channel utilization is higher than random access and reservation based access.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125638985","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}
Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850315
D. Anurag, S. Bandyopadhyay
Most wireless sensor network deployments are 2-tiered where sensors form the leaves of the network and do not participate in the routing. A plot of the best path from each of the leaves to the sink reveals the network topology to be hierarchical in nature. The AODV routing algorithm was designed for a mesh network with highly mobile nodes and is not directly suitable for a hierarchical sensor network where the sensors and relays are predominantly static. The hierarchical routing as implemented by ZigBee's Cskip does not support fault tolerance and has a restriction on the network depth. In this paper, we develop a node addressing methodology that merges the structure of a hierarchical tree with the flexibility of AODV. We show its completeness and develop three algorithms - deterministic, probabilistic and heuristic, based on our methodology. The performance of the algorithms against AODV is compared. Our simulation is made for two probability distributions of network formation — uniform and geometric.
{"title":"Node addressing schemes for scalable and fault tolerant routing in hierarchical WSNs","authors":"D. Anurag, S. Bandyopadhyay","doi":"10.1109/SARNOF.2009.4850315","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850315","url":null,"abstract":"Most wireless sensor network deployments are 2-tiered where sensors form the leaves of the network and do not participate in the routing. A plot of the best path from each of the leaves to the sink reveals the network topology to be hierarchical in nature. The AODV routing algorithm was designed for a mesh network with highly mobile nodes and is not directly suitable for a hierarchical sensor network where the sensors and relays are predominantly static. The hierarchical routing as implemented by ZigBee's Cskip does not support fault tolerance and has a restriction on the network depth. In this paper, we develop a node addressing methodology that merges the structure of a hierarchical tree with the flexibility of AODV. We show its completeness and develop three algorithms - deterministic, probabilistic and heuristic, based on our methodology. The performance of the algorithms against AODV is compared. Our simulation is made for two probability distributions of network formation — uniform and geometric.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127793632","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}
Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850376
J. Yao
Broadband and low loss capability of photonics has led to an ever-increasing interest in its use for the processing of microwave and millimeter-wave signals. In this paper, microwave delay-line filters implemented using photonics techniques are reviewed, with an emphasis on the implementation of microwave delay-line filters with bandpass functionality.
{"title":"Photonics for microwave signal filtering","authors":"J. Yao","doi":"10.1109/SARNOF.2009.4850376","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850376","url":null,"abstract":"Broadband and low loss capability of photonics has led to an ever-increasing interest in its use for the processing of microwave and millimeter-wave signals. In this paper, microwave delay-line filters implemented using photonics techniques are reviewed, with an emphasis on the implementation of microwave delay-line filters with bandpass functionality.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132801961","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}
Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850272
U. Rohde, A. Poddar
The novel approach reported in this paper optimizes the dynamic noise and drive sensitivity factor for achieving low phase noise voltage controlled crystal oscillator circuit (VCXO). An example of 100 MHz mode feedbacks and differential coupled VCXOs are demonstrated for the validation of this new approach, which offers 10–15 dB phase noise reduction, therefore, spectral pure, power-efficient and cost-effective solutions.
{"title":"Voltage controlled crystal oscillator","authors":"U. Rohde, A. Poddar","doi":"10.1109/SARNOF.2009.4850272","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850272","url":null,"abstract":"The novel approach reported in this paper optimizes the dynamic noise and drive sensitivity factor for achieving low phase noise voltage controlled crystal oscillator circuit (VCXO). An example of 100 MHz mode feedbacks and differential coupled VCXOs are demonstrated for the validation of this new approach, which offers 10–15 dB phase noise reduction, therefore, spectral pure, power-efficient and cost-effective solutions.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134408954","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}
Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850327
Ming-Wei Liu, J. Doherty
We propose an algorithm based on the knowledge of training sequences to obtain an asymptotically unbiased estimator of the Radio Frequency (RF) front-end nonlinearity to perform Specific Emitter Identification (SEI). In most SEI literature Inter Symbol Interference (ISI) is seldom considered; however, it is a major limiting factor in SEI systems and should be suppressed to achieve reliable identification. In this paper we develop a nonlinearity estimator that can overcome ISI and provide reliable estimation. The method is shown to achieve nonlinearity estimation and radio emitter identification over an empirical indoor channel model using an Orthogonal Frequency Division Multiplexing (OFDM) system.
{"title":"Nonlinearity estimation for Specific Emitter Identification in multipath environment","authors":"Ming-Wei Liu, J. Doherty","doi":"10.1109/SARNOF.2009.4850327","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850327","url":null,"abstract":"We propose an algorithm based on the knowledge of training sequences to obtain an asymptotically unbiased estimator of the Radio Frequency (RF) front-end nonlinearity to perform Specific Emitter Identification (SEI). In most SEI literature Inter Symbol Interference (ISI) is seldom considered; however, it is a major limiting factor in SEI systems and should be suppressed to achieve reliable identification. In this paper we develop a nonlinearity estimator that can overcome ISI and provide reliable estimation. The method is shown to achieve nonlinearity estimation and radio emitter identification over an empirical indoor channel model using an Orthogonal Frequency Division Multiplexing (OFDM) system.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114752783","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}
Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850311
Y. Abdelmalek, T. Saadawi
In this paper, we propose Destination-Assisted Routing Enhancement (DARE) module as a generic add-on middleware to mobile ad-hoc networks (MANETs) routing protocols. The goal of DARE is to assist the routing protocol to establish a path between the source and destination quickly with high reachability probability by generating destination beacon packets, while considering the dynamic characteristic of MANET and the need for low routing control overhead. These beacon packets act like trail packets to aid in finding the destination. A simplified mathematical model as a proof of concept is presented. We prove that the probability of finding the path between the source and destination using DARE outperforms the same probability using the traditional routing technique. The simulation results show the potential of adding DARE middleware to DSR protocol; for an instance of on-demand ad-hoc routing protocols, to achieve higher network performance in terms of throughput, route discovery time, and connection setup probability. A route discovery time was reported to be 20% less than the original DSR in mobile ad-hoc nodes with minimum overhead.
{"title":"Destination-Assisted Routing Enhancement (DARE) protocol for ad-hoc mobile networks","authors":"Y. Abdelmalek, T. Saadawi","doi":"10.1109/SARNOF.2009.4850311","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850311","url":null,"abstract":"In this paper, we propose Destination-Assisted Routing Enhancement (DARE) module as a generic add-on middleware to mobile ad-hoc networks (MANETs) routing protocols. The goal of DARE is to assist the routing protocol to establish a path between the source and destination quickly with high reachability probability by generating destination beacon packets, while considering the dynamic characteristic of MANET and the need for low routing control overhead. These beacon packets act like trail packets to aid in finding the destination. A simplified mathematical model as a proof of concept is presented. We prove that the probability of finding the path between the source and destination using DARE outperforms the same probability using the traditional routing technique. The simulation results show the potential of adding DARE middleware to DSR protocol; for an instance of on-demand ad-hoc routing protocols, to achieve higher network performance in terms of throughput, route discovery time, and connection setup probability. A route discovery time was reported to be 20% less than the original DSR in mobile ad-hoc nodes with minimum overhead.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115527045","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}
Pub Date : 2009-03-30DOI: 10.1109/SARNOF.2009.4850359
Mahmoud S. El-Saadany, A. Shalash, M. Abdallah
Orthogonal frequency division multiplexing (OFDM) is widely used in wireless communication systems, and it is a candidate for Cognitive Radios (CR). Shaping the spectrum of OFDM-based CR is needed to reduce the out-of-band radiations and reduce the interference delivered to the licensed user (LU). In this paper, shaping the spectrum using windowing and active cancellation carriers is discussed. It is shown that the use of windowing alone for large band is a better choice. The window choice in case of large number of subcarriers spanned by a LU is investigated and it is shown that the Hanning window outperforms the raised cosine window by 7dB. Computational complexity analysis is introduced and it shows a huge advantage by using windowing alone for large frequency bands and multiple bands vis-à-vis cancellation carriers. Simulations show that such technique offers no effect on the bit error rate performance.
{"title":"Revisiting active cancellation carriers for shaping the spectrum of OFDM-based Cognitive Radios","authors":"Mahmoud S. El-Saadany, A. Shalash, M. Abdallah","doi":"10.1109/SARNOF.2009.4850359","DOIUrl":"https://doi.org/10.1109/SARNOF.2009.4850359","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) is widely used in wireless communication systems, and it is a candidate for Cognitive Radios (CR). Shaping the spectrum of OFDM-based CR is needed to reduce the out-of-band radiations and reduce the interference delivered to the licensed user (LU). In this paper, shaping the spectrum using windowing and active cancellation carriers is discussed. It is shown that the use of windowing alone for large band is a better choice. The window choice in case of large number of subcarriers spanned by a LU is investigated and it is shown that the Hanning window outperforms the raised cosine window by 7dB. Computational complexity analysis is introduced and it shows a huge advantage by using windowing alone for large frequency bands and multiple bands vis-à-vis cancellation carriers. Simulations show that such technique offers no effect on the bit error rate performance.","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123939351","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：