In recent times, wireless networks have seen unprecedented growth. This leads to shortage of scarce resources like radio spectrum. With the conventional approach, it is very tough to manage this frightening number of devices. Therefore, Cognitive Radio Ad Hoc Networks (CRAHNs) envisioned. In CRAHNs, the unlicensed users can communicate in licensed bands opportunistically when it is not in use by licensed users. A special routing protocol is required to implement this objective, as the conventional protocols proposed for mobile ad hoc network will not be suitable for CRAHNs. There are many additional routing challenges involved. For instance, the routing protocols must be dynamic to provide protection to primary users & it must be energy efficient since all the devices involved in conventional ad hoc networks are battery operated. This paper proposes an Energy Efficient Multimeric Multichannel routing protocol for CRAHNs. It is an on demand routing protocol which takes residual energy, the probability of primary user appearance on a channel and route cost as metrics to evaluate the best route between a source and destination. The proposed work is simulated on a custom simulator. The route establishment and route maintenance delay are observed alongside by varying primary users activities. The simulation results prove the efficiency of the proposed approach as it takes less time as compared to Dijkstra algorithm with random channel selection.
{"title":"Energy Efficient Multimeric Multichannel Routing Protocol for Cognitive Radio Ad Hoc Network","authors":"Shiraz Khurana, S. Upadhyaya","doi":"10.2139/ssrn.3511005","DOIUrl":"https://doi.org/10.2139/ssrn.3511005","url":null,"abstract":"In recent times, wireless networks have seen unprecedented growth. This leads to shortage of scarce resources like radio spectrum. With the conventional approach, it is very tough to manage this frightening number of devices. Therefore, Cognitive Radio Ad Hoc Networks (CRAHNs) envisioned. In CRAHNs, the unlicensed users can communicate in licensed bands opportunistically when it is not in use by licensed users. A special routing protocol is required to implement this objective, as the conventional protocols proposed for mobile ad hoc network will not be suitable for CRAHNs. There are many additional routing challenges involved. For instance, the routing protocols must be dynamic to provide protection to primary users & it must be energy efficient since all the devices involved in conventional ad hoc networks are battery operated. This paper proposes an Energy Efficient Multimeric Multichannel routing protocol for CRAHNs. It is an on demand routing protocol which takes residual energy, the probability of primary user appearance on a channel and route cost as metrics to evaluate the best route between a source and destination. The proposed work is simulated on a custom simulator. The route establishment and route maintenance delay are observed alongside by varying primary users activities. The simulation results prove the efficiency of the proposed approach as it takes less time as compared to Dijkstra algorithm with random channel selection.","PeriodicalId":343060,"journal":{"name":"ICCS 2019: Proceedings","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114951793","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}
Cloud computing has emerged as a technological evolution in the recent past. It facilitates the provision of data storage, infrastructure and application. Organizations as well as Individuals uses the online services being provide by the cloud service provider. Organizations use data stored in the cloud environment for analysis and decision making purpose.In cloud-based environments protecting sensitive data is a challenge where the user does not have physical access control over the data and cloud infrastructure. This indicates that the cloud provider could be a very serious attack vector. Data protection and preservation is considered to be a significant concern in large applications in cloud environment which requires processing of large sensitive data sets. To address the need of protecting sensitive micro data of an individual, a technique called Data Anonymization like K-anonymization, L-diversity and T-closeness has been proposed by various researchers. Data deidentification and Re-identification meets the requirement for release of data for the research as well as for the protection of privacy of an individual. In this paper it is proposed to protect and preserve sensitive data of cloud users on a cloud based online Property Management application. k-Anonymization has a feature that in the dataset each tuple is indistinguishable from at least k-1 others. Anonymization methods i.e. K- anonymity, L-diversity and T-closeness have been used and the performance of these technique is evaluated in terms of optimal anonymity. We can find optimal Anonymization for the purpose of preserving privacy and reducing re-identification risk by experimenting on the real data. It is seen that Anonymization is useful in circumstance when the input data are processed for the purpose of preliminarily accessing an optimal anonymization.
{"title":"An Approach of Optimal Anonymization for Preserving Privacy in Cloud","authors":"Parmod Kalia, D. Bansal, S. Sofat","doi":"10.2139/ssrn.3511000","DOIUrl":"https://doi.org/10.2139/ssrn.3511000","url":null,"abstract":"Cloud computing has emerged as a technological evolution in the recent past. It facilitates the provision of data storage, infrastructure and application. Organizations as well as Individuals uses the online services being provide by the cloud service provider. Organizations use data stored in the cloud environment for analysis and decision making purpose.In cloud-based environments protecting sensitive data is a challenge where the user does not have physical access control over the data and cloud infrastructure. This indicates that the cloud provider could be a very serious attack vector. Data protection and preservation is considered to be a significant concern in large applications in cloud environment which requires processing of large sensitive data sets. To address the need of protecting sensitive micro data of an individual, a technique called Data Anonymization like K-anonymization, L-diversity and T-closeness has been proposed by various researchers. Data deidentification and Re-identification meets the requirement for release of data for the research as well as for the protection of privacy of an individual. In this paper it is proposed to protect and preserve sensitive data of cloud users on a cloud based online Property Management application. k-Anonymization has a feature that in the dataset each tuple is indistinguishable from at least k-1 others. Anonymization methods i.e. K- anonymity, L-diversity and T-closeness have been used and the performance of these technique is evaluated in terms of optimal anonymity. We can find optimal Anonymization for the purpose of preserving privacy and reducing re-identification risk by experimenting on the real data. It is seen that Anonymization is useful in circumstance when the input data are processed for the purpose of preliminarily accessing an optimal anonymization.","PeriodicalId":343060,"journal":{"name":"ICCS 2019: Proceedings","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126275522","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
扫码关注我们
求助内容：
应助结果提醒方式：