Pub Date : 2010-12-01DOI: 10.1109/GLOCOM.2010.5684039
M. Akbaş, D. Turgut
Wireless sensor and actor networks (WSANs) can be used for monitoring physical environments and acting according to the observations. In order to differentiate the actions based on the sensed information, WSANs comprise of various applications with different quality of service (QoS) requirements. QoS solutions for WSANs are challenging compared to traditional networks because of the limited resource capabilities of sensor nodes. In terms of QoS requirements, WSANs also differ from WSNs since actors and sensors have distinct resource constraints. In this paper we present LRP-QS, lightweight routing protocol with QoS support for WSANs. Our protocol provides QoS by differentiating the rates among different types of applications with dynamic packet tagging at the sensor nodes and per flow management at the actor nodes. Through extensive simulations we observe a greater packet delivery ratio and a better memory consumption rate in comparison with the related mechanisms.
{"title":"Lightweight Routing with QoS Support in Wireless Sensor and Actor Networks","authors":"M. Akbaş, D. Turgut","doi":"10.1109/GLOCOM.2010.5684039","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684039","url":null,"abstract":"Wireless sensor and actor networks (WSANs) can be used for monitoring physical environments and acting according to the observations. In order to differentiate the actions based on the sensed information, WSANs comprise of various applications with different quality of service (QoS) requirements. QoS solutions for WSANs are challenging compared to traditional networks because of the limited resource capabilities of sensor nodes. In terms of QoS requirements, WSANs also differ from WSNs since actors and sensors have distinct resource constraints. In this paper we present LRP-QS, lightweight routing protocol with QoS support for WSANs. Our protocol provides QoS by differentiating the rates among different types of applications with dynamic packet tagging at the sensor nodes and per flow management at the actor nodes. Through extensive simulations we observe a greater packet delivery ratio and a better memory consumption rate in comparison with the related mechanisms.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"3 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85127480","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5684363
M. Corici, D. Vingarzan, T. Magedanz, C. Pampu, Qing Zhou
Mobility in a wireless heterogeneous scenario in which the mobile devices are able to connect to more than one access technology available in their vicinity requires a re-consideration on the access network reselection mechanisms. The present paper describes and evaluates the opportunity of introducing novel access reselection procedures which enable a network provider to optimize the allocation of the users on the different access networks available using as central concept that handovers can and should be triggered by the modifications on the resources required by the mobile devices in order to optimize the overall usage of the wireless environment. This concept is exemplified on the 3GPP Evolved Packet Core and evaluated on a minimal prototype implementation.
{"title":"Access Network Reselection Based on Momentary Resources in a Converged Wireless Environment","authors":"M. Corici, D. Vingarzan, T. Magedanz, C. Pampu, Qing Zhou","doi":"10.1109/GLOCOM.2010.5684363","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5684363","url":null,"abstract":"Mobility in a wireless heterogeneous scenario in which the mobile devices are able to connect to more than one access technology available in their vicinity requires a re-consideration on the access network reselection mechanisms. The present paper describes and evaluates the opportunity of introducing novel access reselection procedures which enable a network provider to optimize the allocation of the users on the different access networks available using as central concept that handovers can and should be triggered by the modifications on the resources required by the mobile devices in order to optimize the overall usage of the wireless environment. This concept is exemplified on the 3GPP Evolved Packet Core and evaluated on a minimal prototype implementation.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"56 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85152918","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683773
M. Chang, Ren-Shian Chen
For real bandlimited periodic signals, the author of [2] proposed reconstruction formulas such that the ideal discreteto-continuous-time (D/C) conversion can be realized within one period of the signal. However, for general complex bandlimited periodic signals, the results of [2] cannot be directly applied to the real and imaginary parts of the signals. Furthermore, no corresponding ideal continuous-to-discrete-time (C/D) conversion has been proposed. In this paper, we first derive the reconstruction formulas for complex bandlimited periodic signals, and this leads to a realizable form of ideal D/C conversion. For the interpolation pulse of the D/C conversion, we construct its correlation function, based on which we further propose a matched filter that can implement the ideal sampling (C/D conversion) of a complex bandlimited periodic signal. We compare the sampling effect and noise effect of the proposed C/D conversion with other sampling approaches. When there are white noises during the sampling, we also derive the correlation function of the output noise for the proposed ideal C/D conversion.
{"title":"Realizable Forms of Ideal D/C and C/D Conversions for Complex Bandlimited Periodic Signals","authors":"M. Chang, Ren-Shian Chen","doi":"10.1109/GLOCOM.2010.5683773","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683773","url":null,"abstract":"For real bandlimited periodic signals, the author of [2] proposed reconstruction formulas such that the ideal discreteto-continuous-time (D/C) conversion can be realized within one period of the signal. However, for general complex bandlimited periodic signals, the results of [2] cannot be directly applied to the real and imaginary parts of the signals. Furthermore, no corresponding ideal continuous-to-discrete-time (C/D) conversion has been proposed. In this paper, we first derive the reconstruction formulas for complex bandlimited periodic signals, and this leads to a realizable form of ideal D/C conversion. For the interpolation pulse of the D/C conversion, we construct its correlation function, based on which we further propose a matched filter that can implement the ideal sampling (C/D conversion) of a complex bandlimited periodic signal. We compare the sampling effect and noise effect of the proposed C/D conversion with other sampling approaches. When there are white noises during the sampling, we also derive the correlation function of the output noise for the proposed ideal C/D conversion.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"14 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85375028","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683926
F. Etezadi, K. Zarifi, A. Ghrayeb, S. Affes
We consider a multi-relay amplify-and-forward cooperative communication scheme in wireless sensor networks with uniformly distributed nodes. Fixing the average total transmission power from the network and preserving fairness among the selected relays by constraining them to transmit with equal average powers, we aim to improve the signal reception quality at the far-field receiver by means of a proper choice of the relays. Assuming that the nodes' forward channels are not known, the following three relay selection schemes are proposed and their performances are analyzed. 1) Optimal relay selection scheme that maximizes the average SNR at the receiver by exploiting K nodes with the highest SNRs as relays; 2) geometry-based relay selection scheme that is energy-efficient and achieves a close-to-optimal average SNR performance at the receiver by using K closest nodes to the source as relays; and 3) random relay selection scheme that is energy-efficient and further guarantees a fair usage of all nodes by randomly selecting K relays from a specific area around the source. By minimizing an outage probability, a strategy to determine this area is also proposed. Finally, it is shown for all relay selection schemes that the SNR variance at the receiver converges to zero as K increases.
{"title":"Topology-Assisted Techniques to Relay Selection for Homogeneously Distributed Wireless Sensor Networks","authors":"F. Etezadi, K. Zarifi, A. Ghrayeb, S. Affes","doi":"10.1109/GLOCOM.2010.5683926","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683926","url":null,"abstract":"We consider a multi-relay amplify-and-forward cooperative communication scheme in wireless sensor networks with uniformly distributed nodes. Fixing the average total transmission power from the network and preserving fairness among the selected relays by constraining them to transmit with equal average powers, we aim to improve the signal reception quality at the far-field receiver by means of a proper choice of the relays. Assuming that the nodes' forward channels are not known, the following three relay selection schemes are proposed and their performances are analyzed. 1) Optimal relay selection scheme that maximizes the average SNR at the receiver by exploiting K nodes with the highest SNRs as relays; 2) geometry-based relay selection scheme that is energy-efficient and achieves a close-to-optimal average SNR performance at the receiver by using K closest nodes to the source as relays; and 3) random relay selection scheme that is energy-efficient and further guarantees a fair usage of all nodes by randomly selecting K relays from a specific area around the source. By minimizing an outage probability, a strategy to determine this area is also proposed. Finally, it is shown for all relay selection schemes that the SNR variance at the receiver converges to zero as K increases.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"31 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85478147","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683743
L. Cai, Yongkang Liu, Xuemin Shen, J. Mark, Dongmei Zhao
We propose a distributed quality of service (QoS)-aware MAC protocol for multi-channel cognitive radio networks supporting multimedia applications. Specifically, based on the channel usage patterns of primary users (PUs), secondary users (SUs) determine a set of channels for channel sensing and data transmissions to satisfy their QoS requirements. We further enhance the QoS provisioning of the proposed cognitive MAC by applying differentiated arbitrary sensing periods for various types of traffic. An analytical model is developed to study the performance of the proposed MAC, taking the activities of both PUs and SUs into consideration. Extensive simulations validate our analysis and demonstrate that our proposed MAC can achieve multiple levels of QoS provisioning for various types of multimedia applications in cognitive radio networks.
{"title":"Distributed QoS-Aware MAC for Multimedia over Cognitive Radio Networks","authors":"L. Cai, Yongkang Liu, Xuemin Shen, J. Mark, Dongmei Zhao","doi":"10.1109/GLOCOM.2010.5683743","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683743","url":null,"abstract":"We propose a distributed quality of service (QoS)-aware MAC protocol for multi-channel cognitive radio networks supporting multimedia applications. Specifically, based on the channel usage patterns of primary users (PUs), secondary users (SUs) determine a set of channels for channel sensing and data transmissions to satisfy their QoS requirements. We further enhance the QoS provisioning of the proposed cognitive MAC by applying differentiated arbitrary sensing periods for various types of traffic. An analytical model is developed to study the performance of the proposed MAC, taking the activities of both PUs and SUs into consideration. Extensive simulations validate our analysis and demonstrate that our proposed MAC can achieve multiple levels of QoS provisioning for various types of multimedia applications in cognitive radio networks.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"24 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85624934","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5685222
Wan-Yi Sabrina Lin, H. V. Zhao, K. J. R. Liu
Users using the same video streaming service within a wireless network share the same limited backbone bandwidth to the Internet. These users are motivated to collaborate with each other to obtain better-quality service. The decisions and actions of users influence the performance of others, hence they form a social network. In a fully-distributed wireless network, malicious attack can cause much more damage than over the Internet since the unstable wireless channel allows hostile users to mimic as a non-malicious user. Therefore, a robust attack-resistant cooperation strategy for non-malicious user is needed to combat the challenges in wireless networks. In this paper, we incorporate trust modelling into the cooperation among users to increase attack-resistance. Simulation results show our robust cooperation strategies can against $40 %$ more attackers.
{"title":"Attack-Resistant Collaboration in Wireless Video Streaming Social Networks","authors":"Wan-Yi Sabrina Lin, H. V. Zhao, K. J. R. Liu","doi":"10.1109/GLOCOM.2010.5685222","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5685222","url":null,"abstract":"Users using the same video streaming service within a wireless network share the same limited backbone bandwidth to the Internet. These users are motivated to collaborate with each other to obtain better-quality service. The decisions and actions of users influence the performance of others, hence they form a social network. In a fully-distributed wireless network, malicious attack can cause much more damage than over the Internet since the unstable wireless channel allows hostile users to mimic as a non-malicious user. Therefore, a robust attack-resistant cooperation strategy for non-malicious user is needed to combat the challenges in wireless networks. In this paper, we incorporate trust modelling into the cooperation among users to increase attack-resistance. Simulation results show our robust cooperation strategies can against $40 %$ more attackers.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"21 61 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85853691","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683857
Bruno M. C. Silva, F. Farahmand, J. Rodrigues
Vehicular delay tolerant networks (VDTNs) were proposed as a novel disruptive network concept based on the delay tolerant networking (DTN) paradigm. VDTN network architecture uses vehicles to relay messages, enabling network connectivity in challenged scenarios. Due to intermittent connectivity, network nodes carry messages in their buffers, relaying them only when a proper contact opportunity occurs. The storage capacity and message retrieving of intermediate nodes directly affects the network performance. Therefore, efficient and robust caching and forwarding mechanisms are needed. This paper proposes a content storage and retrieval solution for VDTN networks. It consists on storage and retrieval control labels, attached to every message of aggregated traffic (data bundles). These labels define cacheable contents, and apply cache-control and forwarding restrictions on data bundles. This solution is fully automated, providing a fast, safe, and reliable data transfer and storage management, while improves the applicability and performance of VDTN networks significantly. The proposed algorithms were evaluated and validated through a VDTN testbed.
{"title":"Performance Assessment of Caching and Forwarding Algorithms for Vehicular Delay Tolerant Networks","authors":"Bruno M. C. Silva, F. Farahmand, J. Rodrigues","doi":"10.1109/GLOCOM.2010.5683857","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683857","url":null,"abstract":"Vehicular delay tolerant networks (VDTNs) were proposed as a novel disruptive network concept based on the delay tolerant networking (DTN) paradigm. VDTN network architecture uses vehicles to relay messages, enabling network connectivity in challenged scenarios. Due to intermittent connectivity, network nodes carry messages in their buffers, relaying them only when a proper contact opportunity occurs. The storage capacity and message retrieving of intermediate nodes directly affects the network performance. Therefore, efficient and robust caching and forwarding mechanisms are needed. This paper proposes a content storage and retrieval solution for VDTN networks. It consists on storage and retrieval control labels, attached to every message of aggregated traffic (data bundles). These labels define cacheable contents, and apply cache-control and forwarding restrictions on data bundles. This solution is fully automated, providing a fast, safe, and reliable data transfer and storage management, while improves the applicability and performance of VDTN networks significantly. The proposed algorithms were evaluated and validated through a VDTN testbed.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"13 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76926534","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683332
Yan Chen, K. Liu
In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their own performance. Thus, how to stimulate cooperation among nodes in cognitive networks is very important. However, most of existing game-theoretic cooperation stimulation approaches rely on the assumption that the interactions between any pair of players are long-lasting. When this assumption is not true, according to the well-known Prisoner's Dilemma and the backward induction principle, the unique Nash equilibrium (NE) is to always play non-cooperatively. In this paper, we propose a cooperation stimulation scheme for the scenario where the number of interactions between any pair of players are finite. The proposed algorithm is based on indirect reciprocity game modelling where the key concept is ``I help you not because you have helped me but because you have helped others''. We formulate the problem of finding the optimal action rule as a Markov Decision Process (MDP). Using the packet forwarding game as an example, we show that with an appropriate cost-to-gain ratio, the strategy of forwarding the number of packets that is equal to the reputation level of the receiver is an evolutionarily stable strategy (ESS). Finally, simulations are shown to verify the efficiency and effectiveness of the proposed algorithm.
{"title":"Cooperation Stimulation in Cognitive Networks Using Indirect Reciprocity Game Modelling","authors":"Yan Chen, K. Liu","doi":"10.1109/GLOCOM.2010.5683332","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683332","url":null,"abstract":"In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their own performance. Thus, how to stimulate cooperation among nodes in cognitive networks is very important. However, most of existing game-theoretic cooperation stimulation approaches rely on the assumption that the interactions between any pair of players are long-lasting. When this assumption is not true, according to the well-known Prisoner's Dilemma and the backward induction principle, the unique Nash equilibrium (NE) is to always play non-cooperatively. In this paper, we propose a cooperation stimulation scheme for the scenario where the number of interactions between any pair of players are finite. The proposed algorithm is based on indirect reciprocity game modelling where the key concept is ``I help you not because you have helped me but because you have helped others''. We formulate the problem of finding the optimal action rule as a Markov Decision Process (MDP). Using the packet forwarding game as an example, we show that with an appropriate cost-to-gain ratio, the strategy of forwarding the number of packets that is equal to the reputation level of the receiver is an evolutionarily stable strategy (ESS). Finally, simulations are shown to verify the efficiency and effectiveness of the proposed algorithm.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"82 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77128446","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683750
M. Shazly, E. Elmallah, H. Aboelfotoh
In this paper we formulate and analyze a model for assessing the reliability of a wireless sensor network (WSN) based on classifying the operating states of each node at any instant into one of three possible states: a state where both the sensing and wireless modules are operating, a state where only the wireless module is operating, and a state where the wireless module is failed. Thus, in the second state a node can only relay traffic among its neighbours without generating its own data. We define the reliability of a WSN as the probability that the sink node can collect data from a number of nodes whose total weight exceeds a specified threshold limit, given that each node can be in any one of the three possible states with a given probability. Existing results in the literature show that a restricted 2-state version of the problem is #P-hard even when the network is a rectangular grid. Nevertheless, for a rectangular WxL grid on n nodes where the sink node lies in one of the corners, the restricted 2-state reliability problem can be solved in O(nL2^W) time. Thus, the algorithm runs in polynomial time for any fixed W. Our work here derives an exact algorithm for the generalized 3-state reliability model on a generalized class of grids, called diagonalized grids, while maintaining the same O(nL2^W) running time. We obtain numerical results that illustrate the use of the devised algorithm as a WSN topological design tool.
{"title":"A Three-State Node Reliability Model for Sensor Networks","authors":"M. Shazly, E. Elmallah, H. Aboelfotoh","doi":"10.1109/GLOCOM.2010.5683750","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683750","url":null,"abstract":"In this paper we formulate and analyze a model for assessing the reliability of a wireless sensor network (WSN) based on classifying the operating states of each node at any instant into one of three possible states: a state where both the sensing and wireless modules are operating, a state where only the wireless module is operating, and a state where the wireless module is failed. Thus, in the second state a node can only relay traffic among its neighbours without generating its own data. We define the reliability of a WSN as the probability that the sink node can collect data from a number of nodes whose total weight exceeds a specified threshold limit, given that each node can be in any one of the three possible states with a given probability. Existing results in the literature show that a restricted 2-state version of the problem is #P-hard even when the network is a rectangular grid. Nevertheless, for a rectangular WxL grid on n nodes where the sink node lies in one of the corners, the restricted 2-state reliability problem can be solved in O(nL2^W) time. Thus, the algorithm runs in polynomial time for any fixed W. Our work here derives an exact algorithm for the generalized 3-state reliability model on a generalized class of grids, called diagonalized grids, while maintaining the same O(nL2^W) running time. We obtain numerical results that illustrate the use of the devised algorithm as a WSN topological design tool.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"1 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80862702","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 : 2010-12-01DOI: 10.1109/GLOCOM.2010.5683492
D. Bhargavi, A. Iyer, C. Murthy
The well known noise rejection property of the cyclostationary spectrum makes it an ideal candidate for spectrum sensing in low SNR environments such as the IEEE 802.22 WRAN, which stipulates detection of primary signals at -20.8dB. In this paper, we propose two novel detector architectures that exploit cyclostationary properties: the Spectral Correlation Density (SCD), and the Magnitude Squared Coherence (MSC). Through extensive simulations, both on generated data and real world ATSC capture data, we show that our detector achieves an improvement of 2.5dB compared to existing proposals. Additionally, we compare our proposal against two popular choices for spectrum sensing in cognitive radio -- the matched filter detection and energy detection, and show the superiority of cyclostationary spectrum sensing in such low SNR environments.
{"title":"Cyclostationary-Based Architectures for Spectrum Sensing in IEEE 802.22 WRAN","authors":"D. Bhargavi, A. Iyer, C. Murthy","doi":"10.1109/GLOCOM.2010.5683492","DOIUrl":"https://doi.org/10.1109/GLOCOM.2010.5683492","url":null,"abstract":"The well known noise rejection property of the cyclostationary spectrum makes it an ideal candidate for spectrum sensing in low SNR environments such as the IEEE 802.22 WRAN, which stipulates detection of primary signals at -20.8dB. In this paper, we propose two novel detector architectures that exploit cyclostationary properties: the Spectral Correlation Density (SCD), and the Magnitude Squared Coherence (MSC). Through extensive simulations, both on generated data and real world ATSC capture data, we show that our detector achieves an improvement of 2.5dB compared to existing proposals. Additionally, we compare our proposal against two popular choices for spectrum sensing in cognitive radio -- the matched filter detection and energy detection, and show the superiority of cyclostationary spectrum sensing in such low SNR environments.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"36 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80992652","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
扫码关注我们
求助内容：
应助结果提醒方式：