{"title":"Fairness and throughput balancing via power control in wireless backhaul networks","authors":"H. Dahrouj, Taiwen Tang, H. Cheng, Radu Selea","doi":"10.1109/QBSC.2014.6841180","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841180","url":null,"abstract":"Balancing between fairness and throughput remains a challenging problem in the design of future wireless networks. This paper addresses this challenge and proposes a practical power optimization method, which has the potential of balancing between fairness and data throughput. The paper assumes a non-line of sight (NLOS) wireless backhaul network, especially introduced to serve areas with dense data traffic. The network comprises several transmitters, known as access-nodes (AN), each serving several remote terminals (RT) via wireless links. To reach a feasible, yet a simple, proportional fairness solution, this paper maximizes an approximated network-wide utility function, where the individual terms are based on long-term channel gains, utilized to compute the geometry carrier to interference and noise ratio (CINR). The paper then solves the power optimization problem by introducing a scalar bias to balance fairness with throughput. Through Monte Carlo simulations, performance improvement of the proposed method is illustrated and compared against existing classical methods.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"33 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124464203","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}
{"title":"Mobility-based internetworking of disjoint segments","authors":"Yatish K. Joshi, M. Younis","doi":"10.1109/QBSC.2014.6841212","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841212","url":null,"abstract":"Wireless sensor networks (WSNs) deployed in inhospitable environments are at increased risk of failure due to malicious enemy action, environmental causes or component malfunction. Large scale failure can divide a network into disjoint segments and disrupt its operation. Reestablishing inter-segment connectivity is of paramount importance to ensure that the network functions effectively. Mobile nodes within surviving disjoint segments can be used to serve as mobile data collectors (MDCs) to tour individual segments and reconnect them by ferrying messages. However finding shortest tours for MDCs is a NP hard problem. In this paper we present a mobility based polynomial time approach for internetworking of disjoint segments (MINDS) by using k MDCs to establish tours between segments. MINDs aims to not only minimize total tour length but also balance the load equitably between the k MDCs. MINDS uses a divide and conquer approach to successively split the larger tour into two around a central node at every step, until we obtain k optimized tours. MINDS is validated through simulation and is shown outperform competing schemes in the literature.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115842395","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}
{"title":"Convex optimization based minimum probability of error beamforming in the uplink of a multiuser system","authors":"Majid Bavand, P. Azmi, S. Blostein","doi":"10.1109/QBSC.2014.6841178","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841178","url":null,"abstract":"Motivated by power-limited uplink access, this paper proposes a receiver optimization for the uplink of a spatial multiple access scenario based on the concept of minimum probability of error (MPE) beamforming. Although MPE beamforming is shown to be more effective than the classical beamforming methods, it results in a non-convex and a highly nonlinear optimization problem. To resolve this problem, a set of modulated-based constraints is added to the MPE beamforming technique. It is shown that the solution to the constrained problem is equivalent to the original one. Moreover, it is proved that the constrained problem does not suffer from the existence of local minima and also has a unique global minimum. Finally the constrained problem is transformed into a convex optimization problem which can be solved using the existing convex programming algorithms.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115412455","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}
{"title":"Joint channel estimation and raptor decoding over fading channel","authors":"B. Khoueiry, M. Soleymani","doi":"10.1109/QBSC.2014.6841207","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841207","url":null,"abstract":"In this paper, we present a comparative study of joint channel estimation and decoding of factor graph-based codes over flat fading channels. A new simple channel approximation scheme is proposed. Specifically, when channel state information is not available at the receiver, a simpler approach is to estimate the channel state of a group of received symbols, then use the approximated value of the channel with the received signal to compute the log likelihood ratio. Simulation results show that the proposed scheme exhibits about 0.4 dB loss compared to the optimal solution when perfect channel state information is available at the receiver.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117018830","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}
{"title":"Adaptive LASSO hyperspectral unmixing using ADMM","authors":"Y. E. Salehani, S. Gazor, S. Yousefi, Il Kim","doi":"10.1109/QBSC.2014.6841205","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841205","url":null,"abstract":"In this paper, a method of hyperspectral unmixing for the linear regression model is introduced. The proposed algorithm employs an adaptive lasso problem using the alternating direction method of multipliers (ADMM) for unmixing process. Indeed, we formulate a weighted l1 norm problem under the reasonable given error to reconstruct the fractional abundances and to avoid inconsistent end member selection in a sparse semi-supervised hyperspectral imaging process. We show that this problem can be efficiently solved by appropriate selection of functions and parameters appearing in the ADMM approach. First, we enforce both non-negativity and full additivity constraints of the abundance fractions in the objective function. Then, we apply the ADMM algorithm to solve the acquired optimization problem. Our simulations show that the proposed algorithms outperform the state-of-the-art methods in terms of mean square error and reconstruction signal-to-noise-ratio with reasonably reduced computational costs.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116850121","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}
{"title":"A reduced complexity iterative grid search for RSS-based emitter localization","authors":"Suzan Üreten, A. Yongaçoğlu, E. Petriu","doi":"10.1109/QBSC.2014.6841203","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841203","url":null,"abstract":"This paper presents a reduced complexity iterative grid-search algorithm for RSS-based localization of non-cooperating primary emitters in cognitive radio networks. The proposed algorithm is initialized with a small number of candidate locations selected uniformly within the region of interest and then the search space is reduced at each iteration around the candidate that maximizes the likelihood function. We evaluate the performance of the proposed algorithm in independent shadowing scenarios and show that the performance closely approaches to that of the full search, particularly at small shadowing spread values with significantly reduced computational complexity.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130616187","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}
M. S. I. Khan, M. M. Rahman, K. Raahemifar, J. Misic, V. Mišić
{"title":"Self-optimizing control parameters for minimizing ping-pong handover in Long Term Evolution (LTE)","authors":"M. S. I. Khan, M. M. Rahman, K. Raahemifar, J. Misic, V. Mišić","doi":"10.1109/QBSC.2014.6841197","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841197","url":null,"abstract":"This paper presents a new self-optimizing ping-pong handover (HOPP) control mechanism for Long Term Evolution (LTE) networks. The proposed mechanism tunes the handover (HO) parameters Hysteresis and Time-To-Trigger (TTT) based on a predefined policy that aims to reduce the negative impact caused by HOPP. To this end, we define the HOPP performance indicator (HPIHPP) and then use it to adjust the HO parameters. Simulation results show clear performance improvement over the static parameter setting, especially when a history-based weighting of the HPIHPP performance indicator is used.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131750777","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}
{"title":"Distortion bounds for broadcasting a Gaussian source in the presence of interference","authors":"A. Saleh, F. Alajaji, W. Chan","doi":"10.1109/QBSC.2014.6841192","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841192","url":null,"abstract":"We consider the transmission of a Gaussian source over the two-user Gaussian broadcast channel in the presence of interference that is known to the transmitter. The interference is assumed to be correlated to the source and each user is interested in estimating the source signal. We propose a hybrid digital-analog (HDA) scheme based on proper combinations of power splitting, Wyner-Ziv and HDA Costa coding. The achievable (square-error) distortion region (inner bound) of this scheme is analyzed under source-channel bandwidth expansion; the matched bandwidth is treated as a special case. An outer bound on the distortion region is also derived by assuming full/partial knowledge of the interference at both users and by adapting the approach of Reznic et al. (2006). This outer bound can be tighter than the “trivial” outer bound found by assuming point-to-point communication.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132542299","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}
{"title":"An efficient hybrid double-threshold based energy detection for cooperative spectrum sensing","authors":"Quoc-Tuan Vien, H. Nguyen, T. Le-Ngoc","doi":"10.1109/QBSC.2014.6841181","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841181","url":null,"abstract":"This paper considers cooperative spectrum sensing (CSS) in cognitive radio networks. The decision on spectrum availability for secondary users (SUs) is carried out with the assistance of a fusion center (FC). In this paper, we propose a new hybrid double-threshold based energy detection (HDTED) to improve the spectrum sensing performance by exploiting both local decision at the SUs and global decision at the FC. In the proposed HDTED, to make a final decision on the availability of licensed spectrum, each SU performs a hybrid combination of both local and global decisions. Particularly, taking into account a practical scenario where all sensing, reporting, and backward channels suffer from Rayleigh fading, we derive the missed detection probability and false alarm probability to show that the proposed HDTED scheme achieves a better CSS performance than the conventional schemes. Finally, simulation results are provided to verify the analytical findings.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132558514","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}
Mohannad A. Alharthi, A. Taha, V. Vasilev, Kevin Atkinson
{"title":"An Acumen/NS-3 integration for modeling networked Cyber-Physical Systems","authors":"Mohannad A. Alharthi, A. Taha, V. Vasilev, Kevin Atkinson","doi":"10.1109/QBSC.2014.6841211","DOIUrl":"https://doi.org/10.1109/QBSC.2014.6841211","url":null,"abstract":"Capturing physical phenomena such as node mobility or wave propagation is challenging in current network simulators, and is mostly achieved through crude abstractions. Despite being operationally efficient, such abstractions adversely affect simulation credibility. To realize more accurate modeling, we are currently developing a simulation environment integrating a hybrid modeling language into a mainstream network simulator. This paper gives a preliminary overview of our efforts. For illustration, an example simulation scenario with some basic mobility is described.","PeriodicalId":314871,"journal":{"name":"2014 27th Biennial Symposium on Communications (QBSC)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123258872","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}