{"title":"On the Level Crossing Rate and Average Fade Duration of Composite Multipath/Shadowing Channels","authors":"I. Trigui, A. Laourine, S. Affes, A. Stephenne","doi":"10.1109/GLOCOM.2008.ECP.803","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.803","url":null,"abstract":"In this paper, we consider composite multipath/shadowing fading channels characterized by Nakagami- m fading with inverse Gaussian shadowing, and Rice fading with inverse Gaussian shadowing. These channel models are very convenient for land mobile satellite systems and communications with low mobility or stationary users. From an analytical standpoint, one major advantage of these models is that they lead to closed-from expressions for the envelope probability density function (pdf) and the cumulative density function (CDF). Moreover, in this paper, we derive mathematically tractable new expressions for fundamental channel statistics such as the level crossing rate (LCR) and the average fade duration (AFD). Also, we validate our analytical results by providing several numerical examples showing the LCR and the AFD as a function of the Nakagami-m factor, Rice factor, and shadowing spread.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"48 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":"127944272","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":"Distributed Detection of Primary Signals in Fading Channels for Cognitive Radio Networks","authors":"P. Kaligineedi, V. Bhargava","doi":"10.1109/GLOCOM.2008.ECP.605","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.605","url":null,"abstract":"In this paper, we investigate cooperative sensing schemes to identify primary signals in fading environment for cognitive radio (CR) networks employing energy detectors. We consider a parallel fusion architecture in which all the sensing devices send their quantized sensing information to an access point, which then applies a fusion rule to determine the presence of the primary signal. We assume independent and identically distributed fading at various CR sensing devices. Considering identical binary quantization at the sensing devices, we study the optimal quantization and data fusion scheme. We compare the performance of the optimal binary data fusion scheme based on identical quantizers with the performances of other binary data fusion schemes commonly used in the literature for CR cooperative sensing networks. We further investigate the performance gain that could be obtained by using identical multi- bit quantization at the sensing devices.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"104 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":"128189159","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":"Content Protection through Multicast IP Flow Aggregation in Optical Networks","authors":"Yi Zhu, J. Jue","doi":"10.1109/GLOCOM.2008.ECP.504","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.504","url":null,"abstract":"In this paper, we study the content protection problem through multicast flow aggregation (CPMFA) in which programs with protection requirement are aggregated into different light trees at the access routers and delivered from the head end to one or more destinations. We first use a tri-partite graph to describe the problem and show that the problem is NP-complete. We then formulate the problem as an interger linear program (ILP) and give results for small scale problems. Two hueristic appoaches, named two-step separated multicast flow aggregation (S-MFA) and mixed multicast flow aggregation (M-MFA), are presented. Numerical results show that S-MFA and M-MFA achieve good results in both large and small scale problems.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"45 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":"115878019","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":"BER Analysis for Asymmetric OFDM Systems","authors":"Lin Luo, Jian Zhang, Zhenning Shi","doi":"10.1109/GLOCOM.2008.ECP.874","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.874","url":null,"abstract":"To alleviate the high peak-to-average power ratio (PAPR) and sensitivity to carrier frequency offset (CFO) problems, an asymmetric OFDM (A-OFDM) system has been recently proposed. In this paper, the theoretical bit error rate (BER) analysis of the A-OFDM systems is presented. Various modulation methods, i.e., BPSK and M-ray QAM, and equalization techniques, i.e., zero forcing (ZF) and minimum mean square error (MMSE) criteria are considered. Our analysis shows that the BER performance of the A-OFDM system bridges that of conventional OFDM and single carrier systems. Certain advanced equalizers, such as MMSE equalizer, are found to significantly improve the BER performance of the A-OFDM systems. The analysis approach is generally applicable to most modulation schemes and can be extended to any preceded OFDM systems.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"33 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":"131929234","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":"On the Gains of Deterministic Placement and Coordinated Activation in Sensor Networks","authors":"V. Fodor, Ioannis Glaropoulos","doi":"10.1109/GLOCOM.2008.ECP.72","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.72","url":null,"abstract":"In this paper we discuss topology design and dimensioning of sensor networks to achieve full sensing coverage. We consider two ways of deploying the sensors, placing them according to some regular pattern or scattering them randomly, and two ways of activating the sensors, optimally according to some predefined schedule or randomly, when each sensor follows a wake-up schedule independently from the other sensors. We provide analytic expressions for the necessary and sufficient number of sensors that guarantee coverage in these scenarios and determine the cases when deterministic sensor placement or optimal sensor activation can achieve significant gains. We consider sensing with bounded delay and show that the number of sensors to be deployed can be decreased significantly even at low sensing delays.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"21 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":"130212454","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":"Cache-Based Content Delivery in Opportunistic Mobile Ad Hoc Networks","authors":"Yaozhou Ma, M. Kibria, A. Jamalipour","doi":"10.1109/GLOCOM.2008.ECP.153","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.153","url":null,"abstract":"Over the last few years, multimedia content sharing through different service providers have gained popularity among the Internet users. The development of wireless mobile devices with enhanced features have further fueled this phenomenon. While such content sharing in Internet is accommodated through an overlay architecture, for infrastructure-less environment such as wireless mobile ad hoc networks (MANETs) experiencing intermittent connectivity, the distribution mechanism is not that straightforward. Arising from inherent MANET limitations such as short radio transmission range, sporadic node densities and constrained power, intermittent connectivity limits the ability of the network to provide successful content delivery. Although some solutions have been proposed in literature, they fail to consider the mobility characteristics of nodes for making decisions regarding the caching of contents for future delivery. Moreover, user-centric service requirements are also not addressed where different subscribers prefer different content profiles. To address this issue, a novel content sharing framework with optimized caching strategy is proposed in this paper. Based on the cached subscription profiles, the framework exploits two decision-making technologies namely analytic hierarchy process (AHP) and grey relational analysis (GRA) to evaluate all possible content requests between two meeting nodes and subsequently request the preferred contents for future encounters. Simulation results validate the improved performance of the proposed distribution framework in comparison to the existing schemes.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"33 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":"130449153","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":"On the Effect of Antenna Height on the Characterization of the Indoor UWB Channel","authors":"Umesh Shukla, H. Volos, R. Buehrer","doi":"10.1109/GLOCOM.2008.ECP.799","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.799","url":null,"abstract":"Ultra-wideband (UWB) technology is being proposed for several short range wireless applications. Some of the applications, such as position location devices for rescue personnel, may require the antenna height to be close to the ground. In scenarios where the antenna height is very low (from 0 to 30 cm), propagation characteristics and channel modeling are needed to provide important insights for the application design. This paper presents time-domain measurements and channel characterization of the indoor UWB channel at three different antenna heights (7.5 cm, 26.5 cm, and 108.5 cm). The transmitting and receiving antennas are placed at heights referred to as near ground, middle ground, and above ground. The effects of the antenna height on the channel characteristics are analyzed. Both large and small-scale characteristics are evaluated and the results for different antenna heights are compared. The results show that large scale characteristics exhibit monotonic behavior with respect to antenna height while small scale characteristics do not follow this behavior. The possible explanations for the obtained results are also discussed.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"22 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":"133893895","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":"Pipelined Implementation of TCAM-Based Search Engines in High-Performance IP Routers","authors":"Hui Yu, Jing Chen, Jianping Wang, Si-Qing Zheng","doi":"10.1109/GLOCOM.2008.ECP.448","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.448","url":null,"abstract":"Search engine is a critical component in several stages of a pipeline flow in high-performance IP routers. To achieve high performance, it has been proposed to use TCAMs to implement search engines in hardware. In this paper, the state- of-art TCAM-based MSMB-LPT scheme is used as an example to show how to introduce pipelining into TCAM-based search by presenting pipelined scheme P-MSMB-LPT. It is shown that P-MSMB-LPT eliminates the unnecessary hazard that exists in the MSMB-LPT scheme, and achieves near-optimal speedup with almost no additional hardware overhead.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"24 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":"134267821","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":"Probabilistic Coverage Map for Mobile Sensor Networks","authors":"Ji Luo, Qian Zhang","doi":"10.1109/GLOCOM.2008.ECP.76","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.76","url":null,"abstract":"Mobile sensor has enabled many new applications in wireless sensor networks where coverage is one of the most important problems to support those applications. Previous research works of coverage issue mainly focus on the static sensor network, which can not handle the significant challenge brought by the node mobility. In this paper, we consider the coverage problem in mobile sensor networks under a very general framework, in which all the sensors are moving all the time with any specified movement model. We propose a scheme that can provide a Real-time Coverage-Map According to Probability (RC- MAP) of the mobile sensor networks. By introducing probability into coverage, RC-MAP provides three different types of coverage map in real-time, including probability to be covered, expected number of sensors to cover, and expected waiting time before being covered. Extensive simulation results demonstrate the high accuracy and effectiveness of the proposed scheme.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"10 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":"134437538","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":"Best-Effort Network Layer Packet Reordering in Support of Multipath Overlay Packet Dispersion","authors":"J. Lane, A. Nakao","doi":"10.1109/GLOCOM.2008.ECP.472","DOIUrl":"https://doi.org/10.1109/GLOCOM.2008.ECP.472","url":null,"abstract":"Simultaneous use of multiple disjoint Internet paths holds promise for exploiting available bandwidth as well as reacting more quickly to Internet path faults. While routing overlay networks have provided a method for accessing these paths, out-of-order packet delivery, which results from dispersion of packets across paths of varying latency, severely degrades the performance of highly optimized transport protocols such as TCP, which assume largely in-order delivery. While traditional approaches perform reordering at the transport or application layers, such approaches have the disadvantage of entangling the complexity of reordering with their own operation, as well as requiring reimplementation for each protocol or application. Herein, we address these issues by proposing the modularization of packet reordering functionality as an optional, best-effort, network layer service for routing overlay networks. We empirically demonstrate the feasibility of this approach by showing that it can realize performance and reliability gains even using unmodified TCP in the face of highly multipath environments and heavy packet reordering.","PeriodicalId":297815,"journal":{"name":"IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference","volume":"48 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":"134546741","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}