Pub Date : 2012-04-01DOI: 10.1109/WCNCW.2012.6215490
J. Leon, F. Bader, Mohamed-Slim Alouini
The effect of smaller cells being placed in a heterogeneous network can improve the way energy is spent in a system. Handoff strategies, bandwidth allocation and path loss calculations in different scenarios show how this is possible as the size of the cell is decreased. As a result, users can experience the same or better capacities while maximising the capacity per unit energy spent. The per-energy capacity metric is introduced as a suitable handoff strategy that considers the energy spent as an important criterion.
{"title":"Per-energy capacity and handoff strategies in macro-femto cells environment","authors":"J. Leon, F. Bader, Mohamed-Slim Alouini","doi":"10.1109/WCNCW.2012.6215490","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215490","url":null,"abstract":"The effect of smaller cells being placed in a heterogeneous network can improve the way energy is spent in a system. Handoff strategies, bandwidth allocation and path loss calculations in different scenarios show how this is possible as the size of the cell is decreased. As a result, users can experience the same or better capacities while maximising the capacity per unit energy spent. The per-energy capacity metric is introduced as a suitable handoff strategy that considers the energy spent as an important criterion.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"57 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114050191","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 : 2012-04-01DOI: 10.1109/WCNCW.2012.6215507
Paul de Kerret, Rajeev Gangula, D. Gesbert
In this work1, we consider a setting where K Transmitters (TXs) equipped with multiple antennas aim at transmitting to their K respective Receivers (RXs) also equipped with multiple antennas. Without exchange of the user's data symbols, this represents a conventional Interference Channel (IC), while it is a so-called MIMO Network Channel if the user's data symbols are fully shared between all the TXs. The focus of this work is on the intermediate case where the user's data symbols can be arbitrary shared to the TXs such that only a subset of the TXs has access to the data symbols to transmit to a given RX. We show that we can build a virtual IC so as so have the transmission in that IC equivalent to the transmission in the original setting. In this virtual IC, it is then possible to apply any of the numerous algorithms (Interference Alignment algorithms) initially tailored for the IC. Finally, we let the routing matrix be optimized subject to a constraint on the total number of symbols shared and use a greedy algorithm to find the user's data allocation. We show by simulations that sharing only few user's data symbols is sufficient to achieve most of the performance.
{"title":"A practical precoding scheme for multicell MIMO channels with partial user's data sharing","authors":"Paul de Kerret, Rajeev Gangula, D. Gesbert","doi":"10.1109/WCNCW.2012.6215507","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215507","url":null,"abstract":"In this work1, we consider a setting where K Transmitters (TXs) equipped with multiple antennas aim at transmitting to their K respective Receivers (RXs) also equipped with multiple antennas. Without exchange of the user's data symbols, this represents a conventional Interference Channel (IC), while it is a so-called MIMO Network Channel if the user's data symbols are fully shared between all the TXs. The focus of this work is on the intermediate case where the user's data symbols can be arbitrary shared to the TXs such that only a subset of the TXs has access to the data symbols to transmit to a given RX. We show that we can build a virtual IC so as so have the transmission in that IC equivalent to the transmission in the original setting. In this virtual IC, it is then possible to apply any of the numerous algorithms (Interference Alignment algorithms) initially tailored for the IC. Finally, we let the routing matrix be optimized subject to a constraint on the total number of symbols shared and use a greedy algorithm to find the user's data allocation. We show by simulations that sharing only few user's data symbols is sufficient to achieve most of the performance.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127965994","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 : 2012-04-01DOI: 10.1109/WCNCW.2012.6215518
C. Makaya, S. Das, F. Lin
With the increasing demand for quality of service (QoS) by end-users, mobility management, IP flow mobility and data offload are key features needed in next-generation wireless networks. With the wide deployment of WiFi (e.g., home, vehicle, smartphones, laptops) and onboard unit (OBU) in automotive and public transportation systems (PTS), it is important to provide mechanisms that allows data offload and seamless handover of sessions between cellular-based vehicular networks (3G/4G) and WiFi as well as IP flow mobility for users in automotive and PTS. Such mechanisms will allow a better resource usage for network operators and guarantee higher QoS for users while considering value-added services in vehicular communication networks (VCNs). Although, several approaches have been proposed for mobility management such as Mobile IP (MIPv4 and MIPv6) and Network Mobility (NEMO), seamless mobility and efficient flow mobility are not guaranteed. This paper proposes a new mechanism for selective IP traffic offload (SIPTO) for VCNs. The proposed solution has been prototyped and the performance evaluation shows improvement in terms of throughput, energy consumption, and flow mobility latency when compared to existing mobility management approaches.
{"title":"Seamless data offload and flow mobility in vehicular communications networks","authors":"C. Makaya, S. Das, F. Lin","doi":"10.1109/WCNCW.2012.6215518","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215518","url":null,"abstract":"With the increasing demand for quality of service (QoS) by end-users, mobility management, IP flow mobility and data offload are key features needed in next-generation wireless networks. With the wide deployment of WiFi (e.g., home, vehicle, smartphones, laptops) and onboard unit (OBU) in automotive and public transportation systems (PTS), it is important to provide mechanisms that allows data offload and seamless handover of sessions between cellular-based vehicular networks (3G/4G) and WiFi as well as IP flow mobility for users in automotive and PTS. Such mechanisms will allow a better resource usage for network operators and guarantee higher QoS for users while considering value-added services in vehicular communication networks (VCNs). Although, several approaches have been proposed for mobility management such as Mobile IP (MIPv4 and MIPv6) and Network Mobility (NEMO), seamless mobility and efficient flow mobility are not guaranteed. This paper proposes a new mechanism for selective IP traffic offload (SIPTO) for VCNs. The proposed solution has been prototyped and the performance evaluation shows improvement in terms of throughput, energy consumption, and flow mobility latency when compared to existing mobility management approaches.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116966545","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 : 2012-04-01DOI: 10.1109/WCNCW.2012.6215476
Namshik Kim, J. Barry
We consider the problem of combining the signals received from a decode-and-forward relay with those received from the source. As an alternative to the high-complexity maximum-likelihood combining strategy, we propose a bit-wise combining strategy in which the received signals are first converted to log-likelihood values before being combined. We show that, subject to the bit-wise constraint, the optimal combining strategy for binary alphabets - minimizing the probability of error - applies a sigmoidal nonlinearity to the relay log-likelihood values before adding to the source log-likelihood values. Unlike the maximal-ratio combining strategy, which has no diversity for the Rayleigh-fading decode-and-forward relay channel, the proposed strategy exhibits the maximum diversity order of two.
{"title":"Bit-wise combining for decode-and-forward relays","authors":"Namshik Kim, J. Barry","doi":"10.1109/WCNCW.2012.6215476","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215476","url":null,"abstract":"We consider the problem of combining the signals received from a decode-and-forward relay with those received from the source. As an alternative to the high-complexity maximum-likelihood combining strategy, we propose a bit-wise combining strategy in which the received signals are first converted to log-likelihood values before being combined. We show that, subject to the bit-wise constraint, the optimal combining strategy for binary alphabets - minimizing the probability of error - applies a sigmoidal nonlinearity to the relay log-likelihood values before adding to the source log-likelihood values. Unlike the maximal-ratio combining strategy, which has no diversity for the Rayleigh-fading decode-and-forward relay channel, the proposed strategy exhibits the maximum diversity order of two.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116678289","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 : 2012-04-01DOI: 10.1109/WCNCW.2012.6215469
Mehdi Keshavarz, M. Dehghan
Free-riding by packet dropping is one of the most important issues for the establishment and survivability of the open multi-hop wireless networks. In this paper, we focus on the data packet dropping in a rather dense Mobile Ad-hoc Network. To encounter this situation, we propose a scheme based on using MAC-layer acknowledgements to detect and punish packet dropper nodes. We used simulation-based results to evaluate the performance of our scheme. All simulations have been performed using NS-2.
{"title":"MAC-aided packet-dropper detection in multi-hop wireless networks","authors":"Mehdi Keshavarz, M. Dehghan","doi":"10.1109/WCNCW.2012.6215469","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215469","url":null,"abstract":"Free-riding by packet dropping is one of the most important issues for the establishment and survivability of the open multi-hop wireless networks. In this paper, we focus on the data packet dropping in a rather dense Mobile Ad-hoc Network. To encounter this situation, we propose a scheme based on using MAC-layer acknowledgements to detect and punish packet dropper nodes. We used simulation-based results to evaluate the performance of our scheme. All simulations have been performed using NS-2.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126200233","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 : 2012-04-01DOI: 10.1109/WCNCW.2012.6215537
A. Georgakopoulos, D. Karvounas, V. Stavroulaki, M. Tosic, D. Boscovic, J. Gebert, W. Koenig, P. Demestichas
It is expected that the wireless world will migrate towards an era that will comprise more local/ temporary structures for the provision of services. A networking paradigm towards this direction is the opportunistic networking. Operator-governed ONs are dynamically created, temporary, coordinated extensions of the infrastructure. Operator governance is being realized through the use of Cognitive Management Systems which acquire the context, policies and profiles of the environment and make decisions on the creation of opportunistic networks. The paper presents an approach for exploiting such ONs in order to extend the capacity in wireless access and backhaul segments for efficient application provisioning, as well as an evaluation of indicative test cases as a proof of concept of the aforementioned approach. All these scenarios will enable the cognitive cloud-oriented vision of wireless networks for efficient application provisioning in the Future Internet era.
{"title":"Cognitive cloud-oriented wireless networks for the Future Internet","authors":"A. Georgakopoulos, D. Karvounas, V. Stavroulaki, M. Tosic, D. Boscovic, J. Gebert, W. Koenig, P. Demestichas","doi":"10.1109/WCNCW.2012.6215537","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215537","url":null,"abstract":"It is expected that the wireless world will migrate towards an era that will comprise more local/ temporary structures for the provision of services. A networking paradigm towards this direction is the opportunistic networking. Operator-governed ONs are dynamically created, temporary, coordinated extensions of the infrastructure. Operator governance is being realized through the use of Cognitive Management Systems which acquire the context, policies and profiles of the environment and make decisions on the creation of opportunistic networks. The paper presents an approach for exploiting such ONs in order to extend the capacity in wireless access and backhaul segments for efficient application provisioning, as well as an evaluation of indicative test cases as a proof of concept of the aforementioned approach. All these scenarios will enable the cognitive cloud-oriented vision of wireless networks for efficient application provisioning in the Future Internet era.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123641209","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 : 2012-04-01DOI: 10.1109/WCNCW.2012.6215491
A. Castellani, Moreno Dissegna, N. Bui, M. Zorzi
After the burst of the dot-com bubble in the Fall of 2001, the Internet has become a participative medium, which allows users to interact with one another and with the services from anywhere and at any time. The potential of such a change is still to be fully exploited, and phenomena such as social networks and cloud computing are just two of the many innovative solutions that have been born from the Web 2.0. At the same time, a new class of users is establishing itself in the Internet landscape: in fact, with the advent of the Internet of Things (IoT), smart objects are becoming the new, and possibly the biggest, Internet community. In this paper, we propose WebIoT, a novel web application framework, based on Google Web Toolkit, aimed at enhancing the interaction among things and between humans and things. Our framework leverages on the following principles: thing-centric design, modularity and web service communications. We will describe the main components of the framework, their interactions and how simple it is to develop any custom IoT application integrating any number and type of smart things. In particular, we will show how different things can be integrated in the framework, how they interact and how users can exploit these interactions to develop any complex functionality. Finally, we describe a typical HealthCare application for the IoT realized using WebIoT.
在2001年秋天网络泡沫破裂之后，互联网已经成为一种参与性的媒介，它允许用户在任何地方和任何时间与他人和服务进行互动。这种变化的潜力仍有待充分开发，诸如社交网络和云计算等现象只是从Web 2.0诞生的众多创新解决方案中的两种。与此同时，一个新的用户群体正在互联网领域建立自己的地位:事实上，随着物联网(IoT)的出现，智能对象正在成为新的，可能是最大的互联网社区。本文提出了一种基于Google web Toolkit的新型web应用框架WebIoT，旨在增强物与物之间以及人与物之间的交互。我们的框架利用了以下原则:以事物为中心的设计、模块化和web服务通信。我们将描述框架的主要组件，它们之间的交互，以及开发集成任何数量和类型的智能事物的任何自定义物联网应用程序的简单程度。特别是，我们将展示如何将不同的东西集成到框架中，它们如何交互，以及用户如何利用这些交互来开发任何复杂的功能。最后，我们描述了一个使用WebIoT实现物联网的典型医疗保健应用。
{"title":"WebIoT: A web application framework for the internet of things","authors":"A. Castellani, Moreno Dissegna, N. Bui, M. Zorzi","doi":"10.1109/WCNCW.2012.6215491","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215491","url":null,"abstract":"After the burst of the dot-com bubble in the Fall of 2001, the Internet has become a participative medium, which allows users to interact with one another and with the services from anywhere and at any time. The potential of such a change is still to be fully exploited, and phenomena such as social networks and cloud computing are just two of the many innovative solutions that have been born from the Web 2.0. At the same time, a new class of users is establishing itself in the Internet landscape: in fact, with the advent of the Internet of Things (IoT), smart objects are becoming the new, and possibly the biggest, Internet community. In this paper, we propose WebIoT, a novel web application framework, based on Google Web Toolkit, aimed at enhancing the interaction among things and between humans and things. Our framework leverages on the following principles: thing-centric design, modularity and web service communications. We will describe the main components of the framework, their interactions and how simple it is to develop any custom IoT application integrating any number and type of smart things. In particular, we will show how different things can be integrated in the framework, how they interact and how users can exploit these interactions to develop any complex functionality. Finally, we describe a typical HealthCare application for the IoT realized using WebIoT.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131763394","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 : 2012-04-01DOI: 10.1109/WCNCW.2012.6215500
Syed Ali Raza Zaidi, M. Ghogho, D. McLernon, A. Swami
This paper presents an analytical approach to quantify energy efficiency (EE), i.e., the bits per Joule performance of a large scale interference limited random wireless ad hoc network. Energy consumption is investigated at physical, medium access control (MAC) and routing layers. Communication between a user and its destination is facilitated by multihop relaying and Slotted ALOHA based MAC protocol. Energy consumption of user's communication hardware platform is analyzed considering the transceiver architecture. Geometry of the forwarding areas resulting from two different long hop routing protocols is explicitly considered in the analysis. The link model is formulated to cater for user's desired QoS while considering the network interference and the spatial/channel uncertainties. EE performance of the network is quantified from single-hop forward progress, node isolation and hop statistics. Optimal MAP which maximizes the network EE is also investigated. Analytical results are supported by Monte Carlo simulations. It is shown that several hypothesis established in existing literature which ignores network interference and fading do not hold in large scale interference limited ad hoc network.
{"title":"Energy Efficiency in Large Scale Interference Limited wireless ad hoc networks","authors":"Syed Ali Raza Zaidi, M. Ghogho, D. McLernon, A. Swami","doi":"10.1109/WCNCW.2012.6215500","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215500","url":null,"abstract":"This paper presents an analytical approach to quantify energy efficiency (EE), i.e., the bits per Joule performance of a large scale interference limited random wireless ad hoc network. Energy consumption is investigated at physical, medium access control (MAC) and routing layers. Communication between a user and its destination is facilitated by multihop relaying and Slotted ALOHA based MAC protocol. Energy consumption of user's communication hardware platform is analyzed considering the transceiver architecture. Geometry of the forwarding areas resulting from two different long hop routing protocols is explicitly considered in the analysis. The link model is formulated to cater for user's desired QoS while considering the network interference and the spatial/channel uncertainties. EE performance of the network is quantified from single-hop forward progress, node isolation and hop statistics. Optimal MAP which maximizes the network EE is also investigated. Analytical results are supported by Monte Carlo simulations. It is shown that several hypothesis established in existing literature which ignores network interference and fading do not hold in large scale interference limited ad hoc network.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133736787","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 : 2012-04-01DOI: 10.1109/WCNCW.2012.6215522
A. Gomez, G. Diaz, K. Boussetta
Nowadays transportation systems suffer from many adversities. One of the most notorious issues is the traffic congestion. The transportation of persons and goods experiment notable delays with the consequent waste of precious resources and the rise of pollution. Actual Intelligent Transportation systems (ITS) are intended to relief the broad spectrum of challenges that affect our modern traffic infrastructures. However the deployment of these technologies is not always reachable for all cities. Also this is not always fully implemented because of the heavy infrastructure required and the elevated cost. In this paper we assess an architecture based on traffic routing services. This is a lighter implementation and affordable cost for cities where ITS technologies are scarce or absent such as cities in developing countries. In this paper we evaluate how our architecture called Virtual Police Agent for ITS traffic Routing [1], [2] can help to improve the traffic performance. The end of this paper is to evaluate the benefits of Virtual Police Agents by means of several proposed scenarios.
{"title":"How Virtual Police Agents can help in the traffic guidance?","authors":"A. Gomez, G. Diaz, K. Boussetta","doi":"10.1109/WCNCW.2012.6215522","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215522","url":null,"abstract":"Nowadays transportation systems suffer from many adversities. One of the most notorious issues is the traffic congestion. The transportation of persons and goods experiment notable delays with the consequent waste of precious resources and the rise of pollution. Actual Intelligent Transportation systems (ITS) are intended to relief the broad spectrum of challenges that affect our modern traffic infrastructures. However the deployment of these technologies is not always reachable for all cities. Also this is not always fully implemented because of the heavy infrastructure required and the elevated cost. In this paper we assess an architecture based on traffic routing services. This is a lighter implementation and affordable cost for cities where ITS technologies are scarce or absent such as cities in developing countries. In this paper we evaluate how our architecture called Virtual Police Agent for ITS traffic Routing [1], [2] can help to improve the traffic performance. The end of this paper is to evaluate the benefits of Virtual Police Agents by means of several proposed scenarios.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114533364","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}
A Cognitive Radio Cloud Network (CRCN) model is proposed for wireless communications in TV White Spaces (TVWS). Making use of the flexible and vast computing capacity of the Cloud, a database and a sparse Bayesian learning (SBL) algorithm are developed for cooperative spectrum sensing (CSS) and implemented on Microsoft's Windows Azure Cloud platform. A medium access control (MAC) scheme is also prototyped for this CRCN model to collect sensing reports and access channels with Rice University's wireless access research platform (WARP). Through this CRCN prototype, important network parameters such as the mean squared errors in CSS, the time to detect the presence and/or the absence of primary users, and the channel vacating delay are measured and analyzed for the design and deployment of the future CRCN.
{"title":"A conceptual model and prototype of Cognitive Radio Cloud Networks in TV White Spaces","authors":"Sau-Hsuan Wu, Hsi-Lu Chao, Chung-Ting Jiang, Shang-Ru Mo, Chun-Hsien Ko, Tzung-Lin Li, Chiau-Feng Liang, Chung-Chieh Cheng","doi":"10.1109/WCNCW.2012.6215536","DOIUrl":"https://doi.org/10.1109/WCNCW.2012.6215536","url":null,"abstract":"A Cognitive Radio Cloud Network (CRCN) model is proposed for wireless communications in TV White Spaces (TVWS). Making use of the flexible and vast computing capacity of the Cloud, a database and a sparse Bayesian learning (SBL) algorithm are developed for cooperative spectrum sensing (CSS) and implemented on Microsoft's Windows Azure Cloud platform. A medium access control (MAC) scheme is also prototyped for this CRCN model to collect sensing reports and access channels with Rice University's wireless access research platform (WARP). Through this CRCN prototype, important network parameters such as the mean squared errors in CSS, the time to detect the presence and/or the absence of primary users, and the channel vacating delay are measured and analyzed for the design and deployment of the future CRCN.","PeriodicalId":392329,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123433785","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
扫码关注我们
求助内容：
应助结果提醒方式：