Pub Date : 2011-12-22DOI: 10.1109/ICC.2011.5963398
Hamid Mahboobi Baghdad Abad, Kaveh Moezzi, A. Aghdam, K. Sayrafian-Pour
In this paper, efficient deployment algorithms are proposed for a mobile sensor network to improve coverage. The proposed algorithms calculate the position of the sensors iteratively based on the existing coverage holes in the target field. The multiplicatively weighted Voronoi diagram (MW-Voronoi diagram) is used to discover the coverage holes corresponding to different sensors with different sensing ranges. The algorithms proposed in this paper consider the distances of each sensor and the points inside its corresponding MW-Voronoi region from the boundary curves of the region. Under the proposed algorithms, the sensors move in such a way that the coverage holes in the target field are reduced. Simulations confirm the effectiveness of the deployment algorithms proposed in this paper.
{"title":"Self-Deployment Algorithms for Field Coverage in a Network of Nonidentical Mobile Sensors","authors":"Hamid Mahboobi Baghdad Abad, Kaveh Moezzi, A. Aghdam, K. Sayrafian-Pour","doi":"10.1109/ICC.2011.5963398","DOIUrl":"https://doi.org/10.1109/ICC.2011.5963398","url":null,"abstract":"In this paper, efficient deployment algorithms are proposed for a mobile sensor network to improve coverage. The proposed algorithms calculate the position of the sensors iteratively based on the existing coverage holes in the target field. The multiplicatively weighted Voronoi diagram (MW-Voronoi diagram) is used to discover the coverage holes corresponding to different sensors with different sensing ranges. The algorithms proposed in this paper consider the distances of each sensor and the points inside its corresponding MW-Voronoi region from the boundary curves of the region. Under the proposed algorithms, the sensors move in such a way that the coverage holes in the target field are reduced. Simulations confirm the effectiveness of the deployment algorithms proposed in this paper.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121462412","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 : 2011-07-29DOI: 10.1109/icc.2011.5962806
Osman Yağan, A. Makowski
We investigate the secure connectivity of wireless sensor networks under the pairwise key distribution scheme of Chan et al.. Unlike recent work which was carried out under the assumption of full visibility, here we assume a (simplified) communication model where unreliable wireless links are represented as on/off channels. We present conditions on how to scale the model parameters so that the network i) has no secure node which is isolated, and ii) is securely connected, both with high probability when the number of sensor nodes becomes large. The results are given in the form of zero-one laws, and exhibit significant differences with corresponding results in the full visibility case.
{"title":"Designing Securely Connected Wireless Sensor Networks in the Presence of Unreliable Links","authors":"Osman Yağan, A. Makowski","doi":"10.1109/icc.2011.5962806","DOIUrl":"https://doi.org/10.1109/icc.2011.5962806","url":null,"abstract":"We investigate the secure connectivity of wireless sensor networks under the pairwise key distribution scheme of Chan et al.. Unlike recent work which was carried out under the assumption of full visibility, here we assume a (simplified) communication model where unreliable wireless links are represented as on/off channels. We present conditions on how to scale the model parameters so that the network i) has no secure node which is isolated, and ii) is securely connected, both with high probability when the number of sensor nodes becomes large. The results are given in the form of zero-one laws, and exhibit significant differences with corresponding results in the full visibility case.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129311476","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 : 2011-07-29DOI: 10.1109/icc.2011.5963415
Lingyang Song
In this paper, we propose a relay selection amplify-and-forward (RS-AF) protocol in general bi-directional relay networks with two sources and $N$ relays. In the proposed scheme, the two sources first transmit to all the relays simultaneously, and then a single relay will be selected to broadcast the received signals back to both sources to achieve a minimum sum symbol error rate (SER). To facilitate the selection process, we propose sub-optimal Max-Min criterions, where a single relay which minimizes the maximum SER of two source nodes will be selected. Simulation results show that the proposed Max-Min selection approaches can obtain comparable performance as the optimal selection with a reduced-complexity. We also present simple asymptotic SER expressions and make comparison with the conventional all-participate amplify-and-forward (AP-AF) relaying scheme. The analytical results are verified through simulations. To improve the system performance, optimum power allocation (OPA) between the sources and the relay is determined based on the analytical results. Simulations indicate that the proposed RS-AF scheme with OPA yields considerable performance improvement over an equal power allocation (EPA) scheme.
{"title":"Relay Selection for Bi-Directional Amplify-and-Forward Wireless Networks","authors":"Lingyang Song","doi":"10.1109/icc.2011.5963415","DOIUrl":"https://doi.org/10.1109/icc.2011.5963415","url":null,"abstract":"In this paper, we propose a relay selection amplify-and-forward (RS-AF) protocol in general bi-directional relay networks with two sources and $N$ relays. In the proposed scheme, the two sources first transmit to all the relays simultaneously, and then a single relay will be selected to broadcast the received signals back to both sources to achieve a minimum sum symbol error rate (SER). To facilitate the selection process, we propose sub-optimal Max-Min criterions, where a single relay which minimizes the maximum SER of two source nodes will be selected. Simulation results show that the proposed Max-Min selection approaches can obtain comparable performance as the optimal selection with a reduced-complexity. We also present simple asymptotic SER expressions and make comparison with the conventional all-participate amplify-and-forward (AP-AF) relaying scheme. The analytical results are verified through simulations. To improve the system performance, optimum power allocation (OPA) between the sources and the relay is determined based on the analytical results. Simulations indicate that the proposed RS-AF scheme with OPA yields considerable performance improvement over an equal power allocation (EPA) scheme.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121516208","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 : 2011-07-29DOI: 10.1109/icc.2011.5963081
Chul-Ho Lee, Do Young Eun
In wireless sensor networks (WSNs), sensor nodes are typically power-constrained with limited lifetime, and thus it is necessary to know how long the network sustains its networking operations. We consider the network lifetime as the time until that a majority of functional nodes remains connected of one another, forming a giant component, in the network. We then analytically examine such network lifetime of a large-scale WSN via the theory of site percolation on a random graph model with a given degree distribution. In particular, we develop an analytical framework to quantify the network lifetime if the node lifetime can be controlled based on its degree, and show in theory and simulation that, by properly exploiting the heterogeneity over the node degrees, we can always increase the network lifetime when compared with that under the comparable degree-independent node lifetime.
{"title":"Exploiting Heterogeneity to Prolong the Lifetime of Large-Scale Wireless Sensor Networks","authors":"Chul-Ho Lee, Do Young Eun","doi":"10.1109/icc.2011.5963081","DOIUrl":"https://doi.org/10.1109/icc.2011.5963081","url":null,"abstract":"In wireless sensor networks (WSNs), sensor nodes are typically power-constrained with limited lifetime, and thus it is necessary to know how long the network sustains its networking operations. We consider the network lifetime as the time until that a majority of functional nodes remains connected of one another, forming a giant component, in the network. We then analytically examine such network lifetime of a large-scale WSN via the theory of site percolation on a random graph model with a given degree distribution. In particular, we develop an analytical framework to quantify the network lifetime if the node lifetime can be controlled based on its degree, and show in theory and simulation that, by properly exploiting the heterogeneity over the node degrees, we can always increase the network lifetime when compared with that under the comparable degree-independent node lifetime.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116937494","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 : 2011-06-05DOI: 10.1109/icc.2011.5962443
G. Liva, P. Pulini, M. Chiani
In many applications erasure correcting codes are used to recover packet losses at high protocol stack layers. The objects (e.g. files) to be transmitted often have variable sizes, resulting in a variable number of packet to be encoded by the packet-level encoder. In this paper, algorithms for the (on-line) flexible design of parity-check matrices for irregular-repeat-accumulate codes are investigated. The proposed algorithms allow designing in fast manner parity-check matrices that are suitable for low-complexity maximum-likelihood decoding. The code ensembles generated by the proposed algorithms are analyzed via extrinsic information transfer charts. Numerical results show how the designed codes can attain codeword error rates as low as 10^{-5} without appreciable losses w.r.t. the performance of idealized maximum-distance separable codes. The application of the proposed techniques to the upcoming aeronautical communication standard is investigated, proving the efficiency and the flexibility of the approach.
{"title":"Flexible On-Line Construction of IRA Codes for Packet Erasure Correction with Application to Aeronautical Communications","authors":"G. Liva, P. Pulini, M. Chiani","doi":"10.1109/icc.2011.5962443","DOIUrl":"https://doi.org/10.1109/icc.2011.5962443","url":null,"abstract":"In many applications erasure correcting codes are used to recover packet losses at high protocol stack layers. The objects (e.g. files) to be transmitted often have variable sizes, resulting in a variable number of packet to be encoded by the packet-level encoder. In this paper, algorithms for the (on-line) flexible design of parity-check matrices for irregular-repeat-accumulate codes are investigated. The proposed algorithms allow designing in fast manner parity-check matrices that are suitable for low-complexity maximum-likelihood decoding. The code ensembles generated by the proposed algorithms are analyzed via extrinsic information transfer charts. Numerical results show how the designed codes can attain codeword error rates as low as 10^{-5} without appreciable losses w.r.t. the performance of idealized maximum-distance separable codes. The application of the proposed techniques to the upcoming aeronautical communication standard is investigated, proving the efficiency and the flexibility of the approach.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114967408","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 : 2011-06-05DOI: 10.1109/icc.2011.5962547
Juemin Zhang, N. Mi, Jianzhe Tai, W. Meleis
Bursty workloads are often observed in a variety of systems such as grid services, multi-tier architectures, and large storage systems. Studies have shown that such burstiness can dramatically degrade system performance because of overloading, increased response time, and unavailable service. Computing grids, which often use distributed, autonomous resource management, are particularly susceptible to load imbalances caused by bursty workloads. In this paper, we use a simulation environment to investigate the performance of decentralized schedulers under various intensity levels of burstiness. We first demonstrate a significant performance degradation in the presence of strong and moderate bursty workloads. Then, we describe two new hybrid schedulers, based on duplication-invalidation, and assess the effectiveness of these schedulers under different intensities of burstiness. Our simulation results show that compared to the conventional decentralized methods, the proposed schedulers achieve a 40% performance improvement under the bursty condition while obtaining similar performance in non-bursty conditions.
{"title":"Decentralized Scheduling of Bursty Workload on Computing Grids","authors":"Juemin Zhang, N. Mi, Jianzhe Tai, W. Meleis","doi":"10.1109/icc.2011.5962547","DOIUrl":"https://doi.org/10.1109/icc.2011.5962547","url":null,"abstract":"Bursty workloads are often observed in a variety of systems such as grid services, multi-tier architectures, and large storage systems. Studies have shown that such burstiness can dramatically degrade system performance because of overloading, increased response time, and unavailable service. Computing grids, which often use distributed, autonomous resource management, are particularly susceptible to load imbalances caused by bursty workloads. In this paper, we use a simulation environment to investigate the performance of decentralized schedulers under various intensity levels of burstiness. We first demonstrate a significant performance degradation in the presence of strong and moderate bursty workloads. Then, we describe two new hybrid schedulers, based on duplication-invalidation, and assess the effectiveness of these schedulers under different intensities of burstiness. Our simulation results show that compared to the conventional decentralized methods, the proposed schedulers achieve a 40% performance improvement under the bursty condition while obtaining similar performance in non-bursty conditions.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115125378","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 : 2011-06-05DOI: 10.1109/icc.2011.5962622
Lingyang Song, Zhu Han, Qihao Li, B. Jiao
It has been well recognized that channel state information (CSI) feedback is important for dowlink transmissions of closed-loop wireless networks. In this paper, we investigate the CSI feedback rate control problem in the analytical setting of a game theoretic framework, where a multiple-antenna base station (BS) communicates with a number of co-channel mobile stations (MS) through a minimum mean square error~(MMSE) precoder. Specifically, we present a non-cooperative feedback-rate control game with price (NFCP) over orthogonal feedback channels with a total bandwidth constraint. The game utility is defined as the performance gain by CSI feedback minus the price as a linear function of the CSI feedback rate, subject to an overall bandwidth constraint. The existence of the Nash equilibrium of such a game is investigated. Simulation results show that the distributed game approach results in close optimal performance compared with the centralized scheme.
{"title":"Feedback Control Game for Channel State Information in Wireless Networks","authors":"Lingyang Song, Zhu Han, Qihao Li, B. Jiao","doi":"10.1109/icc.2011.5962622","DOIUrl":"https://doi.org/10.1109/icc.2011.5962622","url":null,"abstract":"It has been well recognized that channel state information (CSI) feedback is important for dowlink transmissions of closed-loop wireless networks. In this paper, we investigate the CSI feedback rate control problem in the analytical setting of a game theoretic framework, where a multiple-antenna base station (BS) communicates with a number of co-channel mobile stations (MS) through a minimum mean square error~(MMSE) precoder. Specifically, we present a non-cooperative feedback-rate control game with price (NFCP) over orthogonal feedback channels with a total bandwidth constraint. The game utility is defined as the performance gain by CSI feedback minus the price as a linear function of the CSI feedback rate, subject to an overall bandwidth constraint. The existence of the Nash equilibrium of such a game is investigated. Simulation results show that the distributed game approach results in close optimal performance compared with the centralized scheme.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115142353","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 : 2011-06-05DOI: 10.1109/icc.2011.5963060
Chun-Kai Tseng, Sau-Hsuan Wu
In contrast to the outage analysis, the packet error rates (PERs) of two types of cooperative automatic retransmission request (ARQ) protocols with opportunistic selective amplified-and-forward (OSAF) relaying are investigated from the perspective of the maximum likelihood sequence detection (MLSD). The results show that PERs with the threshold requirements derived from the outage analysis cannot benefit from the diversity via opportunistic retransmissions. Based on the PER analysis, effective threshold setting methods for the two types of ARQs are developed to avoid the diversity losses during ARQs, and verified via simulations using convolutional codes. In contrast to the ARQ protocols with the typical opportunistic AF relaying, the new threshold setting methods allow the OSAF ARQ protocols to provide for practical systems a spatial and temporal diversity comparable to what predicts with the outage analysis.
{"title":"Effective Cooperative ARQ Protocols with the Opportunistic Selective AF Relaying: The Perspectives of Outage versus Packet Error Probabilities","authors":"Chun-Kai Tseng, Sau-Hsuan Wu","doi":"10.1109/icc.2011.5963060","DOIUrl":"https://doi.org/10.1109/icc.2011.5963060","url":null,"abstract":"In contrast to the outage analysis, the packet error rates (PERs) of two types of cooperative automatic retransmission request (ARQ) protocols with opportunistic selective amplified-and-forward (OSAF) relaying are investigated from the perspective of the maximum likelihood sequence detection (MLSD). The results show that PERs with the threshold requirements derived from the outage analysis cannot benefit from the diversity via opportunistic retransmissions. Based on the PER analysis, effective threshold setting methods for the two types of ARQs are developed to avoid the diversity losses during ARQs, and verified via simulations using convolutional codes. In contrast to the ARQ protocols with the typical opportunistic AF relaying, the new threshold setting methods allow the OSAF ARQ protocols to provide for practical systems a spatial and temporal diversity comparable to what predicts with the outage analysis.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115169587","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 : 2011-06-05DOI: 10.1109/icc.2011.5962722
Abdelkader Lahmadi, Laurent Delosières, O. Festor
We present a defense platform against text-based message SPAM on SmartPhones. We focus in particular on Short Message Service (SMS) based SPAM. Our solution relies on a social network based collaborative approach to filter this type of spam using Bloom filters and content hashing. We detail the design of the supporting framework and validate its efficiency in minimizing false positive and limiting the storage space.
{"title":"Hinky: Defending against Text-Based Message Spam on Smartphones","authors":"Abdelkader Lahmadi, Laurent Delosières, O. Festor","doi":"10.1109/icc.2011.5962722","DOIUrl":"https://doi.org/10.1109/icc.2011.5962722","url":null,"abstract":"We present a defense platform against text-based message SPAM on SmartPhones. We focus in particular on Short Message Service (SMS) based SPAM. Our solution relies on a social network based collaborative approach to filter this type of spam using Bloom filters and content hashing. We detail the design of the supporting framework and validate its efficiency in minimizing false positive and limiting the storage space.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124361523","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 : 2011-06-05DOI: 10.1109/icc.2011.5962687
Xinlei Chen, Xiyu Lu, Depeng Jin, L. Su, Lieguang Zeng
This paper presents channel measurements for wireless body area network (WBAN) and provides performance evaluation using the model derived from measurement and the model in the final document of the IEEE802.15.6 channel modeling subcommittee. We measure the radio propagation from 3.0GHz to 5.0GHz which falls in ultra-wideband (UWB) frequency range in an anechoic chamber and give out a static model. 10 positions for medical entertainment and sports application are chosen to conduct measurement on a fat body, a normal body and a thin body in order to compare different path loss of different types of body for Chinese people. Moreover, we compare the bit error ratio (BER) of a single carrier UWB (SC-UWB) system which employs different receiving policies such as rake, equalizer and channel coding. The results show that slimmer people cause less path loss in the valid distance from 100mm to 1000mm. The measured model we derived has less multi-path effect than that of the model in the final report given by IEEE802.15.6 channel modeling subcommittee. Even though, rake receiver, equalizer and channel coding are needed to get a satisfying system performance.
{"title":"Channel Modeling of UWB-Based Wireless Body Area Networks","authors":"Xinlei Chen, Xiyu Lu, Depeng Jin, L. Su, Lieguang Zeng","doi":"10.1109/icc.2011.5962687","DOIUrl":"https://doi.org/10.1109/icc.2011.5962687","url":null,"abstract":"This paper presents channel measurements for wireless body area network (WBAN) and provides performance evaluation using the model derived from measurement and the model in the final document of the IEEE802.15.6 channel modeling subcommittee. We measure the radio propagation from 3.0GHz to 5.0GHz which falls in ultra-wideband (UWB) frequency range in an anechoic chamber and give out a static model. 10 positions for medical entertainment and sports application are chosen to conduct measurement on a fat body, a normal body and a thin body in order to compare different path loss of different types of body for Chinese people. Moreover, we compare the bit error ratio (BER) of a single carrier UWB (SC-UWB) system which employs different receiving policies such as rake, equalizer and channel coding. The results show that slimmer people cause less path loss in the valid distance from 100mm to 1000mm. The measured model we derived has less multi-path effect than that of the model in the final report given by IEEE802.15.6 channel modeling subcommittee. Even though, rake receiver, equalizer and channel coding are needed to get a satisfying system performance.","PeriodicalId":336561,"journal":{"name":"2011 IEEE International Conference on Communications (ICC)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123068268","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
扫码关注我们
求助内容：
应助结果提醒方式：