{"title":"A general design of orthogonal sequences with alternate periodic correlation values equal to zero","authors":"Zhenyu Zhang, F. Zeng, Guixin Xuan","doi":"10.1109/WCSP.2009.5371472","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371472","url":null,"abstract":"Based on the interleaving technique, a general design of orthogonal sequences with alternate periodic correlation values equal to zero is proposed. The proposed sequence set can be divided into two groups. In addition to traditional orthogonal properties, the periodic auto-correlation functions (ACFs) and intra-group cross-correlation functions (CCFs) of the designed sequences take zero at any odd shift while the inter-group CCFs take zero at any even shift. As a special case of the sequences with zero correlation zone (ZCZ), the designed sequences have the fixed ZCZ widths of 1 and 2, and can achieve the theoretical bound of set size for sequence length and ZCZ width.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125095444","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}
Jishun Liu, Lianfeng Shen, Tiecheng Song, Xiaoxia Wang
{"title":"Demand-matching spectrum sharing game for non-cooperative cognitive radio network","authors":"Jishun Liu, Lianfeng Shen, Tiecheng Song, Xiaoxia Wang","doi":"10.1109/WCSP.2009.5371504","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371504","url":null,"abstract":"In cognitive radio network, efficient spectrum sharing is one of the important functions which can enhance the overall spectrum utilization of whole network. However, it is still an unexplored issue to make unlicensed users choose the most suitable spectrum according to user demand and the spectrum characteristics. In this paper, a new Demand-Matching Spectrum Sharing (DMSS) algorithm based on game theory for non-cooperative cognitive radio network is proposed. Firstly, the model of the matching factors between the user demand and the spectrum characteristics is built up. Then by adopting demand-matching factor, the DMSS game is proposed and Nash equilibrium is solved by Nelder-Mead direct search method. DMSS enables each unlicensed user to access multiple appropriate channels by maximizing its own payoff. Numeral results reveal that DMSS achieves high performance in spectrum utilization percentage and spectrum efficiency of cognitive radio network when it reaches Nash equilibrium.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131193333","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":"Coordinated precoding for downlink multi-user MIMO relay network","authors":"Zhijia Liu, Zesong Fei, Jingming Kuang","doi":"10.1109/WCSP.2009.5371648","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371648","url":null,"abstract":"Relay communication network has been widely studied in recent years due to their ability to provide more reliable communication through enhanced diversity. In this work, we consider a downlink multiuser multi-input-multi-output (MU-MIMO) relay network under amplify and forward (AF) protocol. Coordinated relay system can provide the additional diversity gain due to adding the relay station (RS) compared to the direct transmit system. Assuming that the channel state information (CSI) at the base station (BS) is available, we propose a precoding method considering equivalent channel between the BS, RS and user equipment (UE), named as maximum-signal-leakage-and-noise-ratio (SLNRmax) that can effectively suppress the co-channel interference (CCI) and noise at the UE. And we also analyze the influence of increasing the number of the UEs on the sum-rate in the MU-MIMO relay network. Theoretical analysis and Monte Carlo simulation results show the un-coded BER and the sum-rate performance with coordinated relay outperforms that without relay.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131627023","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 routing algorithm combined with Multi-Agent System for LEO satellite IP networks","authors":"Zihe Gao, Qing Guo, Zhenyu Na","doi":"10.1109/WCSP.2009.5371688","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371688","url":null,"abstract":"Several routing schemes for Low Earth Orbit (LEO) satellite IP networks have been proposed in recent years, but little work has been done to consider the satellite network topology and traffic load change simultaneously. A distributed routing algorithm combined with Multi-Agent System (MASSR) is proposed in the paper. As MASSR relies on both passive and active information gathering and exchanging, it not only provides a traffic-adaptive and multi-path routing, but fast tracks the change of network topology as well. Simulation results show that, compared with AntNet, MASSR presents improved end-to-end delay as well as enhanced robustness.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131749400","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":"Optimization for cooperative spectrum sensing under Bayesian criteria","authors":"Jun Jing, Youyun Xu","doi":"10.1109/WCSP.2009.5371703","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371703","url":null,"abstract":"Spectrum sensing is one of the most challenging issues in cognitive radio systems. In this paper, optimization for cooperative spectrum sensing based on fusion of local hard decisions is studied. Given some prior knowledge of the targeted spectrum such as prior probability of occupancy by a primary user and the costs for missed detection and false alarm, a Bayesian detection problem is constructed to pursue the optimal fusion and local decision rules. A numerical iterative algorithm is proposed to approach the global optimum of the optimization problem.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127022003","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 measurement study of channel dynamics in wireless mesh networks","authors":"Xueli Ding, Cunqing Hua, Wenchao Xu, Aiping Huang","doi":"10.1109/WCSP.2009.5371547","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371547","url":null,"abstract":"Wireless channels are inherently time-varying due to many different factors, such as fading, shadowing, multipath effects, etc. In practice, it is too complicated to completely capture these factors in a single theoretical framework. Therefore, many simplified channel models have been proposed and widely used in theoretical analysis, protocol design and performance evaluation. However, recent studies show that these well-accepted channel models are inaccurate in practical wireless environments. In this paper, we carry out a measurement study of the wireless channels with the objective of characterizing the channel dynamics. Based on the measurement results from an indoor wireless mesh network testbed, we investigate the short and long term variations, temporal and spatial correlations, transition probability, and the asymmetric link quality of the wireless channels in the indoor environment. Some key issues for applying the measurement-based models in protocol design, performance evaluation and simulation are discussed.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127636826","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 Spatial-multiplexing Time Division Dynamic Token Protocol for ad hoc networks","authors":"Chang-hua Yao, Cheng-gui Wang, Shi-ding Zhu, Zhang Zhao","doi":"10.1109/WCSP.2009.5371425","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371425","url":null,"abstract":"This paper proposes a novel Spatial-multiplexing Time Division Dynamic Token Protocol (STDTP) in single channel that is based on token-passing scheme with the incorporation of TDMA and spatial-multiplexing. The protocol introduces a token relay algorithm which is fast and adaptive to topology variation, presents a collision avoidance algorithm which solves the exposed and hidden terminal problem through the information of network topology and active data transmission carried by the token. The protocol improves the spatial multiplexing compared with the RTS/CTS access mechanism. The results of the simulation show that STDTP can significantly improve the throughput.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134056241","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 improved adaptive MAC protocol for wireless sensor networks based on cross-layer architecture","authors":"Qian Hu, Zhenzhou Tang","doi":"10.1109/WCSP.2009.5371564","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371564","url":null,"abstract":"In this paper, we propose an improved adaptive MAC protocol for wireless sensor networks based on cross-layer architecture. The new protocol is inspired by SMAC, probably the most well-known sensor MAC scheme for energy efficiency. In the proposed new protocol, two major changes are made in original SMAC protocol, one is continual data transmission, and the other is graded contention window. The new MAC protocol is designed based on cross-layer architecture, so that nodes can switch their transmission mode adaptively according to the interface queue length. Simulations have been done to evaluate the performance of the proposed new protocol, by which we can find out that the new protocol can really reduce packet end-to-end delay and energy consumption in case of heavy traffic compared with SMAC.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114496320","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":"Multi-objective cooperative algorithms based on game theory in cognitive radio","authors":"Ye Zhihui, Shen Ke-qin","doi":"10.1109/WCSP.2009.5371656","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371656","url":null,"abstract":"A Multi-objective function cooperative algorithm based on non-collaboration game and Nash equilibrium is designed, which combines Maximum Bandwidth Profitability with Maximum Proportional Fairness. As applied in cognitive radio environment, the proposed algorithm can win trade-off between fairness and bandwidth profit, and realize effective spectrum distribution.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117285689","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":"Joint channel-topology based opportunistic relay selection strategy","authors":"Ma Yuanyuan, Zhang Si-hai, Zhou Wu-yang","doi":"10.1109/WCSP.2009.5371738","DOIUrl":"https://doi.org/10.1109/WCSP.2009.5371738","url":null,"abstract":"In multi-source multi-relay wireless network, centralized relay selection schemes are difficult to realize because they usually require global information, which is hardly available due to the limited memory and latency in realistic systems. Meanwhile, in classical distributed relay selection schemes, each source selects its “best” relay merely based on the local channel information. However, such schemes may lead to the case that several sources simultaneously select the same “best” relay and therefore causes a bottleneck problem. In this paper, we propose an opportunistic distributed relay selection scheme. In this scheme, each source selects its “best” relay by jointing the channel information and local “topology” information which can greatly ease the bottleneck problem. We also propose a three-step distributed signal interaction protocol by which every source can acquire its local “topology” information. Finally, we show the advantages of our proposed scheme by comparing the simulation results with other methods.","PeriodicalId":244652,"journal":{"name":"2009 International Conference on Wireless Communications & Signal Processing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117325047","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}