{"title":"Comparison of the Link Level Performance between OFDMA and SC-FDMA","authors":"Jianhua Zhang, Chengxiang Huang, Guangyi Liu, Ping Zhang","doi":"10.1109/CHINACOM.2006.344649","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344649","url":null,"abstract":"Since 3G long term evolution (LTE) is launched by 3GPP recently, many multiple access (MA) schemes have been proposed for 3G LTE, such as multi-carrier (MC) - WCDMA, MC-time duplex-synchronized CDMA (MC-TD-SCDMA), orthogonal frequency division multiple access (OFDMA), Single Carrier Frequency Division Multiple Access (SC-FDMA), which includes IFDMA (interleaved FDMA) and DFT-S OFDM (DFT-spreading OFDM). Among those schemes, OFDMA and DFT-S OFDM are both promising for their special advantages for uplink. In this paper, the link level performance of MA schemes are compared. The simulation results show that without coding, OFDMA has 1 dB performance gain than DFT-S OFDM when BER is equal to 10-2. When turbo coding is adopted, OFDMA has near 3 dB performance gain than DFT-S OFDM when BLER is equal to 10-2. The performance difference between OFDMA and DFT-S OFDM is increased for MIMO system. Since the PAPR can be reduced to lower than 6 dB as required by 3GPP, OFDMA has the performance gain than DFT-S OFDM in link level simulation.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128436364","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}
Zhaobiao Lu, Zhijian Xu, Bin Wan, Min Zhang, P. Ye
{"title":"Performance Analysis of Burst Assembly under Self-Similar Traffic with Measured WAN Packet Size Distribution","authors":"Zhaobiao Lu, Zhijian Xu, Bin Wan, Min Zhang, P. Ye","doi":"10.1109/CHINACOM.2006.344869","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344869","url":null,"abstract":"Studied in this paper is the convergence performance of three typical burst assembly mechanisms in optical burst-switching (OBS) networks, namely threshold-based, timer-based, and hybrid assembly algorithms. Burst assembly is an important function implemented at edge nodes in optical burst switching (OBS) networks. It can reduce the switching burden and overheads at the optical layer, by aggregating multiple packets from client networks to create a larger optical burst for transmission through the OBS network. Furthermore, burst assembly designed properly can reduce the self-similarity of traffic as traffic shaper. The main challenge in designing burst assembly is to balance the several opposing objectives: first, increasing the burst size; second, maintaining acceptable assembly delay introduced during burst assembly; thirdly, reducing the self-similarity as possible in case of self-similar traffic. Vital parameters, such as optical burst size and assembly delay, are examined by simulations under self-similar input traffic with a measured WAN packet size distribution. The balance between the burst size and the assembly delay for hybrid assembly is also discussed. The results show that the assembly threshold always keeps the burst size near the threshold while the assembly time-limit makes the burst size scattered and even split into multiple peaks when the incoming IP packet size is discrete. In addition, the self-similarity of input traffic has little impact on the burst size and the assembly delay for all three mechanisms. For hybrid assembly, when one of the assembly threshold and the assembly time-limit parameters is fixed, the burst size and the assembly delay are hard to improve by adjusting the other parameter when greater than a certain value","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128502990","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":"Development of a Flexible Access Control Design by Extending RBAC","authors":"Yulong Jin, Yongsun Choi, Myeonggil Choi, Sangmun Shin","doi":"10.1109/CHINACOM.2006.344682","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344682","url":null,"abstract":"Role based access control (RBAC) has received much attention for more than a decade as one of the most attractive solutions for access control in Web-based information systems. However, its associated characteristics are often not suitable for a varying organization requiring a flexible structure. In order to address this limitation, it may essentially be required to assess more flexibility to access control mechanisms. To this end, we propose a new extended access control mechanisms incorporating three authentication dimensions based on user, department, and role. We then demonstrate that the proposed mechanisms can improve utilization of a Web-based knowledge-sharing system.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128078858","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":"An Energy-Efficient Re-Routing Method in Wireless Mobile ad hoc Networks","authors":"Songtao Zhan, Jin Wang, Guoxin Xu, Ping Zhang","doi":"10.1109/CHINACOM.2006.344803","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344803","url":null,"abstract":"Wireless mobile ad hoc network (MANET) is a self-organized network without infrastructure, and the nodes in this network are energy-constrained. In this paper, we propose a new energy-efficient method for mobile ad hoc network. Basing on this method, we define a new type of channel and present a re-routing approach. Instead of establishing an energy-efficient route initially, the routing approach is to find a new route under an existing connection. Because of the mobility of the node, a better route, more energy-efficient for example, may appear between the source and destination nodes. The approach we present in this paper can find these routes without interrupting the data transmission between the source and destination nodes","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130574892","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":"Reliable Multicast Based on Erasure Resilient Codes over InfiniBand","authors":"Xigui Wang, Zifeng Xiao, Jizhong Han, Chengde Han","doi":"10.1109/CHINACOM.2006.344802","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344802","url":null,"abstract":"Many distributed applications and systems, e.g., an efficient implementation of distributed cache coherence protocol in distributed shared-memory systems, usually require efficient, reliable and scalable multicast capabilities from low-level interconnections. However, InfiniBand network, a high performance interconnection with low latency and high bandwidth, lacks the necessary reliable hardware multicast capability. To avoid low-efficiency multicast emulation with one-to-many point-to-point messages and ACKs, this paper proposes an efficient algorithm to provide reliable multicast based on erasure resilient codes over InfiniBand. This algorithm can not only avoid the feedback implosion problem by point-to-point multicast emulation messages, but also achieve lower latency and better scalability comparing with automatic-request retransmission (ARQ). Moreover, this algorithm can be optimized with message pipeline mechanism to achieve the same level of latency as the un-reliable InfiniBand hardware multicast. Performance analysis demonstrates that the failure probability to recover a message is less than 1.4times10 even for a system with 1000 message receivers","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131136251","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 Adaptive Threshold Acquisition Algorithm in DS-UWB with Multi-path Environment","authors":"Jun Chen, Yongbo Zeng, Zheng Zhou","doi":"10.1109/CHINACOM.2006.344808","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344808","url":null,"abstract":"Synchronization process is essential especially in UWB communication system owes to its extremely short transmitted pulse shape and the ultra dense multi-path interference. Acquisition performance decreased rapidly own to serious inter-symbol interference (ISI) caused by those complex channel with relatively large delay spread. An interference resistant adaptive threshold acquisition algorithm (IR-ATAA) for DS-UWB systems proposed here has the feature that the decision threshold changes automatically adapting to the signal to noise ratio (SNR) at time of comparison. The performance analysis mainly focus on the probability of correct acquisition (PACQ) and estimation error of timing delay (MSE) with IEEE defined standard channel models and in the presents of multi-access interference (MAI) which is assumed as an additive white Gaussian noise. The simulation results also indicate the superiority of IR-ATAA over the fixed threshold acquisition algorithm","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129423616","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 Novel Approach for MIMO Adaptive Equalization Based on Affine Projection Algorithm","authors":"Guanghui He, Zucheng Zhou","doi":"10.1109/CHINACOM.2006.344651","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344651","url":null,"abstract":"In this paper, a reduced complexity adaptive decision feedback equalization approach based on affine projection algorithm (APA) is proposed for multiple-input multiple-output (MIMO) time-varying frequency selective channels. Computational complexities of APA-based adaptive decision feedback equalization (AP-DFE), least mean-squares (LMS-DFE) and recursive least squares (RLS-DFE) algorithms are compared. The proposed technique provides fast convergence speed and low computational complexity. Simulation results show that AP-DFE adaptive equalization algorithm outperforms LMS-DFE algorithm and can obtain significant computation saving over RLS-DFE algorithm with approximately the same BER performance.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129427426","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 Stable Rapid Timing Synchronization Scheme for Impulse Radio UWB","authors":"Hongjiang Wang, Shengming Jiang, G. Wei, Fei Ji","doi":"10.1109/CHINACOM.2006.344773","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344773","url":null,"abstract":"Rapid synchronization acquisition is one of the biggest challenges of burst-mode transmission for ultra-wide band (UWB) wireless communications, especially for the impulse radio UWB (IR-UWB) due to the very short duration of the monopulse. Some rapid synchronization acquisition schemes have been proposed in the literature to reduce the mean acquisition time. However, most of them have no stability, i.e., when the delay time of arrive (TOA) for the transmitted signals becomes larger, the mean acquisition time will increase linearly. In this paper, a stable and rapid synchronization acquisition, namely selective bit reversal block search (SBRBS), is presented. The algorithm takes full advantage of the bit reversal technique, which can keep the maximum interval between the two neighboring uncertain search points to improve the detection probability and achieve a smallest search terminating time every four consecutive search points. The paper analyzes the stability of the proposed scheme in detail and makes comparison with other algorithms. Theoretical analysis and simulation results show that the proposed algorithm outperforms others in term of reduced synchronization acquisition time and increased stability.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128731507","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":"Adaptive Bandwidth Allocation Based on Particle Swarm Optimization for Multimedia LEO Satellite Systems","authors":"Dong Yan, Zhou Chi, Suo Si-liang, Huang Zailu","doi":"10.1109/CHINACOM.2006.344787","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344787","url":null,"abstract":"Bandwidth allocation becomes more crucial for efficient utilization of wireless resources to support multiple services in multimedia LEO communication networks and QoS diversities of services raise new challenges. This paper proposes an adaptive bandwidth allocation method based on the fact that the bandwidth of a multimedia call or a data call is alterable in LEO systems. The QoS parameter of the system is represented as system satisfaction degree which is a function of user's utility functions and the income of accepting or rejecting handoff calls. The core of the method is a constrained nonlinear optimization problem which aims at maximizing the system satisfaction degree. A particular particle swarm optimization (PSO) algorithm is developed to solve the optimization problem. Simulations have been outlined and the conformance to QoS parameters, i.e. call blocking probabilities and handoff dropping probabilities, for the proposed approach has been verified","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128881156","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":"Near Optimal Detection of DCT-Domain Watermarks using Alpha-Stable Models","authors":"Zhongwei Sun, Gang Xu","doi":"10.1109/CHINACOM.2006.344880","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344880","url":null,"abstract":"Digital watermarking can be formulated as a communication task. And the performance of a watermarking scheme relies heavily on the design of the detector. This paper proposes a novel near optimal watermark detector for still images in the discrete cosine transform (DCT) domain. First, the alternative current (AC) DCT coefficients are statistically modeled by symmetric alpha-stable distributions. Then, by resorting to well grounded theoretical results of statistical detection theory, the detector structure in the additive alpha-stable noise interference is derived. Through the approximation to the locally optimum score function, the near optimal detector can be easily implemented. The experimental results demonstrate the superiority of the new detector to correlator detector and generalized Gaussian distribution (GGD) based detector.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127213838","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}