{"title":"A Spanning Routing Tree protocol based on State Diffusion for mobile sensor networks","authors":"Wei Xing, Kuntai Li, Yongchao Wang, Wen Zhou","doi":"10.1109/WCSP.2011.6096863","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096863","url":null,"abstract":"For some special applications, the mobile sensor network is more suitable than static sensor network. When sensors become mobile, connectivity assurance and energy saving become two challenges. In this paper, we propose the SRTSD (Spanning Routing Tree protocol based on State Diffusion) and SRTSD-DA (SRTSD with Data Aggregation) protocols to ensure the connectivity and to save energy. In the two protocols, before transmission of sensor data, the routing trees are built by the diffusion of nodes state messages beginning from the sink node. In addition, the SRTSD-DA can conserve a lot of energy with the use of data fusion and aggregation techniques. The protocols are distributed, and the sensor nodes do not require knowledge of the entire network. Simulation results show that SRTSD and SRTSD-DA have excellent performance on connectivity assurance and energy saving.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"44 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128732600","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":"Integration of wireless sensor network into existing public network using DSL and development of web presenter","authors":"Yu Sun, S. Berber","doi":"10.1109/WCSP.2011.6096952","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096952","url":null,"abstract":"Nowadays wireless sensor network has become an area of particular interest due to their wide usage in a great number of different application areas. However, the demand for smaller sensor nodes and low power consumptions has restricted its transmission range and data accessibility. In this paper, an integration solution between the wireless sensor network and the existing public network using DSL modem is proposed and discussed. Through this integration, it is aimed that data collected by local sensors can be made available worldwide. A corresponding visual web presenter was also developed to present the WSN data through the Internet.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128966373","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":"Improved iteration strategy of game-based channel allocation method for cognitive wireless network","authors":"Jun Liu, Xiufeng Xie","doi":"10.1109/WCSP.2011.6096905","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096905","url":null,"abstract":"Based on queuing theory and game analysis, a distributed channel allocation algorithm for secondary users in cognitive wireless networks is proposed. Compared with prior works, the first contribution in this paper is the iterative process with dynamic adjustment step. In traditional strategy adjustment algorithm, the adjustment step is set as fixed, this may cause the periodic oscillation. Another contribution is an efficient iteration formula that reduces the complexity, and improves the convergence of algorithm. Simulation results show that, the convergence speed and the final convergence results are all better than those of the original algorithm.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129425545","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}
Jiamin Li, Dongming Wang, Pengcheng Zhu, X. You, Lan Tang
{"title":"An improved distributed iterative beamforming algorithm with cooperative base stations","authors":"Jiamin Li, Dongming Wang, Pengcheng Zhu, X. You, Lan Tang","doi":"10.1109/WCSP.2011.6096696","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096696","url":null,"abstract":"In this paper, an improved distributed iterative beamforming algorithm is proposed for cooperative base stations, and the detailed characterizations with instantaneous and statistical CSI are presented. Firstly, virtual signal-to-interference-plus-noise ratio (SINR) instead of user rate is chosen as decision criterion to avoid feeding back message by users to tell the base stations which strategy should be initialized with and whether to terminate the iteration. Then, the number of iterations is decreased through solving a constrained optimization problem of maximizing the virtual SINR for a given level of generated interference to the other users which can be converted into a standard convex optimization problem and solved by tools of mathematical programming. Finally, the performance of the proposed algorithm is evaluated.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114622285","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 distributed space-time coded cooperative multicast","authors":"Hui Tian, Wei Xie, Youyun Xu, Lianguo Wu, Maoqiang Zuo","doi":"10.1109/WCSP.2011.6096837","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096837","url":null,"abstract":"Cooperative multicast/broadcast technique which can improve performance of traditional wireless multicast communications system has been paid a broad attention. However, in 2-hop Cooperative multicast system [8], it is easy to arise interference in destination node if all the nodes who decode message correctly in phase 1 forward information to other users simultaneously. In this paper, to solve this problem, we propose the distributed space-time coded cooperative multicast (DSTC-CM) scheme based on coded cooperation, where the base station (BS) sends a part of the information and the relays transmit the rest. The system performance is improved by making use of coding gain provided by the DSTC coded cooperation. The capability of the proposed scheme is evaluated in terms of the outage probability and diversity-multiplexing tradeoff (DMT). The closed-form of the average outage probability is derived. Asymptotic behavior of the average outage probability in high SNR regions is analyzed and it confirms that the proposed scheme is efficient in the sense of achieving full diversity. Finally, we compare the average outage probability and DMT for different transmission protocols in the simulations.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":" 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113948395","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. Qiu, Wenjun Xu, Zhiqiang He, K. Niu, Baoyu Tian
{"title":"Graph-based spectrum sharing for multiuser OFDM Cognitive Radio Networks","authors":"T. Qiu, Wenjun Xu, Zhiqiang He, K. Niu, Baoyu Tian","doi":"10.1109/WCSP.2011.6096929","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096929","url":null,"abstract":"Spectrum sharing in OFDM-based Cognitive Radio Networks (CRN) is investigated by using graph theory. We consider the networks in which a set of secondary links (SLs) make underlay access to support single-hop ad hoc transmission. Spectrum sharing must be carried out in SLs so that no excessive interference is caused to links of the primary network and maximizes the total achievable rates of SLs. We divide the spectrum sharing into two stages: coarse-scale interference mitigation and SINR-based channel mapping. Interference mitigation is done through constructing weighted undirected interference graph and applying k-max cut method. Then we perform channel-cluster mapping, which takes instantaneous channel quality into consider, on the basis of interference mitigation. Low-complexity heuristic algorithms are proposed to effectively solve the problems of each stage. Numerical simulations for various scenarios are executed to show the superior performance of the proposed schemes.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126230001","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 Chinese speech compensation method for the leakage based on generalized sidelobe canceller in hearing aids","authors":"Hui Wang, Linghua Zhang","doi":"10.1109/WCSP.2011.6096941","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096941","url":null,"abstract":"In this paper, the leak of speech caused by generalized sidelobe canceller beamformer algorithm is analyzed from the view of Chinese. A Chinese speech processing technology is proposed to compensate the leak of speech. Amplitude spectrum envelope was modified to improve the similarity between spectrum envelope and the pitch contour with the information of pitch contour. Considering that the speech signal has a great loss in the high frequency range, as a characteristic of the leak information, a consonant amplification method could raising the energy of voiceless consonant, reducing the energy section of the noise and improve speech intelligibility without changing the formant structure. The results show that the signal after the algorithm treatment improved the intelligibility of speech.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125257417","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 unified mathematical model for spatial scrambling based secure wireless transmission and its wiretap method","authors":"Feilong Wu, Wenjie Wang, Huiming Wang, Qinye Yin","doi":"10.1109/WCSP.2011.6096860","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096860","url":null,"abstract":"The spatial scrambling based secure wireless transmission methods, such as artificial noise and antenna array weighted randomly, can secure wireless transmission at the physical layer. They have a common physical essence, that is, the private message is transmitted in the desired direction while deliberate interference is transmitted in other orthogonal directions. Unfortunately, the interference is not white in spatial domain due to the limitation of the transmit antenna number. A eavesdropper can eliminate the directional interferences by the aid of multiple antennas. In this paper, a unified mathematical model for the above physical-layer methods is established, based on which, a MUSIC-like wiretap algorithm is proposed by exploiting the finite alphabet property of communication symbols. Simulation results show that if the eavesdropper has more antennas than that of the transmitter, the proposed algorithm can intercept information effectively.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130045154","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 new approach to weighted sum-rate maximization for the K-user Gaussian interference channel","authors":"Liang Liu, Rui Zhang, K. Chua","doi":"10.1109/WCSP.2011.6096937","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096937","url":null,"abstract":"Characterizing the global maximum of weighted sum-rate (WSR) for the K-user Gaussian interference channel (GIC), with the interference treated as Gaussian noise, is a key problem in wireless communication. However, due to users' mutual interference, this problem is in general non-convex and thus cannot be solved directly by conventional convex optimization techniques. In this paper, by jointly utilizing the monotonic optimization and rate profile techniques, we develop a new approach to obtain the globally optimal power control solution to the WSR maximization problem for the GIC with single-antenna transmitters and receivers. Different from prior work, this paper proposes to maximize the WSR in the achievable rate region of the GIC directly by exploiting the facts that the achievable rate region is a “normal” set and the users' WSR is a “strictly increasing” function over the rate region. Consequently, the WSR maximization problem belongs to the class of monotonic optimization over a normal set and thus can be solved globally optimally by the outer polyblock approximation algorithm. However, an essential step in this algorithm hinges on how to efficiently characterize the intersection point on the Pareto boundary of the achievable rate region with any prescribed “rate profile” vector. This paper shows that such a problem can be transformed into a sequence of signal-to-interference-plus-noise ratio (SINR) feasibility problems, which can be solved efficiently by existing techniques. Furthermore, this paper sheds some lights on how the proposed algorithm can be applied to solve WSR maximization problems for the multi-antenna GICs.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"304 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133091992","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 optimization scheme based on rate guarantee in emergency mesh network","authors":"Su Zhao, Changqing Liang, Qing-min Meng","doi":"10.1109/WCSP.2011.6096698","DOIUrl":"https://doi.org/10.1109/WCSP.2011.6096698","url":null,"abstract":"The wireless mesh network (WMN) is effective as emergency networks in disaster area which has a flexible network topology. The efficiency of the energy is particularly important in the emergency communication network. In this paper, we proposed an energy optimization scheme based on the framework of wireless mesh networks. This scheme ensures the data rate achieved under the condition of the original transmission power in the wireless mesh network, by reducing the mutual interference between nodes to make the transmission power of the nodes down, thus extends the lifespan of the emergency network effectively. A number of simulation results show that the proposed scheme can reduce the transmission power of nodes while ensuring the end-to-end data rates.","PeriodicalId":145041,"journal":{"name":"2011 International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132864558","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}