{"title":"An Empirical Analysis of Ad hoc Routing Protocols for Hybrid Wireless Sensor Networks","authors":"M. Saleemand, M.A. Sheikh","doi":"10.1109/ICEE.2007.4287317","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287317","url":null,"abstract":"This paper investigates and evaluates the possible use of existing ad hoc routing protocols for hybrid wireless sensor networks. The key idea is to adopt the routing protocols designed for Mobile Ad hoc Networks (MANETs) in a hybrid sensor network that consist of resource enriched nodes (which may be mobile or static) and resource constrained nodes (static). The role of resource constrained sensor nodes is to deliver the sensed data to a nearest resource enriched node that can either store/process the data or transmit it to a central base station using high power transmission. By virtue of this, we might be able to save time and effort involved in the design of a completely new routing protocol from scratch for such a hybrid and more practical scenario. Our study is inspired by the similarities found in both MANETs and wireless sensor networks e.g. ad hoc arrangement of nodes, energy constrained devices, wireless communications etc Based on the similarities of the two networks, we formulated a set of design principles on the basis of which a protocol designed for ad-hoc networks may be declared feasible for a hybrids sensor network. Our work is supported by an experimental analysis in which an example protocol primarily designed for MANETs has been shown to perform efficiently in a resource constrained sensor network.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123261597","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}
M. Bonyadi, S.M.R. Azghadi, N.M. Rad, K. Navi, E. Afjei
{"title":"Logic Optimization for Majority Gate-Based Nanoelectronic Circuits Based on Genetic Algorithm","authors":"M. Bonyadi, S.M.R. Azghadi, N.M. Rad, K. Navi, E. Afjei","doi":"10.1109/ICEE.2007.4287307","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287307","url":null,"abstract":"In this paper we propose a novel and efficient method for majority gate-based design. The basic Boolean primitive in quantum cellular automata (QCA) is the majority gate. Method for reducing the number of majority gates required for computing Boolean functions is developed to facilitate the conversion of sum of products (SOP) expression into QCA majority logic. This method is based on genetic algorithm and can reduce the hardware requirements for a QCA design. We will show that the proposed approach is very efficient in deriving the simplified majority expression in QCA design.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126813043","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 Noval Design of Deterministic Interleaver for Turbo Codes","authors":"M. Arif, N. M. Sheikh","doi":"10.1109/ICEE.2007.4287354","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287354","url":null,"abstract":"An efficient design of an interleaver is essential to achieve near Shannon capacity performance with turbo codes. The turbo code performance curve can change its slope in low bit error rate (BER) region, if the interleaver is not designed properly. In this paper the design of an interleaver that combines randomization and de-correlation property with regular permutation, and yet guaranties an enlarged minimum distance, is proposed. Our solution to design a deterministic interleaver outperforms the random and semi-random interleavers particularly for the turbo codes with short block length. Distance spectrum distribution and simulation results are presented and compared with well established S -random interleaver.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126386022","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":"Efficient Training Data Reduction for SVM based Handwritten Digits Recognition","authors":"I. Javed, M. N. Ayyaz, W. Mehmood","doi":"10.1109/ICEE.2007.4287360","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287360","url":null,"abstract":"Support vector machine (SVM) are binary classifiers that make any two classes linearly separable by finding a maximum-margin hyper-plane between the data samples of the two classes in a given feature space. Once the discrimination function of this hyper-plane has been found during the training stage, any unknown sample can be classified by checking the sign of this discrimination function for the unknown sample. It is well understood in SVM theory that the equation of SVM discrimination function is largely determined by data points close to the decision boundary. These data points close to the decision boundary are called as support vectors (SV). SVM training process for large data sets is often a time consuming process. Hence reducing the original data to contain only the SVs is a useful goal for speeding up the training process. This reduction of training data should not affect the accuracy of SVM classifier. In this paper, we propose an efficient training data reduction algorithm (Peer-SV) for SVM classifiers. The algorithm is based on the observation that the desired support vectors are those data points which are of opposite classes and whose diametric sphere does not contain any other class instance of the two classes. We have found these SVs in an efficient way i.e. computing the SVs between the peer classes only and removing the farthest points earlier to retain the border points. The algorithm has been tested on handwritten digits data sets. The results obtained on the total data and on the reduced data shows the accuracy of the adopted approach.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125680338","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":"EM-Based Channel Estimation Algorithms for MIMO Turbo Receivers","authors":"S. Salari, M. Ahmadian, M. Ardebilipour","doi":"10.1109/ICEE.2007.4287296","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287296","url":null,"abstract":"Multiple-input multiple-output (MIMO) systems combined with orthogonal frequency division multiplexing (OFDM), can improve communication quality and capacity. In this paper, we consider channel estimation issue in a MIMO-OFDM system using low-density parity-check (LDPC) codes at transmitter and iterative detection based on a maximum a posteriori (MAP) demodulator and a soft LDPC decoder at receiver. We first consider a previously proposed solution based on least-square estimator (USE). Since matrix inversion is required in LSE algorithms, their computational cost for implementation is high. Then, we resort to the expectation-maximization (EM)-type algorithms, which significantly reduce the complexity of the channel estimation, and propose a modified turbo receiver for LDPC-coded MIMO-OFDM systems which performs the channel estimation by space alternating generalized EM (SAGE) algorithm. Based on simulation results, the performance of the proposed receiver is quite satisfying.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131610884","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":"Developing A Secure Mechanism for Bluetooth-based Wireless Personal Area Networks (WPANs)","authors":"M. Othman, W. H. Hassan, A. Abdalla","doi":"10.1109/ICEE.2007.4287344","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287344","url":null,"abstract":"This paper highlights our work in developing an enhanced security framework for Bluetooth-based wireless personal area networks (WPANs). The basic security architecture of Bluetooth, operating at the link layer, is augmented with a higher application layer security mechanism for authentication and message integrity. This is necessary since the present Bluetooth security has certain drawbacks in its implementation making it insecure. The use of digital signatures and trusted or certified public keys form the basic premise and approach in this work in providing stronger security for WPANs. Our work involves developing a prototype for Bluetooth systems using RSA and DSA encryption algorithms. An analysis was done to ascertain which of these algorithms is more suited to our proposed security framework and the results indicated that in most instances, the RS A performed better.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131808920","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}
Ali Mohammadi, A. Ayatollahi, A. Abrishamifar, A. Beygi
{"title":"Frequency Synthesizer Settling Time and Phase Noise Issues For WLAN Transceiver Application in IEEE 802.11n Standard","authors":"Ali Mohammadi, A. Ayatollahi, A. Abrishamifar, A. Beygi","doi":"10.1109/ICEE.2007.4287334","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287334","url":null,"abstract":"Frequency synthesizer design issues for WLAN applications in IEEE 802.11n standard (draft) are proposed in a systematic aspect. A new concept is introduced on effective phase noise traded off with the settling time which is optimized through widening the loop filter band-width. Simulations are carried out through PLL Design Assistant. Expected phase noise and settling behavior of standard are translated to synthesizer. The effects of phase noise on OFDM constellation error is demonstrated by ADS software.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133000070","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":"Effect of Group Size on Anycasting with Receiver Base Forwarding in Delay Tolerant Networks","authors":"F. Hadi, N. Shah, A. H. Syed, M. Yasin","doi":"10.1109/ICEE.2007.4287301","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287301","url":null,"abstract":"Delay/disruption tolerant networks (DTNs) are known for frequent and long duration partitions and end-to-end connectivity may be absent between the source and the destination. Anycast service is used for applications such as information exchange in hazards/crisis situation, recourse discovery, etc in Delay Tolerant Networks. For a specific type of DTN, where the mobile nodes are sparsely distributed, communicating via low radio range experience frequent and long duration partition and end-to-end path may not be present at the time of message generation. We have proposed a Receiver Based Forwarding (RBF) scheme for anycasting in DTN, which considers the path length as well as the number of receivers in forwarding the anycast bundle to the next hop Group size plays an important role in DTN anycasting, the group size varies in different scenarios. In this paper we have studied the effect of group size on our proposed Anycasting protocol by varying the group size from 3 to 15. Our simulation results have shown that the RBF performs better than the normal forwarding (NF) in term of data delivery ratio, average end-to-end delay and overall data efficiency because the probability of available receivers increases.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"517 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133598831","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":"Design and Development of a Six-Legged Robot with Simplified Control Architecture","authors":"S. M. Mannan, Y. Ayaz, Saeed-ur-Rehman, S. Farrah","doi":"10.1109/ICEE.2007.4287297","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287297","url":null,"abstract":"A six-legged robot named 'Mechatron-1' has been developed. This paper contains a description of the design and working of the robot. A thorough study of its leg motion has been done in order to perform a stability analysis based upon the minimum longitudinal stability margin criteria. The main emphasis in the robot's structural design was to reduce the controller complexity required for proper operation. Mechatron-1 is a wave gait robot designed for general applications in everyday human environment.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133758709","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 Proposed Preventive Information Security System","authors":"M. Anwar, M. Zafar, Zafar Ahmed","doi":"10.1109/ICEE.2007.4287288","DOIUrl":"https://doi.org/10.1109/ICEE.2007.4287288","url":null,"abstract":"Managing computer and network security programs has become an increasingly difficult and challenging job. Dramatic advances in computing and communications technology during the past few years have redirected the focus of data processing from the computing center to the terminals in individual offices and homes. The result is that managers must now monitor security on a more widely dispersed level. These changes are continuing to accelerate, making the security manager's job increasingly difficult. In this paper a better solution for Information Security management has been proposed by designing PrISM (Preventive Information Security Management). PrISM aims to develop and deploy an indigenous Information Security Management System (ISMS) with intrusion prevention capabilities. The objective is to develop an ISMS with appropriate security assurance controls and risk handling processes. This will provide best protection of critical assets against information warfare attacks. The task has been planned by performing reverse engineering of Open Source Security Information Management (OSSIM) system. A detailed discussion on OSSIM and commercially available software Event Horizon has also been presented.","PeriodicalId":291800,"journal":{"name":"2007 International Conference on Electrical Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121457655","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}