{"title":"Particle swarm optimization based MUD for overloaded MC-CDMA system","authors":"M. Choudhry, M. Zubair, I. Qureshi","doi":"10.1109/WCINS.2010.5541874","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541874","url":null,"abstract":"The overloaded CDMA system, in which the number of users is larger than the dimension of signal space experiences a very serious problem of multiple access interference which is the major limiting factor for the channel capacity. In this letter we used multicarrier communication to resolve the problem of overloading. Computational complexity associated with optimum maximum likelihood detector (MLD) in wideband code division multiple access (WCDMA) systems is also addressed by using the particle swarm optimization (PSO) algorithm. In the proposed scheme, large number of users in an overloaded system is divided in groups. A carrier is modulated with the composite signal of each group. The carriers of each group are orthogonal to each other. Detection of individual users in a particular group is accomplished through PSO algorithm. PSO algorithm lowers the search space compared to MLD. Simulation results show that PSO algorithm avoids being trapped in any local minima and gives a much faster convergence compared to MLD. It also performed better than other suboptimal detectors.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125074976","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":"Low complexity video watermarking algorithm by exploiting CAVLC in H.264/AVC","authors":"Dawen Xu, Rangding Wang, Jicheng Wang","doi":"10.1109/WCINS.2010.5541810","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541810","url":null,"abstract":"As H.264/AVC digital video becomes more prevalent, issues of copyright protection and authentication that appropriate for this standard become very important. In this paper, an authentication watermarking algorithm for H.264/AVC compressed video by modulating CAVLC code words of 4×4 luminance blocks is proposed. During the embedding process, the eligible code words are first identified, and then the modulating rules between these code words and the watermark bits are established. The watermark information can be extracted directly from the encoded stream without resorting to the original video, and merely requires decoding the CAVLC code from bit stream rather than decoding the whole video. Experimental results show that the proposed watermarking scheme can effectively embed watermark information with little bit rate increase and almost no quality degradation.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126988940","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}
Xiaogang Yang, Weitao Du, Jingang Yu, Rui Lv, Zhanxin Yang
{"title":"A novel 3780-point FFT","authors":"Xiaogang Yang, Weitao Du, Jingang Yu, Rui Lv, Zhanxin Yang","doi":"10.1109/WCINS.2010.5541737","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541737","url":null,"abstract":"This paper proposes a novel 3780-point FFT algorithm for the China national broadcasting standard. This new algorithm adopts the pure PFA (prime factor algorithm) and nested Winograd FFT which can realize the identity in the circuit structure. The simulation demonstrates that the new algorithm can achieve the equal accuracy rather than other methods but with the least quantity of multiplication.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115998238","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 cross-layer QoS scheme for MPEG-4 streams","authors":"Zemin Ma, Jinhe Zhou, Tonghai Wu","doi":"10.1109/WCINS.2010.5543738","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5543738","url":null,"abstract":"Video streams over wireless channel requires stringent QoS constraints, such as low packet loss and latency. It becomes the main challenge to design a network to achieving these QoS objectives. In this paper, a priority-based cross-layer quality-of-service (QoS) scheme for wireless channel and video applications was introduced. The application layer sends an inquiry to examine the link state. Respectively, the link layer feedbacks a trigger to indicate the state of link information. On the other hand, unequal error protection was adapted for retransmission decision. When a packet was dropped, ARQ decision will be make according to the priority-based adaptive QoS of MPEG-4 video streams. Simulation results demonstrate that video processed in cross-layer scheme experiences much better than that of traditional scheme, not only in PSNR but also in visual quality.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126356582","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 distributed class-based alternative routing under a congestion control architecture for LEO satellite networks","authors":"Cao Huang, Falin Liu","doi":"10.1109/WCINS.2010.5544124","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5544124","url":null,"abstract":"In this paper, contrary to the popular macro-perspective method, we analyze occurrences of congestions and packet-droppings from micro-perspective. The local topology of LEO satellite networks provides an advantage of implementing the distributed alternative routing. This micro analysis is developed to construct a congestion control architecture, including the satellite routing, the crosslayer TCP and the gateway control. A distributed class-based alternative routing method, satisfying the different QoS requirements of different traffic classes, is proposed for the satellite routing part to achieve high performance alone for the satellites without connecting the gateway. The performance is evaluated using the Network Simulator, and encouraging results are obtained.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128933994","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":"Volunteer-instigated connectivity restoration algorithm for Wireless Sensor and Actor Networks","authors":"M. Imran, M. Younis, A. Said, H. Hasbullah","doi":"10.1109/WCINS.2010.5544679","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5544679","url":null,"abstract":"Due to their applications, Wireless Sensor and Actor Networks (WSANs) have recently been getting significant attention from the research community. In these networks, maintaining inter-actor connectivity is of a paramount concern in order to plan an optimal coordinated response to a detected event. Failure of an actor may partition the inter-actor network into disjoint segments, and may thus hinder inter-actor coordination. This paper presents VCR, a novel distributed algorithm that opts to repair severed connectivity while imposing minimal overhead on the nodes. In VCR the neighbors of the failed actor volunteer to restore connectivity by exploiting their partially utilized transmission range and by repositioning closer to the failed actor. Furthermore, a diffusion force is applied among the relocating actors based on transmission range in order to reduce potential of interference, and improve connectivity. VCR is validated through simulation and is shown to outperform contemporary schemes found in the literature.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116909940","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":"Inter-carrier cooperative coding/decoding for OFDM systems using geometric mean decomposition","authors":"Rui Chen, Jiandong Li, Wei Liu, Jian Li","doi":"10.1109/WCINS.2010.5544053","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5544053","url":null,"abstract":"Assuming the availability of the channel state information at the transmitter (CSIT) and receiver (CSIR), we propose two novel inter-carrier cooperative coding / decoding (ICC) schemes that can transform all subcarriers of an OFDM system into the same number of subchannels with identical capacities. One scheme is the combination of a linear precoder and a minimum zero-forcing VBLAST like decoder followed by a linear equalizer, which is referred to as VBLAST-ICC, and the other scheme includes a linear pre-equalizer followed by a dirty paper (DP) precoder and a DP decoder, which we refer to as DP -ICC. The ICC schemes can provide much convenience for the modulation / demodulation and coding / decoding procedures due to obviating the need for bit allocation. The simulation results show that the ICC schemes exhibit excellent performance at high SNRs compared with traditional OFDM scheme.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128418119","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":"Study of MANET routing evaluation model based on Best-First","authors":"Qiao Luo, Jing Chen, Chonghui Huang, Guirong Chen","doi":"10.1109/WCINS.2010.5542312","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5542312","url":null,"abstract":"This paper surveys many MANET routing protocols currently, analyses their merits and disadvantages, put forwards a routing evaluation model based on Best-First. It will select out the eximious ones from a great deal of MANET routing protocols, make clear each protocol's best boundary condition and contribution of the extraction efficiency, then find out the best protocol to satisfy the changing MANET net. The experiment proves that this evaluation model can greatly increase the MANET routing efficiency.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131959740","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 secure anonymous path routing protocol for wireless sensor networks","authors":"Zhiming Zhang, Changgen Jiang, J. Deng","doi":"10.1109/WCINS.2010.5544121","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5544121","url":null,"abstract":"recently, how to support secure anonymous communications in resource restricted wireless sensor network has became the hot topic. In this paper, a secure anonymous routing protocol for wireless sensor network is proposed based on bilinear pairing and exclusive or operation, the protocol not only can provide routing anonymity, location privacy and the identity confidentiality of source node and destination node, but also has the backward and forward security. In this protocol, the symmetric secret key substitute for the asymmetric secret key, and the exclusive or operation substitute for the mould exponent operation, the protocol improves distinctly in computation, and is more suitable for the wireless sensor network.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133196652","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}
Wang Zhong-xun, Yu Xin-qiao, Wang Xing-cheng, Guo Dong
{"title":"An improved IWBF decoding algorithm based on LDPC codes in the image transmission","authors":"Wang Zhong-xun, Yu Xin-qiao, Wang Xing-cheng, Guo Dong","doi":"10.1109/WCINS.2010.5541758","DOIUrl":"https://doi.org/10.1109/WCINS.2010.5541758","url":null,"abstract":"In order to improve the performance and the decoding convergence speed of the improved weighted bit-flipping algorithm (IWBF), an algorithm based on the characteristics of parallel bit-flipping algorithm that updates multiple bits in each iteration is presented here. Also this algorithm is used in the image transmission. Simulation results show that: improved algorithm not only enables significant improvement in bit error performance, the decoding convergence speed has also been greatly improved, and the image transmission in communication can obtain high speed and high equality.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":" 40","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113951403","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}