Pub Date : 2015-10-01DOI: 10.1109/WINCOM.2015.7381301
A. Yatribi, F. Ayoub, M. Belkasmi
In [6], a construction of cyclic one-step majority-logic decodable codes based on idempotent polynomials is given. However, the search for the feasible Parity-Check Idempotent runs through all possible combinations of cyclotomic cosets modulo n, satisfying some algebraic constraints, consequently, increasing the code length may result in very large dimension space search, and the search for the solution becomes more difficult. In this paper, we propose a Genetic Algorithm that aimes to construct new moderate and high lengths Binary Cyclic OSMLD codes, considered as LDPC codes, with high correction capacities. Our construction is very efficient and provide codes with high lenghts and high rates.
{"title":"Construction of cyclic one-step majority-logic decodable codes using genetic algorithms","authors":"A. Yatribi, F. Ayoub, M. Belkasmi","doi":"10.1109/WINCOM.2015.7381301","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381301","url":null,"abstract":"In [6], a construction of cyclic one-step majority-logic decodable codes based on idempotent polynomials is given. However, the search for the feasible Parity-Check Idempotent runs through all possible combinations of cyclotomic cosets modulo n, satisfying some algebraic constraints, consequently, increasing the code length may result in very large dimension space search, and the search for the solution becomes more difficult. In this paper, we propose a Genetic Algorithm that aimes to construct new moderate and high lengths Binary Cyclic OSMLD codes, considered as LDPC codes, with high correction capacities. Our construction is very efficient and provide codes with high lenghts and high rates.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115496338","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 : 2015-10-01DOI: 10.1109/WINCOM.2015.7381343
A. Benjebbour, Keisuke Saito, Anxin Li, Y. Kishiyama, Takehiro Nakamura
Non-orthogonal multiple access (NOMA) has been attracting a lot of attention as a promising downlink multiple access scheme for LTE enhancements and 5G. This paper introduces an overview of the concept, performance evaluation gains and our experimental trials related to NOMA. The goal is to clarify the benefits of NOMA over orthogonal multiple access (OMA) such as OFDMA adopted by Long-Term Evolution (LTE), also its combination with MIMO is discussed. Using computer simulations, NOMA performance gains are assessed from both link-level and system-level perspectives. Also, our NOMA test-bed and the measurement results are explained. Our evaluation results and measurements show that NOMA provides higher gains compared to OFDMA. These gains are more than 30%.
{"title":"Non-orthogonal multiple access (NOMA): Concept, performance evaluation and experimental trials","authors":"A. Benjebbour, Keisuke Saito, Anxin Li, Y. Kishiyama, Takehiro Nakamura","doi":"10.1109/WINCOM.2015.7381343","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381343","url":null,"abstract":"Non-orthogonal multiple access (NOMA) has been attracting a lot of attention as a promising downlink multiple access scheme for LTE enhancements and 5G. This paper introduces an overview of the concept, performance evaluation gains and our experimental trials related to NOMA. The goal is to clarify the benefits of NOMA over orthogonal multiple access (OMA) such as OFDMA adopted by Long-Term Evolution (LTE), also its combination with MIMO is discussed. Using computer simulations, NOMA performance gains are assessed from both link-level and system-level perspectives. Also, our NOMA test-bed and the measurement results are explained. Our evaluation results and measurements show that NOMA provides higher gains compared to OFDMA. These gains are more than 30%.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128617700","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 : 2015-10-01DOI: 10.1109/WINCOM.2015.7381304
Marwane Ayaida, Beatrice Beaujet, F. Valentin, Fabien Bradmetz, G. Picco, Bilel Rojbi
The road safety and maintenance are very important and costly activities for road operators. Due to the decrease in the cost of the sensors technologies and wireless equipments, connecting maintenance fleet vehicles become very intuitive. It allows to enhance the efficiency and the reactivity of such services. In the present paper we describe an interconnection system that facilitates the data exchange between maintenance vehicles and Network Operation Center (NOC). We detail the data synchronization mechanism used by this system, which is equipping forty vehicles under tests. These tests showed that our system works well and enhance the efficiency of the road's maintenance and incidents' treatment.
{"title":"Data synchronization in vehicles for on-board handrail","authors":"Marwane Ayaida, Beatrice Beaujet, F. Valentin, Fabien Bradmetz, G. Picco, Bilel Rojbi","doi":"10.1109/WINCOM.2015.7381304","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381304","url":null,"abstract":"The road safety and maintenance are very important and costly activities for road operators. Due to the decrease in the cost of the sensors technologies and wireless equipments, connecting maintenance fleet vehicles become very intuitive. It allows to enhance the efficiency and the reactivity of such services. In the present paper we describe an interconnection system that facilitates the data exchange between maintenance vehicles and Network Operation Center (NOC). We detail the data synchronization mechanism used by this system, which is equipping forty vehicles under tests. These tests showed that our system works well and enhance the efficiency of the road's maintenance and incidents' treatment.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130484131","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 : 2015-10-01DOI: 10.1109/WINCOM.2015.7381311
Nawal Bounouader, Sofia Ghacham, G. Aniba, Z. Guennoun
Cooperative Cognitive Radio Networks (CCRN) is a promising concept recently studied to enhance cellular networks. The basic idea is that a primary user (PU) transmits his traffic assisted by some selected secondary users (SUs), which transmit also their own traffics using the same channel. The existing works in the literature propose the use of the same channel by applying a time division approach, where a time slot is dedicated to secondary traffic transmission, which degrads system performance. To overcome this problem, the use of multiple antennas enables simultaneous primary and secondary transmissions. Furthermore, the integration of beam-forming techniques removes the interference generated by this simultaneous transmissions. However, for almost systems proposed so far, only the PU and one SU can transmit simultaneously. In this paper, we propose a new scheme of CCRN where SUs communicate with a fusion center (FC) over a TV White Space (TVWS) band and perform a modulation matrix that allows simultaneous transmissions of the PU and all SUs with no interferences. Finally, we prove by theoretical studies and simulations that the suggested model improves significantly the rate of secondary users yet retaining good performances for the primary link.
{"title":"Exploiting zero forcing beamforming and TV white space band for multiuser MIMO cognitive cooperative radio networks","authors":"Nawal Bounouader, Sofia Ghacham, G. Aniba, Z. Guennoun","doi":"10.1109/WINCOM.2015.7381311","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381311","url":null,"abstract":"Cooperative Cognitive Radio Networks (CCRN) is a promising concept recently studied to enhance cellular networks. The basic idea is that a primary user (PU) transmits his traffic assisted by some selected secondary users (SUs), which transmit also their own traffics using the same channel. The existing works in the literature propose the use of the same channel by applying a time division approach, where a time slot is dedicated to secondary traffic transmission, which degrads system performance. To overcome this problem, the use of multiple antennas enables simultaneous primary and secondary transmissions. Furthermore, the integration of beam-forming techniques removes the interference generated by this simultaneous transmissions. However, for almost systems proposed so far, only the PU and one SU can transmit simultaneously. In this paper, we propose a new scheme of CCRN where SUs communicate with a fusion center (FC) over a TV White Space (TVWS) band and perform a modulation matrix that allows simultaneous transmissions of the PU and all SUs with no interferences. Finally, we prove by theoretical studies and simulations that the suggested model improves significantly the rate of secondary users yet retaining good performances for the primary link.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"247 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127391993","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 : 2015-10-01DOI: 10.1109/WINCOM.2015.7381316
Najeh Jammali, L. Chaari
In recent years, Wireless Body Area Network (WBAN) has emerged as a new technology which allows human body monitoring. Because of their enormous benefits, the use of this type of wireless networks is surprisingly increasing day by day and it has a strong presence in several domains. However, WBAN has many challenges yet to be resolved. Security is the most crucial issue. In this paper, we propose a novel key agreement scheme termed Physiological-Feature-based Key Agreement (PFKA) as a biometric based security system. The proposed scheme allows sensors belonging the same WBAN to agree on a symmetric cryptographic key generated from overlapping physiological signal features. On one hand, security analysis shows that our protocol can guarantee data confidentiality, authenticity and integrity. In the other hand, performance analysis show that our scheme reduces communication overhead in comparison with the other proposal protocol termed Secure and Efficient Ordered-Physiological-Feature-based Key Agreement for Wireless Body Area Networks (OPFKA).
{"title":"PFKA: A physiological feature based key agreement for wireless body area network","authors":"Najeh Jammali, L. Chaari","doi":"10.1109/WINCOM.2015.7381316","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381316","url":null,"abstract":"In recent years, Wireless Body Area Network (WBAN) has emerged as a new technology which allows human body monitoring. Because of their enormous benefits, the use of this type of wireless networks is surprisingly increasing day by day and it has a strong presence in several domains. However, WBAN has many challenges yet to be resolved. Security is the most crucial issue. In this paper, we propose a novel key agreement scheme termed Physiological-Feature-based Key Agreement (PFKA) as a biometric based security system. The proposed scheme allows sensors belonging the same WBAN to agree on a symmetric cryptographic key generated from overlapping physiological signal features. On one hand, security analysis shows that our protocol can guarantee data confidentiality, authenticity and integrity. In the other hand, performance analysis show that our scheme reduces communication overhead in comparison with the other proposal protocol termed Secure and Efficient Ordered-Physiological-Feature-based Key Agreement for Wireless Body Area Networks (OPFKA).","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125679636","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 : 2015-10-01DOI: 10.1109/WINCOM.2015.7381305
H. Magri, N. Abghour, M. Ouzzif
Today, One of the most important performance measures in the new burst traffic gets to 3G and 4G systems is the End-to-End jitter. However, in order to study and analyze Jitter, many works and models have been devoted to estimate and evaluate this parameter. In this paper, analytical formulas for jitter of interrupted Poisson traffic (IPP) and MMPP-2 are presented. We provide Jitter approximation for The IPP Model. Moreover, we found that the jitter calculated directly using the IPP process is almost equal to that found by the EPP model. We have found that jitter can be a decreasing function of load. Simulation results show that the delay and jitter behave inversely which confirms the result already found in [8]. Finally, we found value of the average arrival rate and service rate required to provide flexible and efficient QoS guarantees for VoIP.
{"title":"Analytical models for jitter and QoS requirements with IPP and MMPP-2 traffics","authors":"H. Magri, N. Abghour, M. Ouzzif","doi":"10.1109/WINCOM.2015.7381305","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381305","url":null,"abstract":"Today, One of the most important performance measures in the new burst traffic gets to 3G and 4G systems is the End-to-End jitter. However, in order to study and analyze Jitter, many works and models have been devoted to estimate and evaluate this parameter. In this paper, analytical formulas for jitter of interrupted Poisson traffic (IPP) and MMPP-2 are presented. We provide Jitter approximation for The IPP Model. Moreover, we found that the jitter calculated directly using the IPP process is almost equal to that found by the EPP model. We have found that jitter can be a decreasing function of load. Simulation results show that the delay and jitter behave inversely which confirms the result already found in [8]. Finally, we found value of the average arrival rate and service rate required to provide flexible and efficient QoS guarantees for VoIP.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131633331","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 : 2015-10-01DOI: 10.1109/WINCOM.2015.7381323
A. Bouhoute, Rachid Oucheikh, Yassine Zahraoui, Ismail Berrada
Driver behavior has long been considered as particularly relevant for the development of automotive applications, especially that recently these applications are increasingly trying to adapt to the driver. However, drivers behave differently in the different traffic situations, hence the need of techniques to enable cars to learn from their drivers and create a model of his behavior. Actually, future generation of cars will be equipped with all sorts of sensing, computing and communication devices that will allow them to acquire all information about the state of the vehicle, the driver and the environment. And, hence make easier the driving behavior learning process. The present paper addresses the problem of modeling and learning the behavior of a driver in an intelligent car by presenting an approach for the construction and verification of a learned driving model. First, we propose a new way for modeling the driver-vehicle and environment, which consists of considering driver-vehicle as a rectangular hybrid input output automaton while representing contextual information about driving environment as conditions on the automaton variables. The construction of the model is ensured through a continuous monitoring of the driver-vehicle and environment system. The use of rectangular predicate states and environmental conditions will facilitate the verification of driving behavior. We then present a formal verification of properties of the constructed model expressed in Probabilistic Computational Tree Logic (PCTL) to assess its convenience to different traffic situations.
{"title":"A holistic approach for modeling and verification of human driver behavior","authors":"A. Bouhoute, Rachid Oucheikh, Yassine Zahraoui, Ismail Berrada","doi":"10.1109/WINCOM.2015.7381323","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381323","url":null,"abstract":"Driver behavior has long been considered as particularly relevant for the development of automotive applications, especially that recently these applications are increasingly trying to adapt to the driver. However, drivers behave differently in the different traffic situations, hence the need of techniques to enable cars to learn from their drivers and create a model of his behavior. Actually, future generation of cars will be equipped with all sorts of sensing, computing and communication devices that will allow them to acquire all information about the state of the vehicle, the driver and the environment. And, hence make easier the driving behavior learning process. The present paper addresses the problem of modeling and learning the behavior of a driver in an intelligent car by presenting an approach for the construction and verification of a learned driving model. First, we propose a new way for modeling the driver-vehicle and environment, which consists of considering driver-vehicle as a rectangular hybrid input output automaton while representing contextual information about driving environment as conditions on the automaton variables. The construction of the model is ensured through a continuous monitoring of the driver-vehicle and environment system. The use of rectangular predicate states and environmental conditions will facilitate the verification of driving behavior. We then present a formal verification of properties of the constructed model expressed in Probabilistic Computational Tree Logic (PCTL) to assess its convenience to different traffic situations.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134160930","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 : 2015-10-01DOI: 10.1109/WINCOM.2015.7381312
A. Kaabal, M. E. Halaoui, S. Ahyoud, A. Asselman
In this paper, an optimization procedure for the design of pentagon Ultra Wide Band (UWB) antenna with wireless local area network (WLAN) Band notched is presented. The proposed antenna has the capability of operating between 3 GHz to 13 GHz. The antenna parameter design has been verified by the High Frequency Structural Simulator (HFSS) and the commercial field solver packages CST Microwave Studio. The proposed UWB antenna has omnidirectional radiation patterns with a gain variation of 1 dBi to 4 dBi and low distortion group delay less than 1ns over the operating frequency range. As results, the simulation demonstrated reasonable agreement with the HFSS and CST results. And good ultra-wideband linear transmission performance has been achieved in time domain.
{"title":"Spectral and time domains analysis of pentagon UWB antenna with WLAN band-notched using electromagnetic band-gap structures","authors":"A. Kaabal, M. E. Halaoui, S. Ahyoud, A. Asselman","doi":"10.1109/WINCOM.2015.7381312","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381312","url":null,"abstract":"In this paper, an optimization procedure for the design of pentagon Ultra Wide Band (UWB) antenna with wireless local area network (WLAN) Band notched is presented. The proposed antenna has the capability of operating between 3 GHz to 13 GHz. The antenna parameter design has been verified by the High Frequency Structural Simulator (HFSS) and the commercial field solver packages CST Microwave Studio. The proposed UWB antenna has omnidirectional radiation patterns with a gain variation of 1 dBi to 4 dBi and low distortion group delay less than 1ns over the operating frequency range. As results, the simulation demonstrated reasonable agreement with the HFSS and CST results. And good ultra-wideband linear transmission performance has been achieved in time domain.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117016386","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 : 2015-10-01DOI: 10.1109/WINCOM.2015.7381320
Samia Jalil, M. Abbad, R. E. Azouzi
Real-time applications over wireless networks often suffers from jitter, delay and packet loss. The traditional techniques for error control are FEC (Forward Error Correction) and ARQ (Automatic Repeat Request). In this paper a hybrid FEC/ARQ mechanisms with limiting the slots number between the loss of the last retransmission of the original block n and the reception of block n + φ is analyzed in an environment of real time applications. We assume that the packet size increases when adding redundancy so that the amount of useful information contained in a packet is unchanged. We evalute analytically the performance of TFRC (TCP Friendly Rate Control) and ARC (Analytical Rate Control Protocol) as a function of the parameters of the FEC scheme, the limit number of retransmission used by ARQ scheme and the number of slots threshold Sth. We show that the combination of FEC and ARQ with limiting the Sth reduces the number of retransmissions and keeps a reasonable delay for real time traffic in wireless networks.
{"title":"Hybrid FEC/ARQ schemes for real-time traffic in wireless networks","authors":"Samia Jalil, M. Abbad, R. E. Azouzi","doi":"10.1109/WINCOM.2015.7381320","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381320","url":null,"abstract":"Real-time applications over wireless networks often suffers from jitter, delay and packet loss. The traditional techniques for error control are FEC (Forward Error Correction) and ARQ (Automatic Repeat Request). In this paper a hybrid FEC/ARQ mechanisms with limiting the slots number between the loss of the last retransmission of the original block n and the reception of block n + φ is analyzed in an environment of real time applications. We assume that the packet size increases when adding redundancy so that the amount of useful information contained in a packet is unchanged. We evalute analytically the performance of TFRC (TCP Friendly Rate Control) and ARC (Analytical Rate Control Protocol) as a function of the parameters of the FEC scheme, the limit number of retransmission used by ARQ scheme and the number of slots threshold Sth. We show that the combination of FEC and ARQ with limiting the Sth reduces the number of retransmissions and keeps a reasonable delay for real time traffic in wireless networks.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128577250","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 : 2015-10-01DOI: 10.1109/WINCOM.2015.7381326
Hajar Elhammouti, M. Benjillali, L. Echabbi
Heterogeneous deployment of base stations with different transmit power levels helps increase the network efficiency. Yet, the allocation of powers to base stations should be optimal in order to minimize interferences and thus improve users through-put. In this paper, we present a game theoretical approach to maximize the overall throughput in heterogeneous networks with optimal power allocation. We formulate the allocation problem as a "potential game". This type of games is characterized by a potential function, and has a specific property: a pure Nash equilibrium solution always exists and it is, moreover, either a local or a global optimizer of the potential function. We use a fully distributed algorithm that requires minimal coordination between base stations to reach a Nash equilibrium, and we prove that it is necessarily a global maximum. The performance of the algorithm is evaluated through simulations.
{"title":"Power allocation optimization for heterogeneous networks: A potential game approach","authors":"Hajar Elhammouti, M. Benjillali, L. Echabbi","doi":"10.1109/WINCOM.2015.7381326","DOIUrl":"https://doi.org/10.1109/WINCOM.2015.7381326","url":null,"abstract":"Heterogeneous deployment of base stations with different transmit power levels helps increase the network efficiency. Yet, the allocation of powers to base stations should be optimal in order to minimize interferences and thus improve users through-put. In this paper, we present a game theoretical approach to maximize the overall throughput in heterogeneous networks with optimal power allocation. We formulate the allocation problem as a \"potential game\". This type of games is characterized by a potential function, and has a specific property: a pure Nash equilibrium solution always exists and it is, moreover, either a local or a global optimizer of the potential function. We use a fully distributed algorithm that requires minimal coordination between base stations to reach a Nash equilibrium, and we prove that it is necessarily a global maximum. The performance of the algorithm is evaluated through simulations.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128547818","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
扫码关注我们
求助内容：
应助结果提醒方式：