The data in many real-world applications are streamed continuously which causes a variety of problems, e.g. Infinitely long data streams, concept drift, on-line or real-time classification and noise or outlier samples. To overcome these problems, the classifier should be updated continuously and it should have the ability to detect outliers. Since the size of the data set is growing with the duration of the data stream, the classifier should be updated incrementally without storing the whole training set. We present a polynomial classifier that efficiently detects the outliers using the extreme value theory in combination with confidence band intervals derived from regression techniques. All parameters are updated incrementally without requiring the old data. This approach makes the classifier suitable for on-line classification, since the processing time of the update is negligible with respect to the time required for processing the full training data set. In contrast to other novelty detection algorithms which work only with one-class systems, the proposed method can be applied in multi-class systems. The proposed algorithm is evaluated on an unbalanced multi-class gesture database. A comparison of the proposed method with the support vector data description classifier shows that it has superior properties.
{"title":"Semi-supervised Learning Using Incremental Polynomial Classifier and Extreme Value Theory","authors":"Husam Al-Behadili, A. Grumpe, C. Wohler","doi":"10.1109/AIMS.2015.60","DOIUrl":"https://doi.org/10.1109/AIMS.2015.60","url":null,"abstract":"The data in many real-world applications are streamed continuously which causes a variety of problems, e.g. Infinitely long data streams, concept drift, on-line or real-time classification and noise or outlier samples. To overcome these problems, the classifier should be updated continuously and it should have the ability to detect outliers. Since the size of the data set is growing with the duration of the data stream, the classifier should be updated incrementally without storing the whole training set. We present a polynomial classifier that efficiently detects the outliers using the extreme value theory in combination with confidence band intervals derived from regression techniques. All parameters are updated incrementally without requiring the old data. This approach makes the classifier suitable for on-line classification, since the processing time of the update is negligible with respect to the time required for processing the full training data set. In contrast to other novelty detection algorithms which work only with one-class systems, the proposed method can be applied in multi-class systems. The proposed algorithm is evaluated on an unbalanced multi-class gesture database. A comparison of the proposed method with the support vector data description classifier shows that it has superior properties.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125937592","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}
Delivering neonatal babies is still happening in Indonesia and low incomes families often cannot afford to buy/rent baby incubators during the baby critical growing period. Charity groups are lending electrically driven Grashof incubators freely to whom that have financial difficulties. Free incubator still does not immediately solve the problem of the families as nowadays supply of electricity from our Indonesian State Electricity Company to some areas is not delivered constantly. As a result, electricity blackout appears frequently especially at under developed regions even in Jakarta regions.This issue makes such a tremendous anxiety for those families as the incubators heating system cannot work properly.Redesigning of heating system of the incubator will be the solution to the problem. The redesign is to find alternative energy sources that maintain cabin temperature when electricity is out. The new alternative energy a heat exchanger based on hot water flowing in a tubular heating system. The usability of the device is to be considered due to the current device cannot be suitably operated by common people, where some difficulties still appear when operating of the unit. The incubator must also be confidently safe for the neonatal babies and their parents.
{"title":"The Redesign of Grashof Incubator Concerning the Alternative Heating System and the Ergonomic Aspect","authors":"B. Arthaya, C. Tesavrita, Priyatna Permana","doi":"10.1109/AIMS.2015.86","DOIUrl":"https://doi.org/10.1109/AIMS.2015.86","url":null,"abstract":"Delivering neonatal babies is still happening in Indonesia and low incomes families often cannot afford to buy/rent baby incubators during the baby critical growing period. Charity groups are lending electrically driven Grashof incubators freely to whom that have financial difficulties. Free incubator still does not immediately solve the problem of the families as nowadays supply of electricity from our Indonesian State Electricity Company to some areas is not delivered constantly. As a result, electricity blackout appears frequently especially at under developed regions even in Jakarta regions.This issue makes such a tremendous anxiety for those families as the incubators heating system cannot work properly.Redesigning of heating system of the incubator will be the solution to the problem. The redesign is to find alternative energy sources that maintain cabin temperature when electricity is out. The new alternative energy a heat exchanger based on hot water flowing in a tubular heating system. The usability of the device is to be considered due to the current device cannot be suitably operated by common people, where some difficulties still appear when operating of the unit. The incubator must also be confidently safe for the neonatal babies and their parents.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122537619","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}
Mobile ad hoc Networks (MANETs) is a type of wireless ad hoc network which is a self-arranging network of mobile nodes connected by wireless links that create a discretionary topology. The mobile nodes are free to move randomly and to arrange themselves in a random manner. Thus, the wireless ad hoc network topology may expand rapidly and unpredictably. In Mobile ad hoc networks, the routing protocol plays an important role for improving Quality of Service (QoS). There are many different types of routing protocols such as reactive, proactive, and hybrid. In reactive routing protocol, AODV is a one which establishes routes on-demand, as they are needed. In this paper, we proposed a new routing protocol called Reverse Ad hoc On-Demand Distance Vector (R-AODV) routing which reduces route path fail correction messages and gives better performance than the original AODV routing protocol with respect to set of performance metric such as packet delivery ratio, throughput, energy consumption, and overhead under different pause time. We designed the R-AODV routing protocol and implemented with certain simulation parameters using Network Simulator (NS-2) tool. The performance analysis of routing protocol designed for wireless networks has been very challenging. Hence, simulations are always utilized to obtain the desired performance results.
移动自组织网络(manet)是一种无线自组织网络,它是由无线链路连接的移动节点组成的自排列网络,可以创建任意拓扑结构。移动节点可以随意移动,并以随机的方式排列自己。因此,无线自组织网络拓扑结构可能会迅速且不可预测地扩展。在移动自组织网络中,路由协议对提高服务质量(QoS)起着重要作用。有许多不同类型的路由协议,如响应式、主动式和混合式。在响应式路由协议中,AODV是一种根据需要按需建立路由的协议。本文提出了一种新的路由协议——反向自组织按需距离矢量(Reverse Ad hoc On-Demand Distance Vector, R-AODV)路由协议,该协议减少了路由路径失败纠正消息,并在不同暂停时间下的数据包投递率、吞吐量、能耗和开销等性能指标优于原AODV路由协议。我们设计了R-AODV路由协议,并使用Network Simulator (NS-2)工具在一定的仿真参数下实现。无线网络路由协议的性能分析是一个非常具有挑战性的问题。因此,总是利用仿真来获得期望的性能结果。
{"title":"An Improved Quality of Service Using R-AODV Protocol in MANETs","authors":"S. Biradar, P. Kulkarni","doi":"10.1109/AIMS.2015.69","DOIUrl":"https://doi.org/10.1109/AIMS.2015.69","url":null,"abstract":"Mobile ad hoc Networks (MANETs) is a type of wireless ad hoc network which is a self-arranging network of mobile nodes connected by wireless links that create a discretionary topology. The mobile nodes are free to move randomly and to arrange themselves in a random manner. Thus, the wireless ad hoc network topology may expand rapidly and unpredictably. In Mobile ad hoc networks, the routing protocol plays an important role for improving Quality of Service (QoS). There are many different types of routing protocols such as reactive, proactive, and hybrid. In reactive routing protocol, AODV is a one which establishes routes on-demand, as they are needed. In this paper, we proposed a new routing protocol called Reverse Ad hoc On-Demand Distance Vector (R-AODV) routing which reduces route path fail correction messages and gives better performance than the original AODV routing protocol with respect to set of performance metric such as packet delivery ratio, throughput, energy consumption, and overhead under different pause time. We designed the R-AODV routing protocol and implemented with certain simulation parameters using Network Simulator (NS-2) tool. The performance analysis of routing protocol designed for wireless networks has been very challenging. Hence, simulations are always utilized to obtain the desired performance results.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114453489","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 Brushless Doubly Fed Reluctance Machine (BDFRM) is a type variable speed machine with two sets of windings. One set is fed from a variable frequency inverter while the second set is fed at constant frequency. Comparing with the traditional induction machine, BDFRM has simple structure and higher efficiency, higher power density, smaller size and lower maintenance cost. So, it is important to build an accurate dynamic model of BDFRM for many control method studies. This paper presents mathematical model for a dynamic model of BDFRM using d-q reference coordination system and the simulation model be designed on Matlab/Simulink®.
{"title":"Modeling and Simulation Study for Dynamic Model of Brushless Doubly Fed Reluctance Machine Using Matlab Simulink","authors":"W. K. Song, D. Dorrell","doi":"10.1109/AIMS.2015.66","DOIUrl":"https://doi.org/10.1109/AIMS.2015.66","url":null,"abstract":"The Brushless Doubly Fed Reluctance Machine (BDFRM) is a type variable speed machine with two sets of windings. One set is fed from a variable frequency inverter while the second set is fed at constant frequency. Comparing with the traditional induction machine, BDFRM has simple structure and higher efficiency, higher power density, smaller size and lower maintenance cost. So, it is important to build an accurate dynamic model of BDFRM for many control method studies. This paper presents mathematical model for a dynamic model of BDFRM using d-q reference coordination system and the simulation model be designed on Matlab/Simulink®.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114516051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ali Abdulqader Bin Salem, Yung-Wey Chong, Sabri M. Hanshi, T. Wan
Packet size and modulation scheme can play an important role on optimizing the data rate of Long Term Evolution (LTE) system. The performance of the existing LTE system is evaluated in this paper in term of throughput and packet loss for Orthogonal Frequency-Division Multiple Access (OFDMA) modulation scheme with different packet sizes. The performance of LTE system for different packet size is done. The simulation experiments are done using Mat lab and Simulink libraries. The results show and discuss the effects of packet size and adaptation modulation on the performance of LTE based on throughput and packet loss. Moreover, the Signal-to-noise ratio (SNR) threshold values can be optimized in order to enhance the performance of LTE system. Experiments of packet loss illustrated that it is possible to get an accepted Packet Error Rate (PER) before reaching to SNR threshold values by enhancing an optimizing technique such as Markov Decision Process (MDP).
{"title":"On the Optimizing of LTE System Performance for SISO and MIMO Modes","authors":"Ali Abdulqader Bin Salem, Yung-Wey Chong, Sabri M. Hanshi, T. Wan","doi":"10.1109/AIMS.2015.71","DOIUrl":"https://doi.org/10.1109/AIMS.2015.71","url":null,"abstract":"Packet size and modulation scheme can play an important role on optimizing the data rate of Long Term Evolution (LTE) system. The performance of the existing LTE system is evaluated in this paper in term of throughput and packet loss for Orthogonal Frequency-Division Multiple Access (OFDMA) modulation scheme with different packet sizes. The performance of LTE system for different packet size is done. The simulation experiments are done using Mat lab and Simulink libraries. The results show and discuss the effects of packet size and adaptation modulation on the performance of LTE based on throughput and packet loss. Moreover, the Signal-to-noise ratio (SNR) threshold values can be optimized in order to enhance the performance of LTE system. Experiments of packet loss illustrated that it is possible to get an accepted Packet Error Rate (PER) before reaching to SNR threshold values by enhancing an optimizing technique such as Markov Decision Process (MDP).","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128268190","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 this paper we describe a novel digital image watermarking method using local binary patterns (LBP). Local binary patterns are known for their robust texture describing capabilities and digital watermarking used in proving the ownership of a multimedia content. In this work we propose a LBP synthesis or inverse LBP matching process and its applicability to digital image watermarking. LBP synthesis process changes the neighborhood pixels values, so that the LBP computed from these pixels is the value we want to synthesize. This process takes into account the requirements of a digital image watermarking such as imperceptibility and robustness to watermark removal attacks. Because of the nature of LBP synthesis it is required that only few pixels of a given block are modified to embed watermark. The simulation results show that the method is robust to JPEG compression, rotation and scaling attacks. This LBP synthesis process could also be used to watermark sensor data for proving the ownership. We are confident that this work would lead to a new research direction in authentication of digital content.
{"title":"Local Binary Patterns for Digital Image Watermarking","authors":"S. Chalamala, K. Kakkirala","doi":"10.1109/AIMS.2015.34","DOIUrl":"https://doi.org/10.1109/AIMS.2015.34","url":null,"abstract":"In this paper we describe a novel digital image watermarking method using local binary patterns (LBP). Local binary patterns are known for their robust texture describing capabilities and digital watermarking used in proving the ownership of a multimedia content. In this work we propose a LBP synthesis or inverse LBP matching process and its applicability to digital image watermarking. LBP synthesis process changes the neighborhood pixels values, so that the LBP computed from these pixels is the value we want to synthesize. This process takes into account the requirements of a digital image watermarking such as imperceptibility and robustness to watermark removal attacks. Because of the nature of LBP synthesis it is required that only few pixels of a given block are modified to embed watermark. The simulation results show that the method is robust to JPEG compression, rotation and scaling attacks. This LBP synthesis process could also be used to watermark sensor data for proving the ownership. We are confident that this work would lead to a new research direction in authentication of digital content.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128581619","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}
A. F. Muda, N. Saad, N. Waeleh, A. Abdullah, Low Yin Fen
This study proposed automatic detection and segmentation of brain lesion in diffusion-weighted magnetic resonance images (DWI) based on Fuzzy C-Means (FCM). Due to noises and intensity inhomogeneity, FCM technique fails in producing accurate results. Active contour and correlation template are integrated to overcome this problem. The brain lesions are acute stroke and solid tumor foe hyperintense lesions, and necrosis and chronic stroke for hypointense lesions. The proposed analysis framework has been validated by using Jaccard (AO), Dice, false negative rate (FNR) and false positive rate (FPR). FCM with correlation template provides more accurate results compared with FCM with active contour. The results are 0.547, 0.258, 0.192 and 0.687 for Jaccard, FPR, FNR and Dice indices. This method also can segment the lesions precisely.
{"title":"Integration of Fuzzy C-Means with Correlation Template and Active Contour for Brain Lesion Segmentation in Diffusion-Weighted MRI","authors":"A. F. Muda, N. Saad, N. Waeleh, A. Abdullah, Low Yin Fen","doi":"10.1109/AIMS.2015.88","DOIUrl":"https://doi.org/10.1109/AIMS.2015.88","url":null,"abstract":"This study proposed automatic detection and segmentation of brain lesion in diffusion-weighted magnetic resonance images (DWI) based on Fuzzy C-Means (FCM). Due to noises and intensity inhomogeneity, FCM technique fails in producing accurate results. Active contour and correlation template are integrated to overcome this problem. The brain lesions are acute stroke and solid tumor foe hyperintense lesions, and necrosis and chronic stroke for hypointense lesions. The proposed analysis framework has been validated by using Jaccard (AO), Dice, false negative rate (FNR) and false positive rate (FPR). FCM with correlation template provides more accurate results compared with FCM with active contour. The results are 0.547, 0.258, 0.192 and 0.687 for Jaccard, FPR, FNR and Dice indices. This method also can segment the lesions precisely.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121398194","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}
Nur Suhailayani Suhaimi, Siti Nur Kamaliah, N. Arbin, Z. Othman
Clustering dynamic data is a challenge in identifying and forming groups. This unsupervised learning usually leads to indirect knowledge discovery. The cluster detection algorithm searches for clusters of data which are similar to one another by using similarity measures.Optimizing the clustered data with certain fixed values could be an issue. Depending on the parameters and attributes of the data, the results yielded probably either stuck in local optima or bias by attributes pattern. Performing Genetic Algorithm in the data cluster may increase the probability of the questions being clustered in the optimal group cluster. Dynamic Mutation in Genetic Algorithm used as repair mechanism to ensure the cluster is optimized enough and produce optimum indexed questions set.
{"title":"Optimizing Cluster of Questions by Using Dynamic Mutation in Genetic Algorithm","authors":"Nur Suhailayani Suhaimi, Siti Nur Kamaliah, N. Arbin, Z. Othman","doi":"10.1109/AIMS.2015.81","DOIUrl":"https://doi.org/10.1109/AIMS.2015.81","url":null,"abstract":"Clustering dynamic data is a challenge in identifying and forming groups. This unsupervised learning usually leads to indirect knowledge discovery. The cluster detection algorithm searches for clusters of data which are similar to one another by using similarity measures.Optimizing the clustered data with certain fixed values could be an issue. Depending on the parameters and attributes of the data, the results yielded probably either stuck in local optima or bias by attributes pattern. Performing Genetic Algorithm in the data cluster may increase the probability of the questions being clustered in the optimal group cluster. Dynamic Mutation in Genetic Algorithm used as repair mechanism to ensure the cluster is optimized enough and produce optimum indexed questions set.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121439672","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}
Data mining rely on large amount of data to make learning model and the quality of data is very important. One of the important problem under data quality is the presence of missing values. Missing values can occur in both at the time of training and at the time of testing. There are many methods proposed to deal with missing values in training data. Many of them resort to imputation techniques. However, Very few methods are there to deal with the missing values at testing/prediction time. In this paper, we discuss and summarize various strategies to deal with this problem both at training and testing time. Also, we have discussed the compatibility between various methods at training and testing to achieve better results.
{"title":"Decision Tree: Review of Techniques for Missing Values at Training, Testing and Compatibility","authors":"Sachin Gavankar, S. Sawarkar","doi":"10.1109/AIMS.2015.29","DOIUrl":"https://doi.org/10.1109/AIMS.2015.29","url":null,"abstract":"Data mining rely on large amount of data to make learning model and the quality of data is very important. One of the important problem under data quality is the presence of missing values. Missing values can occur in both at the time of training and at the time of testing. There are many methods proposed to deal with missing values in training data. Many of them resort to imputation techniques. However, Very few methods are there to deal with the missing values at testing/prediction time. In this paper, we discuss and summarize various strategies to deal with this problem both at training and testing time. Also, we have discussed the compatibility between various methods at training and testing to achieve better results.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"356 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115937040","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}
Nila Feby Puspitasari, Hanif Al Fatta, F. W. Wibowo
Optimization of the access point layout is one of the issues in the field of networking. This issue is relating to the layout of access point on the Wireless Fidelity (Wi-Fi) network that requires theoretical consideration and analysis. Because of these requirements, a good mechanism is applied in the minimizing aspects between both cost and time on the implementation of WiFi network that used by network designer to organize the layout of the access points in the proper place. In addition, the signal strength obtained by measuring of the two nodes using in SSIDer application and the parameter used to measure the signal strength is the value of RSSI (Receive Signal Strength Indication) generated by the receiver. Not only that aspects used in the implementation of optimal placement of wireless access point, but measurement of the propagation of Line of Sight (LoS) and propagation Non Line of Sight (NLoS) is also considered in the aspect of measurement. The data obtained from the measurements are used to model layout of the access point using Greedy and Simulated Annealing application which has been built and tested. The results determined by application are coverage area and the position coordinates of the wireless acces point.
接入点布局的优化是网络领域的研究热点之一。这个问题涉及到无线保真(Wi-Fi)网络上接入点的布局,需要从理论上进行考虑和分析。由于这些要求,在WiFi网络的实现上,网络设计者在成本和时间的最小化方面运用了一种良好的机制来组织接入点在适当的位置上的布局。另外,在SSIDer应用中测量两个节点得到的信号强度,用于测量信号强度的参数为接收端产生的RSSI (Receive signal strength Indication)值。在测量方面不仅考虑了无线接入点最优放置的实现问题,还考虑了传播视线(LoS)和传播非视线(NLoS)的测量问题。利用已构建并测试的贪心和模拟退火程序,利用测量得到的数据对接入点的布局进行建模。应用确定的结果是无线接入点的覆盖区域和位置坐标。
{"title":"Implementation of Greedy and Simulated Annealing Algorithms for Wireless Access Point Placement","authors":"Nila Feby Puspitasari, Hanif Al Fatta, F. W. Wibowo","doi":"10.1109/AIMS.2015.35","DOIUrl":"https://doi.org/10.1109/AIMS.2015.35","url":null,"abstract":"Optimization of the access point layout is one of the issues in the field of networking. This issue is relating to the layout of access point on the Wireless Fidelity (Wi-Fi) network that requires theoretical consideration and analysis. Because of these requirements, a good mechanism is applied in the minimizing aspects between both cost and time on the implementation of WiFi network that used by network designer to organize the layout of the access points in the proper place. In addition, the signal strength obtained by measuring of the two nodes using in SSIDer application and the parameter used to measure the signal strength is the value of RSSI (Receive Signal Strength Indication) generated by the receiver. Not only that aspects used in the implementation of optimal placement of wireless access point, but measurement of the propagation of Line of Sight (LoS) and propagation Non Line of Sight (NLoS) is also considered in the aspect of measurement. The data obtained from the measurements are used to model layout of the access point using Greedy and Simulated Annealing application which has been built and tested. The results determined by application are coverage area and the position coordinates of the wireless acces point.","PeriodicalId":121874,"journal":{"name":"2015 3rd International Conference on Artificial Intelligence, Modelling and Simulation (AIMS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132139912","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}