Pub Date : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496496
D. Karunkuzhali, D. Tomar
IEEE 802.16m standard redefined with many improvements on IEEE 802.16e standard to provide the best connectivity and to perform the error-free data transmission. In this paper, an improved Traffic based Duo triggered handoff algorithm for the buffer management is proposed to enhance the quality of service features in the air interface standard of IEEE 802.16 m. The standard aims to reduce overhead, improved coverage through optimized parameterization and excessive security measures. These parameters define the set of services that are provided for protection and they are agreed upon at the time of security association establishment. It includes the request and response of both the MS and the BS in order to measure the parametric values and the respective threshold values to find the optimum for handoff operations. Optimization in the threshold value is achieved through the calculation both SNR and delay in a combined manner to evaluate the heuristic handoff for a given scanning interval. We evident that our proposed system framework performs efficient handoff management with effort from base station scheduler and subscriber station scheduler. These processes incur least bandwidth underutilization thereby reducing the transmission delay under heavy traffic condition with QoS features conciliation.
{"title":"Traffic based Duo-triggered handoff algorithm for enhanced buffer management and QoS in Wimax 16m networks","authors":"D. Karunkuzhali, D. Tomar","doi":"10.1109/ICPRIME.2013.6496496","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496496","url":null,"abstract":"IEEE 802.16m standard redefined with many improvements on IEEE 802.16e standard to provide the best connectivity and to perform the error-free data transmission. In this paper, an improved Traffic based Duo triggered handoff algorithm for the buffer management is proposed to enhance the quality of service features in the air interface standard of IEEE 802.16 m. The standard aims to reduce overhead, improved coverage through optimized parameterization and excessive security measures. These parameters define the set of services that are provided for protection and they are agreed upon at the time of security association establishment. It includes the request and response of both the MS and the BS in order to measure the parametric values and the respective threshold values to find the optimum for handoff operations. Optimization in the threshold value is achieved through the calculation both SNR and delay in a combined manner to evaluate the heuristic handoff for a given scanning interval. We evident that our proposed system framework performs efficient handoff management with effort from base station scheduler and subscriber station scheduler. These processes incur least bandwidth underutilization thereby reducing the transmission delay under heavy traffic condition with QoS features conciliation.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116266284","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496474
S. Alagu, T. Meyyappan
This paper proposes a new channel reservation scheme which reserves channels in the neighboring cells for expected handoffs. In mobile communication networks, the radius of the cell becomes smaller so as to utilize the limited channel efficiently. The limited spectrum availability necessitates a novel approach to be addressed to handle handoffs. As the cell radius decreases, the Quality of Service degrades and results in high Handoff dropping rate. In order to handle this issue, a novel reservation based approach is proposed in this paper. The proposed approach reserves channels in the neighboring cells for expected Handoffs. The simulation results reveal that the proposed scheme reduces the dropping probability of handoff calls and guarantees QoS.
{"title":"A novel channel reservation scheme for handling handoffs in wireless mobile networks","authors":"S. Alagu, T. Meyyappan","doi":"10.1109/ICPRIME.2013.6496474","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496474","url":null,"abstract":"This paper proposes a new channel reservation scheme which reserves channels in the neighboring cells for expected handoffs. In mobile communication networks, the radius of the cell becomes smaller so as to utilize the limited channel efficiently. The limited spectrum availability necessitates a novel approach to be addressed to handle handoffs. As the cell radius decreases, the Quality of Service degrades and results in high Handoff dropping rate. In order to handle this issue, a novel reservation based approach is proposed in this paper. The proposed approach reserves channels in the neighboring cells for expected Handoffs. The simulation results reveal that the proposed scheme reduces the dropping probability of handoff calls and guarantees QoS.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123592670","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496520
K. S. Kumar, T. Arunkumar
Mobile Ad-hoc Network (MANET) is a technology that has been developed for real-world applications. The routing information system of MANET can be said to be the back bone for routing process which also represents the characteristics or behaviours of routing nodes. The performance of MANET can be improved if the routing is done based on nodes routing behaviours. Thus, classification and prediction of routing nodes behaviour could lead to proper data analysis and decision making through which an effective routing model can be developed. Association among the routing attributes could help us to predict the behaviour of routing nodes based on the similarity but it is also possible that some of the associations may be hidden due to uncertain behaviour of the routing nodes. Absence of unseen associations may possess some necessary information which should not be ignored when we build an effective routing model. Keeping this in view, we have proposed a prediction model based on the Bayesian approach with fuzzy proximity relation and ordering to predict the link-failure and hidden associations using routing information system of MANET. Since the values in the routing information system are almost identical, we have considered the almost indiscernibility relation to characterize the routing nodes based on fuzzy proximity relation. This result induces the almost equivalence class of routing nodes. On imposing order relation on this equivalence class, we have obtained ordered categorical classes of routing nodes through which we can compute the link-failure possibilities of each routing node. Finally, we use the Bayesian approach to predict the hidden associations of routing attributes which can provide useful information to build an effective routing model for MANET.
{"title":"Classification and prediction of routing nodes behavior in MANET using Fuzzy proximity relation and ordering with Bayesian classifier","authors":"K. S. Kumar, T. Arunkumar","doi":"10.1109/ICPRIME.2013.6496520","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496520","url":null,"abstract":"Mobile Ad-hoc Network (MANET) is a technology that has been developed for real-world applications. The routing information system of MANET can be said to be the back bone for routing process which also represents the characteristics or behaviours of routing nodes. The performance of MANET can be improved if the routing is done based on nodes routing behaviours. Thus, classification and prediction of routing nodes behaviour could lead to proper data analysis and decision making through which an effective routing model can be developed. Association among the routing attributes could help us to predict the behaviour of routing nodes based on the similarity but it is also possible that some of the associations may be hidden due to uncertain behaviour of the routing nodes. Absence of unseen associations may possess some necessary information which should not be ignored when we build an effective routing model. Keeping this in view, we have proposed a prediction model based on the Bayesian approach with fuzzy proximity relation and ordering to predict the link-failure and hidden associations using routing information system of MANET. Since the values in the routing information system are almost identical, we have considered the almost indiscernibility relation to characterize the routing nodes based on fuzzy proximity relation. This result induces the almost equivalence class of routing nodes. On imposing order relation on this equivalence class, we have obtained ordered categorical classes of routing nodes through which we can compute the link-failure possibilities of each routing node. Finally, we use the Bayesian approach to predict the hidden associations of routing attributes which can provide useful information to build an effective routing model for MANET.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124659504","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496515
A. Prema, A. Pethalakshmi
The term ETL which stands for Extraction, Transformation, and Loading is a batch or scheduled data integration process that includes extracting data from their operational or external data sources, transforming the data into an appropriate format, and loading the data into a data warehouse repository. Through the study of Extract, Transform, and Load (ETL) hypothesis, a new ETL is designed, which is titled as Hyper-ETL for increasing an efficiency of ETL process. Hyper-ETL allows the integration of XML document file and Oracle data warehouse to reduce an execution time and to remove the mismanagement of metadata in an existing ETL process.
术语ETL代表提取、转换和加载，它是一个批处理或计划的数据集成过程，包括从操作数据源或外部数据源提取数据，将数据转换为适当的格式，并将数据加载到数据仓库存储库中。通过对ETL (Extract, Transform, and Load)假说的研究，设计了一种新的ETL，称为Hyper-ETL，以提高ETL过程的效率。Hyper-ETL允许集成XML文档文件和Oracle数据仓库，以减少执行时间，并消除现有ETL进程中元数据管理不善的问题。
{"title":"Novel approach in ETL","authors":"A. Prema, A. Pethalakshmi","doi":"10.1109/ICPRIME.2013.6496515","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496515","url":null,"abstract":"The term ETL which stands for Extraction, Transformation, and Loading is a batch or scheduled data integration process that includes extracting data from their operational or external data sources, transforming the data into an appropriate format, and loading the data into a data warehouse repository. Through the study of Extract, Transform, and Load (ETL) hypothesis, a new ETL is designed, which is titled as Hyper-ETL for increasing an efficiency of ETL process. Hyper-ETL allows the integration of XML document file and Oracle data warehouse to reduce an execution time and to remove the mismanagement of metadata in an existing ETL process.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125020379","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 : 2013-04-15DOI: 10.1109/ICPRIME.2013.6496495
R. Mahesh, T. Meyyappan
The term Data Privacy is associated with data collection and dissemination of data. Privacy issues arise in various area such as health care, intellectual property, biological data etc. It is one of the challenging issues when sharing or publishing the data between one to many sources for research purpose and data analysis. Sensitive information of data owners must be protected. There are two kinds of major attacks against privacy namely record linkage and attribute linkage attacks Earlier, researchers have proposed new methods namely k-anonymity, l-dlverslty, t-closeness for data privacy. K-anonymity method preserves the privacy against record linkage attack alone. It fails to address attribute linkage attack. l-diversity method overcomes the drawback of k-anonymity method. But it fails to address identity disclosure attack and attribute disclosure attack in some exceptional cases. t-closeness method preserves the privacy against attribute linkage attack but not identity disclosure attack. But it computational complexity is large. In this paper, the authors propose a new method to preserve the privacy of individuals' sensitive data from record and attribute linkage attacks. In the proposed method, privacy preservation is achieved through generalization of quasi identifier by setting range values and record elimination. The proposed method is implemented and tested with various data sets.
{"title":"Anonymization technique through record elimination to preserve privacy of published data","authors":"R. Mahesh, T. Meyyappan","doi":"10.1109/ICPRIME.2013.6496495","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496495","url":null,"abstract":"The term Data Privacy is associated with data collection and dissemination of data. Privacy issues arise in various area such as health care, intellectual property, biological data etc. It is one of the challenging issues when sharing or publishing the data between one to many sources for research purpose and data analysis. Sensitive information of data owners must be protected. There are two kinds of major attacks against privacy namely record linkage and attribute linkage attacks Earlier, researchers have proposed new methods namely k-anonymity, l-dlverslty, t-closeness for data privacy. K-anonymity method preserves the privacy against record linkage attack alone. It fails to address attribute linkage attack. l-diversity method overcomes the drawback of k-anonymity method. But it fails to address identity disclosure attack and attribute disclosure attack in some exceptional cases. t-closeness method preserves the privacy against attribute linkage attack but not identity disclosure attack. But it computational complexity is large. In this paper, the authors propose a new method to preserve the privacy of individuals' sensitive data from record and attribute linkage attacks. In the proposed method, privacy preservation is achieved through generalization of quasi identifier by setting range values and record elimination. The proposed method is implemented and tested with various data sets.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128370333","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
扫码关注我们
求助内容：
应助结果提醒方式：