Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917511
Sidney S. Doria, M. Spohn
There are synergies between Mobile Ad Hoc Networks (MANETs) and Peer-to-Peer (P2P) networks. Some previous works consisted on the straight implementation of standard P2P content distribution protocols over MANETs. However, we ponder that such a direct approach may not be the best choice. We propose a novel P2P content distribution protocol for MANETs: Peer-to-MANET (P2MAN). P2MAN takes into account the main characteristics and constraints of MANETs, while keeping useful concepts from P2P networks. P2MAN leverages on the PUMA multicast routing protocol, delivering reliable content distribution at the application layer. PUMA was chosen as P2MAN's routing protocol due to its best performance compared to other representative multicast routing protocols. P2MAN was implemented and evaluated in the NS-2 network simulator, and its source code is publicly available. Extensive simulation results in typical MANET scenarios show that P2MAN is efficient and scalable. P2MAN good performance is mainly due to its multicast approach, applying multicast meshes for content distribution, and a basic repair mechanism for reliably sharing content among peers.
{"title":"A Multicast Approach for Peer-to-Peer Content Distribution in Mobile Ad Hoc Networks","authors":"Sidney S. Doria, M. Spohn","doi":"10.1109/WCNC.2009.4917511","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917511","url":null,"abstract":"There are synergies between Mobile Ad Hoc Networks (MANETs) and Peer-to-Peer (P2P) networks. Some previous works consisted on the straight implementation of standard P2P content distribution protocols over MANETs. However, we ponder that such a direct approach may not be the best choice. We propose a novel P2P content distribution protocol for MANETs: Peer-to-MANET (P2MAN). P2MAN takes into account the main characteristics and constraints of MANETs, while keeping useful concepts from P2P networks. P2MAN leverages on the PUMA multicast routing protocol, delivering reliable content distribution at the application layer. PUMA was chosen as P2MAN's routing protocol due to its best performance compared to other representative multicast routing protocols. P2MAN was implemented and evaluated in the NS-2 network simulator, and its source code is publicly available. Extensive simulation results in typical MANET scenarios show that P2MAN is efficient and scalable. P2MAN good performance is mainly due to its multicast approach, applying multicast meshes for content distribution, and a basic repair mechanism for reliably sharing content among peers.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"2018 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132978406","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917861
Yan Wu, Chin Keong Ho, Sumei Sun
In a previous work by Wu et al., it is shown that the performance of the pre-transformed space-time block coded orthogonal frequency division multiplexing (PT-STBC-OFDM) system has much superior performance compared to the normal STBC-OFDM system. In this paper, we present an analytical study on the bit error rate (BER) of the PT-STBC-OFDM system. We derive the noise distribution of PT-STBC-OFDM system and hence, obtain the BER numerically. We also derived two closed-form BER approximations for the PT-STBC-OFDM system at two different SNR regions. We show that by adding the PT operation, the system has better diversity compared to STBC-OFDM system at the medium SNR region. Using linear detection, the diversity of both systems at the high SNR regions are the same. Moreover, we demonstrate that at high SNR, a PT-STBC-OFDM system of transform size N requires 5 log10(N) dB less SNR to achieve the same BER as without PT.
{"title":"On The Performance of Pre-Transformed Space-Time Block Coded OFDM Systems","authors":"Yan Wu, Chin Keong Ho, Sumei Sun","doi":"10.1109/WCNC.2009.4917861","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917861","url":null,"abstract":"In a previous work by Wu et al., it is shown that the performance of the pre-transformed space-time block coded orthogonal frequency division multiplexing (PT-STBC-OFDM) system has much superior performance compared to the normal STBC-OFDM system. In this paper, we present an analytical study on the bit error rate (BER) of the PT-STBC-OFDM system. We derive the noise distribution of PT-STBC-OFDM system and hence, obtain the BER numerically. We also derived two closed-form BER approximations for the PT-STBC-OFDM system at two different SNR regions. We show that by adding the PT operation, the system has better diversity compared to STBC-OFDM system at the medium SNR region. Using linear detection, the diversity of both systems at the high SNR regions are the same. Moreover, we demonstrate that at high SNR, a PT-STBC-OFDM system of transform size N requires 5 log10(N) dB less SNR to achieve the same BER as without PT.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132979516","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4918010
K. V. Pradap, V. Ramachandran, S. Kalyanasundaram
Scheduling of uplink data by the network typically requires that the buffer status information from each User Equipment (UE) is available at the network to ensure that the air interface resources are not wasted. The presence of delay constrained flows or radio bearers at the UE may impose a constraint that the delay information be available at the network in addition to the size of buffer data. In this paper, we discuss the different uplink buffer status reporting schemes considered in 3GPP Long Term Evolution (LTE) and the current agreement. We propose modified limited feedback buffer status reporting schemes for delay-constrained radio bearers. Using simulation results, we illustrate that delay information at the network is important for scheduling real-time flows without dropping packets.
{"title":"Uplink Buffer Status Reporting for Delay Constrained Flows in 3GPP Long Term Evolution","authors":"K. V. Pradap, V. Ramachandran, S. Kalyanasundaram","doi":"10.1109/WCNC.2009.4918010","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4918010","url":null,"abstract":"Scheduling of uplink data by the network typically requires that the buffer status information from each User Equipment (UE) is available at the network to ensure that the air interface resources are not wasted. The presence of delay constrained flows or radio bearers at the UE may impose a constraint that the delay information be available at the network in addition to the size of buffer data. In this paper, we discuss the different uplink buffer status reporting schemes considered in 3GPP Long Term Evolution (LTE) and the current agreement. We propose modified limited feedback buffer status reporting schemes for delay-constrained radio bearers. Using simulation results, we illustrate that delay information at the network is important for scheduling real-time flows without dropping packets.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130908154","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917687
Masayuki Hiromoto, Hiroshi Tsutsui, H. Ochi, Tomoyuki Osano, N. Ishikawa, Yukihiro Nakamura
Emerging high-speed mobile networks enable us to receive media streaming data by mobile terminals on demand. However, media streaming with fixed bitrate causes some problems such as annoying artificial noise, interruption, and so forth, since link quality fluctuates dramatically in such mobile networks. Motivated by this, in this paper, we propose a novel media streaming system with dynamic rate control scheme to achieve continuous streaming on such unstable networks. The proposed rate control scheme uses the delay of the transcoding process to estimate network bandwidth, and adjusts the bitrate of media streams dynamically. To demonstrate our system and scheme, the proposed streaming system is evaluated under some typical models of bandwidth change in high-speed mobile networks. The results show that stable and high-quality streaming without interruption can be achieved by the proposed scheme. Moreover, we successfully demonstrate that our system performs continuous streaming on real mobile networks even in the severe network condition such as on a moving train.
{"title":"Dynamic Rate Control for Media Streaming in High-Speed Mobile Networks","authors":"Masayuki Hiromoto, Hiroshi Tsutsui, H. Ochi, Tomoyuki Osano, N. Ishikawa, Yukihiro Nakamura","doi":"10.1109/WCNC.2009.4917687","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917687","url":null,"abstract":"Emerging high-speed mobile networks enable us to receive media streaming data by mobile terminals on demand. However, media streaming with fixed bitrate causes some problems such as annoying artificial noise, interruption, and so forth, since link quality fluctuates dramatically in such mobile networks. Motivated by this, in this paper, we propose a novel media streaming system with dynamic rate control scheme to achieve continuous streaming on such unstable networks. The proposed rate control scheme uses the delay of the transcoding process to estimate network bandwidth, and adjusts the bitrate of media streams dynamically. To demonstrate our system and scheme, the proposed streaming system is evaluated under some typical models of bandwidth change in high-speed mobile networks. The results show that stable and high-quality streaming without interruption can be achieved by the proposed scheme. Moreover, we successfully demonstrate that our system performs continuous streaming on real mobile networks even in the severe network condition such as on a moving train.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130233658","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}
Various handover technologies for heterogeneous wireless networks have been proposed. Most of these technologies are based on mobile IP technology, which reduces the processing time of handovers, network authentication, and service authentication. However, guaranteeing continuity with real-time services and/or video-on-demand services is difficult, particularly when the processing time is reduced by separating the node and network sides. Cooperative processing is therefore needed between the node and network sides or network and service authentication. Moreover, the handover mechanism must provide anonymity to the users of content distribution services. We propose an anonymous handover mechanism and efficient authentication scheme that divides the content key into two data sets and transmits these data sets to the mobile node by way of two paths. We analyze this handover mechanism in this paper.
{"title":"Anonymous Handover Mechanism for Service Mobility in Heterogeneous Wireless Networks","authors":"Toshiyuki Fujisawa, Masaki Inamura, Toshiaki Tanaka","doi":"10.1109/WCNC.2009.4917600","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917600","url":null,"abstract":"Various handover technologies for heterogeneous wireless networks have been proposed. Most of these technologies are based on mobile IP technology, which reduces the processing time of handovers, network authentication, and service authentication. However, guaranteeing continuity with real-time services and/or video-on-demand services is difficult, particularly when the processing time is reduced by separating the node and network sides. Cooperative processing is therefore needed between the node and network sides or network and service authentication. Moreover, the handover mechanism must provide anonymity to the users of content distribution services. We propose an anonymous handover mechanism and efficient authentication scheme that divides the content key into two data sets and transmits these data sets to the mobile node by way of two paths. We analyze this handover mechanism in this paper.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127844908","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917707
Ruifeng Zhang, J. Gorce, R. Dong, K. Jaffrès-Runser
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes to cooperate, thus using spatial diversity to increase the capacity of the system. However, this approach introduces an overhead in terms of information exchange, increasing the complexity of the receivers. A simpler way of exploiting spatial diversity is referred to as opportunistic routing. In this scheme, a cluster of nodes still serves as relay candidates but only a single node in the cluster forwards the packet. In this paper, we put forward an analytical framework to optimize the opportunistic communication scheme in order to minimize the energy consumption. Meanwhile, the optimizations of node density and the transmission power are analyzed for different ranges of relay candidates in Rayleigh block fading and Additive White Gaussian Noise (AWGN) channels. In the energy consumption viewpoint, the analyses indicate that the opportunistic communication is more efficient in Rayleigh block fading channel than that in AWGN channel.
{"title":"Energy Efficiency of Opportunistic Routing with Unreliable Links","authors":"Ruifeng Zhang, J. Gorce, R. Dong, K. Jaffrès-Runser","doi":"10.1109/WCNC.2009.4917707","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917707","url":null,"abstract":"During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes to cooperate, thus using spatial diversity to increase the capacity of the system. However, this approach introduces an overhead in terms of information exchange, increasing the complexity of the receivers. A simpler way of exploiting spatial diversity is referred to as opportunistic routing. In this scheme, a cluster of nodes still serves as relay candidates but only a single node in the cluster forwards the packet. In this paper, we put forward an analytical framework to optimize the opportunistic communication scheme in order to minimize the energy consumption. Meanwhile, the optimizations of node density and the transmission power are analyzed for different ranges of relay candidates in Rayleigh block fading and Additive White Gaussian Noise (AWGN) channels. In the energy consumption viewpoint, the analyses indicate that the opportunistic communication is more efficient in Rayleigh block fading channel than that in AWGN channel.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"37 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131727180","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917902
Nuan Song, M. Wolf, M. Haardt
We consider a low data rate non-coherent Impulse Radio Ultra-Wideband (IR-UWB) system based on Binary Pulse Position Modulation (2-PPM), which applies sparse codes to enable Code Division Multiple Access (CDMA). The suitability of sparse codes (i.e., codes with a low code weight) is investigated considering Multi-User Interference (MUI) and multipath propagation. The decoding of the particular CDMA code takes place after non-coherent combining. Different sparse codes such as Time Hopping (TH) Random Codes, TH codes constructed from M-Sequences, and optical orthogonal codes are employed. We propose a semi-analytical performance analysis method using Gaussian approximation and the statistics of the code collisions to obtain the bit error rate expressions, which is much more accurate than the Code Correlation Function. The multiple access performance is analyzed in terms of the Signal-to-Noise Ratio (SNR) as well as the number of supported users.
{"title":"Performance of PPM-Based Non-Coherent Impulse Radio UWB Systems using Sparse Codes in the Presence of Multi-User Interference","authors":"Nuan Song, M. Wolf, M. Haardt","doi":"10.1109/WCNC.2009.4917902","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917902","url":null,"abstract":"We consider a low data rate non-coherent Impulse Radio Ultra-Wideband (IR-UWB) system based on Binary Pulse Position Modulation (2-PPM), which applies sparse codes to enable Code Division Multiple Access (CDMA). The suitability of sparse codes (i.e., codes with a low code weight) is investigated considering Multi-User Interference (MUI) and multipath propagation. The decoding of the particular CDMA code takes place after non-coherent combining. Different sparse codes such as Time Hopping (TH) Random Codes, TH codes constructed from M-Sequences, and optical orthogonal codes are employed. We propose a semi-analytical performance analysis method using Gaussian approximation and the statistics of the code collisions to obtain the bit error rate expressions, which is much more accurate than the Code Correlation Function. The multiple access performance is analyzed in terms of the Signal-to-Noise Ratio (SNR) as well as the number of supported users.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128800911","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917583
J. Zhou, M. Gurcan
A novel two group bit loading algorithm is proposed for use in a multicode CDMA transmission method at the physical layer in order to improve an adhoc radio system performance. The proposed algorithm provides better data rates than rates achievable with the current HSDPA type of algorithm. The paper also proposes a MAC layer enhancement for use in an adhoc network to improve the total throughput by as much as 10 times by increasing the payload duration for the transmission packets. The throughput increases rapidly for a small packet size and reaches an asymptotic value for large packets.
{"title":"An Improved Multicode CDMA Transmission Method for Ad Hoc Networks","authors":"J. Zhou, M. Gurcan","doi":"10.1109/WCNC.2009.4917583","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917583","url":null,"abstract":"A novel two group bit loading algorithm is proposed for use in a multicode CDMA transmission method at the physical layer in order to improve an adhoc radio system performance. The proposed algorithm provides better data rates than rates achievable with the current HSDPA type of algorithm. The paper also proposes a MAC layer enhancement for use in an adhoc network to improve the total throughput by as much as 10 times by increasing the payload duration for the transmission packets. The throughput increases rapidly for a small packet size and reaches an asymptotic value for large packets.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128849398","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917933
G. Dai, W. Mow
To improve the efficiency and simplify the complexity of the relay in cooperative communication systems, an one-bit soft forwarding (SF) scheme is proposed to exploit the erroneously decoded packets that are normally abandoned by the selection decode-and-forward (DF) scheme at the relay, as side information to assist decoding of the direct-link packet at the basestation. As this side information from relay is encoded and transmitted in the same format as the usual data packet, the proposed SF scheme can be implemented with the same coding scheme and same encoder/decoder as the DF scheme. It only requires the additional transmission of a packet reliability value from the relay to the basestation, unlike the previous soft relaying schemes which require more complicated soft output decoding and signaling format. The new scheme not only allows low complexity implementation, but also offers considerable error performance gain. Simulation results demonstrate that our SF scheme outperforms the selection DF by up to 2 dB, especially when the inter-link channel is poor.
{"title":"Realizing Wireless Cooperative Communications with the One-Bit Soft Forwarding Technique","authors":"G. Dai, W. Mow","doi":"10.1109/WCNC.2009.4917933","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917933","url":null,"abstract":"To improve the efficiency and simplify the complexity of the relay in cooperative communication systems, an one-bit soft forwarding (SF) scheme is proposed to exploit the erroneously decoded packets that are normally abandoned by the selection decode-and-forward (DF) scheme at the relay, as side information to assist decoding of the direct-link packet at the basestation. As this side information from relay is encoded and transmitted in the same format as the usual data packet, the proposed SF scheme can be implemented with the same coding scheme and same encoder/decoder as the DF scheme. It only requires the additional transmission of a packet reliability value from the relay to the basestation, unlike the previous soft relaying schemes which require more complicated soft output decoding and signaling format. The new scheme not only allows low complexity implementation, but also offers considerable error performance gain. Simulation results demonstrate that our SF scheme outperforms the selection DF by up to 2 dB, especially when the inter-link channel is poor.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125439478","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 : 2009-04-05DOI: 10.1109/WCNC.2009.4917872
A. Platonov
The work presents a new approach to the concurrent optimization and design of transmitting and receiving parts of the adaptive communication systems (ACS). There is shown that optimal ACS used in the threshold mode provide, under given BER, a bit rate equal to the capacity of the forward channel.
{"title":"Optimization of Adaptive Communication Systems with Feedback Channels","authors":"A. Platonov","doi":"10.1109/WCNC.2009.4917872","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917872","url":null,"abstract":"The work presents a new approach to the concurrent optimization and design of transmitting and receiving parts of the adaptive communication systems (ACS). There is shown that optimal ACS used in the threshold mode provide, under given BER, a bit rate equal to the capacity of the forward channel.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"PP 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126674222","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
扫码关注我们
求助内容：
应助结果提醒方式：