Pub Date : 2017-07-01DOI: 10.1109/ICCCNT.2017.8204007
Amit Khandelwal, Chhagan Charan
Spectrum sensing (SS) is an essential requirement in Cognitive Radio (CR) to detect licensed user (Primary user (PU)) and to access the opportunistic spectrum for unlicensed users (secondary users). Several sensing techniques are limited by multipath fading and shadowing which degrade the sensing performance. Hence noise plays an important role in spectrum sensing. Herein, we examine the condition of correlated noise based on eigenvalue technique. The consideration of Standard Condition Number (SCN) based statistics for decision that statistics are further based on Random Matrix Theory (RMT). First we analyze the eigenvalue based Marchenko-Pastur (MP) Law in presence of correlated noise. Due to degradation in performance of MP Law, new SCN based threshold is used. We analyze that the new bound increases the performance in case of correlated noise. Cooperative spectrum sensing based hard decision rule is to analysis the performance of spectrum sensing. Here, AND, OR and Majority rule is analyzed under the condition of noise correlation and also analyzed the effect of correlation on sensing performance using these rules.
{"title":"Investigation of spectrum sensing under colored noise for cognitive radio network","authors":"Amit Khandelwal, Chhagan Charan","doi":"10.1109/ICCCNT.2017.8204007","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8204007","url":null,"abstract":"Spectrum sensing (SS) is an essential requirement in Cognitive Radio (CR) to detect licensed user (Primary user (PU)) and to access the opportunistic spectrum for unlicensed users (secondary users). Several sensing techniques are limited by multipath fading and shadowing which degrade the sensing performance. Hence noise plays an important role in spectrum sensing. Herein, we examine the condition of correlated noise based on eigenvalue technique. The consideration of Standard Condition Number (SCN) based statistics for decision that statistics are further based on Random Matrix Theory (RMT). First we analyze the eigenvalue based Marchenko-Pastur (MP) Law in presence of correlated noise. Due to degradation in performance of MP Law, new SCN based threshold is used. We analyze that the new bound increases the performance in case of correlated noise. Cooperative spectrum sensing based hard decision rule is to analysis the performance of spectrum sensing. Here, AND, OR and Majority rule is analyzed under the condition of noise correlation and also analyzed the effect of correlation on sensing performance using these rules.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"65 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85645314","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 : 2017-07-01DOI: 10.1109/ICCCNT.2017.8204039
Sakshi Virmani, S. Gite
With the advancements in Internet of Things (IoT), we could efficiently improve our daily life activities like health care, monitoring, transportation, smart homes etc. Artificial Intelligence along with Machine learning has played a very supportive role to analyze various situations and take decisions accordingly. Maneuver anticipation supplements existing Advance Driver Assistance Systems (ADAS) by anticipating mishaps and giving drivers more opportunity to respond to road circumstances proactively. The capacity to sort the driver conduct is extremely beneficial for advance driver assistance system (ADAS). Deep learning solutions would further be an endeavor of for driving conduct recognition. A technique for distinguishing driver's conduct is imperative to help operative mode transition between the driver and independent vehicles. We propose a novel approach of dissecting driver's conduct by using Convolutional Neural Network (CNN), Recurrent Neural Network(RNN) and a combination of Convolutional Neural Network with Long-Short Term Memory (LSTM) that would give better results in less response time. We are likewise proposing to concentrate high level features and interpretable features depicting complex driving examples by trying CNN, RNN and then CNN with LSTM. We could improve the system accuracy to 95% by combining CNN with LSTM.
{"title":"Performance of convolutional neural network and recurrent neural network for anticipation of driver's conduct","authors":"Sakshi Virmani, S. Gite","doi":"10.1109/ICCCNT.2017.8204039","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8204039","url":null,"abstract":"With the advancements in Internet of Things (IoT), we could efficiently improve our daily life activities like health care, monitoring, transportation, smart homes etc. Artificial Intelligence along with Machine learning has played a very supportive role to analyze various situations and take decisions accordingly. Maneuver anticipation supplements existing Advance Driver Assistance Systems (ADAS) by anticipating mishaps and giving drivers more opportunity to respond to road circumstances proactively. The capacity to sort the driver conduct is extremely beneficial for advance driver assistance system (ADAS). Deep learning solutions would further be an endeavor of for driving conduct recognition. A technique for distinguishing driver's conduct is imperative to help operative mode transition between the driver and independent vehicles. We propose a novel approach of dissecting driver's conduct by using Convolutional Neural Network (CNN), Recurrent Neural Network(RNN) and a combination of Convolutional Neural Network with Long-Short Term Memory (LSTM) that would give better results in less response time. We are likewise proposing to concentrate high level features and interpretable features depicting complex driving examples by trying CNN, RNN and then CNN with LSTM. We could improve the system accuracy to 95% by combining CNN with LSTM.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"5 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80879628","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 : 2017-07-01DOI: 10.1109/ICCCNT.2017.8203968
Noorinder Kaur, Rupendeep Kaur
Fullerene molecular device configurations are center of allurement for varied number of electronic and transport characteristics by eccentricity of atoms epitomized in the same. In this paper, low bias conductive feature of smallest molecular device C20 has been observed using doping of transition metals. We examined the doping effect of manganese, iron, cobalt and nickel on C20 fullerene in a two probe device configuration. Using this configuration the C20 fullerene is oriented carefully between left and right gold electrodes. Transport properties were investigated and compared which highlighted the superiority of Mn doped device over pristine, Fe, Co and Ni doped C20 molecular devices.
{"title":"To elucidate the conductive behaviour of transition metals (Mn, Fe, Co, Ni) doped C20 molecular device","authors":"Noorinder Kaur, Rupendeep Kaur","doi":"10.1109/ICCCNT.2017.8203968","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8203968","url":null,"abstract":"Fullerene molecular device configurations are center of allurement for varied number of electronic and transport characteristics by eccentricity of atoms epitomized in the same. In this paper, low bias conductive feature of smallest molecular device C20 has been observed using doping of transition metals. We examined the doping effect of manganese, iron, cobalt and nickel on C20 fullerene in a two probe device configuration. Using this configuration the C20 fullerene is oriented carefully between left and right gold electrodes. Transport properties were investigated and compared which highlighted the superiority of Mn doped device over pristine, Fe, Co and Ni doped C20 molecular devices.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"42 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85439709","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 : 2017-07-01DOI: 10.1109/ICCCNT.2017.8203998
E. Rani, Harpreet Kaur
Cloud computing is an internet-based pool of heterogeneous resources. The development of Cloud is scalable and reliable to make availability of resources when required to online users. Resources are provided as a service on demand with payment done on use basis. Nowadays, for less cost and maximize resource utilization, mainly computing is done on Cloud. Cloud simulator is a collection of java classes that provides simulation of concepts of cloud computing. Cloudlet scheduling is one of the most important task in cloud computing. This paper presents fundamental study on the functions of CloudSim simulator and provides tabulated view of various scheduling algorithms used in cloud environment with their parameters and results.
{"title":"Study on fundamental usage of CloudSim simulator and algorithms of resource allocation in cloud computing","authors":"E. Rani, Harpreet Kaur","doi":"10.1109/ICCCNT.2017.8203998","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8203998","url":null,"abstract":"Cloud computing is an internet-based pool of heterogeneous resources. The development of Cloud is scalable and reliable to make availability of resources when required to online users. Resources are provided as a service on demand with payment done on use basis. Nowadays, for less cost and maximize resource utilization, mainly computing is done on Cloud. Cloud simulator is a collection of java classes that provides simulation of concepts of cloud computing. Cloudlet scheduling is one of the most important task in cloud computing. This paper presents fundamental study on the functions of CloudSim simulator and provides tabulated view of various scheduling algorithms used in cloud environment with their parameters and results.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"161 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85454241","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 : 2017-07-01DOI: 10.1109/ICCCNT.2017.8204019
Neelam Dabas, R. Singh, Geethanjali Kher, Vikash Chaudhary
For the increasing use of internet, it is equally important to protect the intellectual property. And for the protection of copyright, a blind digital watermark algorithm with SVD and OSELM in the IWT domain has been proposed. During the embedding process, SVD has been applied to the coefficient blocks to get the singular values in the IWT domain. Singular values are modulated to embed the watermark in the host image. Online sequential extreme learning machine is trained to learn the relationship between the original coefficient and the corresponding watermarked version. During the extraction process, this trained OSELM is used to extract the embedded watermark logo blindly as no original host image is required during this process. The watermarked image is altered using various attacks like blurring, noise, sharpening, rotation and cropping. The experimental results show that the proposed watermarking scheme is robust against various attacks. The extracted watermark has very much similarity with the original watermark and works good to prove the ownership.
{"title":"A novel SVD and online sequential extreme learning machine based watermark method for copyright protection","authors":"Neelam Dabas, R. Singh, Geethanjali Kher, Vikash Chaudhary","doi":"10.1109/ICCCNT.2017.8204019","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8204019","url":null,"abstract":"For the increasing use of internet, it is equally important to protect the intellectual property. And for the protection of copyright, a blind digital watermark algorithm with SVD and OSELM in the IWT domain has been proposed. During the embedding process, SVD has been applied to the coefficient blocks to get the singular values in the IWT domain. Singular values are modulated to embed the watermark in the host image. Online sequential extreme learning machine is trained to learn the relationship between the original coefficient and the corresponding watermarked version. During the extraction process, this trained OSELM is used to extract the embedded watermark logo blindly as no original host image is required during this process. The watermarked image is altered using various attacks like blurring, noise, sharpening, rotation and cropping. The experimental results show that the proposed watermarking scheme is robust against various attacks. The extracted watermark has very much similarity with the original watermark and works good to prove the ownership.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"12 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82448079","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 : 2017-07-01DOI: 10.1109/ICCCNT.2017.8204171
S. Samdani, Sanyam Shukla
Intrusion Detection has been a popular area of research due to increase in number of attacks. Intrusion Detection is a classification problem, in which some of the attributes are nominal. Classification algorithms like Support Vector Machine, Extreme Learning Machine, Neural Network etc. are not capable of handling nominal features. This leads to the need of method for converting nominal features to numeric features. None of research articles published till date have evaluated the appropriate method of nominal to numeric conversion for intrusion detection problem. This work explores Target Methods, Dummy Methods and Influence Value Method for Intrusion Detection to convert nominal attributes to numeric attributes. This work also proposes a new method for nominal to numeric conversion, which performs better than existing methods. The results presented in this paper evaluated using NSL-KDD.
{"title":"A novel technique for converting nominal attributes to numeric attributes for intrusion detection","authors":"S. Samdani, Sanyam Shukla","doi":"10.1109/ICCCNT.2017.8204171","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8204171","url":null,"abstract":"Intrusion Detection has been a popular area of research due to increase in number of attacks. Intrusion Detection is a classification problem, in which some of the attributes are nominal. Classification algorithms like Support Vector Machine, Extreme Learning Machine, Neural Network etc. are not capable of handling nominal features. This leads to the need of method for converting nominal features to numeric features. None of research articles published till date have evaluated the appropriate method of nominal to numeric conversion for intrusion detection problem. This work explores Target Methods, Dummy Methods and Influence Value Method for Intrusion Detection to convert nominal attributes to numeric attributes. This work also proposes a new method for nominal to numeric conversion, which performs better than existing methods. The results presented in this paper evaluated using NSL-KDD.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"11 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82100293","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 : 2017-07-01DOI: 10.1109/ICCCNT.2017.8203987
Arushi Goyal, Shimony Mittal, R. Sawant, Ajay Gidhwani, J. Bagate
The word ‘Health’ has paved its way into the minds of the masses. Issues related to health are increasing at an alarming rate. Cardiovascular diseases, once considered to be a malady for the middle aged, is now prevalent among young adults. It is said that heart attack kills 1 person every 33 seconds in India [1]. The proposed model aims at detecting the occurrence of a heart attack by diagnosing the ECG signal. The chances of death due to heart attack can be greatly reduced by enabling access to immediate medical attention. This paper mainly emphasizes on collection and inspection of ECG signal for determination of a heart attack condition. Here, the survey on various behaviours and conditions observed in the ECG during heart attack would be discussed which is further processed and accordingly notified to the concerned individuals. The device aims to reduce the response time in case of occurrence of a heart attack which is crucial to prevent major damage to the distressed muscles in the heart.
{"title":"Portable heart attack detector","authors":"Arushi Goyal, Shimony Mittal, R. Sawant, Ajay Gidhwani, J. Bagate","doi":"10.1109/ICCCNT.2017.8203987","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8203987","url":null,"abstract":"The word ‘Health’ has paved its way into the minds of the masses. Issues related to health are increasing at an alarming rate. Cardiovascular diseases, once considered to be a malady for the middle aged, is now prevalent among young adults. It is said that heart attack kills 1 person every 33 seconds in India [1]. The proposed model aims at detecting the occurrence of a heart attack by diagnosing the ECG signal. The chances of death due to heart attack can be greatly reduced by enabling access to immediate medical attention. This paper mainly emphasizes on collection and inspection of ECG signal for determination of a heart attack condition. Here, the survey on various behaviours and conditions observed in the ECG during heart attack would be discussed which is further processed and accordingly notified to the concerned individuals. The device aims to reduce the response time in case of occurrence of a heart attack which is crucial to prevent major damage to the distressed muscles in the heart.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"20 2 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82399111","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 : 2017-07-01DOI: 10.1109/ICCCNT.2017.8204032
Neha Pramanick, Syed Taqi Ali
With the fastest technology of modern life we always have to deal with numerous data in various way. We simultaneously store and retrieve data in database of large organization, email server, cloud server etc. Due to this process both the owner and user need security of the data and therefore the data is encrypted before use. Because of this encryption process, some problem arises at the time of searching and retrieving of particular data. Searchable encryption is a scheme which assures the owner and user a secure and efficient searching operation. There has been growing interest in searchable encryption in both academics and industry. Over the years different type of construction of searchable encryption have been introduced. In some of them, researchers have emphasize on the efficiency of searchable encryption technique and somewhere security and privacy have got more attention. In this paper, a comparative survey has done on various technique of searchable encryption.
{"title":"A comparative survey of searchable encryption schemes","authors":"Neha Pramanick, Syed Taqi Ali","doi":"10.1109/ICCCNT.2017.8204032","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8204032","url":null,"abstract":"With the fastest technology of modern life we always have to deal with numerous data in various way. We simultaneously store and retrieve data in database of large organization, email server, cloud server etc. Due to this process both the owner and user need security of the data and therefore the data is encrypted before use. Because of this encryption process, some problem arises at the time of searching and retrieving of particular data. Searchable encryption is a scheme which assures the owner and user a secure and efficient searching operation. There has been growing interest in searchable encryption in both academics and industry. Over the years different type of construction of searchable encryption have been introduced. In some of them, researchers have emphasize on the efficiency of searchable encryption technique and somewhere security and privacy have got more attention. In this paper, a comparative survey has done on various technique of searchable encryption.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"7 1","pages":"1-5"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78975987","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 : 2017-07-01DOI: 10.1109/ICCCNT.2017.8204129
R. Mittal, M. Bhatia
Various real life social networks exhibit multiple types of interaction among entities, thus this arrangement builds a compilation of continuous growing networks called as multiplex networks. Lately, the area related to centrality measurement of entities in multiplex networks has developed a significant interest among researchers. However, the concept of structural holes has not received significant attention in multiplexed networks. The theory of structural holes suggests that “holes” acts as a bridge between individuals or groups that are otherwise disconnected. Structural hole plays an important role in information diffusion and link prediction. Although there are numerous methods defined to detect structural holes in a simple network, detecting structural holes in multiplexed network is still untouched. In this paper, we present a methodology of mining top-k structural holes from multiplexed or multi-layer networks. For the purpose of the study, we make use of two networks: airline and co-author. Our experiments provide an insight into the theory of structural holes in multiplexed network. We compare the proposed methodology with several alternative methods and we get encouraging and comparable results. We believe this is the first shot to report the problem of mining structural holes in multiplexed social networks.
{"title":"Mining top-k structural holes in multiplex networks","authors":"R. Mittal, M. Bhatia","doi":"10.1109/ICCCNT.2017.8204129","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8204129","url":null,"abstract":"Various real life social networks exhibit multiple types of interaction among entities, thus this arrangement builds a compilation of continuous growing networks called as multiplex networks. Lately, the area related to centrality measurement of entities in multiplex networks has developed a significant interest among researchers. However, the concept of structural holes has not received significant attention in multiplexed networks. The theory of structural holes suggests that “holes” acts as a bridge between individuals or groups that are otherwise disconnected. Structural hole plays an important role in information diffusion and link prediction. Although there are numerous methods defined to detect structural holes in a simple network, detecting structural holes in multiplexed network is still untouched. In this paper, we present a methodology of mining top-k structural holes from multiplexed or multi-layer networks. For the purpose of the study, we make use of two networks: airline and co-author. Our experiments provide an insight into the theory of structural holes in multiplexed network. We compare the proposed methodology with several alternative methods and we get encouraging and comparable results. We believe this is the first shot to report the problem of mining structural holes in multiplexed social networks.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"33 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87470066","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 : 2017-07-01DOI: 10.1109/ICCCNT.2017.8204052
Shefali Modi, M. Murmu
Spectrum handover (SHO) is an interesting challenge of cognitive radio networks (CRNs). SHO is initiated when current channel gets occupied by primary user (PU) and therefore secondary user (SU) transfers the task to unused channel in order to avoid application discontinuity. In this paper, we formulated a multiple SU spectrum handover scheme using ant colony optimization (ACO). We deploy a network model by graph coloring problem (GCP) and learn spectrum awareness by ant colony optimization (ACO) approach. Our scheme formulates a handover cost function that helps to take handover decision and performs fair channel assignment to maintain QoS requirements in CRN.
{"title":"Multi-SUs interference avoidance spectrum handover algorithm using ant colony method in cognitive radio networks","authors":"Shefali Modi, M. Murmu","doi":"10.1109/ICCCNT.2017.8204052","DOIUrl":"https://doi.org/10.1109/ICCCNT.2017.8204052","url":null,"abstract":"Spectrum handover (SHO) is an interesting challenge of cognitive radio networks (CRNs). SHO is initiated when current channel gets occupied by primary user (PU) and therefore secondary user (SU) transfers the task to unused channel in order to avoid application discontinuity. In this paper, we formulated a multiple SU spectrum handover scheme using ant colony optimization (ACO). We deploy a network model by graph coloring problem (GCP) and learn spectrum awareness by ant colony optimization (ACO) approach. Our scheme formulates a handover cost function that helps to take handover decision and performs fair channel assignment to maintain QoS requirements in CRN.","PeriodicalId":6581,"journal":{"name":"2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT)","volume":"2 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86993196","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
扫码关注我们
求助内容：
应助结果提醒方式：