Pub Date : 2012-12-31DOI: 10.1109/ICCICT.2012.6398141
P. Pisolkar, S. Parmar, C. Poojari, D. Kalbande
A bangbang controller (on off controller), also known as a hysteresis controller, is a feedback controller that switches abruptly between two states. These controllers may be realized in terms of any element that provides hysteresis. They are often used to control a plant that accepts a binary input. With recent development of the space science and technology, higher requirements such as accuracy, robustness and disturbance rejection ability in satellite attitude control system have leaded to the more promising intelligent control methods. In order implement this artificial neural networks are a growing trend. A neural scheme of bang bang controller [1] is efficient in solving satellite orientation problems and also continuous updation of error. In control systems Fuzzy Inference Systems are used for loop control and to obtain desired output.
{"title":"Satellite positioning simulation system","authors":"P. Pisolkar, S. Parmar, C. Poojari, D. Kalbande","doi":"10.1109/ICCICT.2012.6398141","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398141","url":null,"abstract":"A bangbang controller (on off controller), also known as a hysteresis controller, is a feedback controller that switches abruptly between two states. These controllers may be realized in terms of any element that provides hysteresis. They are often used to control a plant that accepts a binary input. With recent development of the space science and technology, higher requirements such as accuracy, robustness and disturbance rejection ability in satellite attitude control system have leaded to the more promising intelligent control methods. In order implement this artificial neural networks are a growing trend. A neural scheme of bang bang controller [1] is efficient in solving satellite orientation problems and also continuous updation of error. In control systems Fuzzy Inference Systems are used for loop control and to obtain desired output.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115910031","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398137
V. D. Nimavat, G. R. Kulkarni
Nowadays the Global System for Mobile Communication (originally from Groupe Special Mobile)-GSM technology becomes popular. GSM has potential success in its line-of-sight (LOS) and non line-of-sight (NLOS) conditions which operating in the 900 MHz or 1800 MHz bands. There are going to be a surge all over the world for the deployment of GSM networks. Estimation of path loss is very important in initial deployment of wireless network and cell planning. Numerous path loss (PL) models (e.g. Okumura Model, Hata Model) are available to predict the propagation loss. In this paper we compare and analyze five path loss models (i.e. COST 231 Hata model, SUI model, Ericsson model and COST 231 Walfish-Ikegami model) in different receiver antenna heights in urban, suburban and rural environments in NLOS condition. Our main concentration in this paper is to find out a suitable model for different environments to provide guidelines for cell planning of GSM Network at cellular frequency of 900 MHz.
目前，全球移动通信系统(原Groupe Special Mobile)-GSM技术开始流行。GSM在900 MHz或1800 MHz频段的视距(LOS)和非视距(NLOS)条件下具有潜在的成功。GSM网络的部署将在全世界掀起一股热潮。在无线网络的初始部署和小区规划中，路径损耗的估计是非常重要的。有许多路径损耗模型(如Okumura模型、Hata模型)可用于预测传播损耗。本文对比分析了NLOS条件下城市、郊区和农村环境中不同接收天线高度下的五种路径损耗模型(COST 231 Hata模型、SUI模型、Ericsson模型和COST 231 Walfish-Ikegami模型)。本文的主要工作是寻找适合不同环境的模型，为900 MHz蜂窝频率下GSM网络的小区规划提供指导。
{"title":"Simulation and performance evaluation of GSM propagation channel under the urban, suburban and rural environments","authors":"V. D. Nimavat, G. R. Kulkarni","doi":"10.1109/ICCICT.2012.6398137","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398137","url":null,"abstract":"Nowadays the Global System for Mobile Communication (originally from Groupe Special Mobile)-GSM technology becomes popular. GSM has potential success in its line-of-sight (LOS) and non line-of-sight (NLOS) conditions which operating in the 900 MHz or 1800 MHz bands. There are going to be a surge all over the world for the deployment of GSM networks. Estimation of path loss is very important in initial deployment of wireless network and cell planning. Numerous path loss (PL) models (e.g. Okumura Model, Hata Model) are available to predict the propagation loss. In this paper we compare and analyze five path loss models (i.e. COST 231 Hata model, SUI model, Ericsson model and COST 231 Walfish-Ikegami model) in different receiver antenna heights in urban, suburban and rural environments in NLOS condition. Our main concentration in this paper is to find out a suitable model for different environments to provide guidelines for cell planning of GSM Network at cellular frequency of 900 MHz.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115501087","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398097
A. Adamuthe, R. Bichkar
Personnel scheduling problem is combinatorial optimization problem which belongs to category of NP hard problems. This study presents a tabu search to laboratory personnel scheduling problem, assigning tasks to employees by satisfying organizational, personal and work regulation constraints. The main objective of this paper is to search for better solutions for given instance of laboratory personnel scheduling problem. Tabu search shows better results than genetic algorithmic approaches and backtracking approaches reported in literature. To further compare the performance of tabu search with genetic algorithmic approach, we have used ten instances created with our data generator. For simple data instances tabu search is found to be better than GA.
{"title":"Tabu search for solving personnel scheduling problem","authors":"A. Adamuthe, R. Bichkar","doi":"10.1109/ICCICT.2012.6398097","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398097","url":null,"abstract":"Personnel scheduling problem is combinatorial optimization problem which belongs to category of NP hard problems. This study presents a tabu search to laboratory personnel scheduling problem, assigning tasks to employees by satisfying organizational, personal and work regulation constraints. The main objective of this paper is to search for better solutions for given instance of laboratory personnel scheduling problem. Tabu search shows better results than genetic algorithmic approaches and backtracking approaches reported in literature. To further compare the performance of tabu search with genetic algorithmic approach, we have used ten instances created with our data generator. For simple data instances tabu search is found to be better than GA.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130379132","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398168
P. K. Gupta, R. Vaghela, K. Bhatt, S. Valdiya
The advance communication satellites, having narrow spot beams, require an automatic antenna pointing mechanism to maintain the spot beam coverage over the specified area. The monopulse tracking system is a popular choice, where the required tracking accuracy is better than 1/10th of antenna beam width. The two-channel monopulse tracking receiver is an essential subsystem of two-channel monopulse tracking system. The receiver is realized using coherent detection technique for better noise performance. The phase lock loop (PLL), and automatic gain control (AGC) loop are the two major building blocks of the receiver. The receiver has been developed and tested with the tracking chain of GSAT-4 satellite. This paper presents specifications, design, implementation issues and performance of the receiver.
{"title":"Two-channel monopulse tracking receiver for onboard antenna tracking system","authors":"P. K. Gupta, R. Vaghela, K. Bhatt, S. Valdiya","doi":"10.1109/ICCICT.2012.6398168","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398168","url":null,"abstract":"The advance communication satellites, having narrow spot beams, require an automatic antenna pointing mechanism to maintain the spot beam coverage over the specified area. The monopulse tracking system is a popular choice, where the required tracking accuracy is better than 1/10th of antenna beam width. The two-channel monopulse tracking receiver is an essential subsystem of two-channel monopulse tracking system. The receiver is realized using coherent detection technique for better noise performance. The phase lock loop (PLL), and automatic gain control (AGC) loop are the two major building blocks of the receiver. The receiver has been developed and tested with the tracking chain of GSAT-4 satellite. This paper presents specifications, design, implementation issues and performance of the receiver.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130878741","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398111
T. Dhope, D. Simunic
The complexity of wireless system requires a careful design, especially related to bandwidth and energy efficiency. The energy efficiency is getting more and more on importance, due to increasing penetration of various wireless systems in different battery-oriented applications, as well as due to the more conscious global view on the need for “greening the Earth”. Bandwidth efficiency is very important parameter, because it relates to frequency spectrum, which is naturally limited resource. The cognitive radio has been proposed as the future technology to meet the ever increasing demand of the radio spectrum by allocating the spectrum dynamically to allow unlicensed access on non-interfering basis. Cooperative spectrum sensing has been proposed to combat the multipath fading, shadowing and receiver uncertainty problem improving the detection performance by exploiting spatial diversity but at the cost of increase in cooperation overhead such as extra sensing time, delay, energy and operations devoted to cooperative sensing. Cluster based cooperative sensing can improve the performance and reduce the computational cost. In recent years, many methods of cooperative spectrum sensing have been proposed based on the clustering technique. In this paper, we provide an extensive review of cluster-based cooperative spectrum sensing.
{"title":"Cluster based cooperative sensing:-A survey","authors":"T. Dhope, D. Simunic","doi":"10.1109/ICCICT.2012.6398111","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398111","url":null,"abstract":"The complexity of wireless system requires a careful design, especially related to bandwidth and energy efficiency. The energy efficiency is getting more and more on importance, due to increasing penetration of various wireless systems in different battery-oriented applications, as well as due to the more conscious global view on the need for “greening the Earth”. Bandwidth efficiency is very important parameter, because it relates to frequency spectrum, which is naturally limited resource. The cognitive radio has been proposed as the future technology to meet the ever increasing demand of the radio spectrum by allocating the spectrum dynamically to allow unlicensed access on non-interfering basis. Cooperative spectrum sensing has been proposed to combat the multipath fading, shadowing and receiver uncertainty problem improving the detection performance by exploiting spatial diversity but at the cost of increase in cooperation overhead such as extra sensing time, delay, energy and operations devoted to cooperative sensing. Cluster based cooperative sensing can improve the performance and reduce the computational cost. In recent years, many methods of cooperative spectrum sensing have been proposed based on the clustering technique. In this paper, we provide an extensive review of cluster-based cooperative spectrum sensing.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129357643","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398114
A. Tripathy, Nilakshi Joshi, Steffy Thomas, Shweta U. Shetty, Namitha Thomas
The World Wide Web plays an important role while searching for information in the data network. Users are constantly exposed to an ever-growing flood of information. A wrapper is an application which helps in searching for Search Results Records (SSR) from multiple search engines. This helps in making the search more efficient and reliable. VEDD wrapper extracts the relevant SRRs from three search engines by filtering out the noisy and redundant records. Finally the unique set of records is displayed in a common VEDD search result page. The extraction is performed using the concepts of Document Object Model (DOM) tree. The paper presents a series of data filters to detect and remove irrelevant data from the web page. The data filters will also be used to further improve the similarity check of data records. Also, visual cues from the underlying browser rendering engine is made use to locate and extract the relevant data region from the deep web by the keyword matching technique.
{"title":"VEDD- a visual wrapper for extraction of data using DOM tree","authors":"A. Tripathy, Nilakshi Joshi, Steffy Thomas, Shweta U. Shetty, Namitha Thomas","doi":"10.1109/ICCICT.2012.6398114","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398114","url":null,"abstract":"The World Wide Web plays an important role while searching for information in the data network. Users are constantly exposed to an ever-growing flood of information. A wrapper is an application which helps in searching for Search Results Records (SSR) from multiple search engines. This helps in making the search more efficient and reliable. VEDD wrapper extracts the relevant SRRs from three search engines by filtering out the noisy and redundant records. Finally the unique set of records is displayed in a common VEDD search result page. The extraction is performed using the concepts of Document Object Model (DOM) tree. The paper presents a series of data filters to detect and remove irrelevant data from the web page. The data filters will also be used to further improve the similarity check of data records. Also, visual cues from the underlying browser rendering engine is made use to locate and extract the relevant data region from the deep web by the keyword matching technique.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122195100","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398212
A. Kaleem, A. I. Tamboli
Combination approaches provide flexible and versatile solution to improve adaptive filter performance. In this paper, mean square performance of an affine combination of two time varying (TV) LMS adaptive filters is studied. The purpose of this combination is to obtain TV LMS adaptive filter with fast convergence and small mean square error (MSE).Two practical schemes proposed in [1] are used for this case. Simulation results indicate that these schemes yield overall MSE that is less than the MSE of either filter. Moreover this combination is better than combination of two LMS adaptive filters.
{"title":"An affine combination of two time varying LMS adaptive filters","authors":"A. Kaleem, A. I. Tamboli","doi":"10.1109/ICCICT.2012.6398212","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398212","url":null,"abstract":"Combination approaches provide flexible and versatile solution to improve adaptive filter performance. In this paper, mean square performance of an affine combination of two time varying (TV) LMS adaptive filters is studied. The purpose of this combination is to obtain TV LMS adaptive filter with fast convergence and small mean square error (MSE).Two practical schemes proposed in [1] are used for this case. Simulation results indicate that these schemes yield overall MSE that is less than the MSE of either filter. Moreover this combination is better than combination of two LMS adaptive filters.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121427494","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398153
A. Deshmukh, D. Vivek, S. Darpan, K. Sagar, K. P. Ray
The broadband microstrip antenna is realized by cutting the slot of different shapes like U-slot, V-slot and pair of rectangular slots inside the patch. The slot is said to introduce a mode near the fundamental resonance frequency of the patch and realizes broadband response. By using thicker substrates in excess of 0.08λ0, the bandwidth of slot cut microstrip antenna is increased by feeding the patch using the simpler proximity feeding technique. In this paper, a half U-slot and rectangular slots cut proximity fed broadband rectangular microstrip antenna is proposed. The analysis to study the effects of slot on the broadband response of slot cut patch is presented. Through the analysis it was observed that the slot modifies the resonance frequencies of higher order modes of the patch and yields broadband response. The bandwidth of more than 550 MHz (>; 45%) is obtained. The antenna gives broadside radiation pattern with a gain more than 5 dBi over the operating bandwidth.
{"title":"Broadband proximity fed modified rectangular microstrip antenna","authors":"A. Deshmukh, D. Vivek, S. Darpan, K. Sagar, K. P. Ray","doi":"10.1109/ICCICT.2012.6398153","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398153","url":null,"abstract":"The broadband microstrip antenna is realized by cutting the slot of different shapes like U-slot, V-slot and pair of rectangular slots inside the patch. The slot is said to introduce a mode near the fundamental resonance frequency of the patch and realizes broadband response. By using thicker substrates in excess of 0.08λ0, the bandwidth of slot cut microstrip antenna is increased by feeding the patch using the simpler proximity feeding technique. In this paper, a half U-slot and rectangular slots cut proximity fed broadband rectangular microstrip antenna is proposed. The analysis to study the effects of slot on the broadband response of slot cut patch is presented. Through the analysis it was observed that the slot modifies the resonance frequencies of higher order modes of the patch and yields broadband response. The bandwidth of more than 550 MHz (>; 45%) is obtained. The antenna gives broadside radiation pattern with a gain more than 5 dBi over the operating bandwidth.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124436063","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398128
A. Tripathy, S. Raina, R. Mascarenhas, S. Pangotra, R. Rodrigues
This paper introduces a Web mining approach for automatically identifying and extracting new product ideas from internet blogs. There are a large amount of web logs for nearly each topic, where consumers present their needs for new products. These new product ideas are valuable to producers, researchers and developers because they can lead to a new product development process, a well-known task in marketing. However, the current approach towards extraction of these new product ideas involves employed analysts to process these blogs manually and extract the new product ideas. Here, presented is an automated approach towards the extraction of new product ideas through knowledge extraction and using scripting languages, which not only eliminates human error, but also speeds up the entire process of new product idea extraction. Thus, several product development solutions allow engineers, suppliers, business partners and even customers to collaborate throughout the entire product lifecycle via the Internet.
{"title":"Extracting new product ideas from consumer blogs","authors":"A. Tripathy, S. Raina, R. Mascarenhas, S. Pangotra, R. Rodrigues","doi":"10.1109/ICCICT.2012.6398128","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398128","url":null,"abstract":"This paper introduces a Web mining approach for automatically identifying and extracting new product ideas from internet blogs. There are a large amount of web logs for nearly each topic, where consumers present their needs for new products. These new product ideas are valuable to producers, researchers and developers because they can lead to a new product development process, a well-known task in marketing. However, the current approach towards extraction of these new product ideas involves employed analysts to process these blogs manually and extract the new product ideas. Here, presented is an automated approach towards the extraction of new product ideas through knowledge extraction and using scripting languages, which not only eliminates human error, but also speeds up the entire process of new product idea extraction. Thus, several product development solutions allow engineers, suppliers, business partners and even customers to collaborate throughout the entire product lifecycle via the Internet.","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134254232","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 : 2012-12-31DOI: 10.1109/ICCICT.2012.6398119
H. Chavan, S. Sane, H. B. Kekre
The Location Based Services (LBS) have changed the way mobile applications access and manage Mobile Database System (MDS). In LBS data is moved closer to applications to increase the effectiveness and independence. This trend leads to many interesting research problems in mobile database caching. In MDS caching is effective way to improve the performance. The desired caching can be achieved by convincingly accurate prediction of data items for the present and future query processing. It is important to take into consideration the location and movement direction of mobile clients while performing cache replacement. In this paper we propose a Markov Graph Cache Replacement Policy (MGCRP) for MDS. The MGCRP predicts the future client location by first/second order Markov Model. The access patterns generated using biclustering the database and will be prefetched to reduce the network traffic and user latencies. An expressive data structure, graph is used to find the location which is not in close proximity for cache replacement. If data related to Markov-Graph location is not part of cache then replacement is based on valid scope, access frequency, data distance and data size of data item. Simulation results for cache size and query interval show that the MGCRP performs significantly better than the existing Least Recent Used (LRU), Furthest Away Replacement (FAR), Prioritized Predicted Region based Cache Replacement Policy (PPRRP) and Markov Model based Cache Replacement Policy (MMCRP).
{"title":"A Markov-Graph Cache Replacement Policy for mobile environment","authors":"H. Chavan, S. Sane, H. B. Kekre","doi":"10.1109/ICCICT.2012.6398119","DOIUrl":"https://doi.org/10.1109/ICCICT.2012.6398119","url":null,"abstract":"The Location Based Services (LBS) have changed the way mobile applications access and manage Mobile Database System (MDS). In LBS data is moved closer to applications to increase the effectiveness and independence. This trend leads to many interesting research problems in mobile database caching. In MDS caching is effective way to improve the performance. The desired caching can be achieved by convincingly accurate prediction of data items for the present and future query processing. It is important to take into consideration the location and movement direction of mobile clients while performing cache replacement. In this paper we propose a Markov Graph Cache Replacement Policy (MGCRP) for MDS. The MGCRP predicts the future client location by first/second order Markov Model. The access patterns generated using biclustering the database and will be prefetched to reduce the network traffic and user latencies. An expressive data structure, graph is used to find the location which is not in close proximity for cache replacement. If data related to Markov-Graph location is not part of cache then replacement is based on valid scope, access frequency, data distance and data size of data item. Simulation results for cache size and query interval show that the MGCRP performs significantly better than the existing Least Recent Used (LRU), Furthest Away Replacement (FAR), Prioritized Predicted Region based Cache Replacement Policy (PPRRP) and Markov Model based Cache Replacement Policy (MMCRP).","PeriodicalId":319467,"journal":{"name":"2012 International Conference on Communication, Information & Computing Technology (ICCICT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133596357","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
扫码关注我们
求助内容：
应助结果提醒方式：