Pub Date : 2014-04-14DOI: 10.1109/TENCONSPRING.2014.6863070
M. Shafi, M. I. Khattak, Naeem Khan, Mohammad Saleem
In design and synthesis of wearable antenna, the isolation of antenna and human body is always given paramount importance because this shielding has a pronounced effect on antenna parameters such as resonant frequency, input impedance and radiation pattern. This paper deals with the effects of different shapes of ground plane of quarter-wave monopole antenna on on-body communications around the human body model at 1.8 and 2.45GHz. A non line-of-sight (NLOS) situation is demonstrated. Results show that the circular ground plane is providing better communication link than square shape for monopole antenna at mentioned mobile communication frequencies.
{"title":"Ground plane shape effects on around the body area network at 1.8GHz and 2.45GHz","authors":"M. Shafi, M. I. Khattak, Naeem Khan, Mohammad Saleem","doi":"10.1109/TENCONSPRING.2014.6863070","DOIUrl":"https://doi.org/10.1109/TENCONSPRING.2014.6863070","url":null,"abstract":"In design and synthesis of wearable antenna, the isolation of antenna and human body is always given paramount importance because this shielding has a pronounced effect on antenna parameters such as resonant frequency, input impedance and radiation pattern. This paper deals with the effects of different shapes of ground plane of quarter-wave monopole antenna on on-body communications around the human body model at 1.8 and 2.45GHz. A non line-of-sight (NLOS) situation is demonstrated. Results show that the circular ground plane is providing better communication link than square shape for monopole antenna at mentioned mobile communication frequencies.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121150720","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-04-14DOI: 10.1109/TENCONSPRING.2014.6863085
K. A. Alezabi, F. Hashim, S. Hashim, B. Ali
Long Term Evolution (LTE) networks designed by 3rd Generation Partnership Project (3GPP) represent a widespread technology. LTE is mainly influenced by high data rates, minimum delay and the capacity due to scalable bandwidth and its flexibility. With the rapid and widespread use LTE networks, and increase the use in data/video transmission and Internet applications in general, accordingly, the challenges of securing and speeding up data communication in such networks is also increased. Authentication in LTE networks is very important process because most of the coming attacks occur during this stage. Attackers try to be authenticated and then launch the network resources and prevent the legitimate users from the network services. The basics of Extensible Authentication Protocol-Authentication and Key Agreement (EAP-AKA) are used in LTE AKA protocol which is called Evolved Packet System AKA (EPS-AKA) protocol to secure LTE network, However it still suffers from various vulnerabilities such as disclosure of the user identity, computational overhead, Man In The Middle (MITM) attack and authentication delay. In this paper, an Efficient EPS-AKA protocol (EEPS-AKA) is proposed to overcome those problems. The proposed protocol is based on the Simple Password Exponential Key Exchange (SPEKE) protocol. Compared to previous proposed methods, our method is faster, since it uses a secret key method which is faster than certificate-based methods, In addition, the size of messages exchanged between User Equipment (UE) and Home Subscriber Server (HSS) is reduced, this reduces authentication delay and storage overhead effectively. The automated validation of internet security protocols and applications (AVISPA) tool is used to provide a formal verification. Results show that the proposed EEPS-AKA is efficient and secure against active and passive attacks.
{"title":"An efficient authentication and key agreement protocol for 4G (LTE) networks","authors":"K. A. Alezabi, F. Hashim, S. Hashim, B. Ali","doi":"10.1109/TENCONSPRING.2014.6863085","DOIUrl":"https://doi.org/10.1109/TENCONSPRING.2014.6863085","url":null,"abstract":"Long Term Evolution (LTE) networks designed by 3rd Generation Partnership Project (3GPP) represent a widespread technology. LTE is mainly influenced by high data rates, minimum delay and the capacity due to scalable bandwidth and its flexibility. With the rapid and widespread use LTE networks, and increase the use in data/video transmission and Internet applications in general, accordingly, the challenges of securing and speeding up data communication in such networks is also increased. Authentication in LTE networks is very important process because most of the coming attacks occur during this stage. Attackers try to be authenticated and then launch the network resources and prevent the legitimate users from the network services. The basics of Extensible Authentication Protocol-Authentication and Key Agreement (EAP-AKA) are used in LTE AKA protocol which is called Evolved Packet System AKA (EPS-AKA) protocol to secure LTE network, However it still suffers from various vulnerabilities such as disclosure of the user identity, computational overhead, Man In The Middle (MITM) attack and authentication delay. In this paper, an Efficient EPS-AKA protocol (EEPS-AKA) is proposed to overcome those problems. The proposed protocol is based on the Simple Password Exponential Key Exchange (SPEKE) protocol. Compared to previous proposed methods, our method is faster, since it uses a secret key method which is faster than certificate-based methods, In addition, the size of messages exchanged between User Equipment (UE) and Home Subscriber Server (HSS) is reduced, this reduces authentication delay and storage overhead effectively. The automated validation of internet security protocols and applications (AVISPA) tool is used to provide a formal verification. Results show that the proposed EEPS-AKA is efficient and secure against active and passive attacks.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121379440","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-04-14DOI: 10.1109/TENCONSpring.2014.6863089
Safeen Qadir, A. Kist, Zhongwei Zhang
The emergence of video applications and video capable devices have contributed substantially to the increase of video traffic on Internet. New mechanisms recommending video rate adaptation towards delivering enhanced Quality of Experience (QoE) at the same time making room for more sessions. This paper introduces a cross-layer QoE-aware architecture for video traffic over the Internet. It proposes that video sources at the application layer adapt their rate to the network environment by controlling their transmitted bit rate dynamically; and the edge of network at the network layer protects the quality of the active video sessions by controlling the acceptance of new session through a video-aware admission control. In particular, it will seek the most efficient way of accepting new video session and adapting transmission rates to free up resources for more session while maintaining the QoE of active sessions. The proposed framework will contribute to the preparation for the extreme growth of video traffic in the foreseeable future. Simulation results show that the proposed cross-layer architecture guarantees the QoE for the admitted sessions and utilizes the link more efficiently comparing to the rate adaptation only architecture.
{"title":"QoE-aware cross-layer architecture for video traffic over Internet","authors":"Safeen Qadir, A. Kist, Zhongwei Zhang","doi":"10.1109/TENCONSpring.2014.6863089","DOIUrl":"https://doi.org/10.1109/TENCONSpring.2014.6863089","url":null,"abstract":"The emergence of video applications and video capable devices have contributed substantially to the increase of video traffic on Internet. New mechanisms recommending video rate adaptation towards delivering enhanced Quality of Experience (QoE) at the same time making room for more sessions. This paper introduces a cross-layer QoE-aware architecture for video traffic over the Internet. It proposes that video sources at the application layer adapt their rate to the network environment by controlling their transmitted bit rate dynamically; and the edge of network at the network layer protects the quality of the active video sessions by controlling the acceptance of new session through a video-aware admission control. In particular, it will seek the most efficient way of accepting new video session and adapting transmission rates to free up resources for more session while maintaining the QoE of active sessions. The proposed framework will contribute to the preparation for the extreme growth of video traffic in the foreseeable future. Simulation results show that the proposed cross-layer architecture guarantees the QoE for the admitted sessions and utilizes the link more efficiently comparing to the rate adaptation only architecture.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115508857","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-04-14DOI: 10.1109/TENCONSPRING.2014.6863003
Ka Kien Lo, S. Chien, D. Chieng, Heng-Siong Lim, KwongKae Hsiang
In this paper, resource allocation for OFDMA system with proportional rate constraints is studied. The objective is to optimize subcarriers and power allocation in order to maximize sum capacity subject to the constraints of total power and proportionality among users' capacity. Optimal solution to the constrained fairness maximization problem is extremely computationally expensive. Previous works have proposed suboptimal solution by separating the subcarrier and channel allocation. Although previous work offered a suboptimal solution which is 95% close to the optimal but the resource allocation algorithm is found biased to the users which suffer deep fading and can only work in high channel-to-noise ratio condition. We propose a resource allocation algorithm to overcome these issues. The numerical results show that the proposed algorithm consistently yields higher sum capacity and better fairness in resource allocation among users.
{"title":"Proportional resource allocation for OFDMA system","authors":"Ka Kien Lo, S. Chien, D. Chieng, Heng-Siong Lim, KwongKae Hsiang","doi":"10.1109/TENCONSPRING.2014.6863003","DOIUrl":"https://doi.org/10.1109/TENCONSPRING.2014.6863003","url":null,"abstract":"In this paper, resource allocation for OFDMA system with proportional rate constraints is studied. The objective is to optimize subcarriers and power allocation in order to maximize sum capacity subject to the constraints of total power and proportionality among users' capacity. Optimal solution to the constrained fairness maximization problem is extremely computationally expensive. Previous works have proposed suboptimal solution by separating the subcarrier and channel allocation. Although previous work offered a suboptimal solution which is 95% close to the optimal but the resource allocation algorithm is found biased to the users which suffer deep fading and can only work in high channel-to-noise ratio condition. We propose a resource allocation algorithm to overcome these issues. The numerical results show that the proposed algorithm consistently yields higher sum capacity and better fairness in resource allocation among users.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115308757","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-04-14DOI: 10.1109/TENCONSPRING.2014.6863005
Mishra Vishram, L. C. Tong, Chan Syin
Recently cognitive radio has gain considerable interest by research community as a viable solution to mitigate the problems of spectrum scarcity and spectrum under-utilization. A cognitive radio selects a vacant channel opportunistically and perform its own transmission on it. Detecting an incumbent user along with self-coexistence has become one of the important aspects of the cognitive radio. The former problem is solved by spectrum sensing while the latter problem requires complex techniques. To this end we propose a graph coloring based fair channel allocation policy for self-coexistence in cognitive radio networks. The proposed scheme allows multiple cognitive radio network operating over a given region to allocate channels on non-interfering basis with a certain grade of QoS. The scheme allows fair allocation of channels among multiple participating opportunistic networks with varying priorities. Simulation analysis has been done to show the effectiveness of the proposed approach.
{"title":"List multi-coloring based fair channel allocation policy for self coexistence in cognitive radio networks with QoS provisioning","authors":"Mishra Vishram, L. C. Tong, Chan Syin","doi":"10.1109/TENCONSPRING.2014.6863005","DOIUrl":"https://doi.org/10.1109/TENCONSPRING.2014.6863005","url":null,"abstract":"Recently cognitive radio has gain considerable interest by research community as a viable solution to mitigate the problems of spectrum scarcity and spectrum under-utilization. A cognitive radio selects a vacant channel opportunistically and perform its own transmission on it. Detecting an incumbent user along with self-coexistence has become one of the important aspects of the cognitive radio. The former problem is solved by spectrum sensing while the latter problem requires complex techniques. To this end we propose a graph coloring based fair channel allocation policy for self-coexistence in cognitive radio networks. The proposed scheme allows multiple cognitive radio network operating over a given region to allocate channels on non-interfering basis with a certain grade of QoS. The scheme allows fair allocation of channels among multiple participating opportunistic networks with varying priorities. Simulation analysis has been done to show the effectiveness of the proposed approach.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115462162","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-04-14DOI: 10.1109/TENCONSPRING.2014.6863106
S. C. Chua, E. K. Wong, Alan Wee Chiat Tan
This paper presents a quantization approach to the detection of singular points in fingerprint images. Singular points in fingerprint images referred to the core and delta points. They are the global features found in the orientation field image of a fingerprint. A singular point is normally detected at the intersection of three gray levels of a quantized orientation field image at quantization level-3 but no study has been carried out for higher quantization level. In this paper, the singular point detection has been investigated up to quantization level-8 by employing two performance measures: sensitivity and precision. The performance at level-5 has been found to be optimal when both measures are combined.
{"title":"Singular point detection in fingerprint images: An investigation on quantization approach","authors":"S. C. Chua, E. K. Wong, Alan Wee Chiat Tan","doi":"10.1109/TENCONSPRING.2014.6863106","DOIUrl":"https://doi.org/10.1109/TENCONSPRING.2014.6863106","url":null,"abstract":"This paper presents a quantization approach to the detection of singular points in fingerprint images. Singular points in fingerprint images referred to the core and delta points. They are the global features found in the orientation field image of a fingerprint. A singular point is normally detected at the intersection of three gray levels of a quantized orientation field image at quantization level-3 but no study has been carried out for higher quantization level. In this paper, the singular point detection has been investigated up to quantization level-8 by employing two performance measures: sensitivity and precision. The performance at level-5 has been found to be optimal when both measures are combined.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131660470","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-04-14DOI: 10.1109/TENCONSPRING.2014.6863006
Mostofa Kamal Nasir, Syed Adeel Ali Shah, M. A. Qureshi, M. Oche, R. M. Noor
Vehicular Ad hoc Networks (VANETs) have significant potential to host diverse applications associated with traffic safety, traffic efficiency and infotainment. VANETs have distinct characteristics and adapting routing protocols for effective communication is a subject of interest for many researchers in this domain. In this paper, we propose a position based Delay Tolerant Network (DTN) routing protocol in VANET for the highways. The solution is designed for partitioned environments which suffer from frequent network disconnections. Our solution presents the most suitable next hop selection mechanism through a filtration process. The filtration process utilizes node position, current direction, speed and the predicted direction that are acquired by Direction Indicator Light (DIL). NS-2 is used to evaluate the performance of the proposed routing protocol. The results show increment in packet transmission as compared to previous works. Finally, the proposed protocol contributes to route stability in VANET.
{"title":"Adapting geographical DTN routing for enhanced connectivity in partitioned VANETs on highways","authors":"Mostofa Kamal Nasir, Syed Adeel Ali Shah, M. A. Qureshi, M. Oche, R. M. Noor","doi":"10.1109/TENCONSPRING.2014.6863006","DOIUrl":"https://doi.org/10.1109/TENCONSPRING.2014.6863006","url":null,"abstract":"Vehicular Ad hoc Networks (VANETs) have significant potential to host diverse applications associated with traffic safety, traffic efficiency and infotainment. VANETs have distinct characteristics and adapting routing protocols for effective communication is a subject of interest for many researchers in this domain. In this paper, we propose a position based Delay Tolerant Network (DTN) routing protocol in VANET for the highways. The solution is designed for partitioned environments which suffer from frequent network disconnections. Our solution presents the most suitable next hop selection mechanism through a filtration process. The filtration process utilizes node position, current direction, speed and the predicted direction that are acquired by Direction Indicator Light (DIL). NS-2 is used to evaluate the performance of the proposed routing protocol. The results show increment in packet transmission as compared to previous works. Finally, the proposed protocol contributes to route stability in VANET.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131141359","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-04-14DOI: 10.1109/TENCONSPRING.2014.6863084
Nogal Memari, K. Samsudin, S. J. Hashim
Honeynet represents the new theory in network protection. Unlike purely defensive methods such as Intrusion Detection Systems (IDS), Data Encryption and Firewalls that try to avoid interaction with the attacker, Honeynet is based on the idea of interaction with the attacker. During this interaction, the Honeynet records all of the attacker's actions and tools used without the attacker knowing, representing them to the security analyzers to study and prepare defensive methods. A hybrid honeynet including both the high-interaction and low-interaction honeypots was developed and implemented utilizing virtualization technology, representing a typical laboratory environment.
{"title":"Towards virtual honeynet based on LXC virtualization","authors":"Nogal Memari, K. Samsudin, S. J. Hashim","doi":"10.1109/TENCONSPRING.2014.6863084","DOIUrl":"https://doi.org/10.1109/TENCONSPRING.2014.6863084","url":null,"abstract":"Honeynet represents the new theory in network protection. Unlike purely defensive methods such as Intrusion Detection Systems (IDS), Data Encryption and Firewalls that try to avoid interaction with the attacker, Honeynet is based on the idea of interaction with the attacker. During this interaction, the Honeynet records all of the attacker's actions and tools used without the attacker knowing, representing them to the security analyzers to study and prepare defensive methods. A hybrid honeynet including both the high-interaction and low-interaction honeypots was developed and implemented utilizing virtualization technology, representing a typical laboratory environment.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124511035","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-04-14DOI: 10.1109/TENCONSPRING.2014.6863094
Z. Omar, N. Hamzah, T. Stathaki
This paper describes a novel approach of an adaptive fusion method by using Chebyshev polynomial analysis (CPA) for use in remote sensing vegetation imagery. Chebyshev polynomials have been effectively used in image fusion mainly in medium to high noise conditions, though its application is limited to heuristics. In this research, we have proposed a way to adaptively select the optimal CPA parameters according to user specifications. Performance evaluation affirms the approach's ability in reducing computational complexity for remote sensing images affected by noise.
{"title":"Adaptive Chebyshev polynomial analysis for fusion of remote sensing vegetation imagery","authors":"Z. Omar, N. Hamzah, T. Stathaki","doi":"10.1109/TENCONSPRING.2014.6863094","DOIUrl":"https://doi.org/10.1109/TENCONSPRING.2014.6863094","url":null,"abstract":"This paper describes a novel approach of an adaptive fusion method by using Chebyshev polynomial analysis (CPA) for use in remote sensing vegetation imagery. Chebyshev polynomials have been effectively used in image fusion mainly in medium to high noise conditions, though its application is limited to heuristics. In this research, we have proposed a way to adaptively select the optimal CPA parameters according to user specifications. Performance evaluation affirms the approach's ability in reducing computational complexity for remote sensing images affected by noise.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124067120","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-04-14DOI: 10.1109/TENCONSPRING.2014.6863004
A. Mahmud, K. Hamdi, N. Ramli
Fractional Frequency Reuse (FFR) is a simple and efficient method to suppress inter-cell interference (ICI) in multi-cell OFDMA networks. Base station cooperation, or a coordinated multipoint (CoMP) multiple access strategy in the FFR cell-edge, will further improve the performance of the systems. This paper presents analytical performance analysis for the downlink FFR scheme in a cluster of three or seven cells with CoMP over generalized composite fading consisting of Nakagami-m fading, path-loss and log-normal shadowing. Our analysis include the effect of full and partial loading of inter-group interference (IGI) on the capacity of the cellular system. We demonstrate that by reducing the number of participating CoMP base stations in cooperating cluster, the IGI is reduced, maximizing the capacity of the system. Our framework able to compute the spectral efficiency via a single numerical integral and is applicable to arbitrary fading distribution. Numerical and simulation results are provided.
{"title":"Performance of fractional frequency reuse with comp at the cell-edge","authors":"A. Mahmud, K. Hamdi, N. Ramli","doi":"10.1109/TENCONSPRING.2014.6863004","DOIUrl":"https://doi.org/10.1109/TENCONSPRING.2014.6863004","url":null,"abstract":"Fractional Frequency Reuse (FFR) is a simple and efficient method to suppress inter-cell interference (ICI) in multi-cell OFDMA networks. Base station cooperation, or a coordinated multipoint (CoMP) multiple access strategy in the FFR cell-edge, will further improve the performance of the systems. This paper presents analytical performance analysis for the downlink FFR scheme in a cluster of three or seven cells with CoMP over generalized composite fading consisting of Nakagami-m fading, path-loss and log-normal shadowing. Our analysis include the effect of full and partial loading of inter-group interference (IGI) on the capacity of the cellular system. We demonstrate that by reducing the number of participating CoMP base stations in cooperating cluster, the IGI is reduced, maximizing the capacity of the system. Our framework able to compute the spectral efficiency via a single numerical integral and is applicable to arbitrary fading distribution. Numerical and simulation results are provided.","PeriodicalId":270495,"journal":{"name":"2014 IEEE REGION 10 SYMPOSIUM","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122065962","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
扫码关注我们
求助内容：
应助结果提醒方式：