Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258604
D. Seethaler, H. Artés, F. Hlawatsch
It is well known that suboptimal detection schemes for MIMO spatial multiplexing systems (equalization-based as well as nulling-and-cancelling detectors) cannot exploit all of the available diversity. We show that this inferior performance is primarily caused by poorly conditioned channel realizations. We then present the novel sphere-projection algorithm (SPA) that is robust to poorly conditioned channels. The SPA is a computationally efficient add-on to standard suboptimal detectors. Simulation results show that the SPA is able to achieve near-ML performance and significantly increased diversity gains. The SPA's computational complexity is comparable to that of nulling-and-cancelling detectors and only a fraction of that of the Fincke-Phost sphere-decoding algorithm for ML detection (Fincke, U. and Phost, M., Math. of Comp., vol.44, p.463-71, 1985).
{"title":"Efficient near-ML detection for MIMO channels: the sphere-projection algorithm","authors":"D. Seethaler, H. Artés, F. Hlawatsch","doi":"10.1109/GLOCOM.2003.1258604","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258604","url":null,"abstract":"It is well known that suboptimal detection schemes for MIMO spatial multiplexing systems (equalization-based as well as nulling-and-cancelling detectors) cannot exploit all of the available diversity. We show that this inferior performance is primarily caused by poorly conditioned channel realizations. We then present the novel sphere-projection algorithm (SPA) that is robust to poorly conditioned channels. The SPA is a computationally efficient add-on to standard suboptimal detectors. Simulation results show that the SPA is able to achieve near-ML performance and significantly increased diversity gains. The SPA's computational complexity is comparable to that of nulling-and-cancelling detectors and only a fraction of that of the Fincke-Phost sphere-decoding algorithm for ML detection (Fincke, U. and Phost, M., Math. of Comp., vol.44, p.463-71, 1985).","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"329 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134128702","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}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258617
T. A. Drumright, Amir Ali Tabarrok, Z. Ding
We present a blind array beamforming method for the detection of aperiodic CDMA signals in the presence of an unknown carrier drift. This method employs a differential array beamforming algorithm (DABA), which utilizes the known spreading code of the desired user to estimate the signal subspace under carrier drift. Successful beamforming enables better carrier drift estimation before detecting user data symbols. Simulations are performed in order to compare this method with an existing subspace technique, as well as two baseline (Weiner filter and single element matched filter) detectors.
{"title":"Array beamforming for long code CDMA under carrier drift","authors":"T. A. Drumright, Amir Ali Tabarrok, Z. Ding","doi":"10.1109/GLOCOM.2003.1258617","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258617","url":null,"abstract":"We present a blind array beamforming method for the detection of aperiodic CDMA signals in the presence of an unknown carrier drift. This method employs a differential array beamforming algorithm (DABA), which utilizes the known spreading code of the desired user to estimate the signal subspace under carrier drift. Successful beamforming enables better carrier drift estimation before detecting user data symbols. Simulations are performed in order to compare this method with an existing subspace technique, as well as two baseline (Weiner filter and single element matched filter) detectors.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"46 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134504552","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}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258749
V. Rodoplu, T. Meng
The utility of a node in an energy-limited wireless ad hoc network is defined as a positive linear function of the number of bits that the node sends as a source and the number of bits that it receives as a destination. First, we show that under the one-to-one traffic model in which every node wants to send traffic to a randomly chosen destination node, a utility that grows asymptotically at least as c/sub n/(N/logN)/sup (n-1)/2/ is achievable for every node when the nodes are distributed randomly on the surface of a fixed sphere. In this expression, N denotes the number of nodes, n denotes the transmit power fall-off exponent, and c/sub n/ is a constant that depends on n and is independent of N. Second, we introduce a "dollars-per-Joule pricing" system for wireless ad hoc networks, in which each node can charge any other node a price per Joule of energy that it expends on the other node's traffic. Under this pricing system, we extend the definition of the utility of a node to include the revenue that the node raises and the payments that it makes on the network. We show that the core capacity region of a wireless ad hoc network is non-empty under this dollars-per-Joule pricing system. Further, we show that there exists a sequence of utility vectors in the core capacity region such that the average of the utilities of the nodes grows asymptotically at least as c/sub n/(N/logN)/sup (n-1)/2/ under the one-to-one traffic model.
在能量有限的无线自组织网络中，节点的效用被定义为节点作为源发送的比特数和作为目的地接收的比特数的正线性函数。首先，我们证明了在每个节点都希望将流量发送到随机选择的目标节点的一对一流量模型下，当节点随机分布在固定球面上时，每个节点都可以实现至少为c/sub n/(n/ logN)/sup (n-1)/2/渐近增长的效用。在这个表达式中，N表示节点数量，N表示发射功率下降指数，c/sub N /是一个依赖于N且独立于N的常数。其次，我们为无线自组织网络引入了“每焦耳美元定价”系统，其中每个节点可以向任何其他节点收取每焦耳能量的价格，这是它在另一个节点的流量上消耗的。在这种定价体系下，我们扩展了节点效用的定义，以包括节点筹集的收入和它在网络上进行的支付。我们证明了无线自组织网络的核心容量区域在这种每焦耳美元定价系统下是非空的。进一步，我们证明了在核心容量区域存在一个效用向量序列，使得节点的效用均值在一对一交通模型下至少渐近增长为c/sub n/(n/ logN)/sup (n-1)/2/。
{"title":"Growth of wireless ad hoc networks","authors":"V. Rodoplu, T. Meng","doi":"10.1109/GLOCOM.2003.1258749","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258749","url":null,"abstract":"The utility of a node in an energy-limited wireless ad hoc network is defined as a positive linear function of the number of bits that the node sends as a source and the number of bits that it receives as a destination. First, we show that under the one-to-one traffic model in which every node wants to send traffic to a randomly chosen destination node, a utility that grows asymptotically at least as c/sub n/(N/logN)/sup (n-1)/2/ is achievable for every node when the nodes are distributed randomly on the surface of a fixed sphere. In this expression, N denotes the number of nodes, n denotes the transmit power fall-off exponent, and c/sub n/ is a constant that depends on n and is independent of N. Second, we introduce a \"dollars-per-Joule pricing\" system for wireless ad hoc networks, in which each node can charge any other node a price per Joule of energy that it expends on the other node's traffic. Under this pricing system, we extend the definition of the utility of a node to include the revenue that the node raises and the payments that it makes on the network. We show that the core capacity region of a wireless ad hoc network is non-empty under this dollars-per-Joule pricing system. Further, we show that there exists a sequence of utility vectors in the core capacity region such that the average of the utilities of the nodes grows asymptotically at least as c/sub n/(N/logN)/sup (n-1)/2/ under the one-to-one traffic model.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134093700","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}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258955
P. Golla, G. Damm, Timuçin Özugur
Arbitration between various contenders using given priority parameters is difficult to implement in hardware. We present a solution that solves this problem with minimal hardware. The solution presented is simple, fair, starvation-free, and fast. A contention resolving technique, called binary tree arbitration, is taken as a basis for implementing a "weighted fair" contention resolution technique that picks among "n" contenders, which could translate to flows, packets/cells, or connections. The extensions are priority and embedded binary tree arbitrations. Theoretical formulations of these techniques are presented. The results of their comparisons to software and hardware simulations, to show their relative conformance, are also presented.
{"title":"Traffic management mechanism for fast arbitrations with QoS parameters","authors":"P. Golla, G. Damm, Timuçin Özugur","doi":"10.1109/GLOCOM.2003.1258955","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258955","url":null,"abstract":"Arbitration between various contenders using given priority parameters is difficult to implement in hardware. We present a solution that solves this problem with minimal hardware. The solution presented is simple, fair, starvation-free, and fast. A contention resolving technique, called binary tree arbitration, is taken as a basis for implementing a \"weighted fair\" contention resolution technique that picks among \"n\" contenders, which could translate to flows, packets/cells, or connections. The extensions are priority and embedded binary tree arbitrations. Theoretical formulations of these techniques are presented. The results of their comparisons to software and hardware simulations, to show their relative conformance, are also presented.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134361166","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}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258375
Ming-Hui Jin, E. Wu, Yun Liao, Hui-Chun Liao
This paper presents a novel 802.11-based positioning system called the maximal cluster centered positioning system (MCCPS) developed and demonstrated at National Central University. The MCCPS system locates mobile objects via collecting the sensed power strengths of the mobile objects to multiple wireless access points. To overcome the serious multipath fading problem in the indoor environment, several positions called reference points were selected and a database is introduced to maintenance the power signature of each reference point. The experimental results show that the location information provided by MCCPS assures high correctness of region classification and low distance error.
{"title":"802.11-based positioning system for context aware applications","authors":"Ming-Hui Jin, E. Wu, Yun Liao, Hui-Chun Liao","doi":"10.1109/GLOCOM.2003.1258375","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258375","url":null,"abstract":"This paper presents a novel 802.11-based positioning system called the maximal cluster centered positioning system (MCCPS) developed and demonstrated at National Central University. The MCCPS system locates mobile objects via collecting the sensed power strengths of the mobile objects to multiple wireless access points. To overcome the serious multipath fading problem in the indoor environment, several positions called reference points were selected and a database is introduced to maintenance the power signature of each reference point. The experimental results show that the location information provided by MCCPS assures high correctness of region classification and low distance error.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134388760","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}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258404
Feng-Tsun Chien, Chien-Hwa Hwang, C.-C. Jay Kuo
The effects of frequency offsets and aperiodic random spreading sequences on the performance of asynchronous multicarrier code division multiple access (CDMA) systems with correlated fading are investigated in this research. Random parameters including asynchronous delays, correlated Rayleigh fading and spreading sequences are averaged to determine the covariance matrix of the interference-plus-noise vector. An analytic expression for the average signal-to-interference-plus-noise ratio (SINR) is obtained. Furthermore, average bit error probability (BEP) based on the Gaussian approximation is also derived. We show that the system degrades significantly if the frequency offset of the desired user is present, while the system is insensitive to interferers' frequency offsets. In consequence, it is crucial to estimate and compensate the desired user's synchronization imperfection. Finally, design tradeoff among the number of subcarriers, fading correlations, and inter-carrier interference (ICI) are presented in simulation results.
{"title":"Performance of asynchronous long-code multicarrier CDMA systems in the presence of frequency offsets and correlated fading","authors":"Feng-Tsun Chien, Chien-Hwa Hwang, C.-C. Jay Kuo","doi":"10.1109/GLOCOM.2003.1258404","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258404","url":null,"abstract":"The effects of frequency offsets and aperiodic random spreading sequences on the performance of asynchronous multicarrier code division multiple access (CDMA) systems with correlated fading are investigated in this research. Random parameters including asynchronous delays, correlated Rayleigh fading and spreading sequences are averaged to determine the covariance matrix of the interference-plus-noise vector. An analytic expression for the average signal-to-interference-plus-noise ratio (SINR) is obtained. Furthermore, average bit error probability (BEP) based on the Gaussian approximation is also derived. We show that the system degrades significantly if the frequency offset of the desired user is present, while the system is insensitive to interferers' frequency offsets. In consequence, it is crucial to estimate and compensate the desired user's synchronization imperfection. Finally, design tradeoff among the number of subcarriers, fading correlations, and inter-carrier interference (ICI) are presented in simulation results.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132958140","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}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258999
Yang Xiao, Yi Pan, Jie Li
We propose a dynamic fractional movement-based location management scheme for 3G networks where home location registers (HLRs), gateway location registers (GLRs), and visitor location registers (VLRs) are formed into a three-level hierarchical mobility database structure. The cost functions of location updates and paging are formulated analytically. We prove analytically that there is an optimal fractional movement threshold that minimizes the total cost function. Our study shows that the proposed scheme outperforms the previous two-tier mobility database scheme, especially when the remote-local-cost ratio is high.
{"title":"Movement-based location management for 3G cellular networks","authors":"Yang Xiao, Yi Pan, Jie Li","doi":"10.1109/GLOCOM.2003.1258999","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258999","url":null,"abstract":"We propose a dynamic fractional movement-based location management scheme for 3G networks where home location registers (HLRs), gateway location registers (GLRs), and visitor location registers (VLRs) are formed into a three-level hierarchical mobility database structure. The cost functions of location updates and paging are formulated analytically. We prove analytically that there is an optimal fractional movement threshold that minimizes the total cost function. Our study shows that the proposed scheme outperforms the previous two-tier mobility database scheme, especially when the remote-local-cost ratio is high.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127627331","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}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258947
Ruomei Gao, E. Zegura
Models for network topology form a crucial component in the analysis of protocols. This paper systematically investigates a variety of evolutionary models for autonomous system (AS) level Internet topology. Evolution-based models produce a topology incrementally, attempting to reflect the growth patterns of the actual topology. While evolutionary models are appealing, they have generally not agreed as closely with measurements of real data as non-evolutionary models. We attempt to understand what factor contributes to a "good" evolutionary model. Our systematic study consists of a relatively generic evolutionary model framework, which we populate with different choices for the components. This allows us to compare a variety of instances of models to measurements from real data sets. We study issues such as the initial topology, the type of preferential connectivity used when adding edges, and the role of "growth" edges added between existing nodes. We find that appropriate instantiation of the framework can provide topologies that agree closely with real data. We also use our work to highlight several crucial open problems in topology modeling.
{"title":"An evolutionary framework for AS-level Internet topology modeling","authors":"Ruomei Gao, E. Zegura","doi":"10.1109/GLOCOM.2003.1258947","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258947","url":null,"abstract":"Models for network topology form a crucial component in the analysis of protocols. This paper systematically investigates a variety of evolutionary models for autonomous system (AS) level Internet topology. Evolution-based models produce a topology incrementally, attempting to reflect the growth patterns of the actual topology. While evolutionary models are appealing, they have generally not agreed as closely with measurements of real data as non-evolutionary models. We attempt to understand what factor contributes to a \"good\" evolutionary model. Our systematic study consists of a relatively generic evolutionary model framework, which we populate with different choices for the components. This allows us to compare a variety of instances of models to measurements from real data sets. We study issues such as the initial topology, the type of preferential connectivity used when adding edges, and the role of \"growth\" edges added between existing nodes. We find that appropriate instantiation of the framework can provide topologies that agree closely with real data. We also use our work to highlight several crucial open problems in topology modeling.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130754533","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}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258459
Samuel Abdelsayed, David Glimsholt, C. Leckie, Simon Ryan, S. Shami
In this paper, we present an efficient method for detecting and filtering denial-of-service bandwidth attacks. Our system called TOPS (tabulated online packet statistics) can monitor a large number of network addresses in a compact, fixed-size structure using several effective heuristics. We demonstrate that TOPS can detect bandwidth attacks in a standard benchmark dataset with a high accuracy and a low false alarm rate. A key benefit of TOPS is that it uses few computational resources and does not slow down during an attack.
{"title":"An efficient filter for denial-of-service bandwidth attacks","authors":"Samuel Abdelsayed, David Glimsholt, C. Leckie, Simon Ryan, S. Shami","doi":"10.1109/GLOCOM.2003.1258459","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258459","url":null,"abstract":"In this paper, we present an efficient method for detecting and filtering denial-of-service bandwidth attacks. Our system called TOPS (tabulated online packet statistics) can monitor a large number of network addresses in a compact, fixed-size structure using several effective heuristics. We demonstrate that TOPS can detect bandwidth attacks in a standard benchmark dataset with a high accuracy and a low false alarm rate. A key benefit of TOPS is that it uses few computational resources and does not slow down during an attack.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130868764","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}
Pub Date : 2003-12-01DOI: 10.1109/GLOCOM.2003.1258753
Baoxian Zhang, H. Mouftah
In this work, we design a destination-initiated protocol, which aims at building source-rooted shortest path tree (SPT) in a hop-by-hop manner for providing scalable multicast. The designed protocol can support group applications with dynamic membership well. Performance analysis and simulation results show that the destination-initiated characteristic can significantly reduce the computation, storage and communication overhead associated with SPT constructions.
{"title":"A destination-initiated multicast routing protocol for shortest path tree constructions","authors":"Baoxian Zhang, H. Mouftah","doi":"10.1109/GLOCOM.2003.1258753","DOIUrl":"https://doi.org/10.1109/GLOCOM.2003.1258753","url":null,"abstract":"In this work, we design a destination-initiated protocol, which aims at building source-rooted shortest path tree (SPT) in a hop-by-hop manner for providing scalable multicast. The designed protocol can support group applications with dynamic membership well. Performance analysis and simulation results show that the destination-initiated characteristic can significantly reduce the computation, storage and communication overhead associated with SPT constructions.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131182097","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：