{"title":"Increasing Throughput of CDMA-based Ad Hoc Network by Multiuser Detection","authors":"Qian Xiaocong, Zheng Baoyu, Cui Jingwu","doi":"10.1109/APCC.2005.1554015","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554015","url":null,"abstract":"The importance of multiuser detection for CDMA-based mobile ad hoc networks is addressed in this paper. Conventionally, terminals in CDMA-based ad hoc networks use matched filters to receive packets, so the throughput of the network suffers from multi-access interference (MAI). Different from above scheme, in this paper, each terminal of the ad hoc network is equipped with an adaptive blind linear multiuser detector, so the ability of MAI-resistance is gained. Based on fully-connected network model, the throughput of ad hoc network with multiuser detection is studied in link-level. Theoretic analysis and simulation results show that multiuser detection can remarkably increase the throughput of ad hoc networks","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130867392","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}
{"title":"Distributed QoS Control for Link Adaptive Wireless LANs","authors":"R. Shinkuma, J. Maeda, T. Takahashi","doi":"10.1109/APCC.2005.1554081","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554081","url":null,"abstract":"In wireless local area networks (WLANs), the necessity of quality-of-service (QoS) control for uplink flows is greater and greater with interactive applications being more popular. It is also important that fairness between flows transmitted by stations with different physical transmission rates is ensured in QoS control for link adaptive WLANs, which is widely used nowadays. In this paper, we propose a novel distributed access scheme to satisfy these requirements, called QC-DCA. QC-DCA adaptively controls the parameters of carrier sense multiple access with collision avoidance (CSMA/CA). QC-CDA has two QoS control functions: guarantee and classification. QC-DCA guarantees target throughputs and packet delays by quickly adjusting CSMA/CA parameters. In QoS classification, the difference of throughputs and packet delays between different QoS classes is maintained. In both of them, QC-DCA solves unfairness caused by the difference of transmission rates in the physical layer. We evaluate throughput and delay performances of the proposed scheme through computer simulations. The results verify the viability of the proposed scheme","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123352987","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}
{"title":"Decoding the (23, 12, 7) Binary Golay Code","authors":"C. Chr, S. Su, Shao-Wei Wu","doi":"10.1109/APCC.2005.1554105","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554105","url":null,"abstract":"In this paper, an algebraic decoding method is proposed for the (23, 12, 7) binary Golay code. By applying a technique developed in Ching-lung Chr et al. (2005) the computation complexity of this decoder is much less compared with the conventional step-by-step decoding algorithm, since the variable calculations and the operations of multiplication can be reduced significantly","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126429980","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}
{"title":"Distributed Scheduling for QoS Control in Uplink CDMA","authors":"R. Kitamura, R. Shinkuma, T. Takahashi","doi":"10.1109/APCC.2005.1554026","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554026","url":null,"abstract":"The enhancement of transmission speed of third generation cellular systems is yielded by packet scheduling techniques, which enlarge system capacity and improve bandwidth utilization by choosing the most suitable packet to be sent according to the instantaneous channel condition of mobile stations. However, since different types of traffic require different channel quality, considering the difference of quality-of-service (QoS) is important for designing a scheduling algorithm. Furthermore, the necessity of scheduling schemes to be able to handle for uplinks, in the future, are much greater. In this paper, we propose heuristic QoS control for CDMA (HCQ), which is a distributed scheduling method for uplinks using channel information. In HCQ, MSs themselves decide when they should send their packets, and each MS independently adjusts the threshold to decide the packet-sending timing. Moreover, the threshold is modified based on the traffic type of sent packets. HCQ needs no complicated calculation and no extra overhead, and provides high effective throughput and delay performance. We evaluate the proposed scheme through computer simulations, and validate it from the results","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126089065","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}
{"title":"Performance Analysis of a Backoff Algorithm using Finish Tags in IEEE 802.11 Networks","authors":"K. Takahashi","doi":"10.1109/APCC.2005.1554132","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554132","url":null,"abstract":"In IEEE 802.11 distributed coordination function (DCF), system throughput decreases as the number of active stations increases on the medium. For improvement of the system throughput, a backoff algorithm which uses finish tags has been proposed. In the backoff algorithm, the finish tag is used to control the backoff time counter. The backoff algorithm has been evaluated with simulations. The simulation results show that the saturation throughput with proper parameters is almost independent on the number of stations. In this paper, we propose an analytical model to study saturation throughput of the backoff algorithm. The analytical model is a Markov chain in which a system state has three variables: the backoff time counter, the backoff stage, and the number of the stations with an older finish tag. Results of the analytical model show that the saturation throughput with proper parameters is independent of the number of stations. It also provides significant improvements of the throughput of the backoff algorithm over IEEE 802.11 DCF","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"43 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121391267","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}
{"title":"Frequency Domain IQ Correction in a Direct conversion Receiver for DVB-T","authors":"R. Palipana, K. Chung","doi":"10.1109/APCC.2005.1554130","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554130","url":null,"abstract":"This paper describes a novel scheme for correcting IQ imbalance errors in a direct-conversion receiver intended for terrestrial digital video broadcasting (DVB-T). Accurate estimation and correction of IQ errors can be achieved in the frequency domain with the aid of the pilot carriers present in a DVB-T signal. It is shown that relatively large IQ imbalance errors, likely to be encountered in an integrated receiver, can be effectively compensated using the proposed method. Simulations carried out using an end-to-end DVB-T model provide promising results. For example, it is shown through simulations that even larger IQ imbalance errors could be compensated effectively achieving a bit error rate less than the value recommended by the DVB-T standard, which is 2times10-4 at an SNR of around 16.5 dB","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228706","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}
C. Y. Jung, J. Chong, Young-Jun Hong, B. Jung, D. Sung
{"title":"Orthogonal Time Hopping Multiple Access for UWB Impulse Radio Communications","authors":"C. Y. Jung, J. Chong, Young-Jun Hong, B. Jung, D. Sung","doi":"10.1109/APCC.2005.1554079","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554079","url":null,"abstract":"Recently, UWB technologies have been introduced for low rate wireless personal area networks (LR-WPANs). Since the energy level of the UWB impulse radio signals is very low, it is very hard to apply them to a carrier sensing multiple access with collision avoidance (CSMA/CA) scheme, which was adopted as the MAC protocol in IEEE 802.15.4 standard. In this paper, we propose an orthogonal time hopping multiple access (OTHMA) as a multiple access scheme for UWB impulse radio communications, and compare the MAC performance of the proposed scheme with that of CSMA/CA in terms of throughput, success probability, average delay, and user utilization. Simulation results show that the proposed scheme performs better than CSMA/CA as the number of users increases. Therefore, OTHMA can be applied as a multiple access scheme for low power, large scale, and low activity networks in UWB impulse radio communications","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122481663","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}
R. Hayashi, T. Miyamura, K. Shiomoto, Shigeo Urushidani
{"title":"Impact of Traffic Correlation on the Effectiveness of Multilayer Traffic Engineering","authors":"R. Hayashi, T. Miyamura, K. Shiomoto, Shigeo Urushidani","doi":"10.1109/APCC.2005.1554200","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554200","url":null,"abstract":"Multi-layer network (MLNW) consisting of packet and optical layer networks has been widely studied as an important next generation network. In the MLNW, the virtual network topology (VNT) formed by a set of optical paths can be dynamically reconfigured by GMPLS protocols. By reconfiguring VNT, called multilayer traffic engineering, network performance factors can be optimized based on the traffic matrices. Thus, the effectiveness of multilayer traffic engineering is considered to be highly dependant on the correlation among traffic demand of different source-destination flows. We propose an analytical model of the dynamics exhibited by traffic matrices and then investigate how the correlation between different pairs of source-destination flows impacts the performance possible with multilayer traffic engineering. We confirm that the effectiveness of periodical multilayer traffic engineering increases with the correlation among source-destination flows","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122728407","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}
T. Kodama, N. Oguchi, T. Kawasaki, T. Sudo, T. Tsuruoka
{"title":"Implementation and Analysis of Scalable and Flexible Node for Large-scale Networks","authors":"T. Kodama, N. Oguchi, T. Kawasaki, T. Sudo, T. Tsuruoka","doi":"10.1109/APCC.2005.1554181","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554181","url":null,"abstract":"It is necessary to improve the performance of packet forwarding nodes that form part of large-scale and functionally advanced networks to ensure that they function easily and effectively. In this paper, we propose a separation method, in which functions in the network node are divided into forwarding functions and control functions, and each set of functions is executed on different hardware (forwarder and controller). With this method, we configure resources in the forwarder as the controller's own virtual resources. By doing so, the software, which runs on the controller, is able to treat the forwarder's resources as its own. We evaluate the effect of this method by applying it to a router, and clarify the performance improvement by the proposed method. And we select a stateful packet filtering as another test target, which executes the complex processing in packet forwarding. We then examine the field where the pro-posed method is effective","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131602806","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}
{"title":"A Bandwidth Allocation Model with High Concurrence Rate in IEEE802.16 Mesh Mode","authors":"Jianfeng Chen, Caixia Chi, Q. Guo","doi":"10.1109/APCC.2005.1554162","DOIUrl":"https://doi.org/10.1109/APCC.2005.1554162","url":null,"abstract":"In this paper, a bandwidth allocation model is proposed for multi-hop wireless mesh network (WMN) with a goal of achieving high traffic throughput in minimal scheduling time slots. Scheduling scheme based on the optimization model serves the centralized scheduling first and compresses the scheduling time to minimum by enhancing concurrence rate among links, thus more time slots can be saved for distributed scheduling. Simulation results show that this model has higher concurrence rate and reduces nearly 50% centralized time slots than FIFO serving mode","PeriodicalId":176147,"journal":{"name":"2005 Asia-Pacific Conference on Communications","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133183258","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}