{"title":"An Adaptive Interference-Avoiding System for DS-UWB Cognitive Radio","authors":"Rumin Yang, Zheng Zhou","doi":"10.1109/CHINACOM.2006.344820","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344820","url":null,"abstract":"This paper addresses the problem of interfering with narrowband licensed users caused by DS-UWB systems. Deducting the colliding frequency band from UWB spectrum, and then employing orthonormal expansion by Hermite-Gaussian functions, the paper develops a low-complexity algorithm for generating DS-UWB signals that adaptively avoid or recover arbitrary colliding bands. A system implementing this algorithm is suggested. Performance comparison with matured seventh Gaussian derivative shows that our system achieves about 1.5 dB signal-to-noise gain and 52.2 dB signal-to-interference gain over the referenced system in AWGN environment","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"173 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":"124241454","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":"Analysis of Performance of a TDMA-based Distributed MAC Protocol in Single-hop Wireless Networks","authors":"Rui Zhao, M. Einhaus, Daniel Schultz, B. Walke","doi":"10.1109/CHINACOM.2006.344670","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344670","url":null,"abstract":"Nowadays, the IEEE 802.11 infrastructure basic service set (BSS) network is the most widely used wireless LAN (WLAN) system. There are growing needs to interconnect access points (APs) of separate BSSs to create an IEEE 802.11 extended service set (ESS) mesh network over the wireless medium. Mesh distributed coordination function (MDCF) is a novel medium access control (MAC) protocol, designed for interconnecting a large number of APs to form an efficient wireless multi-hop network supporting quality of service (QoS). Based on that an efficient ESS mesh network can be created. This paper evaluates the traffic performance of MDCF by using the analytical approach. Based on the established mathematical model, the optimal frame parameter settings for MDCF can be precisely determined.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"44 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":"114703905","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}
Li Jin, Chen Xiang, T. Moscibroda, Roger Wattenhofer
{"title":"Multi-Channel Primary Initialization Algorithm for Wireless Sensor Networks","authors":"Li Jin, Chen Xiang, T. Moscibroda, Roger Wattenhofer","doi":"10.1109/CHINACOM.2006.344741","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344741","url":null,"abstract":"The most urgent and important thing for a newly deployed sensor as to quickly establish a primary structure. In this paper, a practical algorithm for selecting cluster leader nodes and for setting up the affiliation of leader nodes and slave nodes is presented. Since the occurrence of collision (or co-channel interference) is a serious problem in unstructured networks, three independent channels are taken to reduce interference, Further, we analyze the algorithm based on a co-channel interference model. The simulation results show even in this harsh model, the primary initialization algorithm in our paper can be completed efficiently.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"169 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":"114921585","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":"Bandwidth Management in Shared WLAN","authors":"A. Nazari, N. Yazdani, N. Rezaee","doi":"10.1109/CHINACOM.2006.344674","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344674","url":null,"abstract":"In order to reduce cost and administration task, it is desirable for operators to share their WLAN infrastructure (W. Zhuang et al., 2003). In this paper, we focus on bandwidth management in shared WLANs. We propose an algorithm to allocate cell bandwidth to different operators in such a way that the traffic from one logical network can not affect throughput of the users from other ones. Due to its simplicity, this algorithm can be implemented in large WLANs that use Wi-Fi switches for ease of deployment and management of the network. We evaluated the performance of the proposed method by simulating the transmission of FTP and HTTP traffics. The results show that this method has an acceptable performance.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"24 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":"117028490","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":"Genetic Algorithms Applied to Organize Wireless Sensor Networks Aiming Good Coverage and Redundancy","authors":"R.F. de Mello, R.G. Cuenca, L.T. Yang","doi":"10.1109/CHINACOM.2006.344694","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344694","url":null,"abstract":"Work on coverage and redundancy of wireless sensor networks has motivated this paper which proposes a technique based on genetic algorithms to organize different radii sensors on fields. The genetic algorithm optimizes the organization of sensors maximizing the coverage and redundant area. Based on the obtained results this paper also presents a study of the coverage and redundancy behavior having random sensor failures. By using these results it is possible to define the best number of sensors for an specific area.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"27 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":"116005483","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 Time Division Pricing Based Economic Model to Enhance QoS and Resources Utilization of Grid Services","authors":"Lijuan Lu, Yuhui Deng","doi":"10.1109/CHINACOM.2006.344905","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344905","url":null,"abstract":"Grid economics helps to build a large-scale and geographically distributed grid system as it offers incentive for resource owners to contribute their resources for others to use and profit from it. Numerous grid economic models including microeconomic and macroeconomic principles have been proposed in the recent years. However, grid users (GUs)' strategy and behaviour for utility maximization have not been reflected sufficiently in these models. A time division pricing (TDP) based economic model is proposed in this paper. The model employs a price elasticity coefficient to describe the impact of the GUs' response of grid resources demand on the grid resources price. By attracting GUs to consume grid services from peak time to off-peak time in terms of the changing of grid service price, TDP based economic model can enhance quality of service and grid resources utilization of grid services significantly.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"209 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":"116370423","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":"Minimizing Preemption Cost for Diffserv-Aware MPLS Traffic Engineering","authors":"Mingying Zhu, Xiaoming He, Wu Ye","doi":"10.1109/CHINACOM.2006.344769","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344769","url":null,"abstract":"In this paper, we propose an improved heuristic algorithm for the well-known optimization formulation based on versatile preemption policy, which can minimize the preemption cost with high accuracy and less computational intractability. Simulation results show that the proposed algorithm significantly outperforms the heuristic recently proposed in the literature. Moreover, we also present a new path selection scheme to minimize preemption. Due to preemption of those LSPs that share more links with the selected path, the proposed scheme obviously minimize rerouting in DS-TE environments.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"39 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":"116418172","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}
Jijun Yin, G. Holland, T. Elbatt, F. Bai, H. Krishnan
{"title":"DSRC Channel Fading Analysis from Empirical Measurement","authors":"Jijun Yin, G. Holland, T. Elbatt, F. Bai, H. Krishnan","doi":"10.1109/CHINACOM.2006.344919","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344919","url":null,"abstract":"Vehicle-to-vehicle communication research has gained tremendous interest in recent years due to its importance in facilitating future active safety and telematics applications. However, with limited literature available, there is lack of understanding for modeling mobile-to-mobile channels in vehicular environments. In this paper, we conduct preliminary channel fading statistical analysis of empirical measurement data from devices compatible with the emerging dedicated short range communications (DSRC) standard. In particular, we use the Nakagami distribution to analyze the received signal strength (i.e., RSSI) from empirical measurement, and characterize the fading statistics as a function of distance for vehicular operating environment. Our analysis reveals that fading can be approximated by Rician distribution within 100 m while it seems to follow Rayleigh distribution beyond 100 m. The outcome of the study could be used for vehicular network simulation.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"139 30","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120820400","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":"Provisioning of Survivable Multicast Sessions Against Single Failures in Sparse-Splitting Optical WDM Mesh Networks","authors":"Peng Lin, Xiangang Yu, W. Gu","doi":"10.1109/CHINACOM.2006.344712","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344712","url":null,"abstract":"Recently, many heuristic algorithms have been put forward for protecting the multicast session against any single link failure in a WDM mesh network. But for the same session, the strategy is same. For the first time, in this paper we propose a novel technique to blend two classes of strategies in a hybrid recovery approach. Using this technique the multicast session is divided into two parts through a parameter called threshold. One is critical tree, the other is uncritical tree. These two parts are recovered by using two different sharing strategies of backup resources. We perform simulations to study static provisioning of survivable multicast sessions in a WDM mesh network with sparse light splitting and detailed simulations results are shown.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"65 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":"123942043","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":"Bandwidth Guaranteed Shortest Path Routing in Wireless Mesh Networks","authors":"Yuanyuan Zeng, Bo Xi, Ziming Zeng, Hao Wang","doi":"10.1109/CHINACOM.2006.344839","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344839","url":null,"abstract":"The bandwidth problem is one of the most serious problems for wireless mesh networks due to the influence of interference. In this paper, we present a distributed interference-aware bandwidth guaranteed shortest path routing protocol in IEEE 802.11-based multichannel wireless mesh networks with admission control. We design an interference-free distributed TDMA schedule to guarantee enough link flow. The simulation results show our protocol achieves good performance that it can effectively provide bandwidth guaranteed path for connection request comparing with minimal hop-count routing protocol.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"24 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":"125914904","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}