{"title":"TAT-1 and Deregulation","authors":"J. Hayes","doi":"10.1109/GLOCOM.2008.ECP.689","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.689","url":null,"abstract":"TAT-1, the first transatlantic telephone system, came into service in 1956. Its design was dominated by the need for reliability. Coincidentally, the process of the deregulation of the telephone industry began the very same year. This process has led to the current competitive environment. We speculate on the effect that competition would have had on design decisions. Our focus is upon a particular component, the flexible repeater.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"29 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":"127801089","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}
Wooguil Pak, Kyong-Tak Cho, Jeongjoon Lee, S. Bahk
{"title":"W-MAC: Supporting Ultra Low Duty Cycle in Wireless Sensor Networks","authors":"Wooguil Pak, Kyong-Tak Cho, Jeongjoon Lee, S. Bahk","doi":"10.1109/GLOCOM.2008.ECP.79","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.79","url":null,"abstract":"The duty cycle of a wireless sensor node is a key factor that determines the life time of a wireless sensor network. In general, sensor medium access control protocols reduce the duty cycle to achieve longer lifetime. However, we found out that their performance improvements substantially decrease under extremely low duty cycles (<0.1%). Our proposed W-MAC protocol targets achieving low energy consumption under extremely low duty cycle as well as low duty cycle (>0.1%). It is with estimation of the relative clock speed between the sender and the receiver, and uses it to minimize energy consumption. It saves energy significantly well compared to the existing schemes in an order of ten times, and the performance gap increases with lowering the duty cycle.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"28 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":"134476925","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":"Effective Frame Level Rate Control for H.264/AVC Video Coding","authors":"Yimin Zhou, Y. Sun, Xin Yin, Shixin Sun","doi":"10.1109/GLOCOM.2008.ECP.669","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.669","url":null,"abstract":"In this paper, we present a robost frame level rate control algorithm for H.264/AVC compression standard. Particularly, we propose a simple yet effective approach to deal with B frames, including a PSNR-QP model and an adaptive QP computation method for B frames. The objective is to reduce PSNR variations among frames and improve subjective visual quality. To better handle buffer fullness and reduce buffer overflow/underflow, we develop an enhanced proportional- integral-derivative (PID) buffer controller. Our experimental results demonstrate that the proposed algorithm outperforms the JVT-W042 solution by achieving accurate rate regulation, reducing frame skipping, depressing quality fluctuations, and finally, improving coding quality up to 1.43 dB.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"64 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":"134492959","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":"Delay-Energy Tradeoffs in Wireless Ad-Hoc Networks with Partial Channel State Information","authors":"M. Brand, A. Molisch","doi":"10.1109/GLOCOM.2008.ECP.750","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.750","url":null,"abstract":"Given a wireless network where each link undergoes small-scale (Rayleigh) fading, we consider the problem of routing a message from a source node to a target node while minimizing energy or power expenditure given a fixed time budget, or vice versa. Given instantaneous channel state information, we develop tight hyperbolic bounds on the quantities of interest and solve the related optimizations in closed form or via lightweight computations. If only average channel state information is available, probabilistical performance measures must be introduced. We therefore develop another set of bounds that supports resource-optimal routing with a guaranteed success probability. Our results rest on novel formulations and solution methods for hyperbolic convex programs and, more generally, nonlinear multicriterion combinatorial optimization.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"64 2 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":"134624130","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}
E. Zimmermann, D. L. Milliner, J. Barry, G. Fettweis
{"title":"Optimal LLR Clipping Levels for Mixed Hard/Soft Output Detection","authors":"E. Zimmermann, D. L. Milliner, J. Barry, G. Fettweis","doi":"10.1109/GLOCOM.2008.ECP.222","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.222","url":null,"abstract":"Consider a communications system where the detector generates a mix of hard and soft outputs, which becomes fed to a soft-input channel decoder. In such a setting, it is of interest to find the optimal soft representation for the hard detected bits, which minimizes the probability of error at the decoder output. In this contribution we prove that for repetition codes transmitted over the AWGN channel using antipodal signaling, the optimal soft representation is given by the error probability at the detector output. This provides an indication of how \"LLR clipping levels\" should be chosen, e.g., in the context of list based detection of multiple-input multiple-output (MIMO) signals.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"99 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":"115457943","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":"GDOP-Assisted Location Estimation Algorithms in Wireless Location Systems","authors":"L. Chu, Po-Hsuan Tseng, Kai-Ten Feng","doi":"10.1109/GLOCOM.2008.ECP.1032","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.1032","url":null,"abstract":"In recent years, wireless location estimation has attracted a significant amount of attention in different areas. The network-based location estimation schemes have been widely adopted based on the radio signals between the mobile station (MS) and the base stations (BSs). The two-step Least Square (LS) method has been studied in related research to provide efficient location estimation of the MS. However, the algorithm results in inaccurate location estimation under the circumstances with poor geometric dilution of precision (GDOP). In this paper, the GDOP- assisted location estimation (GOLE) schemes are proposed by considering the geometric relationships between the MS and its associated BSs. According to the minimal GDOP criterion, the BSs are fictitiously repositioned and are served as a new set of BSs within the formulation of the two-step LS algorithm. The proposed GOLE schemes can both preserve the computational efficiency from the two-step LS method and obtain precise location estimation under poor GDOP environments. Comparing with other existing schemes, numerical results demonstrate that the proposed GOLE algorithms can achieve better accuracy in wireless location estimation.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"37 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":"115498833","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":"Throughput Modeling and Analysis of IEEE 802.11 DCF with Selfish Node","authors":"Chunfeng Liu, Y. Shu, Wucheng Yang, O. Yang","doi":"10.1109/GLOCOM.2008.ECP.253","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.253","url":null,"abstract":"Research on the effect of selfish node in wireless ad hoc networks has received considerable attention recently. However, most work concentrates on simulation study, but lacks an analytical study to accurately predict the throughput. This paper investigates the saturated and non-saturated load throughputs of IEEE 802.11 DCF (distributed coordinated function) in the presence of a selfish node. Using a modified Markov model, we have derived the throughput of a node under various traffic loads in the PHY (PHYsical) layer using DSSS (direct sequence spread spectrum) and the wireless MAC (medium access layer). The analytical model and throughput results have been validated by simulations.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"30 5 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":"115729388","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}
Jeonghun Noh, Pierpaolo Baccichet, Aditya Mavlankar, B. Girod
{"title":"Un-Leeching P2P Streaming by Active Overlay Management","authors":"Jeonghun Noh, Pierpaolo Baccichet, Aditya Mavlankar, B. Girod","doi":"10.1109/GLOCOM.2008.ECP.470","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.470","url":null,"abstract":"We propose peer swapping as a means to improve the throughput of structured-overlay-based peer-to-peer (P2P) streaming systems. In many P2P streaming systems, an overlay is incrementally constructed as peers join the system. When the system is dominated by peers with low uplink bandwidth (so-called leeches), the overlay can get clogged, which hampers its growth. A P2P system that suffers from clogging cannot scale any longer because even peers with high bandwidth are rejected. We first provide a theoretical analysis of clogging, which reveals that clogging is inevitable in a structured-overlay-based streaming system with heterogeneous peer uplink bandwidths. To overcome clogging, we propose distributed peer swapping, a method to reconfigure the overlay without centralized control. Experimental results demonstrate that peer swapping enables the system to accept more peers by mitigating clogging.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"25 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":"124432848","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":"MMSE Based Preprocessing and Its Variations for Closest Point Search","authors":"In-Sook Park, J. Chun","doi":"10.1109/GLOCOM.2008.ECP.783","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.783","url":null,"abstract":"The sphere decoding (SD) is a category of algorithms finding the closest lattice point and known to have the expected complexity approximately cubic in the dimension of the lattice point to be searched for a medium-to-high range of signal-to-noise ratios (SNRs). But the expected complexity depends highly on SNR and the portion of high-ordered terms (higher ordered terms than cubic) of it increases rapidly as SNR decreases for low SNRs. The number of points visited by SD is influenced by the processing done before starting to search a closest point. In this paper the minimum mean square error (MMSE) sorted QR-decomposition (SQRD) is proposed as a preprocessing for SD algorithm. By mathematical investigation of MMSE extended matrix we find out that MMSE extension can be generalized and suggest variations of MMSE-SQRD as candidates of the preprocessing for SD. MMSE-SQRD and its variations reduce considerably the dependency of the complexity of SD on SNR.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"142 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":"114472002","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 New Security Scheme for Wireless Sensor Networks","authors":"Junqi Zhang, V. Varadharajan","doi":"10.1109/GLOCOM.2008.ECP.32","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.32","url":null,"abstract":"Wireless sensor networks (WSN) are ad-hoc mobile networks in which the sensors have limited resources and communication capabilities. Secure communications in some wireless sensor networks are critical. Recently, several secure schemes for wireless sensor networks have been proposed. Localized combinatorial keying (LOCK) proposed by Mohamed Eltoweissy is secure wireless sensor network scheme based on the dynamical key management. In this paper, we present a new wireless sensor network security scheme. Our scheme is based on LOCK scheme and employees ID-based secure group key management. Our scheme have several advantages over the existing LOCK scheme. This scheme improves the wireless sensor network system security. It minimizes the number of key storage requirement and the number of the communication messages for rekeying. In addition, one unique advantage is that it does not affect any other nodes when evicting compromised node or moving the node from one location to another.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"118 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":"114602568","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}