Pub Date : 2009-04-05DOI: 10.1109/WCNC.2009.4917972
Rizwan Ghaffar, R. Knopp
Future wireless communication systems characterized by tight frequency reuse, adaptive modulation and coding schemes and diversified data services will be interference limited by interfering signals of diverse rates and strengths. We propose in this paper a low complexity algorithm for spatial interference cancellation in the presence of one strong interferer. This algorithm is based on an earlier proposed low complexity max log MAP detector. It encompasses two strategies for interference cancellation which have been termed as partial interference cancellation (PIC) and absolute interference cancellation (AIC). Their corresponding selection in the receiver is dictated by the relative strength and the rate of interfering stream. In the scenario of interfering stream being relatively weak or of higher rate as compared to the desired stream, the mobile station (MS) resorts to PIC while when the interfering stream is relatively stronger or is of lower rate, the MS switches to AIC. Finally we analyze the performance of proposed algorithm by simulations.
{"title":"Spatial Interference Cancellation Algorithm","authors":"Rizwan Ghaffar, R. Knopp","doi":"10.1109/WCNC.2009.4917972","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917972","url":null,"abstract":"Future wireless communication systems characterized by tight frequency reuse, adaptive modulation and coding schemes and diversified data services will be interference limited by interfering signals of diverse rates and strengths. We propose in this paper a low complexity algorithm for spatial interference cancellation in the presence of one strong interferer. This algorithm is based on an earlier proposed low complexity max log MAP detector. It encompasses two strategies for interference cancellation which have been termed as partial interference cancellation (PIC) and absolute interference cancellation (AIC). Their corresponding selection in the receiver is dictated by the relative strength and the rate of interfering stream. In the scenario of interfering stream being relatively weak or of higher rate as compared to the desired stream, the mobile station (MS) resorts to PIC while when the interfering stream is relatively stronger or is of lower rate, the MS switches to AIC. Finally we analyze the performance of proposed algorithm by simulations.","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":"123888686","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.4917596
Vasken Genc, S. Murphy, John Murphy
In this paper, the system capacity of IEEE 802.16j systems operating in transparent mode is investigated under varying numbers of relays and associated transmit power. The study is based on an extended variant of an analytical model defined in previous work and used to determine the throughput gain that can be achieved under a max-min fairness constraint. The study finds that significant overall throughput gains can be achieved over 802.16e systems: 125% and 55% gain with and without spatial reuse, respectively. However, the overall throughput gain drops as the transmit power at the relays (RSs) decreases despite the fact that a greater number of concurrent transmissions can be achieved due to less interference among the RSs' transmissions. Decreasing the transmit power at the RSs eventually leads to a significant reduction of the achievable throughput gain even though a large number of RSs are deployed in scenarios with or without spatial reuse.
{"title":"Analysis of Transparent Mode IEEE 802.16j System Performance with Varying Numbers of Relays and Associated Transmit Power","authors":"Vasken Genc, S. Murphy, John Murphy","doi":"10.1109/WCNC.2009.4917596","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917596","url":null,"abstract":"In this paper, the system capacity of IEEE 802.16j systems operating in transparent mode is investigated under varying numbers of relays and associated transmit power. The study is based on an extended variant of an analytical model defined in previous work and used to determine the throughput gain that can be achieved under a max-min fairness constraint. The study finds that significant overall throughput gains can be achieved over 802.16e systems: 125% and 55% gain with and without spatial reuse, respectively. However, the overall throughput gain drops as the transmit power at the relays (RSs) decreases despite the fact that a greater number of concurrent transmissions can be achieved due to less interference among the RSs' transmissions. Decreasing the transmit power at the RSs eventually leads to a significant reduction of the achievable throughput gain even though a large number of RSs are deployed in scenarios with or without spatial reuse.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"33 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":"125292002","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.4917522
V. Corvino, D. Gesbert, R. Verdone
This paper introduces a new method for distributed interference mitigation in full spectral-reuse OFDMA cellular networks. This considers the use of pre-defined frequency-domain power profiles helping make the interference more predictable across the subcarriers. We propose a method for computing the power profiles so as to maximize the capacity of the system in case of maximum throughput scheduling, and a simple linear model implemented also in presence of a fairness-oriented scheduler. We prove that our idea of power planning gives substantial improvements in terms of outage capacity in case of fairness-oriented scheduling. The advantage of our method over previously proposed approaches for interference mitigation based on power control is that our algorithm is fully distributed and does not require any exchange of signaling between the different cells.
{"title":"A Novel Distributed Interference Mitigation Technique using Power Planning","authors":"V. Corvino, D. Gesbert, R. Verdone","doi":"10.1109/WCNC.2009.4917522","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917522","url":null,"abstract":"This paper introduces a new method for distributed interference mitigation in full spectral-reuse OFDMA cellular networks. This considers the use of pre-defined frequency-domain power profiles helping make the interference more predictable across the subcarriers. We propose a method for computing the power profiles so as to maximize the capacity of the system in case of maximum throughput scheduling, and a simple linear model implemented also in presence of a fairness-oriented scheduler. We prove that our idea of power planning gives substantial improvements in terms of outage capacity in case of fairness-oriented scheduling. The advantage of our method over previously proposed approaches for interference mitigation based on power control is that our algorithm is fully distributed and does not require any exchange of signaling between the different cells.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"116 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":"122634275","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.4917810
Yulei Wu, G. Min, Guojun Wang, Jianmin Jiang
Wireless Mesh Networks (WMNs) have been proposed to provide rapid deployment and easy reconfiguration of wireless broadband communications. WMNs can interoperate with WiMAX, Wi-Fi, sensor, or cellular networks in the hybrid working environments to relay packets robustly among these heterogeneous networks and significantly extend the coverage of individual wireless access networks. Many recent studies have shown that the packet arrival process in wireless networks exhibits the batch arrival nature and the communication locality has an important impact on the network capacity. With the aim of obtaining an effective performance evaluation tool of wireless networks, this paper proposes an analytical model for heterogeneous wireless networks integrated by WMNs in the presence of batch arrival traffic with communication locality. The validity of the analytical model is demonstrated through extensive comparison between analytical and simulation results.
{"title":"Modelling of Heterogeneous Wireless Networks under Batch Arrival Traffic with Communication Locality","authors":"Yulei Wu, G. Min, Guojun Wang, Jianmin Jiang","doi":"10.1109/WCNC.2009.4917810","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917810","url":null,"abstract":"Wireless Mesh Networks (WMNs) have been proposed to provide rapid deployment and easy reconfiguration of wireless broadband communications. WMNs can interoperate with WiMAX, Wi-Fi, sensor, or cellular networks in the hybrid working environments to relay packets robustly among these heterogeneous networks and significantly extend the coverage of individual wireless access networks. Many recent studies have shown that the packet arrival process in wireless networks exhibits the batch arrival nature and the communication locality has an important impact on the network capacity. With the aim of obtaining an effective performance evaluation tool of wireless networks, this paper proposes an analytical model for heterogeneous wireless networks integrated by WMNs in the presence of batch arrival traffic with communication locality. The validity of the analytical model is demonstrated through extensive comparison between analytical and simulation results.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"111 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":"131156565","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.4917606
Seungjae Shin, Junbeom Hur, Hanjin Lee, H. Yoon
In the near future, various multicast based services will be provided over wireless mesh networks. For secure multicast services, various tree based group key management schemes have been introduced until now. Traditional tree based approaches mainly focus on reducing the number of rekeying messages transmitted by the key distribution center. However, they do not consider the network bandwidth used for transmitting each rekeying message.We propose a bandwidth efficient key tree management scheme for dynamic wireless mesh networks where membership changes occur frequently. Simulation results show that our scheme effectively reduces the bandwidth consumption used for rekeying compared to existing key tree schemes.
{"title":"Bandwidth Efficient Key Distribution for Secure Multicast in Dynamic Wireless Mesh Networks","authors":"Seungjae Shin, Junbeom Hur, Hanjin Lee, H. Yoon","doi":"10.1109/WCNC.2009.4917606","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917606","url":null,"abstract":"In the near future, various multicast based services will be provided over wireless mesh networks. For secure multicast services, various tree based group key management schemes have been introduced until now. Traditional tree based approaches mainly focus on reducing the number of rekeying messages transmitted by the key distribution center. However, they do not consider the network bandwidth used for transmitting each rekeying message.We propose a bandwidth efficient key tree management scheme for dynamic wireless mesh networks where membership changes occur frequently. Simulation results show that our scheme effectively reduces the bandwidth consumption used for rekeying compared to existing key tree schemes.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"35 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":"131762495","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.4917912
D. J. Kadhim, Shimin Gong, Wenfang Xia, Wei Liu, W. Cheng
Cognitive radio technology is used to improve spectrum efficiency by having the cognitive radios act as secondary users to access primary frequency bands when they are not currently being used. In general conditions, cognitive secondary users are mobile nodes powered by battery and consuming power is one of the most important problem that facing cognitive networks; therefore, the power consumption is considered as a main constraint. In this paper, we study the performance of cognitive radio networks considering the sensing parameters as well as power constraint. The power constraint is integrated into the objective function named power efficiency which is a combination of the main system parameters of the cognitive network. We prove the existence of optimal combination of parameters such that the power efficiency is maximized. Then we reformulate the objective function to incorporate the throughput. According to different constraints or degree of significance, we may put proper weight to each term so that we could obtain more preferable combination of parameters. Computer simulations have given the optimal solution curve for different weights. We can draw the conclusion that if we put more emphasis on power efficiency, the transmit power is a more critical parameter, however if throughput is more important, the effect of sensing time is significant.
{"title":"Power Efficiency Maximization in Cognitive Radio Networks","authors":"D. J. Kadhim, Shimin Gong, Wenfang Xia, Wei Liu, W. Cheng","doi":"10.1109/WCNC.2009.4917912","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917912","url":null,"abstract":"Cognitive radio technology is used to improve spectrum efficiency by having the cognitive radios act as secondary users to access primary frequency bands when they are not currently being used. In general conditions, cognitive secondary users are mobile nodes powered by battery and consuming power is one of the most important problem that facing cognitive networks; therefore, the power consumption is considered as a main constraint. In this paper, we study the performance of cognitive radio networks considering the sensing parameters as well as power constraint. The power constraint is integrated into the objective function named power efficiency which is a combination of the main system parameters of the cognitive network. We prove the existence of optimal combination of parameters such that the power efficiency is maximized. Then we reformulate the objective function to incorporate the throughput. According to different constraints or degree of significance, we may put proper weight to each term so that we could obtain more preferable combination of parameters. Computer simulations have given the optimal solution curve for different weights. We can draw the conclusion that if we put more emphasis on power efficiency, the transmit power is a more critical parameter, however if throughput is more important, the effect of sensing time is significant.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"166 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":"116528359","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.4917983
G. Egeland, P. Engelstad
Due to frequent link failures in multi-hop wireless networks, redundancy can be an important feature. For example, when planning the structure of a backhaul mesh network for public access, it is common to introduce redundant nodes in the mesh network. These are called redundant, because they do not increase the network capacity under normal operation, due to the shortest-path metric of the routing protocol. Instead, their sole purpose is to increase the network reliability by providing failover links when a link in the shortest-path fails. This paper shows how to estimate the optimal number of redundant nodes for a given topology. In order to do so, a method to calculate the additional network reliability that results from introducing a redundant node to a given topology is also proposed.
{"title":"The Economy of Redundancy in Wireless Multi-Hop Networks","authors":"G. Egeland, P. Engelstad","doi":"10.1109/WCNC.2009.4917983","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917983","url":null,"abstract":"Due to frequent link failures in multi-hop wireless networks, redundancy can be an important feature. For example, when planning the structure of a backhaul mesh network for public access, it is common to introduce redundant nodes in the mesh network. These are called redundant, because they do not increase the network capacity under normal operation, due to the shortest-path metric of the routing protocol. Instead, their sole purpose is to increase the network reliability by providing failover links when a link in the shortest-path fails. This paper shows how to estimate the optimal number of redundant nodes for a given topology. In order to do so, a method to calculate the additional network reliability that results from introducing a redundant node to a given topology is also proposed.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"57 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":"127573733","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.4917666
Wei Wang, B. Soong, Y. Chan
Based on the technology of Mobile Ad-hoc Network (MANET), we design and implement an Audio Conferencing Testbed (ACT) that is used for a group of people to set up virtual audio conferencing room to complete certain mission in places where network infrastructure is unavailable. ACT is built on popular Windows operating system with off-the-shelf IEEE802.11 (a.k.a. Wi-Fi) adapters as the enabling technology. Little assumption is made during the development process in order to minimize the gap between a laboratory testbed and a fully-operational system. Some notable features of ACT include: 1) it makes use of distributed TDMA scheme to provide "circuit-switched" type of Quality-of-Service (QoS) guarantee for audio traffic; 2) its broadcast tree building algorithm is able to minimize the latency of message dissemination to the whole network; 3) the protocol running in ACT is able to predict radio link break due to mobility so that service interruption is reduced; 4) and relative position information is available at each node in the network. Our work is focused on the system aspect, and a series of experiments are conducted in real environment to verify the system design and evaluate its performance.
{"title":"Design and Implementation of Audio Conferencing Testbed based on Wi-Fi MANET","authors":"Wei Wang, B. Soong, Y. Chan","doi":"10.1109/WCNC.2009.4917666","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917666","url":null,"abstract":"Based on the technology of Mobile Ad-hoc Network (MANET), we design and implement an Audio Conferencing Testbed (ACT) that is used for a group of people to set up virtual audio conferencing room to complete certain mission in places where network infrastructure is unavailable. ACT is built on popular Windows operating system with off-the-shelf IEEE802.11 (a.k.a. Wi-Fi) adapters as the enabling technology. Little assumption is made during the development process in order to minimize the gap between a laboratory testbed and a fully-operational system. Some notable features of ACT include: 1) it makes use of distributed TDMA scheme to provide \"circuit-switched\" type of Quality-of-Service (QoS) guarantee for audio traffic; 2) its broadcast tree building algorithm is able to minimize the latency of message dissemination to the whole network; 3) the protocol running in ACT is able to predict radio link break due to mobility so that service interruption is reduced; 4) and relative position information is available at each node in the network. Our work is focused on the system aspect, and a series of experiments are conducted in real environment to verify the system design and evaluate its performance.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"63 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":"127625491","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.4917758
Wei-Kuo Chiang, An-Nie Ren, Ya-Chen Chung
The combination of SIP-NEMO and IMS brings benefits of power saving, low complexity and few handoff to both end users and service providers. In this article we investigate the integration of SIP-NEMO in the IMS, and propose two interworking architectures: loosely coupled and tightly coupled. We also present three basic scenarios: registration, session establishment and optimized handoff with context transfer in the two architectures, respectively. The loosely coupled architecture maintains the original characteristics of SIP-NEMO and IMS. Control signals for the call setup are passed through the interrogating network in the IMS. The tightly coupled architecture utilizes the network agent of SIP-NEMO as a back-to-back user agent to integrate SIP-NEMO into IMS with minor modification of the IMS network and provides the security offered by IMS. The discussions on deployment and security issues show that the proposed approaches achieve the integration with minimal changes to the existing standards.
{"title":"Integrating SIP-Based Network Mobility into IP Multimedia Subsystem","authors":"Wei-Kuo Chiang, An-Nie Ren, Ya-Chen Chung","doi":"10.1109/WCNC.2009.4917758","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917758","url":null,"abstract":"The combination of SIP-NEMO and IMS brings benefits of power saving, low complexity and few handoff to both end users and service providers. In this article we investigate the integration of SIP-NEMO in the IMS, and propose two interworking architectures: loosely coupled and tightly coupled. We also present three basic scenarios: registration, session establishment and optimized handoff with context transfer in the two architectures, respectively. The loosely coupled architecture maintains the original characteristics of SIP-NEMO and IMS. Control signals for the call setup are passed through the interrogating network in the IMS. The tightly coupled architecture utilizes the network agent of SIP-NEMO as a back-to-back user agent to integrate SIP-NEMO into IMS with minor modification of the IMS network and provides the security offered by IMS. The discussions on deployment and security issues show that the proposed approaches achieve the integration with minimal changes to the existing standards.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"37 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":"127999643","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.4917637
A. Reznik, E. Zeira
We consider the problem of counting mobile stations based on feedback they provide. For this problem we propose an anonymous contentious feedback mechanism which permits efficient counting and relate the resulting estimation problem to a well know combinatorial problem of "coupon collection." Using this relationship, we analyze the estimation problem in an idealized setting. We find the ML estimator and demonstrate that it is inappropriate in this setting. We then propose an estimator which is shown to achieve good performance over a large range of parameters.
{"title":"Contentious Feedback in Cellular Systems","authors":"A. Reznik, E. Zeira","doi":"10.1109/WCNC.2009.4917637","DOIUrl":"https://doi.org/10.1109/WCNC.2009.4917637","url":null,"abstract":"We consider the problem of counting mobile stations based on feedback they provide. For this problem we propose an anonymous contentious feedback mechanism which permits efficient counting and relate the resulting estimation problem to a well know combinatorial problem of \"coupon collection.\" Using this relationship, we analyze the estimation problem in an idealized setting. We find the ML estimator and demonstrate that it is inappropriate in this setting. We then propose an estimator which is shown to achieve good performance over a large range of parameters.","PeriodicalId":186150,"journal":{"name":"2009 IEEE Wireless Communications and Networking Conference","volume":"38 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":"133234888","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
扫码关注我们
求助内容：
应助结果提醒方式：