Pub Date : 2014-12-10DOI: 10.1109/GLOCOM.2014.7036978
Adnan Aijaz, M. R. Nakhai, H. Aghvami
In this paper, we investigate power efficient resource allocation for the uplink of LTE networks under delay Quality-of-Service (QoS) constraints. We formulate the resource allocation problem as the minimization of sum power in the uplink under statistical delay QoS provisioning, which is complicated due to the specific constraints of SC-FDMA (uplink air interface in LTE networks). We solve the problem using Canonical duality theory. Numerical results which are obtained using the Invasive Weed Optimization algorithm, show that the proposed resource allocation algorithm not only outperforms classical algorithms in terms of power efficiency while satisfying the QoS requirements, but also performs closer to the optimal solution.
{"title":"Power efficient uplink resource allocation in LTE networks under delay QoS constraints","authors":"Adnan Aijaz, M. R. Nakhai, H. Aghvami","doi":"10.1109/GLOCOM.2014.7036978","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036978","url":null,"abstract":"In this paper, we investigate power efficient resource allocation for the uplink of LTE networks under delay Quality-of-Service (QoS) constraints. We formulate the resource allocation problem as the minimization of sum power in the uplink under statistical delay QoS provisioning, which is complicated due to the specific constraints of SC-FDMA (uplink air interface in LTE networks). We solve the problem using Canonical duality theory. Numerical results which are obtained using the Invasive Weed Optimization algorithm, show that the proposed resource allocation algorithm not only outperforms classical algorithms in terms of power efficiency while satisfying the QoS requirements, but also performs closer to the optimal solution.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"26 1","pages":"1239-1244"},"PeriodicalIF":0.0,"publicationDate":"2014-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84970636","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 : 2014-12-09DOI: 10.1109/GLOCOM.2014.7037289
Hong Xing, Zheng Chu, Z. Ding, A. Nallanathan
The emerging radio signal enabled simultaneous wireless information and power transfer (SWIPT), has drawn significant attention. To achieve secrecy transmission by cooperative jamming, especially in the upcoming 5G networks with self-sustainable mobile base stations (BSs) and yet not to add extra power consumption, we propose in this paper a new relay protocol, i.e., harvest-and-jam (HJ), in a relay wiretap channel with an additional set of spare helpers. Specifically, in the first transmission phase, a single-antenna transmitter (Tx) transfers signals carrying both information and energy to a multi-antenna amplify-and-forward (AF) relay and a group of multi-antenna helpers; in the second transmission phase, the AF relay processes the information and forwards it to the receiver while each of the helpers generates an artificial noise (AN), the power of which is constrained by its previously harvested energy, to interfere with the eavesdropper. By optimizing the transmit beamforming matrix for the AF relay and the covariance matrix for the AN, we maximize the secrecy rate for the receiver subject to transmit power constraints for the AF relay and all helpers. The formulated problem is shown to be non-convex, for which we propose an iterative algorithm based on alternating optimization. Finally, the performance of the proposed scheme is evaluated by simulations as compared to other heuristic schemes.
{"title":"Harvest-and-jam: Improving security for wireless energy harvesting cooperative networks","authors":"Hong Xing, Zheng Chu, Z. Ding, A. Nallanathan","doi":"10.1109/GLOCOM.2014.7037289","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037289","url":null,"abstract":"The emerging radio signal enabled simultaneous wireless information and power transfer (SWIPT), has drawn significant attention. To achieve secrecy transmission by cooperative jamming, especially in the upcoming 5G networks with self-sustainable mobile base stations (BSs) and yet not to add extra power consumption, we propose in this paper a new relay protocol, i.e., harvest-and-jam (HJ), in a relay wiretap channel with an additional set of spare helpers. Specifically, in the first transmission phase, a single-antenna transmitter (Tx) transfers signals carrying both information and energy to a multi-antenna amplify-and-forward (AF) relay and a group of multi-antenna helpers; in the second transmission phase, the AF relay processes the information and forwards it to the receiver while each of the helpers generates an artificial noise (AN), the power of which is constrained by its previously harvested energy, to interfere with the eavesdropper. By optimizing the transmit beamforming matrix for the AF relay and the covariance matrix for the AN, we maximize the secrecy rate for the receiver subject to transmit power constraints for the AF relay and all helpers. The formulated problem is shown to be non-convex, for which we propose an iterative algorithm based on alternating optimization. Finally, the performance of the proposed scheme is evaluated by simulations as compared to other heuristic schemes.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"28 1","pages":"3145-3150"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78134255","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 : 2014-12-09DOI: 10.1109/GLOCOM.2014.7037438
Yuanwei Liu, Lifeng Wang, M. Elkashlan, T. Duong, A. Nallanathan
This paper exploits an amplify-and-forward (AF) two-way relaying network (TWRN), where an energy constrained relay node harvests energy with wireless power transfer. Two bidirectional protocols, multiple access broadcast (MABC) protocol and time division broadcast (TDBC) protocol, are considered. Three wireless power transfer policies, namely, dual-source (DS) power transfer; single-fixed-source (SFS) power transfer; and single-best-source (SBS) power transfer are proposed and well-designed based on time switching receiver architecture. We derive analytical expressions to determine the throughput both for delay-limited transmission and delay-tolerant transmission. Numerical results corroborate our analysis and show that MABC protocol achieves a higher throughput than TDBC protocol. An important observation is that SBS policy offers a good tradeoff between throughput and power.
{"title":"Two-way relaying networks with wireless power transfer: Policies design and throughput analysis","authors":"Yuanwei Liu, Lifeng Wang, M. Elkashlan, T. Duong, A. Nallanathan","doi":"10.1109/GLOCOM.2014.7037438","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037438","url":null,"abstract":"This paper exploits an amplify-and-forward (AF) two-way relaying network (TWRN), where an energy constrained relay node harvests energy with wireless power transfer. Two bidirectional protocols, multiple access broadcast (MABC) protocol and time division broadcast (TDBC) protocol, are considered. Three wireless power transfer policies, namely, dual-source (DS) power transfer; single-fixed-source (SFS) power transfer; and single-best-source (SBS) power transfer are proposed and well-designed based on time switching receiver architecture. We derive analytical expressions to determine the throughput both for delay-limited transmission and delay-tolerant transmission. Numerical results corroborate our analysis and show that MABC protocol achieves a higher throughput than TDBC protocol. An important observation is that SBS policy offers a good tradeoff between throughput and power.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"14 1","pages":"4030-4035"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87739660","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 : 2014-12-09DOI: 10.1109/GLOCOM.2014.7037281
Haijun Zhang, Chunxiao Jiang, Xiaotao Mao, A. Nallanathan
Recently, cognitive radio enabled femtocell is regarded as a promising technique in wireless communications, where the issues of resource allocation and interference management have been investigated intensively. However, spectrum sensing errors are neglected in most of the existing works. In this paper, we propose a resource allocation scheme for orthogonal frequency division multiple access (OFDMA) based cognitive femtocells. The target is to maximize the sum rate of all femtocell users (FUs) under QoS constraints and co-tier/cross-tier interference constraints under imperfect channel sensing. The subchannel and power allocation problem is first modeled as a mixed integer programming problem, and then transformed into a convex optimization problem by relaxing subchannel sharing and imposing co-tier interference constraints, which is finally solved using the dual decomposition method. Based on the obtained solution, an iterative subchannel and power allocation algorithm is proposed. The effectiveness in terms of instantaneous maximum achievable rate of the proposed algorithm as compared with perfect spectrum sensing schemes is verified by simulations.
{"title":"Resource management in cognitive opportunistic access femtocells with imperfect spectrum sensing","authors":"Haijun Zhang, Chunxiao Jiang, Xiaotao Mao, A. Nallanathan","doi":"10.1109/GLOCOM.2014.7037281","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037281","url":null,"abstract":"Recently, cognitive radio enabled femtocell is regarded as a promising technique in wireless communications, where the issues of resource allocation and interference management have been investigated intensively. However, spectrum sensing errors are neglected in most of the existing works. In this paper, we propose a resource allocation scheme for orthogonal frequency division multiple access (OFDMA) based cognitive femtocells. The target is to maximize the sum rate of all femtocell users (FUs) under QoS constraints and co-tier/cross-tier interference constraints under imperfect channel sensing. The subchannel and power allocation problem is first modeled as a mixed integer programming problem, and then transformed into a convex optimization problem by relaxing subchannel sharing and imposing co-tier interference constraints, which is finally solved using the dual decomposition method. Based on the obtained solution, an iterative subchannel and power allocation algorithm is proposed. The effectiveness in terms of instantaneous maximum achievable rate of the proposed algorithm as compared with perfect spectrum sensing schemes is verified by simulations.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"40 1","pages":"3098-3102"},"PeriodicalIF":0.0,"publicationDate":"2014-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88034584","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7036980
Raúl Palacios, El Moatez Billah Larbaa, J. Alonso-Zarate, F. Granelli
The Distributed Coordination Function (DCF) is the mandatory access method for any compliant device in Wireless Local Area Networks (WLANs) based on the IEEE 802.11 Standard. WLAN Access Points (APs) and stations (STAs) contend for the access to the wireless channel in order to transmit data by using a variation of Carrier Sense Multiple Access (CSMA). In doing so, they consume a significant amount of energy for continuously monitoring the channel state. In this paper we investigate backwards-compatible mechanisms to increase throughput and energy efficiency in WLANs during contention periods based on DCF. The first mechanism is called Bi-Directional DCF (BD-DCF) because it allows for bidirectional transmissions between APs and STAs with a single channel access invocation. The second mechanism is called Bi-Directional Sleep DCF (BDSL-DCF) as it allows overhearing STAs to enter the sleep state, i.e. switch off the radio transceiver, during bidirectional transmissions. We analyze the performance limits of the proposed protocols in terms of throughput and energy efficiency considering different values for the data packet length and data rate. The results of this work show that the BD-DCF and BDSL-DCF protocols can improve throughput up to 60% and energy efficiency up to 360% when compared to legacy DCF.
{"title":"Performance analysis of energy-efficient MAC protocols using bidirectional transmissions and sleep periods in IEEE 802.11 WLANs","authors":"Raúl Palacios, El Moatez Billah Larbaa, J. Alonso-Zarate, F. Granelli","doi":"10.1109/GLOCOM.2014.7036980","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036980","url":null,"abstract":"The Distributed Coordination Function (DCF) is the mandatory access method for any compliant device in Wireless Local Area Networks (WLANs) based on the IEEE 802.11 Standard. WLAN Access Points (APs) and stations (STAs) contend for the access to the wireless channel in order to transmit data by using a variation of Carrier Sense Multiple Access (CSMA). In doing so, they consume a significant amount of energy for continuously monitoring the channel state. In this paper we investigate backwards-compatible mechanisms to increase throughput and energy efficiency in WLANs during contention periods based on DCF. The first mechanism is called Bi-Directional DCF (BD-DCF) because it allows for bidirectional transmissions between APs and STAs with a single channel access invocation. The second mechanism is called Bi-Directional Sleep DCF (BDSL-DCF) as it allows overhearing STAs to enter the sleep state, i.e. switch off the radio transceiver, during bidirectional transmissions. We analyze the performance limits of the proposed protocols in terms of throughput and energy efficiency considering different values for the data packet length and data rate. The results of this work show that the BD-DCF and BDSL-DCF protocols can improve throughput up to 60% and energy efficiency up to 360% when compared to legacy DCF.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"6 1","pages":"1252-1258"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82275247","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7037136
R. Joyce, Li X. Zhang
This paper presents a number of Self-Organising Network (SON) based methods using a 3GPP Minimisation of Drive Testing (MDT) approach or similar and the analysis of these geo-located UE measurements to maximise traffic offload onto lamppost mounted 3G/WCDMA microcells. Simulations have been performed for a real 3G/WCDMA microcell deployment in a busy area of central London and the results suggest that for the network studied a traffic increase on the microcell layer of up to 175% is achievable through the novel SON methods presented.
{"title":"Self organising network techniques to maximise traffic offload onto a 3G/WCDMA small cell network using MDT UE measurement reports","authors":"R. Joyce, Li X. Zhang","doi":"10.1109/GLOCOM.2014.7037136","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037136","url":null,"abstract":"This paper presents a number of Self-Organising Network (SON) based methods using a 3GPP Minimisation of Drive Testing (MDT) approach or similar and the analysis of these geo-located UE measurements to maximise traffic offload onto lamppost mounted 3G/WCDMA microcells. Simulations have been performed for a real 3G/WCDMA microcell deployment in a busy area of central London and the results suggest that for the network studied a traffic increase on the microcell layer of up to 175% is achievable through the novel SON methods presented.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"23 1","pages":"2212-2217"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90282839","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7389766
Natalya Rozhnova, S. Fdida
The evolution of the Internet has triggered a significant activity exploring new architectures among which the concept of Information-Centric-Networks (ICN) has emerged. Considering the various ICN solutions, Content-Centric Networking (CCN) is the one that received most attention. The design of CCN is progressing albeit many important issues still deserve a careful analysis and design. In this paper, we cover the important problem of congestion control in CCN and develop our hop-by-hop Interest Shaping mechanism (HoBHIS) framework. We present the foundation and general properties of our solution. We then study the behaviour of HoBHIS and demonstrate the fairness of resource sharing in presence of multiple active conversations. Further, we introduce a mechanism to control the user behavior in order to limit its ability to submit requests in excess creating a potential risk for buffer overflow. We demonstrate the effectiveness of the proposed solutions and provide a performance analysis using the implementation of our schemes in ndnSIM. We show that HoBHIS provides an adequate and efficient solution to the general problem of congestion control in CCN.
{"title":"An extended Hop-by-hop interest shaping mechanism for content-centric networking","authors":"Natalya Rozhnova, S. Fdida","doi":"10.1109/GLOCOM.2014.7389766","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7389766","url":null,"abstract":"The evolution of the Internet has triggered a significant activity exploring new architectures among which the concept of Information-Centric-Networks (ICN) has emerged. Considering the various ICN solutions, Content-Centric Networking (CCN) is the one that received most attention. The design of CCN is progressing albeit many important issues still deserve a careful analysis and design. In this paper, we cover the important problem of congestion control in CCN and develop our hop-by-hop Interest Shaping mechanism (HoBHIS) framework. We present the foundation and general properties of our solution. We then study the behaviour of HoBHIS and demonstrate the fairness of resource sharing in presence of multiple active conversations. Further, we introduce a mechanism to control the user behavior in order to limit its ability to submit requests in excess creating a potential risk for buffer overflow. We demonstrate the effectiveness of the proposed solutions and provide a performance analysis using the implementation of our schemes in ndnSIM. We show that HoBHIS provides an adequate and efficient solution to the general problem of congestion control in CCN.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"19 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89292461","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7037172
H. Mshali, Tayeb Lemlouma, D. Magoni
This work focuses on the evaluation of the need and help required by elderly and dependent persons. We study the most widely used evaluation models in the health domain. We propose a new algorithm to assess and compare the performance of these models and the possibility to use them in future eHealth systems and platforms. The objective is to shed some light on the weakness of existing models and to gain a better knowledge about the context of persons in order to provide them with eHealth services that match their context and meet their needs.
{"title":"Analysis of dependency evaluation models for eHealth services","authors":"H. Mshali, Tayeb Lemlouma, D. Magoni","doi":"10.1109/GLOCOM.2014.7037172","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7037172","url":null,"abstract":"This work focuses on the evaluation of the need and help required by elderly and dependent persons. We study the most widely used evaluation models in the health domain. We propose a new algorithm to assess and compare the performance of these models and the possibility to use them in future eHealth systems and platforms. The objective is to shed some light on the weakness of existing models and to gain a better knowledge about the context of persons in order to provide them with eHealth services that match their context and meet their needs.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"27 1","pages":"2429-2435"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77253451","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7036833
Samuel B. Wood, H. Sadjadpour, J. Garcia-Luna-Aceves
Tactical and emergency-response networks require efficient communication without a managed infrastructure. Recent work demonstrates that applying information-centric paradigms to the tactical edge can provide performance benefits over traditional address centric approaches. We propose SOCRATIC (SOCial RATe control for Information Centric networks), an approach that unifies replication and network coding to disseminate content by taking advantage of social content and context heuristics. SOCRATIC replicates network encoded blocks according to a popularity index metric that is shared during neighbor discovery. The number of encoded blocks that is relayed to a node depends on its own interest in a data object and its social popularity, i.e., how often and for how long the node meets other nodes. These blocks are subsequently replicated towards the subscriber if a stable path exists. We evaluate an implementation of SOCRATIC through network emulation of a tactical scenario and demonstrate that it can achieve better performance than traditional socially agnostic approaches.
{"title":"SOCRATIC: A social approach to network coding rate control","authors":"Samuel B. Wood, H. Sadjadpour, J. Garcia-Luna-Aceves","doi":"10.1109/GLOCOM.2014.7036833","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036833","url":null,"abstract":"Tactical and emergency-response networks require efficient communication without a managed infrastructure. Recent work demonstrates that applying information-centric paradigms to the tactical edge can provide performance benefits over traditional address centric approaches. We propose SOCRATIC (SOCial RATe control for Information Centric networks), an approach that unifies replication and network coding to disseminate content by taking advantage of social content and context heuristics. SOCRATIC replicates network encoded blocks according to a popularity index metric that is shared during neighbor discovery. The number of encoded blocks that is relayed to a node depends on its own interest in a data object and its social popularity, i.e., how often and for how long the node meets other nodes. These blocks are subsequently replicated towards the subscriber if a stable path exists. We evaluate an implementation of SOCRATIC through network emulation of a tactical scenario and demonstrate that it can achieve better performance than traditional socially agnostic approaches.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"41 1","pages":"352-356"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87280302","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 : 2014-12-08DOI: 10.1109/GLOCOM.2014.7036805
A. Busson, Lynda Zitoune, V. Vèque, B. Jabbari
The femtocell - Wi-Fi integration is a promising approach to solve the problem of inter-tier or intra-tier interference in heterogeneous networks. In this paper, multimode femtocell base stations are deployed which form a Wi-Fi mesh network to communicate between themselves while deploying cellular technology (e.g., LTE) for communications with mobile users, thus ensuring ultimately connectivity between mobile users and their macro base stations to improve the network coverage. We propose a tractable model for coverage/outage to evaluate the benefits of such integration in terms of SINR and received signal strength. Our work is based on point processes in two-dimensional plane that models locations of femtocell - Wi-Fi (also referred to as multimode) nodes. The proposed model is more realistic than the classical Poisson point process, as the distribution of points is more homogeneous and it ensures that the nodes are not too close to each other. The derivation of coverage/outage formula allows us to determine operational parameter ranges for the Wi-Fi network to form a mesh network. In addition, it helps in the design of the femtocell network to ensure a suitable coverage for users in terms of SINR and received signal strength.
{"title":"Outage analysis of integrated mesh LTE femtocell networks","authors":"A. Busson, Lynda Zitoune, V. Vèque, B. Jabbari","doi":"10.1109/GLOCOM.2014.7036805","DOIUrl":"https://doi.org/10.1109/GLOCOM.2014.7036805","url":null,"abstract":"The femtocell - Wi-Fi integration is a promising approach to solve the problem of inter-tier or intra-tier interference in heterogeneous networks. In this paper, multimode femtocell base stations are deployed which form a Wi-Fi mesh network to communicate between themselves while deploying cellular technology (e.g., LTE) for communications with mobile users, thus ensuring ultimately connectivity between mobile users and their macro base stations to improve the network coverage. We propose a tractable model for coverage/outage to evaluate the benefits of such integration in terms of SINR and received signal strength. Our work is based on point processes in two-dimensional plane that models locations of femtocell - Wi-Fi (also referred to as multimode) nodes. The proposed model is more realistic than the classical Poisson point process, as the distribution of points is more homogeneous and it ensures that the nodes are not too close to each other. The derivation of coverage/outage formula allows us to determine operational parameter ranges for the Wi-Fi network to form a mesh network. In addition, it helps in the design of the femtocell network to ensure a suitable coverage for users in terms of SINR and received signal strength.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"30 1","pages":"187-192"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83402354","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
扫码关注我们
求助内容：
应助结果提醒方式：