Pub Date : 2005-09-11DOI: 10.1109/PIMRC.2005.1651775
Hidekazu Gomi, H. Harada, S. Shinoda
The next-generation wireless access system named DPC-OF/TDMA, which is capable of achieving 100 Mbps carrier bit rate under high mobility environment, has been proposed and is being developed. For the realization of this system, large size of cellular zone is required in order to increase system capacity. However, propagation delays between an access point (AP) and mobile stations (MSs) managed by the AP increase as the cellular zone size is large. These increased propagation delays falls system throughput. In this paper, application of PR-DSMA, which is robust against large propagation delays, to the MAC layer protocol of DPC-OF/TDMA is proposed to solve this problem. This paper also conducts performance evaluation in terms of automatic request control (ARQ) and cell radius by computer simulation
{"title":"Performance Evaluation of Dynamic Parameter Controlled OF/TDMA Based on PR-DSMA","authors":"Hidekazu Gomi, H. Harada, S. Shinoda","doi":"10.1109/PIMRC.2005.1651775","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651775","url":null,"abstract":"The next-generation wireless access system named DPC-OF/TDMA, which is capable of achieving 100 Mbps carrier bit rate under high mobility environment, has been proposed and is being developed. For the realization of this system, large size of cellular zone is required in order to increase system capacity. However, propagation delays between an access point (AP) and mobile stations (MSs) managed by the AP increase as the cellular zone size is large. These increased propagation delays falls system throughput. In this paper, application of PR-DSMA, which is robust against large propagation delays, to the MAC layer protocol of DPC-OF/TDMA is proposed to solve this problem. This paper also conducts performance evaluation in terms of automatic request control (ARQ) and cell radius by computer simulation","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126519955","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 : 2005-09-11DOI: 10.1109/PIMRC.2005.1651701
F. Mertz, U. Engelke, P. Vary, Hervé Taddei, I. Varga
This paper examines the application of UDP-lite for unequal error detection in packet-switched speech transmission via Internet protocols (voice-over-IP) over UMTS radio channels. Traditionally, UDP is used as transport layer protocol, which contains a checksum that covers the complete packet. Thus, any packet with residual bit errors is discarded. Speech codecs like AMR, however, can tolerate bit errors in less sensitive parts of the bitstream. A more recent development, UDP-lite, provides unequal error detection with a partial checksum that covers only the sensitive parts of a packet. Thus, only packets with errors in important bits are discarded. We compare the use of UDP-lite for UMTS channels with convolutional and channels with turbo coding. The results show that the achievable quality improvement by applying UDP-lite depends on the residual bit error distribution of the chosen UMTS channel coding method. While we determined a quality improvement for channels with convolutional coding, we did not get an improvement for turbo coding. Furthermore, when combined with header compression, the convolutional coder with use of UDP-lite can reach the performance of the turbo coder with use of UDP
{"title":"Applicability of UDP-lite for voice over IP in UMTS networks","authors":"F. Mertz, U. Engelke, P. Vary, Hervé Taddei, I. Varga","doi":"10.1109/PIMRC.2005.1651701","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651701","url":null,"abstract":"This paper examines the application of UDP-lite for unequal error detection in packet-switched speech transmission via Internet protocols (voice-over-IP) over UMTS radio channels. Traditionally, UDP is used as transport layer protocol, which contains a checksum that covers the complete packet. Thus, any packet with residual bit errors is discarded. Speech codecs like AMR, however, can tolerate bit errors in less sensitive parts of the bitstream. A more recent development, UDP-lite, provides unequal error detection with a partial checksum that covers only the sensitive parts of a packet. Thus, only packets with errors in important bits are discarded. We compare the use of UDP-lite for UMTS channels with convolutional and channels with turbo coding. The results show that the achievable quality improvement by applying UDP-lite depends on the residual bit error distribution of the chosen UMTS channel coding method. While we determined a quality improvement for channels with convolutional coding, we did not get an improvement for turbo coding. Furthermore, when combined with header compression, the convolutional coder with use of UDP-lite can reach the performance of the turbo coder with use of UDP","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128100019","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 : 2005-09-11DOI: 10.1109/PIMRC.2005.1651803
J. Pérez-Romero, O. Sallent, R. Agustí, P. Karlsson, A. Barbaresi, Lin Wang, F. Casadevall, M. Dohler, H. Gonzalez, F. Pinto
Common radio resource management strategies are devoted to achieve an efficient usage of the pool of radio resources available in a heterogeneous radio access network context. This paper describes the functionalities associated with the common vision of radio access technologies, the different possibilities in the functional model split and the corresponding implementation considerations
{"title":"Common radio resource management: functional models and implementation requirements","authors":"J. Pérez-Romero, O. Sallent, R. Agustí, P. Karlsson, A. Barbaresi, Lin Wang, F. Casadevall, M. Dohler, H. Gonzalez, F. Pinto","doi":"10.1109/PIMRC.2005.1651803","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651803","url":null,"abstract":"Common radio resource management strategies are devoted to achieve an efficient usage of the pool of radio resources available in a heterogeneous radio access network context. This paper describes the functionalities associated with the common vision of radio access technologies, the different possibilities in the functional model split and the corresponding implementation considerations","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125653034","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 : 2005-09-11DOI: 10.1109/PIMRC.2005.1651546
L. Doyle
The purpose of this paper is to present an overview of a platform for exploring reconfigurability in wireless networks. The types of networks that are particularly of interest here are distributed and disaggregated networks. The term disaggregated is used to describe networks that are not alone distributed but also non-homogenous and controlled by different and possibly competing entities. In distributed and disaggregated networks, network-wide reconfiguration, if indeed possible, will not be achieved through a coordinating or controlling entity as a global view or global control of the network does not exist Therefore mechanisms for facilitating network-wide reconfiguration based on local knowledge only are needed. The platform presented in the paper combines research outcomes from ad hoc networking research and work carried out in the area of reconfigurable radio design in an effort to address these issues
{"title":"A platform for exploring reconfigurability in distributed and disaggregated wireless networks","authors":"L. Doyle","doi":"10.1109/PIMRC.2005.1651546","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651546","url":null,"abstract":"The purpose of this paper is to present an overview of a platform for exploring reconfigurability in wireless networks. The types of networks that are particularly of interest here are distributed and disaggregated networks. The term disaggregated is used to describe networks that are not alone distributed but also non-homogenous and controlled by different and possibly competing entities. In distributed and disaggregated networks, network-wide reconfiguration, if indeed possible, will not be achieved through a coordinating or controlling entity as a global view or global control of the network does not exist Therefore mechanisms for facilitating network-wide reconfiguration based on local knowledge only are needed. The platform presented in the paper combines research outcomes from ad hoc networking research and work carried out in the area of reconfigurable radio design in an effort to address these issues","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125656844","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 : 2005-09-11DOI: 10.1109/PIMRC.2005.1651754
Junsu Kim, Sung Ho Moon, D. Sung
Since there are various packet-type services with different QoS's , a scheduling algorithm that can support multiple QoS classes is needed to efficiently provide data services in the high speed downlink packet access (HSDPA). In this paper, we investigate the capability of HSDPA to support multiple QoS classes and propose an improved scheduling algorithm to serve multiple QoS classes
{"title":"Multi-QoS scheduling algorithm for class fairness in high speed downlink packet access","authors":"Junsu Kim, Sung Ho Moon, D. Sung","doi":"10.1109/PIMRC.2005.1651754","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651754","url":null,"abstract":"Since there are various packet-type services with different QoS's , a scheduling algorithm that can support multiple QoS classes is needed to efficiently provide data services in the high speed downlink packet access (HSDPA). In this paper, we investigate the capability of HSDPA to support multiple QoS classes and propose an improved scheduling algorithm to serve multiple QoS classes","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"45 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113937856","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 : 2005-09-11DOI: 10.1109/PIMRC.2005.1651506
Moon-Soon Choi, G. Großkopf, D. Rohde
This paper presents statistical properties of the space-time propagation channel at 60 GHz. An extensive measurement campaign is conducted for three different type of corridors in an office building. The 60 GHz channel sounder used is capable of measuring the complex-valued space time channel data accurately and the multipath components are resolved both in space and time domain with 1 GHz measurement bandwidth. Throughout the measurements the line-of-sight (LOS) path is ensured. The parameter estimation is performed using space-alternating generalized expectation (SAGE) algorithm. Parameters for the directional channel model such as root mean square (RMS) delay spread, Ricean K-factor and angular spread are calculated. Statistical models for the power delay spectrum (PDP) and the power azimuth spectrum (PAP) are given
{"title":"Statistical Characteristics of 60 GHz Wideband Indoor Propagation Channel","authors":"Moon-Soon Choi, G. Großkopf, D. Rohde","doi":"10.1109/PIMRC.2005.1651506","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651506","url":null,"abstract":"This paper presents statistical properties of the space-time propagation channel at 60 GHz. An extensive measurement campaign is conducted for three different type of corridors in an office building. The 60 GHz channel sounder used is capable of measuring the complex-valued space time channel data accurately and the multipath components are resolved both in space and time domain with 1 GHz measurement bandwidth. Throughout the measurements the line-of-sight (LOS) path is ensured. The parameter estimation is performed using space-alternating generalized expectation (SAGE) algorithm. Parameters for the directional channel model such as root mean square (RMS) delay spread, Ricean K-factor and angular spread are calculated. Statistical models for the power delay spectrum (PDP) and the power azimuth spectrum (PAP) are given","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131464119","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 : 2005-09-11DOI: 10.1109/PIMRC.2005.1651687
Elena López-Aguilera, J. Casademont, Josep Cotrina Navau, A. Rojas
Most studies about the performance of IEEE 802.11 consider scenarios of ad-hoc topology and networks where all stations have the same traffic load (symmetric traffic conditions). This paper presents a study of performance parameters of more realistic networks. We focus the attention on WLAN with infrastructure networks, where the traffic distribution is asymmetric. In this case, the traffic load at the access point is much heavier than that at user stations. These studies are more realistic because most nowadays installed WLAN are infrastructure topology type, due to the fact that they are used as access networks. In this case, the access point has to retransmit all incoming traffic to the basic service set and therefore its traffic load is higher. Finally, the paper presents the tuning of the contention window, taken from IEEE 802.11e, used to increase the system performance under asymmetric traffic conditions, and the proposal of an adaptive algorithm to adapt the MAC layer settings to the system traffic load
{"title":"Performance enhancement of WLAN IEEE 802.11 for asymmetric traffic","authors":"Elena López-Aguilera, J. Casademont, Josep Cotrina Navau, A. Rojas","doi":"10.1109/PIMRC.2005.1651687","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651687","url":null,"abstract":"Most studies about the performance of IEEE 802.11 consider scenarios of ad-hoc topology and networks where all stations have the same traffic load (symmetric traffic conditions). This paper presents a study of performance parameters of more realistic networks. We focus the attention on WLAN with infrastructure networks, where the traffic distribution is asymmetric. In this case, the traffic load at the access point is much heavier than that at user stations. These studies are more realistic because most nowadays installed WLAN are infrastructure topology type, due to the fact that they are used as access networks. In this case, the access point has to retransmit all incoming traffic to the basic service set and therefore its traffic load is higher. Finally, the paper presents the tuning of the contention window, taken from IEEE 802.11e, used to increase the system performance under asymmetric traffic conditions, and the proposal of an adaptive algorithm to adapt the MAC layer settings to the system traffic load","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131925603","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 : 2005-09-11DOI: 10.1109/PIMRC.2005.1651592
Hoon Kim, Yeonwoo Lee, Sangboh Yun
This paper discusses a spectrum sharing problem in multiple network operators (NOs). Most of the previous works have illustrated the dynamic spectrum allocation (DSA) gain achieved by utilizing the time or regional variations in traffic demand between NOs. In this paper, we introduce the functionalities required for the entities related with the spectrum allocation and propose a spectrum allocation algorithm. In the proposed spectrum allocation algorithm, the priority between NOs and the priorities of multiple class services are incorporated into the spectrum sharing metric (SSM), while also accommodating the urgent bandwidth request by proposing a negotiation procedure. It is shown that the proposed scheme allocates the spectrum dynamically, reflecting the long-term occupation ratio between NOs and the priorities of multiple class services
{"title":"A dynamic spectrum allocation between network operators with priority-based sharing and negotiation","authors":"Hoon Kim, Yeonwoo Lee, Sangboh Yun","doi":"10.1109/PIMRC.2005.1651592","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651592","url":null,"abstract":"This paper discusses a spectrum sharing problem in multiple network operators (NOs). Most of the previous works have illustrated the dynamic spectrum allocation (DSA) gain achieved by utilizing the time or regional variations in traffic demand between NOs. In this paper, we introduce the functionalities required for the entities related with the spectrum allocation and propose a spectrum allocation algorithm. In the proposed spectrum allocation algorithm, the priority between NOs and the priorities of multiple class services are incorporated into the spectrum sharing metric (SSM), while also accommodating the urgent bandwidth request by proposing a negotiation procedure. It is shown that the proposed scheme allocates the spectrum dynamically, reflecting the long-term occupation ratio between NOs and the priorities of multiple class services","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132000095","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 : 2005-09-11DOI: 10.1109/PIMRC.2005.1651651
A. Giovanardi, G. Mazzini, R. Veronesi
Emulation capability in network simulation allows exposing experimental algorithms and protocols to live traffic load and to introduce real packet processing times. This paper describes the design and implementation of the emulation facility in the simple ad hoc simulator (SAM). The emulation architecture works in the user space allowing implementing and testing routing protocols for ad hoc networks. With respect to SAM, the emulator gives the possibility to test the routing protocols with a real exchange of signaling and data packets between the hosts present in the network. With respect to a wireless live test, the emulator works on hosts connected each other via wired links and the wireless channel is simulated
{"title":"Network emulation in the SAM simulator","authors":"A. Giovanardi, G. Mazzini, R. Veronesi","doi":"10.1109/PIMRC.2005.1651651","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651651","url":null,"abstract":"Emulation capability in network simulation allows exposing experimental algorithms and protocols to live traffic load and to introduce real packet processing times. This paper describes the design and implementation of the emulation facility in the simple ad hoc simulator (SAM). The emulation architecture works in the user space allowing implementing and testing routing protocols for ad hoc networks. With respect to SAM, the emulator gives the possibility to test the routing protocols with a real exchange of signaling and data packets between the hosts present in the network. With respect to a wireless live test, the emulator works on hosts connected each other via wired links and the wireless channel is simulated","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132475822","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 : 2005-09-11DOI: 10.1109/PIMRC.2005.1651424
Yongmei Dai, Sumei Sun, Z. Lei
We present a comparative study of two tree search based detection algorithms, namely, the M-algorithm combined with QR decomposition (QRD-M) and the sphere decoding (SD) algorithms, for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. First, we show that nodes ordering before and during the tree search are important for both algorithms. With appropriate ordering, QRD-M can improve detection performance significantly and SD can reduce decoding complexity substantially. Then we compare the implementation complexity of the two algorithms, in terms of the number of nodes required to search or the required number of multiplications to achieve maximum likelihood detection performance. It is interesting to show that the average complexity of SD is lower than that of QRD-M, whereas the worst case complexity of SD is much higher than that of QRD-M
{"title":"A Comparative Study of QRD-M Detection and Sphere Decoding for MIMO-OFDM Systems","authors":"Yongmei Dai, Sumei Sun, Z. Lei","doi":"10.1109/PIMRC.2005.1651424","DOIUrl":"https://doi.org/10.1109/PIMRC.2005.1651424","url":null,"abstract":"We present a comparative study of two tree search based detection algorithms, namely, the M-algorithm combined with QR decomposition (QRD-M) and the sphere decoding (SD) algorithms, for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems. First, we show that nodes ordering before and during the tree search are important for both algorithms. With appropriate ordering, QRD-M can improve detection performance significantly and SD can reduce decoding complexity substantially. Then we compare the implementation complexity of the two algorithms, in terms of the number of nodes required to search or the required number of multiplications to achieve maximum likelihood detection performance. It is interesting to show that the average complexity of SD is lower than that of QRD-M, whereas the worst case complexity of SD is much higher than that of QRD-M","PeriodicalId":248766,"journal":{"name":"2005 IEEE 16th International Symposium on Personal, Indoor and Mobile Radio Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130261817","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
扫码关注我们
求助内容：
应助结果提醒方式：