EURASIP Journal on Wireless Communications and Networking最新文献

{"title":"Coverage probability analysis of three uplink power control schemes: Stochastic geometry approach.","authors":"Prasanna Herath,&nbsp;Chintha Tellambura,&nbsp;Witold A Krzymień","doi":"10.1186/s13638-018-1120-7","DOIUrl":"https://doi.org/10.1186/s13638-018-1120-7","url":null,"abstract":"<p><p>In cellular networks, each mobile station adjusts its power level under control of its base station, i.e., through uplink transmit power control, which is essential to reach desired signal-to-interference-plus-noise ratio (SINR) at the base station and to limit inter-cell interference. The optimal levels of transmit power in a network depend on path loss, shadowing, and multipath fading, as well as the network configuration. However, since path loss is distance dependent and the cell association distances are correlated due to the cell association policies, the performance analysis of the uplink transmit power control is very complicated. Consequently, the impact of a specific power control algorithm on network performance is hard to quantify. In this paper, we analyze three uplink transmit power control schemes. We assume the standard power-law path loss and composite Rayleigh-lognormal fading. Using stochastic geometry tools, we derive the cumulative distribution function and the probability density function of the uplink transmit power and the resulting network coverage probability. It is shown that the coverage is highly dependent on the severity of shadowing, the power control scheme, and its parameters, but invariant of the density of deployment of base stations when the shadowing is mild and power control is fractional. At low SINRs, compensation of both path loss and shadowing improves the coverage. However, at high SINRs, compensating for path loss only improves coverage. Increase in the severity of shadowing significantly reduces the coverage.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2018 1","pages":"141"},"PeriodicalIF":2.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13638-018-1120-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37162256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Coverage and rate analysis in the uplink of millimeter wave cellular networks with fractional power control.","authors":"Oluwakayode Onireti,&nbsp;Ali Imran,&nbsp;Muhammad A Imran","doi":"10.1186/s13638-018-1208-0","DOIUrl":"https://doi.org/10.1186/s13638-018-1208-0","url":null,"abstract":"<p><p>In this paper, using the concept of stochastic geometry, we present an analytical framework to evaluate the signal-to-interference-and-noise-ratio (SINR) coverage in the uplink of millimeter wave cellular networks. By using a distance-dependent line-of-sight (LOS) probability function, the location of LOS and non-LOS users are modeled as two independent non-homogeneous Poisson point processes, with each having a different pathloss exponent. The analysis takes account of per-user fractional power control (FPC), which couples the transmission of users based on location-dependent channel inversion. We consider the following scenarios in our analysis: (1) pathloss-based FPC (PL-FPC) which is performed using the measured pathloss and (2) distance-based FPC (D-FPC) which is performed using the measured distance. Using the developed framework, we derive expressions for the area spectral efficiency. Results suggest that in terms of SINR coverage, D-FPC outperforms PL-FPC scheme at high SINR where the future networks are expected to operate. It achieves equal or better area spectral efficiency compared with the PL-FPC scheme. Contrary to the conventional ultra-high frequency cellular networks, in both FPC schemes, the SINR coverage decreases as the cell density becomes greater than a threshold, while the area spectral efficiency experiences a slow growth region.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2018 1","pages":"195"},"PeriodicalIF":2.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13638-018-1208-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37129347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Rotating cluster mechanism for coordinated heterogeneous MIMO cellular networks.","authors":"Hakimeh Purmehdi,&nbsp;Robert C Elliott,&nbsp;Witold A Krzymień,&nbsp;Jordan Melzer","doi":"10.1186/s13638-018-1061-1","DOIUrl":"https://doi.org/10.1186/s13638-018-1061-1","url":null,"abstract":"<p><p>To increase the average achievable rates per user for cluster-edge users, a rotating clustering scheme for the downlink of a coordinated multicell multiuser multiple-input multiple-output system is proposed in this paper and analyzed in two network layouts. In the multicell heterogeneous cellular network, base stations of a cluster cooperate to transmit data signals to the users within the cluster; rotating cluster patterns enable all users to be nearer the cluster center in at least one of the patterns. Considering cellular layouts with three or six macrocells per site, different rotating patterns of clusters are proposed and the system performance with the proposed sets of clustering patterns is investigated using a simulated annealing algorithm for user scheduling and successive zero-forcing dirty paper coding as the precoding method. The rotating clustering scheme is less complex than fully dynamic clustering, and it is primarily designed to improve the throughput of cluster-edge users. As an extra secondary benefit, it is also capable of slightly improving the average achievable sum rate of the network overall. The effectiveness of the proposed methods with two different scheduling metrics, namely throughput maximization and proportionally fair scheduling, is of interest in this work. Moreover, the speed of rotation affects the performance of the system; the higher the speed of rotation, the more frequently any specific users will be nearer the cluster center. Our simulations demonstrate the effectiveness of the proposed rotational approach and determine the speed of rotation beyond which any additional performance gains become negligible.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2018 1","pages":"59"},"PeriodicalIF":2.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13638-018-1061-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37378421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Rate-splitting multiple access for downlink communication systems: bridging, generalizing, and outperforming SDMA and NOMA.","authors":"Yijie Mao,&nbsp;Bruno Clerckx,&nbsp;Victor O K Li","doi":"10.1186/s13638-018-1104-7","DOIUrl":"https://doi.org/10.1186/s13638-018-1104-7","url":null,"abstract":"<p><p>Space-division multiple access (SDMA) utilizes linear precoding to separate users in the spatial domain and relies on <i>fully</i> treating any residual multi-user interference as noise. Non-orthogonal multiple access (NOMA) uses linearly precoded superposition coding with successive interference cancellation (SIC) to superpose users in the power domain and relies on user grouping and ordering to enforce some users to fully decode and cancel interference created by other users. In this paper, we argue that to efficiently cope with the high throughput, heterogeneity of quality of service (QoS), and massive connectivity requirements of future multi-antenna wireless networks, multiple access design needs to depart from those two extreme interference management strategies, namely fully treat interference as noise (as in SDMA) and fully decode interference (as in NOMA). Considering a multiple-input single-output broadcast channel, we develop a novel multiple access framework, called rate-splitting multiple access (RSMA). RSMA is a more general and more powerful multiple access for downlink multi-antenna systems that contains SDMA and NOMA as special cases. RSMA relies on linearly precoded rate-splitting with SIC to decode part of the interference and treat the remaining part of the interference as noise. This capability of RSMA to <i>partially</i> decode interference and partially treat interference as noise enables to softly bridge the two extremes of fully decoding interference and treating interference as noise and provides room for rate and QoS enhancements and complexity reduction. The three multiple access schemes are compared, and extensive numerical results show that RSMA provides a smooth transition between SDMA and NOMA and outperforms them both in a wide range of network loads (underloaded and overloaded regimes) and user deployments (with a diversity of channel directions, channel strengths, and qualities of channel state information at the transmitter). Moreover, RSMA provides rate and QoS enhancements over NOMA at a lower computational complexity for the transmit scheduler and the receivers (number of SIC layers).</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2018 1","pages":"133"},"PeriodicalIF":2.6,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13638-018-1104-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37162255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Characteristics of the polarised off-body channel in indoor environments.","authors":"Kenan Turbic,&nbsp;Slawomir J Ambroziak,&nbsp;Luis M Correia","doi":"10.1186/s13638-017-0956-6","DOIUrl":"https://doi.org/10.1186/s13638-017-0956-6","url":null,"abstract":"<p><p>This paper addresses the depolarisation effect in off-body body area networks channels, based on measurements performed at 2.45 GHz in an indoor environment. Seven different scenarios, involving both static and dynamic users, were considered, taking a statistical perspective. The analysis of the cross-polarisation discrimination is performed, as well as the analysis of path loss in co- and cross-polarised channels. Results show a strong dependence of the cross-polarisation discrimination and of channel characteristics on the polarisation and propagation condition, i.e. line-of-sight (LoS), non-LoS or quasi-LoS. Distance, varied between 1 and 6 m in the considered scenarios, is observed to have very little impact on the cross-polarisation discrimination. In the considered dynamic scenario, the channel is characterised by lognormal-distributed shadowing and Nakagami-distributed multipath fading. Parameters of the Nakagami distribution have essentially different values in the co- and cross-polarised channels, showing a trend towards Rice in the former and Rayleigh in the latter. Based on results, a model is proposed for a dynamic off-body channel.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2017 1","pages":"174"},"PeriodicalIF":2.6,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13638-017-0956-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35564850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Subspace-based self-interference cancellation for full-duplex MIMO transceivers.","authors":"Ahmed Masmoudi, Tho Le-Ngoc","doi":"10.1186/s13638-017-0839-x","DOIUrl":"10.1186/s13638-017-0839-x","url":null,"abstract":"<p><p>This paper addresses the self-interference (SI) cancellation at baseband for full-duplex MIMO communication systems in consideration of practical transmitter imperfections. In particular, we develop a subspace-based algorithm to jointly estimate the SI and intended channels and the nonlinear distortions. By exploiting the covariance and pseudo-covariance of the received signal, we can increase the dimension of the received signal subspace while keeping the dimension of the signal subspace constant, and hence, the proposed algorithm can be applied to most of full-duplex MIMO configurations with arbitrary numbers of transmit and receive antennas. The channel coefficients are estimated, up to an ambiguity term, without any knowledge of the intended signal. A joint detection and ambiguity identification scheme is proposed. Simulation results show that the proposed algorithm can properly estimate the channel with only one pilot symbol and offers superior SI cancellation performance.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2017 1","pages":"55"},"PeriodicalIF":2.6,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7089642/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37782888","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Scheduling multi-task jobs with extra utility in data centers.","authors":"Xiaolin Fang,&nbsp;Junzhou Luo,&nbsp;Hong Gao,&nbsp;Weiwei Wu,&nbsp;Yingshu Li","doi":"10.1186/s13638-017-0986-0","DOIUrl":"https://doi.org/10.1186/s13638-017-0986-0","url":null,"abstract":"<p><p>This paper investigates the problem of maximizing utility for job scheduling where each job consists of multiple tasks, each task has utility and each job also has extra utility if all tasks of that job are completed. We provide a 2-approximation algorithm for the single-machine case and a 2-approximation algorithm for the multi-machine problem. Both algorithms include two steps. The first step employs the Earliest Deadline First method to compute utility with only extra job utility, and it is proved that it obtains the optimal result for this sub-problem. The second step employs a Dynamic Programming method to compute utility without extra job utility, and it also derives the optimal result. An approximation result can then be obtained by combining the results of the two steps.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2017 1","pages":"200"},"PeriodicalIF":2.6,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13638-017-0986-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"35227609","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Localization algorithms for asynchronous time difference of arrival positioning systems.","authors":"Shuai He,&nbsp;Xiaodai Dong,&nbsp;Wu-Sheng Lu","doi":"10.1186/s13638-017-0851-1","DOIUrl":"https://doi.org/10.1186/s13638-017-0851-1","url":null,"abstract":"<p><p>An asynchronous time difference of arrival (ATDOA) positioning system requires no time synchronization among all the anchor and target nodes, which makes it highly practical and can be easily deployed. This paper first presents an ATDOA localization model, and then primarily focuses on two new localization algorithms for the system. The first algorithm is a two-step positioning algorithm that combines semidefinite programming (SDP) with a Taylor series method to achieve global convergence as well as superior estimation accuracy, and the second algorithm is a constrained least-squares method that has the advantage of low complexity and fast convergence while maintaining good performance. In addition, a novel receiver re-selection method is presented to significantly improve estimation accuracy. In this paper, we also derive the Cramer-Rao lower bound (CRLB) of the ATDOA positioning system using a distance-dependent noise variance model, which describes a realistic indoor propagation channel.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2017 1","pages":"64"},"PeriodicalIF":2.6,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13638-017-0851-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"37681347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Modeling On-Body DTN Packet Routing Delay in the Presence of Postural Disconnections.","authors":"Muhannad Quwaider,&nbsp;Mahmoud Taghizadeh,&nbsp;Subir Biswas","doi":"10.1155/2011/280324","DOIUrl":"https://doi.org/10.1155/2011/280324","url":null,"abstract":"<p><p>This paper presents a stochastic modeling framework for store-and-forward packet routing in Wireless Body Area Networks (<i>WBAN</i>) with postural partitioning. A prototype <i>WBANs</i> has been constructed for experimentally characterizing and capturing on-body topology disconnections in the presence of ultrashort range radio links, unpredictable RF attenuation, and human postural mobility. Delay modeling techniques for evaluating single-copy on-body DTN routing protocols are then developed. End-to-end routing delay for a series of protocols including opportunistic, randomized, and two other mechanisms that capture multiscale topological localities in human postural movements have been evaluated. Performance of the analyzed protocols are then evaluated experimentally and via simulation to compare with the results obtained from the developed model. Finally, a mechanism for evaluating the topological importance of individual on-body sensor nodes is developed. It is shown that such information can be used for selectively reducing the on-body sensor-count without substantially sacrificing the packet delivery delay.</p>","PeriodicalId":12040,"journal":{"name":"EURASIP Journal on Wireless Communications and Networking","volume":"2011 ","pages":""},"PeriodicalIF":2.6,"publicationDate":"2011-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1155/2011/280324","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"32927517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}