{"title":"Virtual MIMO-based wireless sensor networks using LDPC codes","authors":"E. Rezayi, B. Abolhassani","doi":"10.1109/CCECE.2009.5090113","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090113","url":null,"abstract":"Energy conservation in wireless sensor networks (WSNs) is one of the primary performance parameters. In this paper, an energy-efficient virtual multiple-input multiple-output (MIMO) communication architecture based on distributed source coding (DSC) is proposed for energy-constrained, distributed wireless sensor networks. Low Density Parity Check (LDPC) code is one of the practical codes that can be used for DSC to compress close to Slepian-Wolf limit. Simulation results show that employing DSC by using a LDPC code with length 1000 and compression ratio of R=3/5 in a virtual MIMO-based WSN achieves better energy efficiency compared to that of a virtual MIMO-based communication system without DSC.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"44 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115814227","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":"The possible use of Fiber Bragg Grating based accelerometers for seismic measurements","authors":"Jack Wu, V. Mašek, M. Čada","doi":"10.1109/CCECE.2009.5090251","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090251","url":null,"abstract":"Over the last two decades, extensive studies and research have opened a new era for Fiber Bragg Grating (FBG) based sensing technologies. One of the new applications is the FBG based accelerometers. In various field applications, FBG based accelerometers are replacing conventional electronic sensors, due to their long term stability, high accuracy and low power consumption. In this paper, theoretical analysis on FBG is introduced followed by the sensing principles. In-depth studies are made on three existing FBG based accelerometers for their unique transducer designs and signal interrogation techniques, and most importantly their possible use for seismic measurements.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131695251","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":"Sampling-based path planning for robust feature-based visual servoing","authors":"F. Arvani, G. Mann, A. Fisher, R. Gosine","doi":"10.1109/CCECE.2009.5090243","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090243","url":null,"abstract":"Classical image-based visual servo methods regulate error in the image space and undergo difficulties when the initial and desired robot positions are distant. It is not trivial to introduce constraints in the realized trajectories and to ensure convergence due to the nonlinearity of the system. This paper proposes a trajectory planning scheme based on Probabilistic Roadmaps (PRM) in order to achieve more robust visual servoing through the introduction of desired constraints at the task planning level such as visibility and occlusion avoidance constraints that ensure the object remains in the camera field of view (FOV). Off-line path planning is performed on a 5DOF robot arm to confirm the validity of the approach.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127545418","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":"Classifying software visualization tools using the Bloom's taxonomy of cognitive domain","authors":"Shaochun Xu, Xuhui Chen, Dapeng Liu","doi":"10.1109/CCECE.2009.5090082","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090082","url":null,"abstract":"There are a lot of software visualization tools existing for various purposes. Therefore, how to choose the right visualization tool for a specific task becomes an important issue. Although there are a few taxonomies for classifying visualization tools, each has its own defects. This paper proposes a new classification schema based on the widely used Bloom's cognitive taxonomy. We summarize a set of questions for each level of the Bloom taxonomy using the well defined verbs, to identify if the visualization tool belongs to the individual cognitive level, which in turn can determine the purposes of the tool. We also conduct case studies on four tools to evaluate this new approach. The result demonstrates that the new classification schema can provide good guidance for people to choose a useful visualization tool.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125341849","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 comprehensive simulation study of SWAN QoS model in MANETs with proactive and reactive routing","authors":"Ning Zhang, A. Anpalagan","doi":"10.1109/CCECE.2009.5090203","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090203","url":null,"abstract":"In this paper, one of the QoS models for MANETs - SWAN is studied under varying conditions to provide both quantitative and qualitative assessments of the applicability of the model in different scenarios. Results and analysis from NS-2 based simulation indicate that (i) real-time (RT) applications in SWAN-enabled mobile ad hoc networks experience low and stable delays under various traffic and mobility environment at the expense of best-effort (BE) traffic, (ii) SWAN model works compatibly with proactive as well as reactive routing protocols. A careful choice of parameters is important to balance the throughput of the BE traffic and RT traffic and QoS provisions in MANETs.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121632670","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":"Spectrally efficient cooperative coded schemes for next generation wireless networks","authors":"Mahmood Mohassel Feghhi, B. Abolhassani","doi":"10.1109/CCECE.2009.5090110","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090110","url":null,"abstract":"Both cooperative diversity and adaptive modulation provide significant enabling techniques for future generations of wireless communication networks. In this paper, we consider an IRCC (incremental redundancy cooperative coding) based cooperative network, which uses adaptive node transmission. Two cases are considered: (i) adaptive transmission only at relay nodes; (ii) adaptive transmission at source and relay nodes. The performance of these two cases are evaluated in terms of the average bit error rate (ABER) and the average spectral efficiency (ASE) and compared with those of noncooperative scheme without adaptive transmission over Rayleigh fading channels. Simulation results show that the IRCC scheme without adaptive modulation (AM) provides 28% more spectral efficiency compared with that of noncooperative case without AM. However, using AM and selecting the best relay in the IRCC scheme, this improvement increases to 100% at SNR of 1 dB.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114206730","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 image watermarking algorithm based on wavelet transform","authors":"K. Loukhaoukha, J. Chouinard","doi":"10.1109/CCECE.2009.5090126","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090126","url":null,"abstract":"In this paper, we proposed a new non blind robust digital watermarking algorithm for embedding binary image watermark in grayscale images. For embedding procedure, three levels discrete wavelet transform of cover image is computed. Afterward the watermark image is added in the high-high (HH), low-high (LH) and high-low (HL) subbands using a threshold coefficients. The low-low (LL) subband coefficients are not used in embedding procedure because that the human visual system (HVS) is less sensitive to the small change in edges and textures of image. Comparing the performance of our method to other watermarking methods, the proposed method show good performance in terms of invisibility and robustness. Experimental results demonstrate that the proposed method has a good robustness against several attacks such as: noise addition, histogram equalization, Gamma correction, JPEG compression, cropping and randomly line and column removal.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114525983","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":"Cluster head selection using RF signal strength","authors":"Scott Fazackerley, Alan Paeth, R. Lawrence","doi":"10.1109/CCECE.2009.5090148","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090148","url":null,"abstract":"The LEACH algorithm for selecting cluster heads is a probabilistic method which produces clusters with a large variation of link distances and uneven energy consumption during the data transmission phase. To address this issue, a RF signal strength algorithm based on link quality is presented. Using a competitive distributed algorithm, nodes attempt to reduce the overall energy required for transmission in addition to forming favourable clusters based on Received Signal Strength Indication (RSSI) density and quality. Cluster heads form in areas of high node density leading to a significant reduction in transmission link length, a reduced variance in link length distribution and greater opportunity for energy savings through data aggregation. Simulations show that cluster heads selected by this algorithm form clusters with a lower average link length and have less link distance variability. This produces a lower and more evenly distributed energy cost per node in the network.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121522009","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":"Experimental validation of statistical algorithm for diagnosis of damage fault","authors":"Amar Kumar, A. Nayak, A. Srivastava, N. Goel","doi":"10.1109/CCECE.2009.5090217","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090217","url":null,"abstract":"A statistical algorithm was developed for the damage fault diagnosis and prognosis tool and the present work focuses on the experimental validation. The oxide scale growth experiments using laboratory samples under thermal cycling simulate the hot section turbine blade coating failures. The experimental steps, oxide thickness data measurement, collection and sampling procedures are discussed. Three data samples each from two groups under different thermal cycling conditions are considered. The data are subjected to randomness check, preprocessing, rank sum test etc. The validation is carried out with 15 possible combinations for analysis. Consistent with the mean thickness distribution for the samples in two groups, the statistical algorithm for damage and anomaly diagnosis yields expected results.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115438629","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":"Formal semantics of UML state diagram and automatic verification based on Kripke structure","authors":"Yefei Zhao, Zongyuang Yang, Jinkui Xie","doi":"10.1109/CCECE.2009.5090274","DOIUrl":"https://doi.org/10.1109/CCECE.2009.5090274","url":null,"abstract":"If UML is formalized with dynamic semantics, automatic verification can be performed for system model in the early stage of software procedure. It becomes more and more important to apply model checking in UML, such that software architecture can be formalized with dynamic semantics. We explicitly proposed the mapping rules between UML state diagram and Kripke structure semantics. UML state diagram is mapped to the value transition of variable rather than the transition of states, thus the situation in that system finite state automata can't be exhausted can be resolved. Finally, a critical resource competition example is illustrated according to the theory. The mapping rules we proposed are bi-direction, as a result, the theory can be applied in both forward software engineering in design phase and reverse software engineering in implementation phase.","PeriodicalId":153464,"journal":{"name":"2009 Canadian Conference on Electrical and Computer Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122658736","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}