Pub Date : 2013-12-11DOI: 10.1109/PIMRC.2013.6666421
Zhuo Chen, R. Yates, D. Raychaudhuri
Recent technology advances are poised to enable low-cost, low-power communications in the 7 GHz of unlicensed spectrum at 60 GHz millimeter wave (mmW) frequencies. In 60 GHz networks, transmitters and receivers employ directional antennas and point their main beams toward each other to overcome high propagation losses and achieve high data rates. However, CSMA based directional MAC (DMAC) protocols suffer from the "deafness" problem which causes unfairness and low channel utilization. This paper examines the deafness problem from a new perspective and shows that unfairness and low channel utilization are caused by the exponential backoff mechanism. We propose an enhanced DMAC (EDMAC) protocol that does not use an exponential backoff mechanism, instead employing a low control overhead protocol that enables receivers to adaptively tune senders' contention window sizes. NS-2 simulation results are given to demonstrate that EDMAC compares favorably to DMAC, achieving similar capacity and lower delay jitter in single hop networks, and significantly higher capacity in multi-hop ad hoc network scenarios.
{"title":"EDMAC: An enhanced directional medium access control protocol for 60 GHz networks","authors":"Zhuo Chen, R. Yates, D. Raychaudhuri","doi":"10.1109/PIMRC.2013.6666421","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666421","url":null,"abstract":"Recent technology advances are poised to enable low-cost, low-power communications in the 7 GHz of unlicensed spectrum at 60 GHz millimeter wave (mmW) frequencies. In 60 GHz networks, transmitters and receivers employ directional antennas and point their main beams toward each other to overcome high propagation losses and achieve high data rates. However, CSMA based directional MAC (DMAC) protocols suffer from the \"deafness\" problem which causes unfairness and low channel utilization. This paper examines the deafness problem from a new perspective and shows that unfairness and low channel utilization are caused by the exponential backoff mechanism. We propose an enhanced DMAC (EDMAC) protocol that does not use an exponential backoff mechanism, instead employing a low control overhead protocol that enables receivers to adaptively tune senders' contention window sizes. NS-2 simulation results are given to demonstrate that EDMAC compares favorably to DMAC, achieving similar capacity and lower delay jitter in single hop networks, and significantly higher capacity in multi-hop ad hoc network scenarios.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131522135","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666499
Péter Szilágyi, Zoltán Vincze, C. Vulkán
Mobility Load Balancing (MLB) is a Self-Organising Networks (SON) use case with the scope of detecting and resolving radio overload. In case of overload, the MLB triggers the handover of cell edge users towards less loaded neighbour cells to better align the traffic demand with the capacity available on the air interface. This, however, also increases the load on the transport links of these cells; therefore, MLB should consider the transport status in order not to cause transport congestion while resolving air interface overload. This paper proposes a general MLB framework that, unlike existing mechanisms, has efficient means to properly consider the transport load and congestion in addition to the radio load. The solution is not limited to any particular transport network topology and it also acts as a Traffic Steering (TS) mechanism as it resolves transport overload by redirecting users to neighbour cells with spare transport resources. The performance of the proposed framework was evaluated with simulations. Results indicate that the solution improves the overall system performance by balancing both radio and transport load.
{"title":"Integrated Mobility Load Balancing and Traffic Steering mechanism in LTE","authors":"Péter Szilágyi, Zoltán Vincze, C. Vulkán","doi":"10.1109/PIMRC.2013.6666499","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666499","url":null,"abstract":"Mobility Load Balancing (MLB) is a Self-Organising Networks (SON) use case with the scope of detecting and resolving radio overload. In case of overload, the MLB triggers the handover of cell edge users towards less loaded neighbour cells to better align the traffic demand with the capacity available on the air interface. This, however, also increases the load on the transport links of these cells; therefore, MLB should consider the transport status in order not to cause transport congestion while resolving air interface overload. This paper proposes a general MLB framework that, unlike existing mechanisms, has efficient means to properly consider the transport load and congestion in addition to the radio load. The solution is not limited to any particular transport network topology and it also acts as a Traffic Steering (TS) mechanism as it resolves transport overload by redirecting users to neighbour cells with spare transport resources. The performance of the proposed framework was evaluated with simulations. Results indicate that the solution improves the overall system performance by balancing both radio and transport load.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125494432","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666414
A. Domenico, V. Savin, D. Kténas
This paper considers heterogeneous cellular networks, where cluster of small cells are deployed to create local hot spots inside the macro cell. In the past, most of the research in this topic has focused on mitigating inter cell interference; however, wireless backhaul has recently emerged as an urgent challenge to enable ubiquitous broadband wireless services at small cells. Hence, we propose a novel cell selection framework, which associates users and heterogeneous access nodes to improve the efficiency in the overall radio and backhaul resource utilization and avoid load congestions. We also model the relationships amongst cell load, resource management, backhaul capacity constraints, and the overall network capacity. Then, we describe the cell selection problem and we present a heuristic algorithm, named as Evolve, to solve it with limited complexity. Our analysis shows that Evolve achieves near optimal performance leading to notable capacity improvements with respect to the classic SINR based association scheme.
{"title":"A backhaul-aware cell selection algorithm for heterogeneous cellular networks","authors":"A. Domenico, V. Savin, D. Kténas","doi":"10.1109/PIMRC.2013.6666414","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666414","url":null,"abstract":"This paper considers heterogeneous cellular networks, where cluster of small cells are deployed to create local hot spots inside the macro cell. In the past, most of the research in this topic has focused on mitigating inter cell interference; however, wireless backhaul has recently emerged as an urgent challenge to enable ubiquitous broadband wireless services at small cells. Hence, we propose a novel cell selection framework, which associates users and heterogeneous access nodes to improve the efficiency in the overall radio and backhaul resource utilization and avoid load congestions. We also model the relationships amongst cell load, resource management, backhaul capacity constraints, and the overall network capacity. Then, we describe the cell selection problem and we present a heuristic algorithm, named as Evolve, to solve it with limited complexity. Our analysis shows that Evolve achieves near optimal performance leading to notable capacity improvements with respect to the classic SINR based association scheme.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131779581","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666178
Huiming Wang, X. Xia, Qinye Yin, Pengcheng Mu
Exploiting the idea of cooperative communications is an efficient way to improve the physical-layer security of a wireless transmission in the presence of passive eavesdroppers. In this paper, we propose a hybrid cooperative relaying and jamming scheme to enhance the security of a two-way relay network, where some intermediate nodes help to relay the signal to the legitimate terminals via distributed beamforming and the others jam the eavesdropper simultaneously. In such a way, both two cooperative phases of the data transmission are protected. Subjected to the more practical per-node power constraint of each node and without the channel state information (CSI) of the eavesdropper, we propose a scheme to enhance the secrecy of the two terminals. It is shown that the problem can be transformed into a semidefinite programming (SDP) problem with an additional rank-1 constraint. We then develop a penalty function method and an iterative algorithm to solve such a problem efficiently, instead of the popular semi-definite relaxation (SDR) and randomization techniques proposed in the previous literatures. Simulations show that the proposed hybrid scheme greatly improves the security of the two-way relay networks.
{"title":"Hybrid relaying and jamming for secure two-way relay networks with passive eavesdroppers","authors":"Huiming Wang, X. Xia, Qinye Yin, Pengcheng Mu","doi":"10.1109/PIMRC.2013.6666178","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666178","url":null,"abstract":"Exploiting the idea of cooperative communications is an efficient way to improve the physical-layer security of a wireless transmission in the presence of passive eavesdroppers. In this paper, we propose a hybrid cooperative relaying and jamming scheme to enhance the security of a two-way relay network, where some intermediate nodes help to relay the signal to the legitimate terminals via distributed beamforming and the others jam the eavesdropper simultaneously. In such a way, both two cooperative phases of the data transmission are protected. Subjected to the more practical per-node power constraint of each node and without the channel state information (CSI) of the eavesdropper, we propose a scheme to enhance the secrecy of the two terminals. It is shown that the problem can be transformed into a semidefinite programming (SDP) problem with an additional rank-1 constraint. We then develop a penalty function method and an iterative algorithm to solve such a problem efficiently, instead of the popular semi-definite relaxation (SDR) and randomization techniques proposed in the previous literatures. Simulations show that the proposed hybrid scheme greatly improves the security of the two-way relay networks.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"208 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124689810","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666425
S. Kim, M. Bengtsson
In this paper, we study virtual full-duplex (FD) buffer-aided relaying to recover the multiplexing loss of half-duplex (HD) relaying in a network with multiple buffer-aided relays, each of which has multiple antennas, through opportunistic relay selection and beamforming. The main idea of virtual FD buffer-aided relaying is that a source and a relay simultaneously transmit their own information to another relay and a destination, respectively. In this network, inter-relay interference (IRI) is a crucial problem which has to be resolved like self-interference in the FD relaying. In contrast to previous work that neglected the IRI, we propose two buffer-aided relay selection and beam-forming schemes taking the IRI into consideration. Numerical results show that our proposed relay selection scheme with zero-forcing beamforming (ZFB)-based IRI cancellation approaches the average end-to-end capacity of IRI-free upper bound as the numbers of relays and antennas increase.
{"title":"Virtual full-duplex buffer-aided relaying — Relay selection and beamforming","authors":"S. Kim, M. Bengtsson","doi":"10.1109/PIMRC.2013.6666425","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666425","url":null,"abstract":"In this paper, we study virtual full-duplex (FD) buffer-aided relaying to recover the multiplexing loss of half-duplex (HD) relaying in a network with multiple buffer-aided relays, each of which has multiple antennas, through opportunistic relay selection and beamforming. The main idea of virtual FD buffer-aided relaying is that a source and a relay simultaneously transmit their own information to another relay and a destination, respectively. In this network, inter-relay interference (IRI) is a crucial problem which has to be resolved like self-interference in the FD relaying. In contrast to previous work that neglected the IRI, we propose two buffer-aided relay selection and beam-forming schemes taking the IRI into consideration. Numerical results show that our proposed relay selection scheme with zero-forcing beamforming (ZFB)-based IRI cancellation approaches the average end-to-end capacity of IRI-free upper bound as the numbers of relays and antennas increase.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130747837","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666630
F. Ganji, L. Budzisz, A. Wolisz
Due to the requirements to provision a proper Quality of Service level in enterprise WLANs supporting both voice and data services the typical densities in the deployment of access points (APs) may exceed 4000 APs per square kilometer. While such density is necessary under heavy traffic conditions, it is obviously superfluous during the time of lower load- and dramatically excessive at night periods, with only marginal traffic intensity. We present a novel, aggressive approach for adjusting the AP density to the actual traffic conditions. In the limiting case of a very low traffic, we postulate keeping operational only a skeleton deployment, sufficient just to recognize that there is a station attempting an association. In this case additional APs can be powered up, in order to assure the requested connectivity, locally in this area. Using data from commercially available APs we estimate the potential of power saving in such an operation mode and relate it to the best approaches proposed so far.
{"title":"Assessment of the power saving potential in dense enterprise WLANs","authors":"F. Ganji, L. Budzisz, A. Wolisz","doi":"10.1109/PIMRC.2013.6666630","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666630","url":null,"abstract":"Due to the requirements to provision a proper Quality of Service level in enterprise WLANs supporting both voice and data services the typical densities in the deployment of access points (APs) may exceed 4000 APs per square kilometer. While such density is necessary under heavy traffic conditions, it is obviously superfluous during the time of lower load- and dramatically excessive at night periods, with only marginal traffic intensity. We present a novel, aggressive approach for adjusting the AP density to the actual traffic conditions. In the limiting case of a very low traffic, we postulate keeping operational only a skeleton deployment, sufficient just to recognize that there is a station attempting an association. In this case additional APs can be powered up, in order to assure the requested connectivity, locally in this area. Using data from commercially available APs we estimate the potential of power saving in such an operation mode and relate it to the best approaches proposed so far.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"57 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132899847","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666539
C. Mannweiler, Pratip Chakraborty, H. Schotten
Coordinated wireless point-to-point networks constitute a reliable and cost-efficient technology for providing backhaul connectivity for access networks in remote or topologically challenging environments, e.g. mountainous regions. Their flexibility allows for joint operation with any kind of access networks (including cellular), temporary or mobile deployment (e.g., for sport or entertainment events), or for full-fledged alternative of wired backhaul infrastructure. This paper introduces a novel approach for optimizing the topology of such coordinated backhaul point-to-point networks based on a range of relevant parameters, among them total network capacity, current load in the access network, energy consumption of the considered topology, battery level of nodes without continuous power supply, as well as fairness of throughput allocation from user perspective. We extend our Backhaul Topology Optimization (BTO) algorithm by exploiting the given heterogeneous data to generate an optimal backhaul topology. We show that our algorithm extends the lifetime of such a backhaul network by up to 20% compared to a standard reference case while at the same time modestly improving the fairness of throughput distribution.
{"title":"Multi-objective adjacency matrix optimization for coordinated wireless backhaul networks","authors":"C. Mannweiler, Pratip Chakraborty, H. Schotten","doi":"10.1109/PIMRC.2013.6666539","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666539","url":null,"abstract":"Coordinated wireless point-to-point networks constitute a reliable and cost-efficient technology for providing backhaul connectivity for access networks in remote or topologically challenging environments, e.g. mountainous regions. Their flexibility allows for joint operation with any kind of access networks (including cellular), temporary or mobile deployment (e.g., for sport or entertainment events), or for full-fledged alternative of wired backhaul infrastructure. This paper introduces a novel approach for optimizing the topology of such coordinated backhaul point-to-point networks based on a range of relevant parameters, among them total network capacity, current load in the access network, energy consumption of the considered topology, battery level of nodes without continuous power supply, as well as fairness of throughput allocation from user perspective. We extend our Backhaul Topology Optimization (BTO) algorithm by exploiting the given heterogeneous data to generate an optimal backhaul topology. We show that our algorithm extends the lifetime of such a backhaul network by up to 20% compared to a standard reference case while at the same time modestly improving the fairness of throughput distribution.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114867024","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666448
J. Bas, F. V. Gallego, C. Gavrincea, J. Alonso-Zarate
Emerging Machine-to-Machine (M2M) applications demand small data packet sizes, very low latencies, and ultrahigh energy efficiencies. For all these reasons, Binary Bose-Chaudhuri-Hocquenhem (BCH) codes, which are very simple to implement, could constitute a good option to guarantee the required reliability of M2M transmissions. Nevertheless, existing delay and energy analyses of BCH decoders in the literature neither consider the channel statistics nor the first and second moments of the decoding delay. Therefore, they provide conservative codeword designs that lead to high delays and waste of energy. In this paper, we analyze the first and second moments of the delay and energy performance of Binary Bose-Chaudhuri-Hocquenhem (BCH) codes in realistic channel statistics to show that, if optimized, they can perform very efficiently for M2M transmissions. The results presented in this paper allow for the codeword length optimization for BCH codes given specific delay and energy constraints.
{"title":"Energy and delay analysis of Binary BCH codes for Machine-to-Machine networks with small data transmissions","authors":"J. Bas, F. V. Gallego, C. Gavrincea, J. Alonso-Zarate","doi":"10.1109/PIMRC.2013.6666448","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666448","url":null,"abstract":"Emerging Machine-to-Machine (M2M) applications demand small data packet sizes, very low latencies, and ultrahigh energy efficiencies. For all these reasons, Binary Bose-Chaudhuri-Hocquenhem (BCH) codes, which are very simple to implement, could constitute a good option to guarantee the required reliability of M2M transmissions. Nevertheless, existing delay and energy analyses of BCH decoders in the literature neither consider the channel statistics nor the first and second moments of the decoding delay. Therefore, they provide conservative codeword designs that lead to high delays and waste of energy. In this paper, we analyze the first and second moments of the delay and energy performance of Binary Bose-Chaudhuri-Hocquenhem (BCH) codes in realistic channel statistics to show that, if optimized, they can perform very efficiently for M2M transmissions. The results presented in this paper allow for the codeword length optimization for BCH codes given specific delay and energy constraints.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132812410","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666747
Yong Bai, W. Du
To support maritime voice service for mobile users on ocean fishery vessels, it is a promising approach to integrate heterogeneous wireless and wireline networks including maritime wireless mesh network (WMN), satellite mobile network, and Internet. In such a networking environment, the ship-to-ship and ship-to-shore VoIP calls traverse different networking paths. When applying traditional Mobile IP and SIP protocols directly without differentiating these two kinds of VoIP services, it is challenging to support them cost-effectively with acceptable QoS. To deal with the faced technical challenges, this paper proposes to employ dual IP addresses and dual SIP addresses for user mobility and VoIP session managements. With such a proposal, best data path selection can be achieved during VoIP call setup and data delivery by differentiating two kinds of VoIP calls. The reduced involvement of satellite link with best data path selection yields the benefits of decreased data transmission delay and lower calling charge for maritime VoIP services over such an integrated wireless/wireline network.
{"title":"VoIP services for ocean fishery vessels over integrated wireless and wireline networks","authors":"Yong Bai, W. Du","doi":"10.1109/PIMRC.2013.6666747","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666747","url":null,"abstract":"To support maritime voice service for mobile users on ocean fishery vessels, it is a promising approach to integrate heterogeneous wireless and wireline networks including maritime wireless mesh network (WMN), satellite mobile network, and Internet. In such a networking environment, the ship-to-ship and ship-to-shore VoIP calls traverse different networking paths. When applying traditional Mobile IP and SIP protocols directly without differentiating these two kinds of VoIP services, it is challenging to support them cost-effectively with acceptable QoS. To deal with the faced technical challenges, this paper proposes to employ dual IP addresses and dual SIP addresses for user mobility and VoIP session managements. With such a proposal, best data path selection can be achieved during VoIP call setup and data delivery by differentiating two kinds of VoIP calls. The reduced involvement of satellite link with best data path selection yields the benefits of decreased data transmission delay and lower calling charge for maritime VoIP services over such an integrated wireless/wireline network.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123884746","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 : 2013-12-11DOI: 10.1109/PIMRC.2013.6666371
Kun Wang, X. Sha, Yong Li
Recently, two fire-new modulation schemes: the so-called hybrid carrier (HC) modulation based on weighted-type fractional Fourier transform (WFRFT) and the modulation based on energy spreading transform (EST), have emerged as promising solutions to repress the inter-sample and inter-carrier interference caused by doubly selective channels. In this paper, we propose an iterative frequency domain minimum mean-square-error (MMSE) equalization scheme for systems with WFRFT and EST precoders in order to achieve a better tradeoff between the interference-repression performance and complexity. During the process of the proposed iterative equalization, priors-aided linear MMSE estimations (LME) are performed iteratively in the frequency domain, and the priors are updated in precoding domains. During the iterations, the prior information is estimated more accurately in WFRFT and EST based modulation systems than those in conventional orthogonal frequency division multiplexing (OFDM) and single carrier (SC) systems. Simulation results manifest that the proposed iterative frequency domain MMSE equalization (IFME) scheme outperforms existing iterative MMSE equalization schemes proposed for OFDM and SC architectures in terms of bit-error-ratio.
{"title":"Iterative frequency-domain equalization for WFRFT and EST based modulation schemes over doubly selective wireless fading channels","authors":"Kun Wang, X. Sha, Yong Li","doi":"10.1109/PIMRC.2013.6666371","DOIUrl":"https://doi.org/10.1109/PIMRC.2013.6666371","url":null,"abstract":"Recently, two fire-new modulation schemes: the so-called hybrid carrier (HC) modulation based on weighted-type fractional Fourier transform (WFRFT) and the modulation based on energy spreading transform (EST), have emerged as promising solutions to repress the inter-sample and inter-carrier interference caused by doubly selective channels. In this paper, we propose an iterative frequency domain minimum mean-square-error (MMSE) equalization scheme for systems with WFRFT and EST precoders in order to achieve a better tradeoff between the interference-repression performance and complexity. During the process of the proposed iterative equalization, priors-aided linear MMSE estimations (LME) are performed iteratively in the frequency domain, and the priors are updated in precoding domains. During the iterations, the prior information is estimated more accurately in WFRFT and EST based modulation systems than those in conventional orthogonal frequency division multiplexing (OFDM) and single carrier (SC) systems. Simulation results manifest that the proposed iterative frequency domain MMSE equalization (IFME) scheme outperforms existing iterative MMSE equalization schemes proposed for OFDM and SC architectures in terms of bit-error-ratio.","PeriodicalId":210993,"journal":{"name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127417352","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
扫码关注我们
求助内容：
应助结果提醒方式：