Zaid Abdi Alkareem Alyasseri, Ahamad Tajudin Khadeer, M. Al-Betar, A. Abasi, S. Makhadmeh, Nabeel Salih Ali
In modern life, the identification system is considered as one of the most challenging projects because identity authentication needs to be secure. Researchers have developed digital authentication techniques which are implemented in society. One of these techniques is using biometric technology which is commonly known as face recognition, voice recognition, and fingerprinting. These techniques have achieved a high level of authentication but are subject to hacking or counterfeiting. In this paper, a new identification method based on electroencephalogram (EEG) signals is proposed. The EEG method uses a standard EEG database which deals with five different thought patterns or mental tasks which are multiplication, baseline, letter composition, rotation, and visual board counting. Using ANN (artificial neural network) classifier, EEG signals were classified. The performance of this proposed method is evaluated using five criteria: (accuracy, sensitivity, specificity, F-Score measure, and false acceptance rate). The experimental results show that the EEG features extraction with wavelet 10 decomposition levels can achieve better than 5 decomposition levels for all mental tasks. The proposed method achieved the highest accuracy when using a visual counting mental task.
{"title":"The effects of EEG feature extraction using multi-wavelet decomposition for mental tasks classification","authors":"Zaid Abdi Alkareem Alyasseri, Ahamad Tajudin Khadeer, M. Al-Betar, A. Abasi, S. Makhadmeh, Nabeel Salih Ali","doi":"10.1145/3321289.3321327","DOIUrl":"https://doi.org/10.1145/3321289.3321327","url":null,"abstract":"In modern life, the identification system is considered as one of the most challenging projects because identity authentication needs to be secure. Researchers have developed digital authentication techniques which are implemented in society. One of these techniques is using biometric technology which is commonly known as face recognition, voice recognition, and fingerprinting. These techniques have achieved a high level of authentication but are subject to hacking or counterfeiting. In this paper, a new identification method based on electroencephalogram (EEG) signals is proposed. The EEG method uses a standard EEG database which deals with five different thought patterns or mental tasks which are multiplication, baseline, letter composition, rotation, and visual board counting. Using ANN (artificial neural network) classifier, EEG signals were classified. The performance of this proposed method is evaluated using five criteria: (accuracy, sensitivity, specificity, F-Score measure, and false acceptance rate). The experimental results show that the EEG features extraction with wavelet 10 decomposition levels can achieve better than 5 decomposition levels for all mental tasks. The proposed method achieved the highest accuracy when using a visual counting mental task.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"19 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":"115651478","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}
Hayder S. Radeaf, Basheera M. Mahmmod, S. Abdulhussain, Dhyia Al-Jumaeily
The increase in data transmission volume and repository size have increased the need to secure and protecting a message such that it does not draw attention. in this paper, a new steganography algorithm in the transform domain of images based on orthogonal polynomials (OPs) is presented. The algorithms get benefits from the low energy moments, where the message is embedded. First, the proposed algorithm transforms the cover image into the transform domain using squared form of Krawtchouk-Tchebichef polynomials. After that, the low energy moments (transform coefficients) is substituted by the message data. Finally, the transform domain coefficients are transformed into the spatial domain to obtain the stego-image. Experimental results show that the proposed algorithm is competent in embedding information compared to other methods in terms of message size and image quality.
{"title":"A steganography based on orthogonal moments","authors":"Hayder S. Radeaf, Basheera M. Mahmmod, S. Abdulhussain, Dhyia Al-Jumaeily","doi":"10.1145/3321289.3321324","DOIUrl":"https://doi.org/10.1145/3321289.3321324","url":null,"abstract":"The increase in data transmission volume and repository size have increased the need to secure and protecting a message such that it does not draw attention. in this paper, a new steganography algorithm in the transform domain of images based on orthogonal polynomials (OPs) is presented. The algorithms get benefits from the low energy moments, where the message is embedded. First, the proposed algorithm transforms the cover image into the transform domain using squared form of Krawtchouk-Tchebichef polynomials. After that, the low energy moments (transform coefficients) is substituted by the message data. Finally, the transform domain coefficients are transformed into the spatial domain to obtain the stego-image. Experimental results show that the proposed algorithm is competent in embedding information compared to other methods in terms of message size and image quality.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"92 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":"131252061","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}
Medical image data are important part of diagnoses in existing health care information systems. The medical image's document is a communication instrument that serves clinical decision, give medication, explanation, consultation, coordination of services, validation and identification. This paper proposed an efficient and secure watermark approached using shearlet transform domain techniques for telehealth applications. The shearlet representation is very well improved the edges and the other anisotropic objects, which are the main features in medical images. Medical images with watermarks provide alternatives to various issues related to security, data management, and distribution. Applying the Arnold based encryption algorithms to a watermark image in a less complex way will better protect privacy. The conclusion that arises from the results is that the proposed method has improved in terms of acceptance, satisfaction, and integration of the application of telehealth security. Image quality is measured by a number of commonly used metrics. The experimental results show that quality analysis of the proposed approach provides an effective way to transmit a secure medical image over the public network. Moreover, the results clearly indicate that the proposed techniques are very powerful and adequate for the security of many procedures of aggressions without any noticeable misrepresentations between the watermarks and the cover image.
{"title":"Security in telehealth applications: issues in medical image watermarking scheme through the shearlet transform","authors":"Nemir Al-Azzawi","doi":"10.1145/3321289.3321326","DOIUrl":"https://doi.org/10.1145/3321289.3321326","url":null,"abstract":"Medical image data are important part of diagnoses in existing health care information systems. The medical image's document is a communication instrument that serves clinical decision, give medication, explanation, consultation, coordination of services, validation and identification. This paper proposed an efficient and secure watermark approached using shearlet transform domain techniques for telehealth applications. The shearlet representation is very well improved the edges and the other anisotropic objects, which are the main features in medical images. Medical images with watermarks provide alternatives to various issues related to security, data management, and distribution. Applying the Arnold based encryption algorithms to a watermark image in a less complex way will better protect privacy. The conclusion that arises from the results is that the proposed method has improved in terms of acceptance, satisfaction, and integration of the application of telehealth security. Image quality is measured by a number of commonly used metrics. The experimental results show that quality analysis of the proposed approach provides an effective way to transmit a secure medical image over the public network. Moreover, the results clearly indicate that the proposed techniques are very powerful and adequate for the security of many procedures of aggressions without any noticeable misrepresentations between the watermarks and the cover image.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"11 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":"114158654","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}
Design of a new miniaturized FF-PIFA (Folded Fractal Planar Inverted F-antenna) with dual-band resonant behavior is introduced in this paper for use in the dual-band WLAN MIMO (multi-input multi-output) applications. Firstly, the fourth iteration Koch's fractal geometry has been applied to the edges of the conventional rectangular patch structure to create a single miniaturized antenna. Then for further miniaturization, the radiating patch is folded in its sides. A substrate with relative permittivity of 2.2 and thickness of 0.9 mm has been used. The proposed antenna is located at the corner of a copper ground plane of 0.05mm thickness and dimensions of 110 × 70 mm2. The dimensions of the single antenna are 12mm × 15mm × 6.2 mm, making it suitable for mobile terminal applications. The proposed antenna offers a dual-band resonance covering the two WLAN band standards. Modeling and performance evaluation of the proposed antenna have been carried out using the CST Microwave Studio. After that, the FF-PIFA antenna has been investigated in a 4 by 4 MIMO system suggested for use in dual band WLAN applications. Simulation results show that the MIMO system offers ≤ -10 dB impedance bandwidths of about 182.32MHz with an isolation more than 12.17 dB, for the lower band, and 400MHz with an isolation of higher than 20 dB, for the upper band. This makes the proposed system suitable for use in MIMO dual-band WLAN applications.
{"title":"A new miniaturized folded fractal based PIFA antenna design for MIMO wireless applications","authors":"A. Salim, R. Fyath, J. Ali","doi":"10.1145/3321289.3321298","DOIUrl":"https://doi.org/10.1145/3321289.3321298","url":null,"abstract":"Design of a new miniaturized FF-PIFA (Folded Fractal Planar Inverted F-antenna) with dual-band resonant behavior is introduced in this paper for use in the dual-band WLAN MIMO (multi-input multi-output) applications.\u0000 Firstly, the fourth iteration Koch's fractal geometry has been applied to the edges of the conventional rectangular patch structure to create a single miniaturized antenna. Then for further miniaturization, the radiating patch is folded in its sides. A substrate with relative permittivity of 2.2 and thickness of 0.9 mm has been used. The proposed antenna is located at the corner of a copper ground plane of 0.05mm thickness and dimensions of 110 × 70 mm2. The dimensions of the single antenna are 12mm × 15mm × 6.2 mm, making it suitable for mobile terminal applications. The proposed antenna offers a dual-band resonance covering the two WLAN band standards. Modeling and performance evaluation of the proposed antenna have been carried out using the CST Microwave Studio. After that, the FF-PIFA antenna has been investigated in a 4 by 4 MIMO system suggested for use in dual band WLAN applications. Simulation results show that the MIMO system offers ≤ -10 dB impedance bandwidths of about 182.32MHz with an isolation more than 12.17 dB, for the lower band, and 400MHz with an isolation of higher than 20 dB, for the upper band. This makes the proposed system suitable for use in MIMO dual-band WLAN applications.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"10 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":"134335751","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}
This paper presents a smart guiding system and wearable device to assist the visually impaired people in avoiding obstacles and navigate safely through indoor environments. The proposed navigation system includes a pair of glasses with a RGB-D camera and an ultrasonic sensor in the front, Raspberry pi 3 B+ board, and earphone. An obstacle avoiding algorithm based on integration of a computer vision and ETA techniques is adopted to provide an accurate and low cost solution. The measuring distance approach depends on an ultrasonic sensor and the raw depth map that is acquired from depth sensor to output several suitable moving directions. The integration of different data input helps to detect the small and transparent obstacles and increases the accuracy of the navigation system output. This work has been tested and evaluated in different real-time scenarios. The experimental results indicate accurate guiding instructions and effective performance of obstacle detected and avoiding algorithm. The guiding instruction has been sent to the user as audio message through earphone.
{"title":"Navigation system for visually impaired people based on RGB-D camera and ultrasonic sensor","authors":"Heba Hakim, A. Fadhil","doi":"10.1145/3321289.3321303","DOIUrl":"https://doi.org/10.1145/3321289.3321303","url":null,"abstract":"This paper presents a smart guiding system and wearable device to assist the visually impaired people in avoiding obstacles and navigate safely through indoor environments. The proposed navigation system includes a pair of glasses with a RGB-D camera and an ultrasonic sensor in the front, Raspberry pi 3 B+ board, and earphone. An obstacle avoiding algorithm based on integration of a computer vision and ETA techniques is adopted to provide an accurate and low cost solution. The measuring distance approach depends on an ultrasonic sensor and the raw depth map that is acquired from depth sensor to output several suitable moving directions. The integration of different data input helps to detect the small and transparent obstacles and increases the accuracy of the navigation system output. This work has been tested and evaluated in different real-time scenarios. The experimental results indicate accurate guiding instructions and effective performance of obstacle detected and avoiding algorithm. The guiding instruction has been sent to the user as audio message through earphone.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"14 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":"116753707","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}
S. Abdulhussain, A. Ramli, A. Hussain, Basheera M. Mahmmod, Wissam A. Jassim
Preprocessing operations of images and video frame sequences are beneficial in computer vision algorithms. For example, smoothing frames is used to eliminate noise; while computing frame gradient in x-direction and y-direction is used for frame feature extraction or for finding frame edges. Such operations involve convolving operators (image kernels) with an image precomputing moments will add extra computation cost to computer vision algorithm. In case of video, the computational time accumulatively increased because of the convolution operation for each frame is performed. To overcome this problem, a mathematical model is established for computing preprocessed frame moments via embedding the operator (image kernel) in the orthogonal polynomial (OP) functions. The experimental results show that the computation time for feature extraction using the proposed method is noticeably reduced in the both trends: image size and moment selection order. The average speed up ratio of the proposed method to traditional method is 3x, 5x, 8x, and 40x for moment selection ratio 100%, 25%, 10%, and 5%, respectively. In addition, the percentage reduction in processing time for small image size is ~ 99% and for large image size is ~ 40%.
{"title":"Orthogonal polynomial embedded image kernel","authors":"S. Abdulhussain, A. Ramli, A. Hussain, Basheera M. Mahmmod, Wissam A. Jassim","doi":"10.1145/3321289.3321310","DOIUrl":"https://doi.org/10.1145/3321289.3321310","url":null,"abstract":"Preprocessing operations of images and video frame sequences are beneficial in computer vision algorithms. For example, smoothing frames is used to eliminate noise; while computing frame gradient in x-direction and y-direction is used for frame feature extraction or for finding frame edges. Such operations involve convolving operators (image kernels) with an image precomputing moments will add extra computation cost to computer vision algorithm. In case of video, the computational time accumulatively increased because of the convolution operation for each frame is performed. To overcome this problem, a mathematical model is established for computing preprocessed frame moments via embedding the operator (image kernel) in the orthogonal polynomial (OP) functions. The experimental results show that the computation time for feature extraction using the proposed method is noticeably reduced in the both trends: image size and moment selection order. The average speed up ratio of the proposed method to traditional method is 3x, 5x, 8x, and 40x for moment selection ratio 100%, 25%, 10%, and 5%, respectively. In addition, the percentage reduction in processing time for small image size is ~ 99% and for large image size is ~ 40%.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"27 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":"123489984","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}
R. A. Hameed, Mohannad K. Sabir, M. Fadhel, O. Al-Shamma, Laith Alzubaidi
Interactions between people commonly expressed and possessed emotions due to the human beings. Respiration is one of the parameters that reflects an emotion. The reasonable hypothesis, that various respiratory patterns are associated with various emotions, has enhanced the evidence for links between respiration and emotion. For instance, breathing turns out to be, deeper and slower at leisure or relief, shallower and faster at scare or terror, and deeper and faster at anger or excitement. In this study, the breathing signals, which include the features; airflow rate and volume, are acquired from the BIOPAC instrument. The extracted features, which include Max/Min and Mean/Variance of the main features, are analyzed using Fast Fourier Transform (FFT) and classified using Orang open source program, respectively. The result is very successful and agreed by 80%, which in turn, extremely accepted by the researchers.
{"title":"Human emotion classification based on respiration signal","authors":"R. A. Hameed, Mohannad K. Sabir, M. Fadhel, O. Al-Shamma, Laith Alzubaidi","doi":"10.1145/3321289.3321315","DOIUrl":"https://doi.org/10.1145/3321289.3321315","url":null,"abstract":"Interactions between people commonly expressed and possessed emotions due to the human beings. Respiration is one of the parameters that reflects an emotion. The reasonable hypothesis, that various respiratory patterns are associated with various emotions, has enhanced the evidence for links between respiration and emotion. For instance, breathing turns out to be, deeper and slower at leisure or relief, shallower and faster at scare or terror, and deeper and faster at anger or excitement. In this study, the breathing signals, which include the features; airflow rate and volume, are acquired from the BIOPAC instrument. The extracted features, which include Max/Min and Mean/Variance of the main features, are analyzed using Fast Fourier Transform (FFT) and classified using Orang open source program, respectively. The result is very successful and agreed by 80%, which in turn, extremely accepted by the researchers.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"63 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":"126649627","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}
Media (image, text, sound, and video) becomes available in the digital form. The ability to copy or modify contents and access to these media easily lead to making these problems challenging when transferring them to the internet. Therefore, data hiding methods are developed to handle these problems. In addition, cryptography algorithms can be combined with data hiding to increase the security of secret data that are used during the hiding process. In this paper, a new method of image steganography is proposed. The suggested approach is based on using ACM and array of random bits generated using BBS CSPRBG to encrypt the secret logo that is used during the hiding process. In embedding process, the cover-image is divided into blocks and the entropy of each block is computed. Then, the block that has a maximum value of entropy is selected to hide secret logo in it using (1st-LSB) algorithm. According to experimental results, the suggested method has achieved the best quality for the stego-image. Also, the secrecy of the logo is enhanced.
{"title":"Highly secure image steganography approach using Arnold's Cat map and maximum image entropy","authors":"Y. A. Hamza","doi":"10.1145/3321289.3321323","DOIUrl":"https://doi.org/10.1145/3321289.3321323","url":null,"abstract":"Media (image, text, sound, and video) becomes available in the digital form. The ability to copy or modify contents and access to these media easily lead to making these problems challenging when transferring them to the internet. Therefore, data hiding methods are developed to handle these problems. In addition, cryptography algorithms can be combined with data hiding to increase the security of secret data that are used during the hiding process. In this paper, a new method of image steganography is proposed. The suggested approach is based on using ACM and array of random bits generated using BBS CSPRBG to encrypt the secret logo that is used during the hiding process. In embedding process, the cover-image is divided into blocks and the entropy of each block is computed. Then, the block that has a maximum value of entropy is selected to hide secret logo in it using (1st-LSB) algorithm. According to experimental results, the suggested method has achieved the best quality for the stego-image. Also, the secrecy of the logo is enhanced.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"27 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":"128245652","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}
This study introduces a detailed mathematical modeling of a suggested compliant three-link planar robot. The modeling method is based on state-space representation, which allows a standard access to the interconnection of links with Variable Stiffness Actuator (VSA) by means of first-order differential equations. In these differential equations, the expression of the stiffness is derived in the time domain. In addition, the stiffness of VSA as control input exists in a dependent manner with state variables. An iterative numerical method is proposed, in which, the optimal trajectory of VSA is generated using steepest descent method. Besides this, the optimal feedback controller is designed to minimize the velocities of joints to avoid unsafe contact with the environment. Thus, the performance function was to minimize the velocities of joints and stiffness of VSA. The stabilization of joint velocities is achieved within the optimal feedback control system. A computer program is written to test the model and the proposed control method.
{"title":"Optimal control of compliant planar robot for safe impact using steepest descent technique","authors":"Izzat Al-Darraji, A. Kılıç, S. Kapucu","doi":"10.1145/3321289.3321313","DOIUrl":"https://doi.org/10.1145/3321289.3321313","url":null,"abstract":"This study introduces a detailed mathematical modeling of a suggested compliant three-link planar robot. The modeling method is based on state-space representation, which allows a standard access to the interconnection of links with Variable Stiffness Actuator (VSA) by means of first-order differential equations. In these differential equations, the expression of the stiffness is derived in the time domain. In addition, the stiffness of VSA as control input exists in a dependent manner with state variables. An iterative numerical method is proposed, in which, the optimal trajectory of VSA is generated using steepest descent method. Besides this, the optimal feedback controller is designed to minimize the velocities of joints to avoid unsafe contact with the environment. Thus, the performance function was to minimize the velocities of joints and stiffness of VSA. The stabilization of joint velocities is achieved within the optimal feedback control system. A computer program is written to test the model and the proposed control method.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"283 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":"122958510","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}
Maan Muataz Abdulwahid, O. A. Al-Ani, M. Mosleh, R. A. Abd-Alhmeed
The deployment of access points (AP's) with optimum location has particular importance in optimizing the coverage, operation, and management of the networks. In addition, the most interesting researcher topics recently were finding the lowest cost localization algorithm and methods for indoor communication. The most utilizing approach was based on the use of Received Signal Strength (RSS) measurement, due to reasons related to its availability in the wireless network. As well as, it can be easily accessed from a different operating system. In this paper, a localization algorithm for optimal AP deployment based on RSS measurement has been presented. RSS measurement obtained from different received points in a real-world environment. Measurement results obtained using specialized software was considered the optimum direction in each received point. Our algorithm uses these measurements and considered two-step localization approach, data collecting phase, and localization phase. It is worth to mention, that the same location was considered to be the optimum for both real-world measurement scenario and simulation scenario that has been clarified in previous work. This study may be considered as a quite verification for simulating results obtained using 3D-Ray Tracing approach based wireless InSite software. Furthermore, it is a low-cost method for achieving the optimum location for AP deployment and enhancing the network coverage area.
{"title":"Optimal access point location algorithm based real measurement for indoor communication","authors":"Maan Muataz Abdulwahid, O. A. Al-Ani, M. Mosleh, R. A. Abd-Alhmeed","doi":"10.1145/3321289.3321300","DOIUrl":"https://doi.org/10.1145/3321289.3321300","url":null,"abstract":"The deployment of access points (AP's) with optimum location has particular importance in optimizing the coverage, operation, and management of the networks. In addition, the most interesting researcher topics recently were finding the lowest cost localization algorithm and methods for indoor communication. The most utilizing approach was based on the use of Received Signal Strength (RSS) measurement, due to reasons related to its availability in the wireless network. As well as, it can be easily accessed from a different operating system. In this paper, a localization algorithm for optimal AP deployment based on RSS measurement has been presented. RSS measurement obtained from different received points in a real-world environment. Measurement results obtained using specialized software was considered the optimum direction in each received point. Our algorithm uses these measurements and considered two-step localization approach, data collecting phase, and localization phase. It is worth to mention, that the same location was considered to be the optimum for both real-world measurement scenario and simulation scenario that has been clarified in previous work. This study may be considered as a quite verification for simulating results obtained using 3D-Ray Tracing approach based wireless InSite software. Furthermore, it is a low-cost method for achieving the optimum location for AP deployment and enhancing the network coverage area.","PeriodicalId":375095,"journal":{"name":"Proceedings of the International Conference on Information and Communication Technology - ICICT '19","volume":"68 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":"125207872","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
扫码关注我们
求助内容：
应助结果提醒方式：