{"title":"Benchmarking Stream-Based XPath Engines Supporting Simultaneous Queries for Service Oriented Networking","authors":"T. C. Lam, S. Poon, J. Ding","doi":"10.1109/GLOCOM.2008.ECP.311","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.311","url":null,"abstract":"Stream-based simultaneous XPath processing plays a critical role in service oriented networking, where the processing must scale well in terms of concurrent input streams and number of XPath queries. However, there are no benchmarks or evaluation methodology in existing literatures that benchmark stream-based XPath engines supporting simultaneous queries. In this paper, we describe a novel benchmarking methodology for evaluating XPath engines which handle simultaneous queries on streaming traffics. With structured data model, query model, and control model in our benchmark, we conduct well controlled experiments to assess and isolate various performance factors. We also demonstrate that our structured, quantified approach with wide data set coverage, enables accurate performance measurements, and easy bottleneck isolations of a real-world XPath engine implementation.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126854726","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":"Maximum Likelihood Based Modulation Classification for Unsynchronized QAMs","authors":"Q. Shi, Y. Karasawa","doi":"10.1109/GLOCOM.2008.ECP.664","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.664","url":null,"abstract":"We consider modulation classification for quadrature amplitude modulation (QAM) formats. The received signal is assumed to be unsynchronized in both time and frequency, since in practice the receiver has little prior knowledge about the transmitted signal. To tackle this challenging problem, we propose a classifier that is based on a combination of blind time synchronization, differential processing, and maximum likelihood (ML) detection. A computationally efficient scheme is then developed. Numerical results are provided to justify our approach.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115097062","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}
Seokjung Kim, Young-Kyun Choi, Kyungchul Kwak, Keukjoon Bang, D. Hong
{"title":"A Robust Timing Recovery Algorithm for OFDM Systems","authors":"Seokjung Kim, Young-Kyun Choi, Kyungchul Kwak, Keukjoon Bang, D. Hong","doi":"10.1109/GLOCOM.2008.ECP.617","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.617","url":null,"abstract":"We propose a new robust timing recovery algorithm with small symbol timing jitter for orthogonal frequency-division multiplexing (OFDM) systems. The concept of coarse FFT window selection and adaptive reference pilot generation are employed in this paper. This proposed scheme avoids inter-symbol interference (ISI) as well as delayed locked loop (DLL) tracking failure over frequency selective time-varying channels. In addition, the proposed algorithm has much smaller and smoother steady state DLL tracking error than the conventional algorithm.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115454913","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":"Optimal Error Rate Performance of Binary TH-UWB Receivers in Multiuser Interference","authors":"Iraj Hosseini, N. Beaulieu","doi":"10.1109/GLOCOM.2008.ECP.756","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.756","url":null,"abstract":"An exact mathematical model which explains the important characteristics of the probability density function (PDF) of the multiple access interference (MAI) in time-hopping UWB (TH-UWB) systems is discussed. The proposed model accurately foresees impulses, singularities, and heavy tails found in the distribution of the MAI. Also, it discloses precisely why a Gaussian approximation for the MAI in TH-UWB systems is highly inaccurate even in the presence of a large number of interferers. Then, using the maximum a posteriori (MAP) receiver rule and based on the obtained model for the PDF of the MAI, the optimal achievable BER performance of binary TH-UWB receivers is numerically determined. Finally, the performances of some recently proposed UWB receivers are benchmarked against the optimal performance.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116153645","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 Simple, Two-Level Markovian Traffic Model for IPTV Video Sources","authors":"Fengdan Wan, Lin X. Cai, T. Gulliver","doi":"10.1109/GLOCOM.2008.ECP.288","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.288","url":null,"abstract":"To facilitate network performance analysis and simulations for IPTV traffic, a two-level Markovian traffic model is proposed in the paper. The model considers both spatial and temporal correlation in MPEG encoded video sequences, so it can mimic the highly variable data rate (VBR) behavior of IPTV sources. The model contains a Group of Pictures (GoP)- level Markov chain and a frame-level Markov chain, so it can capture both the inter-GoP and intra-GoP correlations. The proposed traffic model is simple to incorporate into network simulators, and can be used to obtain closed-form solutions of queue performance. Extensive simulations have been conducted to compare the network performance using the proposed model with the performance of a variety of real video traces. The results show that the accuracy of the proposed video source model is sufficient for the study of network performance. Therefore, it is an effective tool for performance evaluation of IPTV services via analysis and/or simulation.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116159314","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":"Efficient Power Control over Fading Channels","authors":"A. Kotelba, A. Mämmelä","doi":"10.1109/GLOCOM.2008.ECP.896","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.896","url":null,"abstract":"This paper introduces a novel concept of efficient power control in nonergodic fading channels. We use the risk-reward approach to quantitatively describe the performance of power control schemes. A power control scheme is said to be efficient if it minimizes the risk for a given level of reward. The reward and risk are measured, respectively, as the expected value of the link spectral efficiency in excess of some predefined target value and the below-target semideviation of the link spectral efficiency distribution. Furthermore, we introduce a novel fundamental limit on the performance of adaptive power control schemes. The new fundamental limit, which we call the efficient frontier, is the set of all efficient power control schemes. We analytically derive the adaptive power control rule that achieves the fundamental limit. We show that no power control scheme can be constructed with the performance above the efficient frontier. The numerical results suggest that various state-of-the-art power control schemes are suboptimal, i.e., their risk-reward performance is below the efficient frontier.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122709876","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}
A. Alaya-Feki, B. Sayraç, É. Moulines, A. L. Cornec
{"title":"Opportunistic Spectrum Access: Online Search of Optimality","authors":"A. Alaya-Feki, B. Sayraç, É. Moulines, A. L. Cornec","doi":"10.1109/GLOCOM.2008.ECP.594","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.594","url":null,"abstract":"This paper presents an online tuning approach for the ad-hoc reinforcement learning algorithms which are used for solving the exploitation-exploration dilemma of the opportunistic spectrum access, in dynamic environments. These algorithms originate from a well-known problem in computer science: the multi-armed bandit (MAB) problem and they have provided evidence to be viable solutions for the detection and exploration of white spaces in opportunistic spectrum access. Previous work (A. Ben Hadj Alaya-Feki et al., 2008) has shown that the reinforcement learning solutions of the MAB problem are very sensitive to the statistical properties of the wireless medium access and therefore need careful tuning according to the dynamic variations of the wireless environment. This paper deals with the online tuning of those algorithms by proposing and assessing two different approaches: 1-a meta learning approach where a second learner (meta learner) is used to learn the parameters of the base learner, and 2-the Exp3 algorithm that has been previously proposed for dynamical tuning of MAB parameters in other contexts. The simulation results obtained on an IEEE 802.11medium access scenario show that one of the proposed meta-learning methods, namely the change point detection method, achieves much better performance compared to the other methods.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122856777","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":"Performance of Cooperative Multi-Hop Wireless Systems over Log-Normal Fading Channels","authors":"M. Renzo, F. Graziosi, F. Santucci","doi":"10.1109/GLOCOM.2008.ECP.861","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.861","url":null,"abstract":"In recent years, there has been a growing interest in antenna sharing systems, and many analytical frameworks have been developed to analyze the performance of various relying protocols in a variety of propagation environments. However, among the different propagation scenarios, the less investigated are those characterized by log-normal fading. Motivated by this consideration, we propose a comprehensive framework for performance analysis of multi-hop multi-branch wireless systems over log-normal fading channels. More specifically, the developed framework allows to estimate the performance of amplify and forward (AF) relay methods for both channel state information (CSI-) assisted analog relays, and semi-blind and blind analog relays. In particular, the contribution of the paper is twofold: i) first of all, by relying on the Gauss quadrature rule (GQR) representation of the moment generation function (MGF) for a log-normal distribution, we develop very accurate formulas for important performance indexes; ii) then, in order to simplify the computational burden of the former framework for some system setups, we also propose an approximation, which is based on the improved Schwartz-Yeh (I-SY) method. We show with numerical and simulation results that the proposed approximation provides a good trade-off between accuracy and complexity.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122917128","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":"Collusion-Resistant Multi-Winner Spectrum Auction for Cognitive Radio Networks","authors":"Yongle Wu, Beibei Wang, K. Liu, T. Clancy","doi":"10.1109/GLOCOM.2008.ECP.597","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.597","url":null,"abstract":"In order to fully utilize spectrum, auction-based dynamic spectrum allocation has become a promising approach which allows unlicensed wireless users to lease unused bands from spectrum license holders. Because spectrum resources are reusable by users far apart, in some scenarios, spectrum is more efficiently utilized by awarding one band to multiple secondary users simultaneously, which distinguishes it from traditional auctions where only one user can be the winner. However, the multi-winner auction is a new concept posing new challenges in the traditional auction mechanisms, because such mechanisms may yield low revenue and are not robust to some newly-emerging collusion. Therefore, in this paper, we propose an efficient mechanism for the multi-winner spectrum auction with collusion- resistant pricing strategies, in which the optimal spectrum allocation can be solved by binary linear programming and the pricing is formulated as a convex optimization problem. Furthermore, a greedy algorithm is proposed to reduce complexity for multi- band auctions. Simulation results are presented to evaluate our proposed auction mechanisms.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122074301","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}
Nikhil Kelkar, Yaling Yang, Dilip Shome, G. Morgan
{"title":"A Business Model Framework for Dynamic Spectrum Access in Cognitive Networks","authors":"Nikhil Kelkar, Yaling Yang, Dilip Shome, G. Morgan","doi":"10.1109/GLOCOM.2008.ECP.1059","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.1059","url":null,"abstract":"We have outlined a comprehensive business framework to evaluate the business impact of dynamic spectrum access technology in cognitive networks. Our model seeks to address the technical feasibility and practicality of this new technology. We attempt to obtain upper bounds on the allowable capital expenditure below which the technology might be worth pursuing for the primary providers. Cognitive radios & networks are bound to open new frontiers in the field of wireless networks and spectrum management and have the potential of becoming success stories in the near future.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122194465","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}