N. Eya, H. Alhassan, A. Alabdullah, K. Hameed, M. Bin-Melha, R. Abd‐Alhameed
Group communication as an efficient communication mechanism, in recent years has become popular. This is due to the increase in group applications and services. Group communication ensures efficient delivery of packets from one source to multiple recipients or many sources to multiple recipients. Group key management in a wireless environment has been an interesting challenge with group communication because of insecure communication channel. The security and integrity of group communication in a wireless environment is a challenge. One of the challenges with group communication is the mobility of group members. Member mobility is a challenge when designing a group key management scheme. There have been several attempts that have been made to design a secure group key management for wireless environment. Not so many successful attempts have towards wireless mobile environments to explicitly address the various challenges with dynamic mobility issue between multiple networks. This research proposes a GKM scheme that tackles mobility in group communication. The protocol is analyzed to assess security and performance requirements. The size of the group variation, the mobility rate variation are carefully observed to determine the impact on the average of rekeying messages generated at every event and also 1-affects-n phenomenon. The results achieved, shows that the proposed protocol outperforms other popular solutions with less number of rekeying messages per event and also less number of affected members per event. Backward and Forward security are preserved for moving members.
{"title":"Improved group key management with host mobility protocol in wireless mobile environment","authors":"N. Eya, H. Alhassan, A. Alabdullah, K. Hameed, M. Bin-Melha, R. Abd‐Alhameed","doi":"10.1145/3321289.3321301","DOIUrl":"https://doi.org/10.1145/3321289.3321301","url":null,"abstract":"Group communication as an efficient communication mechanism, in recent years has become popular. This is due to the increase in group applications and services. Group communication ensures efficient delivery of packets from one source to multiple recipients or many sources to multiple recipients. Group key management in a wireless environment has been an interesting challenge with group communication because of insecure communication channel. The security and integrity of group communication in a wireless environment is a challenge. One of the challenges with group communication is the mobility of group members. Member mobility is a challenge when designing a group key management scheme. There have been several attempts that have been made to design a secure group key management for wireless environment. Not so many successful attempts have towards wireless mobile environments to explicitly address the various challenges with dynamic mobility issue between multiple networks. This research proposes a GKM scheme that tackles mobility in group communication. The protocol is analyzed to assess security and performance requirements. The size of the group variation, the mobility rate variation are carefully observed to determine the impact on the average of rekeying messages generated at every event and also 1-affects-n phenomenon. The results achieved, shows that the proposed protocol outperforms other popular solutions with less number of rekeying messages per event and also less number of affected members per event. Backward and Forward security are preserved for moving members.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122831738","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}
Hanan A. R. Akkar, W. A. H. Hadi, Ibraheem H. M. Al-Dosari
The paper deals with a work for unique wavelet shrinkage technique is planned and assessed in comparison with the opposite wavelet shrinkage ways like soft and onerous shrinkages. It's evident that wavelet families have distinctive characteristics and details that successively provide them a unique behavior against an identical wave once they were utilized for a particular procedure. As an example, in signal process applications, like wave compression, a comparative analysis in conjugation with analysis study utilizing economical system was needed to accumulate appropriate results. During this work a wavelets analysis tool was utilized to compress an artificial wave. The purpose of this work is to style and execute another wavelets shrinkage strategy, so valuate it against alternative wavelets shrinkage ways, so as to seek out the best wavelet mum operations among the antecedently mentioned families. Conjointly associate applicable decomposition level has been found to utilize the novel shrinkage technique. This new shrinkage technique is employed to shrink the wavelets coefficients and yield a decent compressed pressure signal before transmit it. There are numerous evaluation parameters to make up the evaluation and analysis method for signal compression. But the additional well-known quantitative measures are: N.M.S.E. (normalized mean sq. error) and E.S.N.R. (enhancement of signal to noise ratio). These on top of mentioned performance indices are utilized to urge the comparison results among completely different shrinkage strategies. The planned shrinkage technique outperformed the opposite standard strategies for all elect decomposition levels and completely different threshold choice rules. As an example Hardy-sine has E.S.N.R. =10.26dB and N.M.S.E. =0.02 that is concerning four improvement in E.S.N.R. for onerous-sine as compared with regular hard technique. Later the conclusion is to highlight that; this planned technique may be utilized for wave compression in more studies.
{"title":"A novel wavelet thresholding method for implementation of signal compressor design","authors":"Hanan A. R. Akkar, W. A. H. Hadi, Ibraheem H. M. Al-Dosari","doi":"10.1145/3321289.3321292","DOIUrl":"https://doi.org/10.1145/3321289.3321292","url":null,"abstract":"The paper deals with a work for unique wavelet shrinkage technique is planned and assessed in comparison with the opposite wavelet shrinkage ways like soft and onerous shrinkages. It's evident that wavelet families have distinctive characteristics and details that successively provide them a unique behavior against an identical wave once they were utilized for a particular procedure. As an example, in signal process applications, like wave compression, a comparative analysis in conjugation with analysis study utilizing economical system was needed to accumulate appropriate results. During this work a wavelets analysis tool was utilized to compress an artificial wave. The purpose of this work is to style and execute another wavelets shrinkage strategy, so valuate it against alternative wavelets shrinkage ways, so as to seek out the best wavelet mum operations among the antecedently mentioned families. Conjointly associate applicable decomposition level has been found to utilize the novel shrinkage technique. This new shrinkage technique is employed to shrink the wavelets coefficients and yield a decent compressed pressure signal before transmit it. There are numerous evaluation parameters to make up the evaluation and analysis method for signal compression. But the additional well-known quantitative measures are: N.M.S.E. (normalized mean sq. error) and E.S.N.R. (enhancement of signal to noise ratio). These on top of mentioned performance indices are utilized to urge the comparison results among completely different shrinkage strategies. The planned shrinkage technique outperformed the opposite standard strategies for all elect decomposition levels and completely different threshold choice rules. As an example Hardy-sine has E.S.N.R. =10.26dB and N.M.S.E. =0.02 that is concerning four improvement in E.S.N.R. for onerous-sine as compared with regular hard technique. Later the conclusion is to highlight that; this planned technique may be utilized for wave compression in more studies.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124556800","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. S. Mustafa, M. H. N. Al-Mayyahi, N. H. Barnouti
In modern world, the usage of automated vending machines is increased rapidly as a result of the latest life style. Vending machines can dispense small different products such as beverages, snacks, cigarette, consumer products, lottery tickets, train tickets, gems and even gold to consumers automatically after a currency or credit is inserted by the customer into the machine. The majority of vending machines are implemented using CMOS, SED, Microprocessor and Microcontroller technology that are inefficient in terms of power and speed. Compared to previous technologies, The FPGA based vending machines are reprogrammable, flexible and more advantageous in terms of speed, response and power consumption. FPGA based machine can be reprogrammed without the need to change the whole architecture when enhancing the model of machine. In this paper, FPGA based vending machine is designed and implemented on FPGA board which can provide multiple products. The proposed FPGA based machine supports three items and three currencies and provides products when the required amount is inserted into the machine and returns the change when the amount is further than the price of the product. The machine is supporting cancel function where the consumer is able to ignore the request and the inserted currency any time. The proposed vending machine conceptual model is designed in VHDL and implemented using altera DE2 development board.
{"title":"Design and implementation of vending machine embedded control system using FPGA","authors":"M. S. Mustafa, M. H. N. Al-Mayyahi, N. H. Barnouti","doi":"10.1145/3321289.3321314","DOIUrl":"https://doi.org/10.1145/3321289.3321314","url":null,"abstract":"In modern world, the usage of automated vending machines is increased rapidly as a result of the latest life style. Vending machines can dispense small different products such as beverages, snacks, cigarette, consumer products, lottery tickets, train tickets, gems and even gold to consumers automatically after a currency or credit is inserted by the customer into the machine. The majority of vending machines are implemented using CMOS, SED, Microprocessor and Microcontroller technology that are inefficient in terms of power and speed. Compared to previous technologies, The FPGA based vending machines are reprogrammable, flexible and more advantageous in terms of speed, response and power consumption. FPGA based machine can be reprogrammed without the need to change the whole architecture when enhancing the model of machine. In this paper, FPGA based vending machine is designed and implemented on FPGA board which can provide multiple products. The proposed FPGA based machine supports three items and three currencies and provides products when the required amount is inserted into the machine and returns the change when the amount is further than the price of the product. The machine is supporting cancel function where the consumer is able to ignore the request and the inserted currency any time. The proposed vending machine conceptual model is designed in VHDL and implemented using altera DE2 development board.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124238318","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}
Efficient and simple design of speech encryption-based stream cipher is produced and suggested in this paper with name finite precision chaotic map-based stream cipher (FPCM-SC) system. Two pseudo random bits generator (PRBG) are built by hybrid chaotic maps using finite precision format and named finite precision chaotic XOR based PRBG (FPCXOR-BRPB) and finite precision chaotic hopping based PRBG(FPCH-PRBG). The statistical security analysis and speech residual unintelligibility measures are presented for the two proposed systems. The results show that key space for FPCXOR-PRBG is 214*32 and for FPCH-PRBG is 216*32 that are large enough to resist against all kind of brute force attack. Also, residual unintelligibility measures show that the speech signal is unintelligible signal and can't be listen by an attacker.
{"title":"Speech encryption using finite precision chaotic maps based stream ciphers","authors":"Zahraa M. Dawood, M. Aboud, F. S. Hasan","doi":"10.1145/3321289.3321322","DOIUrl":"https://doi.org/10.1145/3321289.3321322","url":null,"abstract":"Efficient and simple design of speech encryption-based stream cipher is produced and suggested in this paper with name finite precision chaotic map-based stream cipher (FPCM-SC) system. Two pseudo random bits generator (PRBG) are built by hybrid chaotic maps using finite precision format and named finite precision chaotic XOR based PRBG (FPCXOR-BRPB) and finite precision chaotic hopping based PRBG(FPCH-PRBG). The statistical security analysis and speech residual unintelligibility measures are presented for the two proposed systems. The results show that key space for FPCXOR-PRBG is 214*32 and for FPCH-PRBG is 216*32 that are large enough to resist against all kind of brute force attack. Also, residual unintelligibility measures show that the speech signal is unintelligible signal and can't be listen by an attacker.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132472175","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}
H. Al-Kashoash, Zain-Aldeen S. A. Rahman, E. Alhamdawee
Wireless sensor network (WSN) composes of randomly and uniformly deployed sensors to sense and monitor condition changing e.g. temperature and pass the data to a base station. As sensor node operates on a limited power battery where it is difficult to recharge or replace it, the main challenge in WSNs is energy conservation. Clustering is a technique in which nodes are grouped together into a number of clusters to maximize energy saving and prolong nodes lifespan. In this paper, we design a fuzzy logic controller and propose a clustering algorithm for selecting a cluster head (CH) depend on node's residual energy and RSSI. The proposed algorithm is simulated in Castalia simulator and compared with LEACH protocol. The simulation results show that our proposal performs better than LEACH with regards to nodes lifetime, energy consumption and number of sent packets.
{"title":"Energy and RSSI based fuzzy inference system for cluster head selection in wireless sensor networks","authors":"H. Al-Kashoash, Zain-Aldeen S. A. Rahman, E. Alhamdawee","doi":"10.1145/3321289.3321319","DOIUrl":"https://doi.org/10.1145/3321289.3321319","url":null,"abstract":"Wireless sensor network (WSN) composes of randomly and uniformly deployed sensors to sense and monitor condition changing e.g. temperature and pass the data to a base station. As sensor node operates on a limited power battery where it is difficult to recharge or replace it, the main challenge in WSNs is energy conservation. Clustering is a technique in which nodes are grouped together into a number of clusters to maximize energy saving and prolong nodes lifespan. In this paper, we design a fuzzy logic controller and propose a clustering algorithm for selecting a cluster head (CH) depend on node's residual energy and RSSI. The proposed algorithm is simulated in Castalia simulator and compared with LEACH protocol. The simulation results show that our proposal performs better than LEACH with regards to nodes lifetime, energy consumption and number of sent packets.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114850871","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}
In the last years, Wireless Sensor Networks (WSNs) are widely used in many applications in the real life. The sensor devices in WSNs are resource-constrained in terms of computation, energy, and memory. This makes the Key establishment and refreshment lead to increase the communication cost and consumed energy thus minimize the network lifetime in WSNs. Therefore, it is a challenging problem to design an energy efficient Secret key establishment and refreshment protocol in WSNs. In this paper, a Secret Key Generation (SKG) protocol is proposed to improve the network lifetime while maintaining the security of the WSN. SKG protocol distributes part of the secret key on the sensor nodes in the network while another part would be kept inside the nodes of the WSN. Each node in the network generates the secret keys by using the two parts. The suggested protocol is evaluated using NS2 network simulator and the conducted results show that the SKG protocol can increase throughput by the rate 17.36 b/s and decrease the consumed power for key distribution by the rate 4.3152 w thus extend the lifetime of the WSN.
{"title":"Secret key generation in wireless sensor network using public key encryption","authors":"Manar Hamza Bashaa, S. Al-Alak, A. Idrees","doi":"10.1145/3321289.3321320","DOIUrl":"https://doi.org/10.1145/3321289.3321320","url":null,"abstract":"In the last years, Wireless Sensor Networks (WSNs) are widely used in many applications in the real life. The sensor devices in WSNs are resource-constrained in terms of computation, energy, and memory. This makes the Key establishment and refreshment lead to increase the communication cost and consumed energy thus minimize the network lifetime in WSNs. Therefore, it is a challenging problem to design an energy efficient Secret key establishment and refreshment protocol in WSNs. In this paper, a Secret Key Generation (SKG) protocol is proposed to improve the network lifetime while maintaining the security of the WSN. SKG protocol distributes part of the secret key on the sensor nodes in the network while another part would be kept inside the nodes of the WSN. Each node in the network generates the secret keys by using the two parts. The suggested protocol is evaluated using NS2 network simulator and the conducted results show that the SKG protocol can increase throughput by the rate 17.36 b/s and decrease the consumed power for key distribution by the rate 4.3152 w thus extend the lifetime of the WSN.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129693839","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}
The ball and beam (B&B) system is widely used as a laboratory equipment to study control systems engineering since it represents one of the most easy to understand and important system. In this work, a step by step Lagrangian model for the B&B system has been obtained. Afterward, a pole placement controller has been designed for trajectory tracking and disturbance rejection purpose. The derived model and the controller has been demonstrated in Simulink environment. The paper also investigates the controller robustness in the existence of sensor noise and external disturbances. For the purpose of better understanding of the relationship between the set of placed poles, the system response plot and the physical system behavior, a visualized model for the B&B system has been built using Matlab graphical user interface (GUI) platform. The GUI platform present a helpful tool in understanding the ball and beam system mechanical behavior with different placed poles' positions. It will also minify the need for an actual B&B laboratory experimental set.
{"title":"Pole placement control of a ball and beam system a graphical user interface (GUI) approach","authors":"Ahmed Alkamachi","doi":"10.1145/3321289.3321305","DOIUrl":"https://doi.org/10.1145/3321289.3321305","url":null,"abstract":"The ball and beam (B&B) system is widely used as a laboratory equipment to study control systems engineering since it represents one of the most easy to understand and important system. In this work, a step by step Lagrangian model for the B&B system has been obtained. Afterward, a pole placement controller has been designed for trajectory tracking and disturbance rejection purpose. The derived model and the controller has been demonstrated in Simulink environment. The paper also investigates the controller robustness in the existence of sensor noise and external disturbances. For the purpose of better understanding of the relationship between the set of placed poles, the system response plot and the physical system behavior, a visualized model for the B&B system has been built using Matlab graphical user interface (GUI) platform. The GUI platform present a helpful tool in understanding the ball and beam system mechanical behavior with different placed poles' positions. It will also minify the need for an actual B&B laboratory experimental set.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129358532","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}
Rasha S. Ali, Rajaa Kadhom Hassoun, I. F. Jaleel, Noor Subhi Ali
Playfair cipher is a classic encryption technique that is hard to be manipulated manually but apart from the advantages found in playfair cipher there are also many weakness, can be solved by using modern cryptographic algorithms. This work is about securing text by using modified Play fair algorithm. The encryption and decryption processes are done by using secret key and message provided by the user. The encryption and decryption process depended on using same key. The proposed modified Play fair algorithm depended on using biomolecular computing. The strength of this work represented by encrypting any type of characters or numbers and symbols by using the proposed method comparative to the previous works which is used to encrypt only English characters with some numbers. The strength of this work represented by encrypting any type of characters or numbers and symbols by using the proposed method comparative to the previous works which is used to encrypt only English characters with some numbers. The proposed technique depended on using modern cryptographic methods like bioinformatics technique. The generated key depended on using secure lock up table which is generated from another secure lock up table. Also the insertion process between duplicated character is removed, so this is saved the time and storage space. The size of the proposed modified Play fair matrix includes 4 columns and 16 rows instead of 5*5 matrix of conventional method. In this work the matrix of equal dimensions was not required; the amino acid codes(mRNA codes) are used in this work. The amino acid codes are also converted to special symbols; this means instead of using triple replacement of amino acid codes the triple characters are converted to one symbol. A single replacement was used, by this the size of encrypted text was decreased to 1:3 of using triple replacement. Each three character of amino acid codes is become represented by one character and this is also leading to save memory storage 3 times of using original representation of amino acid codes. The experimental results showed that the proposed method achieves good results; it was passed a proximity 13 tests of 14 NIST tests. The other 2 NIST tests are not worked from the original software of 16 NIST tests so 14 NIST tests are used in this paper. the proposed method overcomes the limitation of the previous methods in terms of encrypting any data types in Arabic, English, Latin language, numbers and symbols. Also the experiments show that the proposed method consumed few milliseconds in the encryption and decryption process and there is 75% changes in the cipher texts when using keys different in only one bit.
{"title":"Proposal for encryption by using modified play fair algorithm and bioinformatics techniques","authors":"Rasha S. Ali, Rajaa Kadhom Hassoun, I. F. Jaleel, Noor Subhi Ali","doi":"10.1145/3321289.3321321","DOIUrl":"https://doi.org/10.1145/3321289.3321321","url":null,"abstract":"Playfair cipher is a classic encryption technique that is hard to be manipulated manually but apart from the advantages found in playfair cipher there are also many weakness, can be solved by using modern cryptographic algorithms. This work is about securing text by using modified Play fair algorithm. The encryption and decryption processes are done by using secret key and message provided by the user. The encryption and decryption process depended on using same key. The proposed modified Play fair algorithm depended on using biomolecular computing. The strength of this work represented by encrypting any type of characters or numbers and symbols by using the proposed method comparative to the previous works which is used to encrypt only English characters with some numbers. The strength of this work represented by encrypting any type of characters or numbers and symbols by using the proposed method comparative to the previous works which is used to encrypt only English characters with some numbers. The proposed technique depended on using modern cryptographic methods like bioinformatics technique. The generated key depended on using secure lock up table which is generated from another secure lock up table. Also the insertion process between duplicated character is removed, so this is saved the time and storage space. The size of the proposed modified Play fair matrix includes 4 columns and 16 rows instead of 5*5 matrix of conventional method. In this work the matrix of equal dimensions was not required; the amino acid codes(mRNA codes) are used in this work. The amino acid codes are also converted to special symbols; this means instead of using triple replacement of amino acid codes the triple characters are converted to one symbol. A single replacement was used, by this the size of encrypted text was decreased to 1:3 of using triple replacement. Each three character of amino acid codes is become represented by one character and this is also leading to save memory storage 3 times of using original representation of amino acid codes. The experimental results showed that the proposed method achieves good results; it was passed a proximity 13 tests of 14 NIST tests. The other 2 NIST tests are not worked from the original software of 16 NIST tests so 14 NIST tests are used in this paper. the proposed method overcomes the limitation of the previous methods in terms of encrypting any data types in Arabic, English, Latin language, numbers and symbols. Also the experiments show that the proposed method consumed few milliseconds in the encryption and decryption process and there is 75% changes in the cipher texts when using keys different in only one bit.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132524430","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}
Increased peak-to-average power ratio (PAPR) of its transmit sequence represents the main problem of the orthogonal frequency division multiplexing (OFDM) technology, as large signal peaks lead to power inefficiency of the amplifiers. In this study, a new combination based on the use of two intelligent techniques: fuzzy logic as well as genetic algorithm (GA) with the proposition of a popular reduction technique, partial transmit sequences (PTS) is presented here to decrease the probability of high PAPR appearance in multiple input-multiple output OFDM (MIMO-OFDM) system over Rayleigh fading channel. The PTS scheme is utilized in a space time block coding (STBC) model where the nominated signal for transmission has lowest PAPR. Without increasing computation, numerical results verify the competition of the presented algorithm as compared to some published studies.
{"title":"Genetic-fuzzy algorithm based suboptimum partial transmit sequences scheme for peak-to-average power ratio reduction in MIMO-OFDM systems","authors":"Zainab Abdulameer Hassan, Alaa A. Hasan","doi":"10.1145/3321289.3321328","DOIUrl":"https://doi.org/10.1145/3321289.3321328","url":null,"abstract":"Increased peak-to-average power ratio (PAPR) of its transmit sequence represents the main problem of the orthogonal frequency division multiplexing (OFDM) technology, as large signal peaks lead to power inefficiency of the amplifiers. In this study, a new combination based on the use of two intelligent techniques: fuzzy logic as well as genetic algorithm (GA) with the proposition of a popular reduction technique, partial transmit sequences (PTS) is presented here to decrease the probability of high PAPR appearance in multiple input-multiple output OFDM (MIMO-OFDM) system over Rayleigh fading channel. The PTS scheme is utilized in a space time block coding (STBC) model where the nominated signal for transmission has lowest PAPR. Without increasing computation, numerical results verify the competition of the presented algorithm as compared to some published studies.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127940571","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}
Recently there is increasing interest in microwave photonics (MWP) to process wideband microwave signals using photonic technology. Beam-steering and -forming networks for phase array antennas (PAAs) have been successfully and efficiently implemented using MWP incorporating a photonic true time delay line (TTDL). The delay line is designed according to the operating microwave frequency fmw and number of radiating elements N of the PAA and cannot be adopted efficiently for other PAAs operating at different parameters values. Future wireless communication base stations will deal with PAAs having different values of fmw and N. Therefore, it is essential to design a configurable MWP-based beamsteering and -forming networks. In this paper, a configurable photonic TTDL is proposed for beamsteering network. The delay line consists of cascaded linearly chirped fiber Bragg gratings (LCFBGs) whose number is adopted according to the operating frequency, number of radiating elements, and steering angle. The simulation results reveal that a fiber Bragg grating (FBG) designed with 80 mm length and modified Gaussian apodization offers a 562.12 ps time delay difference across its reflectively spectrum bandwidth (4.07 nm). The steering network uses 3, 2, and 1 LCFBGs for 8-PAAs operating with 2.4, 5.8, and 10 GHz, respectively. Then three patch radiating elements operating at 2.4, and 5.8 GHz are designed and experimentally fabricated. The radiation pattern performance of these radiating elements are simulated and the results are found to be closed to experimental data. Accordingly, three PAAs incorporating these radiating elements are designed and their scanning capabilities based on the proposed configurable steering network are investigated for N= 4, 8, and 16. The results demonstrate the capability of the proposed configurable beamsteering network in controlling the steering angle of the designed PAAs.
{"title":"Design and investigation of configurable photonics true time delay line-based beamsteering network","authors":"D. A. Aljaf, R. Fyath","doi":"10.1145/3321289.3321299","DOIUrl":"https://doi.org/10.1145/3321289.3321299","url":null,"abstract":"Recently there is increasing interest in microwave photonics (MWP) to process wideband microwave signals using photonic technology. Beam-steering and -forming networks for phase array antennas (PAAs) have been successfully and efficiently implemented using MWP incorporating a photonic true time delay line (TTDL). The delay line is designed according to the operating microwave frequency fmw and number of radiating elements N of the PAA and cannot be adopted efficiently for other PAAs operating at different parameters values. Future wireless communication base stations will deal with PAAs having different values of fmw and N. Therefore, it is essential to design a configurable MWP-based beamsteering and -forming networks. In this paper, a configurable photonic TTDL is proposed for beamsteering network. The delay line consists of cascaded linearly chirped fiber Bragg gratings (LCFBGs) whose number is adopted according to the operating frequency, number of radiating elements, and steering angle. The simulation results reveal that a fiber Bragg grating (FBG) designed with 80 mm length and modified Gaussian apodization offers a 562.12 ps time delay difference across its reflectively spectrum bandwidth (4.07 nm). The steering network uses 3, 2, and 1 LCFBGs for 8-PAAs operating with 2.4, 5.8, and 10 GHz, respectively. Then three patch radiating elements operating at 2.4, and 5.8 GHz are designed and experimentally fabricated. The radiation pattern performance of these radiating elements are simulated and the results are found to be closed to experimental data. Accordingly, three PAAs incorporating these radiating elements are designed and their scanning capabilities based on the proposed configurable steering network are investigated for N= 4, 8, and 16.\u0000 The results demonstrate the capability of the proposed configurable beamsteering network in controlling the steering angle of the designed PAAs.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131533438","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
扫码关注我们
求助内容：
应助结果提醒方式：