Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710093
R. C. Saritha, Utkarsh Mankad, G. Venkataswamy, S. Bapu
The world has witnessed a significant change in the learning methodology by students in the last decade. With drastic technological developments in the education domain, the learning methods used by students have also evolved. The learning methods changed from, traditional classroom learning to e-learning, from e-learning to mlearning and subsequently to a new way of learning using Augmented Reality. Augmented Reality really helps in making the learning very effective and interesting in real time. It also helps in understanding some of the complex subjects in a very lucid and intuitive way. This paper discusses about an Augmented Reality learning ecosystem, which consists of Augmented Reality(AR) Learning framework and AR applications for learning environment. The implementation and benefits of Augmented Reality applications targeted for education community, namely AR Board, AR Book and AR Game are discussed.
{"title":"An Augmented Reality ecosystem for learning environment","authors":"R. C. Saritha, Utkarsh Mankad, G. Venkataswamy, S. Bapu","doi":"10.1109/ANTS.2018.8710093","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710093","url":null,"abstract":"The world has witnessed a significant change in the learning methodology by students in the last decade. With drastic technological developments in the education domain, the learning methods used by students have also evolved. The learning methods changed from, traditional classroom learning to e-learning, from e-learning to mlearning and subsequently to a new way of learning using Augmented Reality. Augmented Reality really helps in making the learning very effective and interesting in real time. It also helps in understanding some of the complex subjects in a very lucid and intuitive way. This paper discusses about an Augmented Reality learning ecosystem, which consists of Augmented Reality(AR) Learning framework and AR applications for learning environment. The implementation and benefits of Augmented Reality applications targeted for education community, namely AR Board, AR Book and AR Game are discussed.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129052608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710132
Anita Ramachandran, R. Adarsh, P. Pahwa, K. Anupama
Intelligent IoT-based ambient assisted living systems (AALS) have been a major research focus area in recent times. According to the studies conducted by the Govt. of India, elderly population in India has reached 8.3% of the total population [40]. Per the National Program for Health Care of the Elderly (NPHCE), the elderly population in India has tripled over the last 50 years, and is projected to increase to 33.32 million by 2021 and 300.96 million by 2051 [41]. Application of machine learning in AALS, such as fall detection, therefore, has the potential to have huge public impact. In this paper, we propose a fall detection system that takes into account not only various wearable sensor node parameter readings for a subject, but also his biological and physiological profile. The profile is used to determine a fall risk category for the subject. We performed machine learning experiments using public datasets for fall detection which included wearable sensor node readings. The algorithms were then retrained by feeding in the risk categorization of the subject, and results from this analyses are presented. The objective of the experiments was to find out the impact of a subject's risk categorization on the accuracy of fall detection. The algorithms presented here form part of a comprehensive geriatric healthcare system under development, which comprises wearable sensor nodes, coordinator nodes, an indoor localization framework and cloud-hosted application servers. A brief overview of the system capabilities is also presented.
{"title":"Machine Learning-based Fall Detection in Geriatric Healthcare Systems","authors":"Anita Ramachandran, R. Adarsh, P. Pahwa, K. Anupama","doi":"10.1109/ANTS.2018.8710132","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710132","url":null,"abstract":"Intelligent IoT-based ambient assisted living systems (AALS) have been a major research focus area in recent times. According to the studies conducted by the Govt. of India, elderly population in India has reached 8.3% of the total population [40]. Per the National Program for Health Care of the Elderly (NPHCE), the elderly population in India has tripled over the last 50 years, and is projected to increase to 33.32 million by 2021 and 300.96 million by 2051 [41]. Application of machine learning in AALS, such as fall detection, therefore, has the potential to have huge public impact. In this paper, we propose a fall detection system that takes into account not only various wearable sensor node parameter readings for a subject, but also his biological and physiological profile. The profile is used to determine a fall risk category for the subject. We performed machine learning experiments using public datasets for fall detection which included wearable sensor node readings. The algorithms were then retrained by feeding in the risk categorization of the subject, and results from this analyses are presented. The objective of the experiments was to find out the impact of a subject's risk categorization on the accuracy of fall detection. The algorithms presented here form part of a comprehensive geriatric healthcare system under development, which comprises wearable sensor nodes, coordinator nodes, an indoor localization framework and cloud-hosted application servers. A brief overview of the system capabilities is also presented.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134361263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710096
Arijit Datta, Manish Mandloi, V. Bhatia
Massive multiple-input multiple-output (MIMO) is a core technology for 5G and beyond systems. However, symbol detection in massive MIMO requires high complexity matrix inversions. To tackle this problem, a novel and robust low complexity hybrid algorithm (HA) is proposed for uplink symbol detection in massive MIMO systems with a large number of users. Proposed HA integrates two novel techniques; non-stationary Newton iteration (NSNI) and improved sequential Richardson iteration (ISRI), which are proposed in this paper. Newton iteration (NI) is a promising technique for approximate matrix inversion, however, in this paper, Newton iteration (NI) is realized as the stationary iterative method which uses constant step size for all iterations. Consequently, NI suffers from performance-complexity trade-off. To address this issue, NSNI is proposed, which utilizes non-stationary step size that changes at each iteration. Moreover, Richardson iteration is a simple but efficient algorithm for massive MIMO detection, however, RI suffers from intersymbol interference (ISI) which is a major reason for the low performance of RI when the number of users scales up in massive MIMO system. Hence, symbols are updated sequentially to extenuate ISI in RI. In addition, to further improve the performance of RI, optimal step sizes based on each symbol-index in RI are computed and hence, an improved stationary Richardson iteration (ISRI) is introduced. Finally, to further boost bit error rate (BER), NSNI and RI are integrated into pseudo-stationary iterative HA for low complexity symbol detection in massive MIMO systems. Simulation results validate low complexity, superior BER performance and robustness of proposed HA as compared to recently reported several massive MIMO detection techniques, under both perfect and imperfect channel state information at the receiver.
{"title":"Hybrid Pseudo-stationary Iterative Detection Algorithm for Uplink Massive MIMO Systems","authors":"Arijit Datta, Manish Mandloi, V. Bhatia","doi":"10.1109/ANTS.2018.8710096","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710096","url":null,"abstract":"Massive multiple-input multiple-output (MIMO) is a core technology for 5G and beyond systems. However, symbol detection in massive MIMO requires high complexity matrix inversions. To tackle this problem, a novel and robust low complexity hybrid algorithm (HA) is proposed for uplink symbol detection in massive MIMO systems with a large number of users. Proposed HA integrates two novel techniques; non-stationary Newton iteration (NSNI) and improved sequential Richardson iteration (ISRI), which are proposed in this paper. Newton iteration (NI) is a promising technique for approximate matrix inversion, however, in this paper, Newton iteration (NI) is realized as the stationary iterative method which uses constant step size for all iterations. Consequently, NI suffers from performance-complexity trade-off. To address this issue, NSNI is proposed, which utilizes non-stationary step size that changes at each iteration. Moreover, Richardson iteration is a simple but efficient algorithm for massive MIMO detection, however, RI suffers from intersymbol interference (ISI) which is a major reason for the low performance of RI when the number of users scales up in massive MIMO system. Hence, symbols are updated sequentially to extenuate ISI in RI. In addition, to further improve the performance of RI, optimal step sizes based on each symbol-index in RI are computed and hence, an improved stationary Richardson iteration (ISRI) is introduced. Finally, to further boost bit error rate (BER), NSNI and RI are integrated into pseudo-stationary iterative HA for low complexity symbol detection in massive MIMO systems. Simulation results validate low complexity, superior BER performance and robustness of proposed HA as compared to recently reported several massive MIMO detection techniques, under both perfect and imperfect channel state information at the receiver.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130524576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710039
Padarthi Naga Prasanth, K. Sumanth, Vijay Kumar Chakka, Gouriprasanna Roy
In this paper, we consider a tabletop molecular communication (MC) system for exchange of information through flow assisted diffusion of ethanol chemical molecules. Designing modulation and demodulation algorithms for such setup is an important research problem. We propose a demodulation algorithm using Sampling based Adaptive Threshold Variation (S-ATV) for Pulse Position Modulation (PPM) and ON/OFF keying (OOK) based modulation techniques. The performance of BER with bit duration is plotted for proposed demodulation algorithm as well as Increase detection algorithm (IDA). It is found that the proposed S-ATV demodulation algorithm has better performance than IDA for smaller bit durations.
{"title":"Experimental Implementation of Molecular Communication System using Sampling based Adaptive Threshold Variation Demodulation Algorithm","authors":"Padarthi Naga Prasanth, K. Sumanth, Vijay Kumar Chakka, Gouriprasanna Roy","doi":"10.1109/ANTS.2018.8710039","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710039","url":null,"abstract":"In this paper, we consider a tabletop molecular communication (MC) system for exchange of information through flow assisted diffusion of ethanol chemical molecules. Designing modulation and demodulation algorithms for such setup is an important research problem. We propose a demodulation algorithm using Sampling based Adaptive Threshold Variation (S-ATV) for Pulse Position Modulation (PPM) and ON/OFF keying (OOK) based modulation techniques. The performance of BER with bit duration is plotted for proposed demodulation algorithm as well as Increase detection algorithm (IDA). It is found that the proposed S-ATV demodulation algorithm has better performance than IDA for smaller bit durations.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131364818","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710080
R. Pal, Naveen Chowdary
Anomalous HTTP traffic can be identified by analysing the content of HTTP packet as payload. n-gram analysis is a prominent technique for payload analysis. In this paper, a novel n-gram based anomaly detection method has been proposed for HTTP traffic. During the training phase, statistical profiling (the maximum, the minimum, the median and the average of number of occurrences in a packet) of n-grams for a data set of normal (not malicious) HTTP packets provides the basis for this work. In a test packet, the number of occurrences of an n-gram decides whether the n-gram is anomalous or not. Moreover, the deviation of number of occurrences of such an anomalous n-gram from the median (or the average) of number of occurrences of the n-gram in training packets is considered for estimating an anomaly score of the test packet. Consideration of this magnitude of the deviation from the statistical profile (median or average) of n-gram occurrences for a normal HTTP traffic is the highlight of the proposed method. Finally, an anomaly-to-normal ratio for the test packet determines whether it is malicious or normal. This technique yields better performance as compared to an existing n-gram based method of anomalous HTTP traffic detection.
{"title":"Statistical Profiling of n-grams for Payload Based Anomaly Detection for HTTP Web Traffic","authors":"R. Pal, Naveen Chowdary","doi":"10.1109/ANTS.2018.8710080","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710080","url":null,"abstract":"Anomalous HTTP traffic can be identified by analysing the content of HTTP packet as payload. n-gram analysis is a prominent technique for payload analysis. In this paper, a novel n-gram based anomaly detection method has been proposed for HTTP traffic. During the training phase, statistical profiling (the maximum, the minimum, the median and the average of number of occurrences in a packet) of n-grams for a data set of normal (not malicious) HTTP packets provides the basis for this work. In a test packet, the number of occurrences of an n-gram decides whether the n-gram is anomalous or not. Moreover, the deviation of number of occurrences of such an anomalous n-gram from the median (or the average) of number of occurrences of the n-gram in training packets is considered for estimating an anomaly score of the test packet. Consideration of this magnitude of the deviation from the statistical profile (median or average) of n-gram occurrences for a normal HTTP traffic is the highlight of the proposed method. Finally, an anomaly-to-normal ratio for the test packet determines whether it is malicious or normal. This technique yields better performance as compared to an existing n-gram based method of anomalous HTTP traffic detection.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123052500","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710139
S. Verma, M. Hashmi
This paper reports a novel compact dual band bandstop filter (DB-BSF) structure using triangular shaped defected ground structure (DGS) and split ring type defected microstrip line (DMS). The triangular shaped DGS and split ring type DMS are designed to ensure resonance at two frequencies. The proposed design represents the combination of DMS and DGS geometries analyzed by effective capacitance and effective inductance. An appropriate equivalent parallel LC circuit model has been developed for performance analysis of individual geometries. A prototype operating at 2.4 GHz and 5.86 GHz frequencies has been developed on Rogers RO4350B substrate for the demonstration of the effectiveness of the proposed design. A very good agreement between the simulated and measured results demonstrate the effectiveness of the proposed technique. The design is miniature, board size of $12 times 12 mm ^{2}$, and achieves a performance significantly improves the performance metrics of the DGS based dual band bandstop filter reported so far.
本文报道了一种采用三角形缺陷接地结构(DGS)和裂环型缺陷微带线(DMS)的新型紧凑型双带带阻滤波器(DB-BSF)结构。三角形DGS和分裂环型DMS的设计，以确保在两个频率共振。通过有效电容和有效电感对DMS和DGS的几何形状进行了分析。建立了一种合适的等效并行LC电路模型，用于单个几何形状的性能分析。在Rogers ro450b衬底上开发了工作在2.4 GHz和5.86 GHz频率的原型，以验证所提出设计的有效性。仿真结果与实测结果吻合良好，证明了该方法的有效性。该设计是微型的，电路板尺寸为12 × 12 mm ^{2}$，并且实现了显著提高目前报道的基于DGS的双带带阻滤波器的性能指标。
{"title":"A Compact Dual Band Bandstop Filter Using Triangular Shaped Defected Ground Structure and Split Ring Type Defected Microstrip Line","authors":"S. Verma, M. Hashmi","doi":"10.1109/ANTS.2018.8710139","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710139","url":null,"abstract":"This paper reports a novel compact dual band bandstop filter (DB-BSF) structure using triangular shaped defected ground structure (DGS) and split ring type defected microstrip line (DMS). The triangular shaped DGS and split ring type DMS are designed to ensure resonance at two frequencies. The proposed design represents the combination of DMS and DGS geometries analyzed by effective capacitance and effective inductance. An appropriate equivalent parallel LC circuit model has been developed for performance analysis of individual geometries. A prototype operating at 2.4 GHz and 5.86 GHz frequencies has been developed on Rogers RO4350B substrate for the demonstration of the effectiveness of the proposed design. A very good agreement between the simulated and measured results demonstrate the effectiveness of the proposed technique. The design is miniature, board size of $12 times 12 mm ^{2}$, and achieves a performance significantly improves the performance metrics of the DGS based dual band bandstop filter reported so far.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123566291","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710151
Babul P. Tewari, B. Mandal
In 802. 11 NLaN, Access Point (AP) and its associated mobile stations (MSs) forms a basic service set BSS. In such network a continuous service coverage with an acceptable throughput is highly desirable while the $mathrm {M}mathrm {S}s$ roam around the network. Limited size of WLAN BSSs with increased deployment results more transmission overlapping and frequent hand-offs. This significantly increases the delay. On the other hand, selection of appropriate target AP is another major issue as it crucially determines the obtained throughput. In this paper we propose a load aware channel probing (LACP) towards an efficient hand-off addressing these two issues simultaneously. Based on the accumulated load on the $mathrm {A}mathrm {P}s$ in range the proposed approach efficiently reduces the probe-count during hand-off by avoiding unnecessary channel probing and selects the appropriate destination AP. The objective is to reduce the hand-off delay and to enhance the obtained throughput. We first present a motivational example then develop an elegant algorithm. The novelty of the idea is established through extensive simulations. We have shown that the performance of the proposed approach is highly comparable to the other approaches from existing literature.
{"title":"Efficient 802.11 Hand-off through Load Aware Channel Probing","authors":"Babul P. Tewari, B. Mandal","doi":"10.1109/ANTS.2018.8710151","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710151","url":null,"abstract":"In 802. 11 NLaN, Access Point (AP) and its associated mobile stations (MSs) forms a basic service set BSS. In such network a continuous service coverage with an acceptable throughput is highly desirable while the $mathrm {M}mathrm {S}s$ roam around the network. Limited size of WLAN BSSs with increased deployment results more transmission overlapping and frequent hand-offs. This significantly increases the delay. On the other hand, selection of appropriate target AP is another major issue as it crucially determines the obtained throughput. In this paper we propose a load aware channel probing (LACP) towards an efficient hand-off addressing these two issues simultaneously. Based on the accumulated load on the $mathrm {A}mathrm {P}s$ in range the proposed approach efficiently reduces the probe-count during hand-off by avoiding unnecessary channel probing and selects the appropriate destination AP. The objective is to reduce the hand-off delay and to enhance the obtained throughput. We first present a motivational example then develop an elegant algorithm. The novelty of the idea is established through extensive simulations. We have shown that the performance of the proposed approach is highly comparable to the other approaches from existing literature.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123599852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710094
Neelima Singh, Brejesh Lall
The main objective of this paper is to do entropy measures based complexity analysis of impulse noises encountered in wireline communication systems. We have demonstrated in this paper that sample entropy, which is an information theory based statistical measure, is able to capture the time-domain complexity (in terms of variability and regularity) of impulse noises arising from most commonly used domestic electronic appliances. Results show that sample entropy features based analysis of impulse noises may also aid in identifying the primary disturber (active noise source) and thus can be helpful in troubleshooting the performance issues in wireline communication systems.
{"title":"Entropy Measures Based Complexity Analysis of Impulse Noise Sources for xDSL/PLC Systems","authors":"Neelima Singh, Brejesh Lall","doi":"10.1109/ANTS.2018.8710094","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710094","url":null,"abstract":"The main objective of this paper is to do entropy measures based complexity analysis of impulse noises encountered in wireline communication systems. We have demonstrated in this paper that sample entropy, which is an information theory based statistical measure, is able to capture the time-domain complexity (in terms of variability and regularity) of impulse noises arising from most commonly used domestic electronic appliances. Results show that sample entropy features based analysis of impulse noises may also aid in identifying the primary disturber (active noise source) and thus can be helpful in troubleshooting the performance issues in wireline communication systems.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115915423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ANTS.2018.8710141
G. Abhilash, G. Divyansh
Software defined networking is a concept proposed to replace traditional networks by separating control plane and data plane. It makes the network more programmable and manageable. As there is a single point of control of the network, it is more vulnerable to intrusion. The idea is to train the network controller by machine learning algorithms to let it make the intelligent decisions automatically. In this paper, we have discussed our approach to make software defined networking more secure from various malicious attacks by making it capable of detecting and preventing such attacks.
{"title":"Intrusion Detection and Prevention in Software Defined Networking","authors":"G. Abhilash, G. Divyansh","doi":"10.1109/ANTS.2018.8710141","DOIUrl":"https://doi.org/10.1109/ANTS.2018.8710141","url":null,"abstract":"Software defined networking is a concept proposed to replace traditional networks by separating control plane and data plane. It makes the network more programmable and manageable. As there is a single point of control of the network, it is more vulnerable to intrusion. The idea is to train the network controller by machine learning algorithms to let it make the intelligent decisions automatically. In this paper, we have discussed our approach to make software defined networking more secure from various malicious attacks by making it capable of detecting and preventing such attacks.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124779025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-12-01DOI: 10.1109/ants.2018.8710138
Ravi Sharma, Venkataramana Badarla
This paper presents a novel beacon placement strategy and its geometric evaluation for the accuracy of three dimensional (3D) indoor localization. The proposed method assumes the beacon placement domain to be a grid of candidate locations on the surface of ceilings and walls of target indoor geometry. The effect of error propagation due to the geometrical arrangement between anchor beacons and target devices is formulated as an optimization objective. A Mixed Integer Linear Programming (MILP) approach is used to minimize the required total beacon count, constrained by the resulting Geometric Dilution of Precision (GDoP) at each candidate device location. To demonstrate the effectiveness of the proposed technique, the surface placement is compared against the typical linear placement of beacons which considers a planar geometry between device and beacon locations. A resulting improvement in minimum achievable GDoP while keeping the same beacon count was reported for surface over linear beacon placement.
{"title":"Geometrical Optimization of A Novel Beacon Placement Strategy for 3D Indoor Localization","authors":"Ravi Sharma, Venkataramana Badarla","doi":"10.1109/ants.2018.8710138","DOIUrl":"https://doi.org/10.1109/ants.2018.8710138","url":null,"abstract":"This paper presents a novel beacon placement strategy and its geometric evaluation for the accuracy of three dimensional (3D) indoor localization. The proposed method assumes the beacon placement domain to be a grid of candidate locations on the surface of ceilings and walls of target indoor geometry. The effect of error propagation due to the geometrical arrangement between anchor beacons and target devices is formulated as an optimization objective. A Mixed Integer Linear Programming (MILP) approach is used to minimize the required total beacon count, constrained by the resulting Geometric Dilution of Precision (GDoP) at each candidate device location. To demonstrate the effectiveness of the proposed technique, the surface placement is compared against the typical linear placement of beacons which considers a planar geometry between device and beacon locations. A resulting improvement in minimum achievable GDoP while keeping the same beacon count was reported for surface over linear beacon placement.","PeriodicalId":273443,"journal":{"name":"2018 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122048709","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
扫码关注我们
求助内容：
应助结果提醒方式：