Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723907
Haosong Gou, Md. Kafil Uddin, M. Hossen
Cooperative communication has been considered as a promising method for benefiting the advantages from MIMO (multiple-input multiple-output) system for single antenna mobiles in the wireless network, and many important milestones in this area have been achieved, leading to a flurry of research activity. Especially, cooperative communication in wireless sensor networks (WSNs) has gained so much interest due to the limitations of WSNs. This paper proposes a new cooperative communication method for WSNs in port logistics according to the observation of real application in port. In our proposed method, we use some fixed agents to help the sensor nodes to gain more efficient communication in the network. The simulation results and analysis show that our method achieves a good performance in enhancing the transmission and energy efficiency, resulting in improvement of the communication performance of the whole network.
{"title":"An agent-based cooperative communication method in wireless sensor network for port logistics","authors":"Haosong Gou, Md. Kafil Uddin, M. Hossen","doi":"10.1109/ICCITECHN.2010.5723907","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723907","url":null,"abstract":"Cooperative communication has been considered as a promising method for benefiting the advantages from MIMO (multiple-input multiple-output) system for single antenna mobiles in the wireless network, and many important milestones in this area have been achieved, leading to a flurry of research activity. Especially, cooperative communication in wireless sensor networks (WSNs) has gained so much interest due to the limitations of WSNs. This paper proposes a new cooperative communication method for WSNs in port logistics according to the observation of real application in port. In our proposed method, we use some fixed agents to help the sensor nodes to gain more efficient communication in the network. The simulation results and analysis show that our method achieves a good performance in enhancing the transmission and energy efficiency, resulting in improvement of the communication performance of the whole network.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122827464","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723903
M. Islam, M. Karim
The paper proposes a new technology to ensure enhanced security of personal identification information or binary images through the use of encryption and multiplexing processes. Orthogonal codes are employed to encrypt the given input images so that multiple encoded images can then be mixed together to save storage space or transmission bandwidth. The multiplexed and encoded image is further encrypted employing multiple reference-based joint transform correlation. The address code is fed into four channels after performing phase shifting on them by different amount. The input image is introduced to the channels to obtain joint power spectra (JPS) signals through Fourier transformation. The resultant signals are phase-shifted and then combined to form a modified JPS signal which is then inverse Fourier transformed to yield the final and highly secure encrypted image. At the receiver, the image is Fourier transformed and multiplied by the address code used in encryption. Inverse Fourier transformation yields the multiplexed and encoded image which is then decoded using orthogonal codes. The proposed technique enhances the security performance by implementing orthogonal coding and nonlinear encryption algorithms so that no unauthorized access to or interception of information is possible. Performance of the technique is evaluated through computer simulation.
{"title":"Optical encryption system employing orthogonal code and multiple reference-based joint transform correlation","authors":"M. Islam, M. Karim","doi":"10.1109/ICCITECHN.2010.5723903","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723903","url":null,"abstract":"The paper proposes a new technology to ensure enhanced security of personal identification information or binary images through the use of encryption and multiplexing processes. Orthogonal codes are employed to encrypt the given input images so that multiple encoded images can then be mixed together to save storage space or transmission bandwidth. The multiplexed and encoded image is further encrypted employing multiple reference-based joint transform correlation. The address code is fed into four channels after performing phase shifting on them by different amount. The input image is introduced to the channels to obtain joint power spectra (JPS) signals through Fourier transformation. The resultant signals are phase-shifted and then combined to form a modified JPS signal which is then inverse Fourier transformed to yield the final and highly secure encrypted image. At the receiver, the image is Fourier transformed and multiplied by the address code used in encryption. Inverse Fourier transformation yields the multiplexed and encoded image which is then decoded using orthogonal codes. The proposed technique enhances the security performance by implementing orthogonal coding and nonlinear encryption algorithms so that no unauthorized access to or interception of information is possible. Performance of the technique is evaluated through computer simulation.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125442187","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723879
Pallab Biswas, V. Nair, Soumen Nandi, S. Biswas, Amit Biswas, Animesh Dutta
Classroom teaching has always been a face to face interaction between students and teachers and here in the proposed system we would like to preserve this aspect of teaching with help of information and communication technology. We like to bring this quality along with the concept of geographical independence in a distributed system. Teleteaching as in any collaborative system is difficult to model. Before any implementation we need to model the system. Here we have used ontology to create a level of abstraction which broadly defines a model and the dependencies of activities, thus, making the system easy to interact and modify.
{"title":"Session management protocol for virtual classroom in teleteaching","authors":"Pallab Biswas, V. Nair, Soumen Nandi, S. Biswas, Amit Biswas, Animesh Dutta","doi":"10.1109/ICCITECHN.2010.5723879","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723879","url":null,"abstract":"Classroom teaching has always been a face to face interaction between students and teachers and here in the proposed system we would like to preserve this aspect of teaching with help of information and communication technology. We like to bring this quality along with the concept of geographical independence in a distributed system. Teleteaching as in any collaborative system is difficult to model. Before any implementation we need to model the system. Here we have used ontology to create a level of abstraction which broadly defines a model and the dependencies of activities, thus, making the system easy to interact and modify.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125577114","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723927
N. M. Shafiul Kabir Chowdhury, Md. Shahriar Hussain, Farruk Ahmed
The goal of this paper is to validate a formulae, originally derived to calculate the throughout upper bound of the IEEE 802.11 networks, over a single Access Point (AP) based WLAN system combined with the IEEE 802.11e EDCA mechanism. In this paper some important assumptions are made to keep the formulae very simple. The most important assumption is that, the AP is providing service to client nodes with only one type of Access Category (AC) traffic at an instant. Comparing both the theoretically achieved maximum throughput and simulation results, for different access categories (ACs) and for different packet sizes we observed that the formulae is pretty much accurate except for only one test case.
{"title":"Theoretical maximum throughput of IEEE 802.11e EDCA mechanism","authors":"N. M. Shafiul Kabir Chowdhury, Md. Shahriar Hussain, Farruk Ahmed","doi":"10.1109/ICCITECHN.2010.5723927","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723927","url":null,"abstract":"The goal of this paper is to validate a formulae, originally derived to calculate the throughout upper bound of the IEEE 802.11 networks, over a single Access Point (AP) based WLAN system combined with the IEEE 802.11e EDCA mechanism. In this paper some important assumptions are made to keep the formulae very simple. The most important assumption is that, the AP is providing service to client nodes with only one type of Access Category (AC) traffic at an instant. Comparing both the theoretically achieved maximum throughput and simulation results, for different access categories (ACs) and for different packet sizes we observed that the formulae is pretty much accurate except for only one test case.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121130518","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723820
Faisal Mohsin
In this paper, we have shown a new design for double qutrit multiplier for quantum computer. This multiplier can be an essential part of quantum arithmetic logic unit (ALU). This proposal is based on ion-trap scheme of quantum computer, which is practically realizable using current technology.
{"title":"A low cost realization of quantum double qutrit multiplier using ion-trap scheme","authors":"Faisal Mohsin","doi":"10.1109/ICCITECHN.2010.5723820","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723820","url":null,"abstract":"In this paper, we have shown a new design for double qutrit multiplier for quantum computer. This multiplier can be an essential part of quantum arithmetic logic unit (ALU). This proposal is based on ion-trap scheme of quantum computer, which is practically realizable using current technology.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122194495","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723926
A.K.M. Nazmus Sakib, M. M. S. Kowsar
As a promising broadband wireless technology, WiMAX has many salient advantages over such as: high data rates, quality of service, scalability, security and mobility. Many sophisticated authentication and encryption techniques have been embedded into WiMAX but it still facing a lot of challenging situations. This paper shows different security vulnerabilities found in IEEE 802.16e and gives possible solutions to eliminate them. These vulnerabilities are the possibilities to forge key messages in Multi- and Broadcast operation, some unauthenticated messages which are susceptible to forgery and the unencrypted management communication which reveals important management information. We modify DH key exchange protocol to fit it into mobile WiMAX network as well as eliminate existing weakness in original DH key exchange protocol.
{"title":"Shared key vulnerability in IEEE 802.16e: Analysis & solution","authors":"A.K.M. Nazmus Sakib, M. M. S. Kowsar","doi":"10.1109/ICCITECHN.2010.5723926","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723926","url":null,"abstract":"As a promising broadband wireless technology, WiMAX has many salient advantages over such as: high data rates, quality of service, scalability, security and mobility. Many sophisticated authentication and encryption techniques have been embedded into WiMAX but it still facing a lot of challenging situations. This paper shows different security vulnerabilities found in IEEE 802.16e and gives possible solutions to eliminate them. These vulnerabilities are the possibilities to forge key messages in Multi- and Broadcast operation, some unauthenticated messages which are susceptible to forgery and the unencrypted management communication which reveals important management information. We modify DH key exchange protocol to fit it into mobile WiMAX network as well as eliminate existing weakness in original DH key exchange protocol.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114632825","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723922
Nadia Nowshin, A. Arifuzzman, Md. Anwar Hossain, M. Tarique
This paper deals with the performance analysis (i.e., Symbol Error Rate) of M-ary Phase-shift-keying (M-PSK) and M-ary Quadrature Amplitude Modulation (M-QAM) to transmit information using Selection Combining (SC) diversity technique over flat Rayleigh communication channel with Orthogonal Frequency Division Multiplexing (OFDM). It is well known that the multipath fading phenomenon is an inherent characteristic of wireless channel. In this paper, it is shown how selection combining diversity scheme enhances reliability in wireless communication by minimizing the channel fluctuations due to fading. The simulation results show that the Signal-to-Noise Ration (SNR) varies between M-PSK and M-QAM but better SNR gain achieved as the number of receiving antenna increases like for two, three and four receiving antennas around 20–27 dB, 22–30 dB, 23–31 dB diversity gains are found respectively.
{"title":"Performance comparison of Selection Combining diversity receivers for different modulation schemes in OFDM system","authors":"Nadia Nowshin, A. Arifuzzman, Md. Anwar Hossain, M. Tarique","doi":"10.1109/ICCITECHN.2010.5723922","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723922","url":null,"abstract":"This paper deals with the performance analysis (i.e., Symbol Error Rate) of M-ary Phase-shift-keying (M-PSK) and M-ary Quadrature Amplitude Modulation (M-QAM) to transmit information using Selection Combining (SC) diversity technique over flat Rayleigh communication channel with Orthogonal Frequency Division Multiplexing (OFDM). It is well known that the multipath fading phenomenon is an inherent characteristic of wireless channel. In this paper, it is shown how selection combining diversity scheme enhances reliability in wireless communication by minimizing the channel fluctuations due to fading. The simulation results show that the Signal-to-Noise Ration (SNR) varies between M-PSK and M-QAM but better SNR gain achieved as the number of receiving antenna increases like for two, three and four receiving antennas around 20–27 dB, 22–30 dB, 23–31 dB diversity gains are found respectively.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130030720","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723860
D. Bhadra, T. A. Tarique, S. U. Ahmed, M. Shahjahan, K. Murase
A neural representation of combinational logic circuit is proposed, called ‘Logical Neural Network’ (LNN). LNN is a feed-forward neural network (NN) where the weights of the network indicate the connections of digital circuit. The logic operations of the circuit such as AND, OR, NOR etc are performed with the neurons of LNN. A modification of Simple Genetic Algorithm (mSGA) is applied to design and optimize the LNN for a given truth table. The proposed technique is experimentally studied on four bit parity checker, two bit multiplexer, two bit full adder, full subtractor, and two bit multiplier circuits. LNN is compared with conventional ‘Cell Array’ method. LNN outperforms the Cell Array method in terms of number of required gates.
{"title":"An encoding technique for design and optimization of combinational logic circuit","authors":"D. Bhadra, T. A. Tarique, S. U. Ahmed, M. Shahjahan, K. Murase","doi":"10.1109/ICCITECHN.2010.5723860","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723860","url":null,"abstract":"A neural representation of combinational logic circuit is proposed, called ‘Logical Neural Network’ (LNN). LNN is a feed-forward neural network (NN) where the weights of the network indicate the connections of digital circuit. The logic operations of the circuit such as AND, OR, NOR etc are performed with the neurons of LNN. A modification of Simple Genetic Algorithm (mSGA) is applied to design and optimize the LNN for a given truth table. The proposed technique is experimentally studied on four bit parity checker, two bit multiplexer, two bit full adder, full subtractor, and two bit multiplier circuits. LNN is compared with conventional ‘Cell Array’ method. LNN outperforms the Cell Array method in terms of number of required gates.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"2419 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130770312","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723888
Md. Anisuzzaman Siddique, Y. Morimoto
Skyline queries have recently attracted a lot of attention for its intuitive query formulation. It can act as a filter to discard sub-optimal objects. However, a major drawback of skyline is that, in datasets with many dimensions, the number of skyline objects becomes large and no longer offer any interesting insights. To solve the problem, recently k-dominant skyline queries have been introduced, which can reduce the number of skyline objects by relaxing the definition of the dominance. This paper addresses the problem of k-dominant skyline objects for high dimensional dataset. We propose algorithms for k-dominant skyline computation. Through extensive experiments with real and synthetic datasets, we show that our algorithms can efficiently compute k-dominant skyline queries.
{"title":"Efficient computation for k-dominant skyline queries with domination power index","authors":"Md. Anisuzzaman Siddique, Y. Morimoto","doi":"10.1109/ICCITECHN.2010.5723888","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723888","url":null,"abstract":"Skyline queries have recently attracted a lot of attention for its intuitive query formulation. It can act as a filter to discard sub-optimal objects. However, a major drawback of skyline is that, in datasets with many dimensions, the number of skyline objects becomes large and no longer offer any interesting insights. To solve the problem, recently k-dominant skyline queries have been introduced, which can reduce the number of skyline objects by relaxing the definition of the dominance. This paper addresses the problem of k-dominant skyline objects for high dimensional dataset. We propose algorithms for k-dominant skyline computation. Through extensive experiments with real and synthetic datasets, we show that our algorithms can efficiently compute k-dominant skyline queries.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134009736","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}
Pub Date : 2010-12-01DOI: 10.1109/ICCITECHN.2010.5723867
S. Chattopadhyay, S. K. Sanyal, A. Chandra
Modern signal processing applications invoke various evolutionary algorithms in different areas such as aerodynamic shape optimization, pattern recognition, digital filter design, automated mirror design etc. Presently, Differential Evolution (DE) algorithm has proved to be quite efficient in these areas. Digital filters of various kinds can be designed using this particular evolutionary technique. In this paper, we have studied the effect of an important control parameter namely, the Weighting Factor, on the convergence speed of the DE algorithm, associated with the efficient design of low-pass FIR filter being used subsequently as a pulse-shaping filter in a QPSK modulated system. Finally, the optimized value of the Weighting Factor for this specific design problem has been suggested. Experimentally measured Eye diagrams confirm the optimized value.
{"title":"Optimization of control parameter of Differential Evolution algorithm for efficient design of FIR filter","authors":"S. Chattopadhyay, S. K. Sanyal, A. Chandra","doi":"10.1109/ICCITECHN.2010.5723867","DOIUrl":"https://doi.org/10.1109/ICCITECHN.2010.5723867","url":null,"abstract":"Modern signal processing applications invoke various evolutionary algorithms in different areas such as aerodynamic shape optimization, pattern recognition, digital filter design, automated mirror design etc. Presently, Differential Evolution (DE) algorithm has proved to be quite efficient in these areas. Digital filters of various kinds can be designed using this particular evolutionary technique. In this paper, we have studied the effect of an important control parameter namely, the Weighting Factor, on the convergence speed of the DE algorithm, associated with the efficient design of low-pass FIR filter being used subsequently as a pulse-shaping filter in a QPSK modulated system. Finally, the optimized value of the Weighting Factor for this specific design problem has been suggested. Experimentally measured Eye diagrams confirm the optimized value.","PeriodicalId":149135,"journal":{"name":"2010 13th International Conference on Computer and Information Technology (ICCIT)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133814981","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：