Pub Date : 2014-06-10DOI: 10.1109/ICC.2014.6884099
A. Salhab, S. Zummo
In this paper, we evaluate the outage performance of space diversity systems with the Nth-best antenna selection scheme and co-channel interference (CCI). In this paper, we first derive the cumulative distribution function (CDF) of the end-to-end (e2e) signal-to-interference plus noise ratio (SINR) at the selection scheme combiner output. This CDF is then used to derive closed-form expressions for the e2e outage probability for the independent non-identically distributed (i.n.i.d.) and independent identically distributed (i.i.d.) cases of interferers' channels. In the analysis, the channels of the desired user and the interferers are assumed to follow Rayleigh distribution. Furthermore, to get more about system insights, the outage performance is studied at high signal-to-noise (SNR) regime where approximate expressions for the outage probability, diversity order, and coding gain are derived and analyzed. Monte-Carlo simulations are provided to validate the derived analytical and asymptotic expressions. Main results illustrate that with a fixed number of interferers of power not scaling with SNR, the system can still achieve diversity gain when more receive antennas are used. Also, findings show that the diversity order of the system is linearly decreasing with increasing the order of the antenna, and linearly increasing with decreasing it.
{"title":"Outage performance of space diversity systems with Nth-best receive antenna selection and co-channel interference","authors":"A. Salhab, S. Zummo","doi":"10.1109/ICC.2014.6884099","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884099","url":null,"abstract":"In this paper, we evaluate the outage performance of space diversity systems with the Nth-best antenna selection scheme and co-channel interference (CCI). In this paper, we first derive the cumulative distribution function (CDF) of the end-to-end (e2e) signal-to-interference plus noise ratio (SINR) at the selection scheme combiner output. This CDF is then used to derive closed-form expressions for the e2e outage probability for the independent non-identically distributed (i.n.i.d.) and independent identically distributed (i.i.d.) cases of interferers' channels. In the analysis, the channels of the desired user and the interferers are assumed to follow Rayleigh distribution. Furthermore, to get more about system insights, the outage performance is studied at high signal-to-noise (SNR) regime where approximate expressions for the outage probability, diversity order, and coding gain are derived and analyzed. Monte-Carlo simulations are provided to validate the derived analytical and asymptotic expressions. Main results illustrate that with a fixed number of interferers of power not scaling with SNR, the system can still achieve diversity gain when more receive antennas are used. Also, findings show that the diversity order of the system is linearly decreasing with increasing the order of the antenna, and linearly increasing with decreasing it.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124291995","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-06-10DOI: 10.1109/ICC.2014.6883704
Yanjiao Chen, Jin Zhang, Qian Zhang, Kaishun Wu
For wireless service providers (WSP), the emerging femtocell market brings new opportunities as well as challenges. It is difficult for a WSP to have complete information of the technical strength of other WSP in the market, and it is hard to estimate the user demand, which is influenced by the price and service quality of all competing WSP in the market. To address these problems, in this paper, we propose an economic framework for the WSP to maximize their utility, via a joint pricing and spectrum allocation strategy, under the condition of incomplete information of other rival WSP in the market. We study two scenarios: 1) all WSP enter the market at the same time; 2) the WSP enter the market at different times. In both scenario, we formulate the problem as a Bayesian game, and derive the Bayesian Nash equilibrium. The simulation results verify that the proposed joint pricing and spectrum allocation strategy outperforms sole pricing or sole spectrum allocation strategy. Interestingly, when the WSP enter the market at different times, the later entered WSP chooses more aggressive pricing and spectrum allocation strategy than the early entered WSP.
{"title":"A Bayesian game model for joint pricing and spectrum allocation strategy of femtocell service providers","authors":"Yanjiao Chen, Jin Zhang, Qian Zhang, Kaishun Wu","doi":"10.1109/ICC.2014.6883704","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883704","url":null,"abstract":"For wireless service providers (WSP), the emerging femtocell market brings new opportunities as well as challenges. It is difficult for a WSP to have complete information of the technical strength of other WSP in the market, and it is hard to estimate the user demand, which is influenced by the price and service quality of all competing WSP in the market. To address these problems, in this paper, we propose an economic framework for the WSP to maximize their utility, via a joint pricing and spectrum allocation strategy, under the condition of incomplete information of other rival WSP in the market. We study two scenarios: 1) all WSP enter the market at the same time; 2) the WSP enter the market at different times. In both scenario, we formulate the problem as a Bayesian game, and derive the Bayesian Nash equilibrium. The simulation results verify that the proposed joint pricing and spectrum allocation strategy outperforms sole pricing or sole spectrum allocation strategy. Interestingly, when the WSP enter the market at different times, the later entered WSP chooses more aggressive pricing and spectrum allocation strategy than the early entered WSP.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116614881","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-06-10DOI: 10.1109/ICC.2014.6883979
Huawei Huang, Deze Zeng, Song Guo, Hong Yao
Service provisioning has been widely regarded as a critical issue to quality-of-service (QoS) of cloud services in datacenters. Conventional studies on service provisioning mainly focus on task mapping, i.e., how to distribute the service-oriented tasks onto the servers to achieve different goals, e.g., makespan minimization. In distributed datacenters, a task is usually routed from its generation point (i.e., control room) to the designated server within a datacenter network. Since the routing delay also has a deep influence on the task makespan, we are motivated to study how to minimize the maximum makespan of all tasks in a duty period by joint optimization of both task mapping and routing. It is formulated as an integer programming with quadratic constraints (IPQC) problem and proved as NP-hard. To tackle the computational complexity of solving IPQC, a heuristic algorithm with polynomial time is proposed. Extensive simulation results show that it performs close to the optimal one and outperforms existing algorithms significantly.
{"title":"Joint optimization of task mapping and routing for service provisioning in distributed datacenters","authors":"Huawei Huang, Deze Zeng, Song Guo, Hong Yao","doi":"10.1109/ICC.2014.6883979","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883979","url":null,"abstract":"Service provisioning has been widely regarded as a critical issue to quality-of-service (QoS) of cloud services in datacenters. Conventional studies on service provisioning mainly focus on task mapping, i.e., how to distribute the service-oriented tasks onto the servers to achieve different goals, e.g., makespan minimization. In distributed datacenters, a task is usually routed from its generation point (i.e., control room) to the designated server within a datacenter network. Since the routing delay also has a deep influence on the task makespan, we are motivated to study how to minimize the maximum makespan of all tasks in a duty period by joint optimization of both task mapping and routing. It is formulated as an integer programming with quadratic constraints (IPQC) problem and proved as NP-hard. To tackle the computational complexity of solving IPQC, a heuristic algorithm with polynomial time is proposed. Extensive simulation results show that it performs close to the optimal one and outperforms existing algorithms significantly.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117342037","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-06-10DOI: 10.1109/ICC.2014.6883821
Hsi-Lu Chao, Sau-Hsuan Wu, Yu-Han Huang, ShangQian Li
A cooperative spectrum sharing, power allocation and user scheduling method is studied in this work under the framework of LTE self-organizing femtocell networks. Making use of dynamic channel and power allocation, and interference control, all femto access points (APs) in a self-organizing network (SON) can share the channels available to the SON with guaranteed quality of service. Simulation results show that the effective channel usage ratio can reach 75% in average even with no explicit cellular planning inside the service area of an SON. This result supports the feasibility of randomly deploying large numbers of femto APs in metropolitan areas based on the concept of SON.
{"title":"Cooperative spectrum sharing and scheduling in self-organizing femtocell networks","authors":"Hsi-Lu Chao, Sau-Hsuan Wu, Yu-Han Huang, ShangQian Li","doi":"10.1109/ICC.2014.6883821","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883821","url":null,"abstract":"A cooperative spectrum sharing, power allocation and user scheduling method is studied in this work under the framework of LTE self-organizing femtocell networks. Making use of dynamic channel and power allocation, and interference control, all femto access points (APs) in a self-organizing network (SON) can share the channels available to the SON with guaranteed quality of service. Simulation results show that the effective channel usage ratio can reach 75% in average even with no explicit cellular planning inside the service area of an SON. This result supports the feasibility of randomly deploying large numbers of femto APs in metropolitan areas based on the concept of SON.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"120 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120898374","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-06-10DOI: 10.1109/ICC.2014.6883849
T. Ozbilgin, M. Koca
We propose spatial pulse position amplitude modulation (SPPAM) as a novel optical signaling scheme with the capability of having higher power and spectral efficiencies than those of conventional optical modulation techniques. We evaluate the performance of SPPAM in free space optical (FSO) communication systems over weak-to-moderate and moderate-to-strong atmospheric turbulence channels and provide average bit error probability (ABEP) bounds for both uncoded and coded performances. Theoretical derivations are validated with simulation results which show that SPPAM forms a feasible alternative to other FSO modulation approaches.
{"title":"Optical spatial pulse position amplitude modulation over atmospheric turbulence channels","authors":"T. Ozbilgin, M. Koca","doi":"10.1109/ICC.2014.6883849","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883849","url":null,"abstract":"We propose spatial pulse position amplitude modulation (SPPAM) as a novel optical signaling scheme with the capability of having higher power and spectral efficiencies than those of conventional optical modulation techniques. We evaluate the performance of SPPAM in free space optical (FSO) communication systems over weak-to-moderate and moderate-to-strong atmospheric turbulence channels and provide average bit error probability (ABEP) bounds for both uncoded and coded performances. Theoretical derivations are validated with simulation results which show that SPPAM forms a feasible alternative to other FSO modulation approaches.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121107753","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-06-10DOI: 10.1109/ICC.2014.6884097
Keisuke Yamamoto, T. Yano, Takehiko Kobayashi
A simple turbo multi-input multi-output (MIMO) scheme using arithmetic-extended mapping and repetition codes is proposed. To mitigate performance degradation of MIMO schemes caused by spatial correlation, a soft canceller followed by minimum-mean-squared-error filter (SC-MMSE) and an iterative-decoding technique based on the turbo principle are adopted. This turbo MIMO scheme is designed by using 8-amplitude-shift keying (8-ASK) arithmetic extended mapping and a 1/4-rate repetition code. The performance of the proposed turbo MIMO scheme is verified in terms of bit error rate (BER) for a spatially correlated Rayleigh channel. The scheme exhibits a “turbo cliff” at signal-to-noise ratio (SNR) of 28 dB. Compared to a conventional MIMO scheme using MMSE with 64-quadrature-amplitude-modulation (64-QAM) mapping and a 1/2-rate turbo code, the proposed scheme improves SNR by 1.8 dB at BER of 10-4.
{"title":"Simple turbo MIMO scheme using arithmetic extended mapping and repetition codes","authors":"Keisuke Yamamoto, T. Yano, Takehiko Kobayashi","doi":"10.1109/ICC.2014.6884097","DOIUrl":"https://doi.org/10.1109/ICC.2014.6884097","url":null,"abstract":"A simple turbo multi-input multi-output (MIMO) scheme using arithmetic-extended mapping and repetition codes is proposed. To mitigate performance degradation of MIMO schemes caused by spatial correlation, a soft canceller followed by minimum-mean-squared-error filter (SC-MMSE) and an iterative-decoding technique based on the turbo principle are adopted. This turbo MIMO scheme is designed by using 8-amplitude-shift keying (8-ASK) arithmetic extended mapping and a 1/4-rate repetition code. The performance of the proposed turbo MIMO scheme is verified in terms of bit error rate (BER) for a spatially correlated Rayleigh channel. The scheme exhibits a “turbo cliff” at signal-to-noise ratio (SNR) of 28 dB. Compared to a conventional MIMO scheme using MMSE with 64-quadrature-amplitude-modulation (64-QAM) mapping and a 1/2-rate turbo code, the proposed scheme improves SNR by 1.8 dB at BER of 10-4.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121131454","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-06-10DOI: 10.1109/ICC.2014.6883939
Q. Xu, Xi Li, Hong Ji
For energy-efficient (EE) resource allocation, only limited work has considered end-to-end energy consumption. In this paper, a novel EE resource allocation algorithm is proposed for orthogonal frequency division multiple access (OFDMA) downlink networks, where both transmitter energy consumption (base station (BS) transmission and BS circuit energy consumption) and receiver energy consumption (user equipment (UE) circuit energy consumption) are taken into account. The time slot, subchannel (frequency) and power allocation policies are joint considered to optimize system energy efficiency. In addition, different quality of service (QoS) requirements including minimum-rate guarantee service and best effort service are supported in our considering system. With all these considerations, the EE resource allocation problem is formulated as a mixed combinatorial and non-convex optimization problem, which is extremely difficult to solve. To obtain a desirable solution with a reasonable computation cost, an algorithm based on quantum-behaved particle swarm optimization (QPSO) is proposed. Finally, extensive simulation results are presented to validate the effectiveness of the proposed algorithm.
{"title":"Multiple resource allocation in OFDMA downlink networks: End-to-end energy-efficient approach","authors":"Q. Xu, Xi Li, Hong Ji","doi":"10.1109/ICC.2014.6883939","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883939","url":null,"abstract":"For energy-efficient (EE) resource allocation, only limited work has considered end-to-end energy consumption. In this paper, a novel EE resource allocation algorithm is proposed for orthogonal frequency division multiple access (OFDMA) downlink networks, where both transmitter energy consumption (base station (BS) transmission and BS circuit energy consumption) and receiver energy consumption (user equipment (UE) circuit energy consumption) are taken into account. The time slot, subchannel (frequency) and power allocation policies are joint considered to optimize system energy efficiency. In addition, different quality of service (QoS) requirements including minimum-rate guarantee service and best effort service are supported in our considering system. With all these considerations, the EE resource allocation problem is formulated as a mixed combinatorial and non-convex optimization problem, which is extremely difficult to solve. To obtain a desirable solution with a reasonable computation cost, an algorithm based on quantum-behaved particle swarm optimization (QPSO) is proposed. Finally, extensive simulation results are presented to validate the effectiveness of the proposed algorithm.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127174586","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}
Network coding has the potential to provide powerful support to transmit real-time traffic in wireless network. In this paper, we utilize pairwise coding to schedule the flows which have heterogeneous delay constraints and weights. Our goal is to maximize the weighted sum of scheduled packets that satisfy the delay constraints. We formulate the problem as an integer linear programming problem, and propose two algorithms to solve it. The first algorithm drops the integral constraints and rounds the fractional solutions in such a way that the rounded solution is also optimal. Inspired by the first algorithm and for better running time, we propose the second algorithm based on a minimum cost flow formulation. The formulation is proved to be equivalent to the original integer linear programming formulation. Simulations are conducted to show the effectiveness of our approach over two greedy algorithms.
{"title":"Optimal scheduling with pairwise coding under heterogeneous delay constraints","authors":"Yafei Mao, Chao Dong, Haipeng Dai, Xiaojun Zhu, Guihai Chen","doi":"10.1109/ICC.2014.6883349","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883349","url":null,"abstract":"Network coding has the potential to provide powerful support to transmit real-time traffic in wireless network. In this paper, we utilize pairwise coding to schedule the flows which have heterogeneous delay constraints and weights. Our goal is to maximize the weighted sum of scheduled packets that satisfy the delay constraints. We formulate the problem as an integer linear programming problem, and propose two algorithms to solve it. The first algorithm drops the integral constraints and rounds the fractional solutions in such a way that the rounded solution is also optimal. Inspired by the first algorithm and for better running time, we propose the second algorithm based on a minimum cost flow formulation. The formulation is proved to be equivalent to the original integer linear programming formulation. Simulations are conducted to show the effectiveness of our approach over two greedy algorithms.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127430432","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-06-10DOI: 10.1109/ICC.2014.6883526
T. Chu, Hoc Phan, H. Zepernick
This paper studies the performance of adaptive modulation and coding in a cognitive incremental decode-and-forward relaying network where a secondary source can directly communicate with a secondary destination or via an intermediate relay. To maximize transmission efficiency, a policy which flexibly switches between the relaying and direct transmission is proposed. In particular, the transmission, which gives higher average transmission efficiency, will be selected for the communication. Specifically, the direct transmission will be chosen if its instantaneous signal-to-noise ratio (SNR) is higher than one half of that of the relaying transmission. In this case, the appropriate modulation and coding scheme (MCS) of the direct transmission is selected only based on its instantaneous SNR. In the relaying transmission, since the MCS of the transmissions from the source to the relay and from the relay to the destination are implemented independently to each other, buffering of packets at the relay is necessary. To avoid buffer overflow at the relay, the MCS for the relaying transmission is selected by considering both the queue state and the respective instantaneous SNR. Finally, a finite-state Markov chain is modeled to analyze key performance indicators such as outage probability and average transmission efficiency of the cognitive relay network.
{"title":"Adaptive modulation and coding with queue awareness in cognitive incremental decode-and-forward relay networks","authors":"T. Chu, Hoc Phan, H. Zepernick","doi":"10.1109/ICC.2014.6883526","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883526","url":null,"abstract":"This paper studies the performance of adaptive modulation and coding in a cognitive incremental decode-and-forward relaying network where a secondary source can directly communicate with a secondary destination or via an intermediate relay. To maximize transmission efficiency, a policy which flexibly switches between the relaying and direct transmission is proposed. In particular, the transmission, which gives higher average transmission efficiency, will be selected for the communication. Specifically, the direct transmission will be chosen if its instantaneous signal-to-noise ratio (SNR) is higher than one half of that of the relaying transmission. In this case, the appropriate modulation and coding scheme (MCS) of the direct transmission is selected only based on its instantaneous SNR. In the relaying transmission, since the MCS of the transmissions from the source to the relay and from the relay to the destination are implemented independently to each other, buffering of packets at the relay is necessary. To avoid buffer overflow at the relay, the MCS for the relaying transmission is selected by considering both the queue state and the respective instantaneous SNR. Finally, a finite-state Markov chain is modeled to analyze key performance indicators such as outage probability and average transmission efficiency of the cognitive relay network.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127533068","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-06-10DOI: 10.1109/ICC.2014.6883867
Guan-Tsang Chen, Wen-Tsuen Chen, Shan-Hsiang Shen
This paper investigates the issue of interference mitigation in wireless body area networks (BANs). Although several approaches have been proposed in BAN standard IEEE 802.15.6, they increase transmission latency or energy cost, and do not mitigate interference effectively. In order to avoid both intra- and inter-BAN interference, we present a MAC protocol with two-layer interference mitigation (2L-MAC) for BANs. Considering the QoS requirements of BANs, the proposed protocol not only avoids packet collisions but also reduces transmission delay and energy consumption in sensors. Moreover, channel switching is triggered whenever a BAN needs to acquire more bandwidth. Simulation results show that our protocol outperforms other protocols in terms of delivery rate, latency and energy saving.
{"title":"2L-MAC: A MAC protocol with two-layer interference mitigation in wireless body area networks for medical applications","authors":"Guan-Tsang Chen, Wen-Tsuen Chen, Shan-Hsiang Shen","doi":"10.1109/ICC.2014.6883867","DOIUrl":"https://doi.org/10.1109/ICC.2014.6883867","url":null,"abstract":"This paper investigates the issue of interference mitigation in wireless body area networks (BANs). Although several approaches have been proposed in BAN standard IEEE 802.15.6, they increase transmission latency or energy cost, and do not mitigate interference effectively. In order to avoid both intra- and inter-BAN interference, we present a MAC protocol with two-layer interference mitigation (2L-MAC) for BANs. Considering the QoS requirements of BANs, the proposed protocol not only avoids packet collisions but also reduces transmission delay and energy consumption in sensors. Moreover, channel switching is triggered whenever a BAN needs to acquire more bandwidth. Simulation results show that our protocol outperforms other protocols in terms of delivery rate, latency and energy saving.","PeriodicalId":444628,"journal":{"name":"2014 IEEE International Conference on Communications (ICC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127535435","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
扫码关注我们
求助内容：
应助结果提醒方式：