{"title":"A Novel Non-Iterative Localization Solution","authors":"Junlin Yan, C. Tiberius, G. Bellusci, G. Janssen","doi":"10.1109/GLOCOM.2009.5425667","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425667","url":null,"abstract":"In this paper, a new method is proposed for low complexity localization based on measured/estimated ranges. First, it is proved that the method provides a better estimator than the well known non-iterative direct methods documented in literature, i.e. the Spherical Interpolation and the Linear Least Squares method. It does so by exploiting two similar full constrained models. The proposed estimator is better, in the sense that it corresponds to an equal or smaller value of the original least-squares objective function. Second, the method goes without iterations, and therefore requires considerably less computation power than the iterative techniques such as the Gauss-Newton method. Validation is performed based on actual Ultra-WideBand (UWB) radio measurements conducted in typical office environments, with signal bandwidths varying from 1 to 7.5 GHz. Results show that the position estimates obtained with the proposed non-iterative method have lower root mean squared errors than any other tested well-known direct methods.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123067981","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 Pilot Power Allocation for OFDM Systems with Transmitter and Receiver IQ Imbalances","authors":"V. Gottumukkala, H. Minn","doi":"10.1109/GLOCOM.2009.5426140","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426140","url":null,"abstract":"In this paper, we derive optimal pilot power allocation for OFDM systems suffering from in-phase and quadrature-phase (IQ) imbalances. Existing works in literature on IQ imbalances optimize for pilot spacings and pilot designs. However, in all these works, optimal power allocation between pilot and data symbols has not been considered. Using a lower bound on the average channel capacity as a metric, we optimize for the pilot and data power allocations. Simulations show that the resulting optimal pilot power allocation increases the channel capacity along with lowering the bit error rate (BER). We further show that the power allocation is flexible in the sense that several power allocation choices exist that improve capacity compared to the equal power allocation scenario.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116710846","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":"Time Synchronization of Cognitive Radio Networks","authors":"Jari Nieminen, R. Jäntti, Lijun Qian","doi":"10.1109/GLOCOM.2009.5425499","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425499","url":null,"abstract":"In this paper, a novel synchronization protocol is proposed especially for Cognitive Radio (CR) networks called CR-Sync. In a CR network, time synchronization is indispensable because of the requirements for coordinated and simultaneous quiet periods for spectrum sensing, as well as the common understanding of time frame/slot in many CR MAC designs. The proposed CR-Sync achieves network-wide time synchronization in a fully distributed manner, i.e., each node performs synchronization individually using CR-Sync. Contrary to many existing synchronization protocols that do not exploit CR attributes, the proposed protocol takes advantage of the potential multiple spectrum holes that are discovered by CR and distributes the synchronization of different pairs of nodes to distinct channels and thus reduces the synchronization time significantly. Detailed analysis of synchronization error and convergence time are provided. Results show that the proposed CR-Sync out-performs other protocols such as TPSN in CR networks.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116939181","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 Fault Tolerant Dynamic Clustering Protocol of Wireless Sensor Networks","authors":"Lutful Karim, N. Nasser, T. Sheltami","doi":"10.1109/GLOCOM.2009.5426072","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426072","url":null,"abstract":"Energy efficiency in the clustering protocols in highly desired in Wireless Sensor Network (WSN). The Dynamic Static Clustering (DSC) protocol is an energy efficient clustering protocol; however, it does not provide any fault tolerance mechanism. Moreover, the non-Cluster Head nodes send data to the Cluster Heads (CH) in every time slot of a frame allocated to them using TDMA scheme, which is an energy consuming process. Considering these limitations of the DSC protocol, we have proposed a more energy efficient and fault tolerant Dynamic Static Clustering (FT-DSC) protocol of WSN to enhance the performance of DSC. The performance of the proposal protocol has been tested by means of simulation and compared against the original DSC protocol. Simulation results show that the FT-DSC protocol has better performance than the DSC protocol in terms of energy efficiency and reliability.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117207129","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 Analysis of Selfish Access Strategies on WiFi Infrastructure Networks","authors":"L. Giarré, G. Neglia, I. Tinnirello","doi":"10.1109/GLOCOM.2009.5425511","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425511","url":null,"abstract":"In this paper we propose a game-theoretic approach for characterizing WiFi network performance in presence of intelligent nodes employing cognitive functionalities. We assume that a cognitive WiFi node is aware of its application requirements and is able to dynamically estimate the network status, in order to dynamically change its access strategy by tuning the contention window settings. We prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium conditions, which are also Pareto optimal. Indeed, we show that the station strategies converge toward values which maximize a per-node utility function, while maintaining performance fairness.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117208567","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 Pilot-Aided Digital Baseband Compensation of Phase Noise ICI in OFDM Receivers","authors":"P. Rabiei, W. Namgoong, N. Al-Dhahir","doi":"10.1109/GLOCOM.2009.5426095","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426095","url":null,"abstract":"A new method for detecting packet-based OFDM signals in the presence of phase noise is presented. The scattered pilots in each data OFDM symbol are used to noniteratively estimate and mitigate the phase noise induced inter-carrier interference (ICI). A significant improvement in the bit error rate (BER) is achieved using this technique, especially for systems suffering from high phase noise.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":" 35","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120833360","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":"Multihop MIMO Relay Networks with ARQ","authors":"Yao Xie, Deniz Gündüz, A. Goldsmith","doi":"10.1109/GLOCOM.2009.5426214","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426214","url":null,"abstract":"A multiple antenna multihop relay network consisting of a source, a relay, and a destination node, is considered. The diversity-multiplexing-delay tradeoffs (DMDT) for various multihop ARQ protocols are obtained. It is shown that the tradeoff region is limited by the performance of the weakest link, and hence the optimal ARQ protocol should balance the link performances by allocating the ARQ rounds among all links. Based on this argument, a Variable Block-Length (VBL) ARQ protocol is proposed and its DMDT-optimality is shown.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"30 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120931249","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":"Design of Measurement-Based Stochastic Wideband MIMO Channel Simulators","authors":"Dmitry Umansky, M. Pätzold","doi":"10.1109/GLOCOM.2009.5425314","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425314","url":null,"abstract":"In this paper, we propose a method for designing measurement-based stochastic models for simulating wideband multiple-input multiple-output (MIMO) wireless channels. The proposed method allows synthesizing channel transfer functions with the spatial-temporal-frequency correlation properties approximating those of real-world radio channels. The parameters of a channel simulator are determined by fitting the space-timefrequency cross-correlation matrix of the simulation model to the estimated space-time-frequency cross-correlation matrix of a physical channel. For this purpose, an iterative parameter computation algorithm has been developed. The proposed design method is verified by creating stochastic channel simulators based on the time-variant frequency responses (TVFRs) of real-world channels measured in different propagation environments.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121003342","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}
Sok-Hyong Kim, J. Baek, Seung-Hoon Lee, Young-Joo Suh
{"title":"Directory-Hopping Based Service Discovery for Dynamic Large-Scale Wireless Networks","authors":"Sok-Hyong Kim, J. Baek, Seung-Hoon Lee, Young-Joo Suh","doi":"10.1109/GLOCOM.2009.5426097","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5426097","url":null,"abstract":"With the rapid growth of wireless communication technologies, the demands for large-scale wireless networks have been emerged. One promising solution is the hierarchical architecture that consists of global and local wireless networks. The service discovery is a key issue to meet a vast amount of service demands from mobile nodes. However, under dynamic wireless networks, node failures severely affect the performance of service discovery protocols. Therefore, in this paper, we propose the directory hopping (DH) protocol for efficient service discoveries in dynamic large-scale networks. Basically, DH utilizes the directory for low-overhead service discoveries and periodically moves the directory to other operating nodes. In addition, it provides a fast and efficient recovery mechanism for node failures in dynamic network environments. Through extensive simulations, we show that the proposed DH protocol outperforms existing service discovery schemes.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121026733","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 Data Aggregation in Multi-Hop WSNs","authors":"Xiaohua Xu, ShiGuang Wang, Xufei Mao, Shaojie Tang, Ping Xu, Xiangyang Li","doi":"10.1109/GLOCOM.2009.5425843","DOIUrl":"https://doi.org/10.1109/GLOCOM.2009.5425843","url":null,"abstract":"Data aggregation is a primitive communication task in wireless sensor networks (WSNs). In this paper, we study designing data aggregation schedules under the Protocol Interference Model for answering queries. Given a network consisting of a set of nodes V distributed in a two-dimensional plane, we address different kinds of queries in this paper. First and foremost, we consider a single one-off query which requires a subset of source nodes V' C V to send data to a distinguished sink node, we propose a delay-efficient algorithm that produces a collision-free schedule and theoretically prove that the delay achieved by our algorithm is nearly a small constant factor of the optimum. We further extend our discussion to the multiple one-off queries case and periodic query case and propose our data aggregation scheduling algorithms respectively with theoretical performance analysis.","PeriodicalId":405624,"journal":{"name":"GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127364309","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}