Pub Date : 2009-12-01DOI: 10.1109/ICCIT.2009.5407166
Md. Omar Faruq, M. Rahman, M. Islam, M. Amin
In this paper, a simple scheme is presented to improve the performance of mobile cellular networks by using delay of voice end user (DOVE) to the new originating calls over handoff calls in a two-dimensional (2D) traffic model for finite number of users. Expressions for probability of forced termination of handoff calls and the blocking probability of new originating calls have been derived. From this study, it has been found that the probability of forced termination of handoff calls is significantly reduced due to the incorporation of the delay of voice end user compared to the case when no such delay of voice end user is used in the system.
{"title":"Capacity enhancement of limited user traffic of mobile cellular networks using DOVE technique","authors":"Md. Omar Faruq, M. Rahman, M. Islam, M. Amin","doi":"10.1109/ICCIT.2009.5407166","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407166","url":null,"abstract":"In this paper, a simple scheme is presented to improve the performance of mobile cellular networks by using delay of voice end user (DOVE) to the new originating calls over handoff calls in a two-dimensional (2D) traffic model for finite number of users. Expressions for probability of forced termination of handoff calls and the blocking probability of new originating calls have been derived. From this study, it has been found that the probability of forced termination of handoff calls is significantly reduced due to the incorporation of the delay of voice end user compared to the case when no such delay of voice end user is used in the system.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131199867","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407279
Nusrat S. Islam, M. Wasi-ur-Rahman
The Integrated Prepaid Water Meter System is a technology for prepaid billing of water along with sufficient monitoring of the water meter readings automatically from a remote place without any human intervention. This system promises fast and accurate billing of water as well as prevents any misuse of it. In this paper, a technique having adequate security support, for prepaid billing of water using Short Message Service (SMS) has been illustrated. Existing Global System for Mobile communications (GSM) networks have been used for sending and receiving SMS. A prototype of the system has been designed and developed for system exploration and experiment.
{"title":"An intelligent SMS-based remote Water Metering System","authors":"Nusrat S. Islam, M. Wasi-ur-Rahman","doi":"10.1109/ICCIT.2009.5407279","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407279","url":null,"abstract":"The Integrated Prepaid Water Meter System is a technology for prepaid billing of water along with sufficient monitoring of the water meter readings automatically from a remote place without any human intervention. This system promises fast and accurate billing of water as well as prevents any misuse of it. In this paper, a technique having adequate security support, for prepaid billing of water using Short Message Service (SMS) has been illustrated. Existing Global System for Mobile communications (GSM) networks have been used for sending and receiving SMS. A prototype of the system has been designed and developed for system exploration and experiment.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121283565","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407165
Md. Mohsin Ali, Md. Amjad Hossain, Md. Kowsar Hossain, G. M. Mashrur-E-Elahi, Md. Asadul Islam
This paper proposes a new approach for reducing average call delivery cost and location server's load of wireless mobile networks. It uses caches whose up-todate information is responsible for dropping these costs and these caches are updated not only during call arrival moment from the calling Mobile Hosts (MHs) but also during call receiving moment to those MHs. To achieve load balancing among replicated Home Location Registers (HLRs), hashing technique is also used and this load is also affected by up-to-date cache information. The analytical model and experimental results show that our proposed method prepares the cache with up-to-date information more frequently with the increase of average call arrival rate as well as average call receiving rate. This increases probability of finding MH's location as well as hit ratio of the cache. As a result, both the average call delivery cost and load on a particular HLR are minimized considerably than all other previous approaches.
{"title":"A new hashing and caching approach for reducing call delivery cost and location server's load in wireless mobile networks","authors":"Md. Mohsin Ali, Md. Amjad Hossain, Md. Kowsar Hossain, G. M. Mashrur-E-Elahi, Md. Asadul Islam","doi":"10.1109/ICCIT.2009.5407165","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407165","url":null,"abstract":"This paper proposes a new approach for reducing average call delivery cost and location server's load of wireless mobile networks. It uses caches whose up-todate information is responsible for dropping these costs and these caches are updated not only during call arrival moment from the calling Mobile Hosts (MHs) but also during call receiving moment to those MHs. To achieve load balancing among replicated Home Location Registers (HLRs), hashing technique is also used and this load is also affected by up-to-date cache information. The analytical model and experimental results show that our proposed method prepares the cache with up-to-date information more frequently with the increase of average call arrival rate as well as average call receiving rate. This increases probability of finding MH's location as well as hit ratio of the cache. As a result, both the average call delivery cost and load on a particular HLR are minimized considerably than all other previous approaches.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127285766","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407163
A. Roy, Md. Jweel Hossain, M. Islam
Markov Arrival Process (MAP) is the most widely used traffic model to analyze performance of a node of an asynchronous packet traffic. Recent literatures make transition between overload and underload states of a node without arrival but sometimes transition may take place from underload to overload with an arrival which deviates our analysis from the present literature of Markov Modulated Poisson Process (MMPP) traffic model. In this paper two different rates of packet ‘arrival’ and ‘non arrival’ is incorporated in state transition of underload to overload and a comparison is made with previous literatures.
{"title":"A modified MAP in performance evaluation of asynchronous packet traffic","authors":"A. Roy, Md. Jweel Hossain, M. Islam","doi":"10.1109/ICCIT.2009.5407163","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407163","url":null,"abstract":"Markov Arrival Process (MAP) is the most widely used traffic model to analyze performance of a node of an asynchronous packet traffic. Recent literatures make transition between overload and underload states of a node without arrival but sometimes transition may take place from underload to overload with an arrival which deviates our analysis from the present literature of Markov Modulated Poisson Process (MMPP) traffic model. In this paper two different rates of packet ‘arrival’ and ‘non arrival’ is incorporated in state transition of underload to overload and a comparison is made with previous literatures.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126311993","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407283
Mushlah Uddin Sarkar, M. Islam, M. Amin
Two-dimensional (2D) and three-dimensional (3D) steady state Markov chains are widely used to analyze the traffic performance of communications networks. When the characteristics of the network changes with time, such steady state Markov chain is unable to determine different probability states. Markov Modulated Poisson Process (MMPP) is a special case of Markov Arrival Process (MAP) where arrival rate depends on probability states. In this paper, a traffic model of micro-macro cellular network of time dependent traffic load is modeled and its probability states are evaluated using MMPP varying load condition of the network under different parts of observation time.
{"title":"Performance evaluation of time dependent micro macro cellular network using MMPP traffic","authors":"Mushlah Uddin Sarkar, M. Islam, M. Amin","doi":"10.1109/ICCIT.2009.5407283","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407283","url":null,"abstract":"Two-dimensional (2D) and three-dimensional (3D) steady state Markov chains are widely used to analyze the traffic performance of communications networks. When the characteristics of the network changes with time, such steady state Markov chain is unable to determine different probability states. Markov Modulated Poisson Process (MMPP) is a special case of Markov Arrival Process (MAP) where arrival rate depends on probability states. In this paper, a traffic model of micro-macro cellular network of time dependent traffic load is modeled and its probability states are evaluated using MMPP varying load condition of the network under different parts of observation time.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128623992","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407281
Zahra Madani, N. Nematbakhsh
Several methods and languages have been developed to describe computer system specifications and some of them have been deployed to validate and verify the functionality of the system. No one method is equally appropriate for all application domains. Service Oriented Architecture and using web services is a wide growing domain of applications in software engineering these days, so to achieve more goals and benefits in large business works, we need to compose the existing web services from different organizations. In this paper we discuss about web service composition mechanisms and related formal methods and verification issues. One of the solutions in highest level is to use Web Service Choreography Definition Language (WS-CDL) to design the composition of services. With regard to this, we need to get sure about the correctness of choreography behavior, before to employ it for developing and executing services collaboration. In this paper we present a method using first order logic notation based on the partial-order planning problems. This method can be used for interactive systems that all participants have a common understanding of interaction rules. This method will be able to model variable specification of the system. It is consist of three parts included precondition, action and effect, so has a simple structure to understand. In this method we can check the properties of the model for reachability of ideal and safe states. We show the method in a web service interaction case study and verify it in Prolog tool.
{"title":"A logical formal model for verification of Web Service Choreography","authors":"Zahra Madani, N. Nematbakhsh","doi":"10.1109/ICCIT.2009.5407281","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407281","url":null,"abstract":"Several methods and languages have been developed to describe computer system specifications and some of them have been deployed to validate and verify the functionality of the system. No one method is equally appropriate for all application domains. Service Oriented Architecture and using web services is a wide growing domain of applications in software engineering these days, so to achieve more goals and benefits in large business works, we need to compose the existing web services from different organizations. In this paper we discuss about web service composition mechanisms and related formal methods and verification issues. One of the solutions in highest level is to use Web Service Choreography Definition Language (WS-CDL) to design the composition of services. With regard to this, we need to get sure about the correctness of choreography behavior, before to employ it for developing and executing services collaboration. In this paper we present a method using first order logic notation based on the partial-order planning problems. This method can be used for interactive systems that all participants have a common understanding of interaction rules. This method will be able to model variable specification of the system. It is consist of three parts included precondition, action and effect, so has a simple structure to understand. In this method we can check the properties of the model for reachability of ideal and safe states. We show the method in a web service interaction case study and verify it in Prolog tool.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133654260","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407172
M. Rahman, M. Akbar, Mohammad Shafiul Alam
Due to the growing application of peer-to-peer computing, the distributed applications are continuously spreading over extensive number of nodes. To cope with this large number of participants, various cluster based hierarchical solutions have been proposed. Cluster based algorithms are scalable by nature. Several of them are quorum based solutions. All of these solutions exploit the idea of coordinator/leader of cluster. Thus, fault tolerance of these algorithms is low. If any coordinator fails, election of new one is required. Here we propose a two-layer hierarchical cluster based solution where no coordinator is used. We simulate our proposed algorithm and show that it outperforms related ME algorithms.
{"title":"A two-layer hierarchical permission based mutual exclusion algorithm","authors":"M. Rahman, M. Akbar, Mohammad Shafiul Alam","doi":"10.1109/ICCIT.2009.5407172","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407172","url":null,"abstract":"Due to the growing application of peer-to-peer computing, the distributed applications are continuously spreading over extensive number of nodes. To cope with this large number of participants, various cluster based hierarchical solutions have been proposed. Cluster based algorithms are scalable by nature. Several of them are quorum based solutions. All of these solutions exploit the idea of coordinator/leader of cluster. Thus, fault tolerance of these algorithms is low. If any coordinator fails, election of new one is required. Here we propose a two-layer hierarchical cluster based solution where no coordinator is used. We simulate our proposed algorithm and show that it outperforms related ME algorithms.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115418848","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407322
Nusrat Sultana, M. A. J. B. Bakkre, M. Islam, M. Amin
In a mobile cellular network, both new originating calls and handoff calls can be dropped at any time in the midst of a conversation when a user enters in a dead spot. Because of this, there is always some discrepancy between traffic originated by the mobile station (MS) and that of received by the base station (BS). A probability model is used in this paper to evaluate this discrepancy considering geometry of the service area and probability density function of user distribution. Blocking probability experienced by the BS is found less than that of evaluated from the offered traffic of user end, which is the central idea of this paper. Furthermore, the same traffic model is applied to an ad- hoc two hop relay mobile cellular system for performance evaluation.
{"title":"Performance evaluation of a mobile cellular network with two hop ad-hoc relaying","authors":"Nusrat Sultana, M. A. J. B. Bakkre, M. Islam, M. Amin","doi":"10.1109/ICCIT.2009.5407322","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407322","url":null,"abstract":"In a mobile cellular network, both new originating calls and handoff calls can be dropped at any time in the midst of a conversation when a user enters in a dead spot. Because of this, there is always some discrepancy between traffic originated by the mobile station (MS) and that of received by the base station (BS). A probability model is used in this paper to evaluate this discrepancy considering geometry of the service area and probability density function of user distribution. Blocking probability experienced by the BS is found less than that of evaluated from the offered traffic of user end, which is the central idea of this paper. Furthermore, the same traffic model is applied to an ad- hoc two hop relay mobile cellular system for performance evaluation.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115448493","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 : 2009-12-01DOI: 10.1504/IJAISC.2010.038636
Mozammel H. A. Khan
In ordinary statistical methods, multiple outliers in least-squares regression model are detected sequentially one after another, where smearing and masking effects give misleading results. If the potential multiple outliers can be detected simultaneously, smearing and masking effects can be avoided. Such multiple-case outlier detection is of combinatorial nature and 2N -1 sets of possible outliers need to be tested, where N is the number of data points. This exhaustive search is practically impossible. In this paper, we have used quantum-inspired evolutionary algorithm (QEA) for multiple-case outlier detection in least-squares regression model. An information criterion based fitness function incorporating extra penalty for number of potential outliers has been used for identifying the most appropriate set of potential outliers. Experimental results with four datasets from statistical literature show that the QEA effectively detects the most appropriate set of outliers.
{"title":"Multiple-case outlier detection in least-squares regression model using quantum-inspired evolutionary algorithm","authors":"Mozammel H. A. Khan","doi":"10.1504/IJAISC.2010.038636","DOIUrl":"https://doi.org/10.1504/IJAISC.2010.038636","url":null,"abstract":"In ordinary statistical methods, multiple outliers in least-squares regression model are detected sequentially one after another, where smearing and masking effects give misleading results. If the potential multiple outliers can be detected simultaneously, smearing and masking effects can be avoided. Such multiple-case outlier detection is of combinatorial nature and 2N -1 sets of possible outliers need to be tested, where N is the number of data points. This exhaustive search is practically impossible. In this paper, we have used quantum-inspired evolutionary algorithm (QEA) for multiple-case outlier detection in least-squares regression model. An information criterion based fitness function incorporating extra penalty for number of potential outliers has been used for identifying the most appropriate set of potential outliers. Experimental results with four datasets from statistical literature show that the QEA effectively detects the most appropriate set of outliers.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123956650","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 : 2009-12-01DOI: 10.1109/ICCIT.2009.5407304
Subrata Kumar Dey, Mohammad Noor Nabi, M. Anwer
In this technology mediated world, e-Commerce is becoming more and more powerful medium for doing business, globally. Existing security technologies are proven to protect online transaction and fund transfer. However, while transacting with global e-merchants, trustworthiness of secure fund transfer and delivery of products/services are affected, and they could not leverage the potential benefit of e-Commerce. In this paper, the authors firstly overview the current state-of-threat by surveying was people's perception about trust in e-Commerce in developing countries like Bangladesh and argue that the security requirements of e-Commerce service generally go beyond the more traditional requirements of network security. The result analysis shows that, challenges in building trust for Business-to-Consumer (B2C) e-Commerce venture (local/international) is the major concern. The authors propose an e-Commerce enabled model for secure electronic fund transfer, and discuss ways to mitigate challenges in building trust in B2C.
{"title":"Challenges in building trust in B2C e-Commerce and proposal to mitigate them: developing countries perspective","authors":"Subrata Kumar Dey, Mohammad Noor Nabi, M. Anwer","doi":"10.1109/ICCIT.2009.5407304","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407304","url":null,"abstract":"In this technology mediated world, e-Commerce is becoming more and more powerful medium for doing business, globally. Existing security technologies are proven to protect online transaction and fund transfer. However, while transacting with global e-merchants, trustworthiness of secure fund transfer and delivery of products/services are affected, and they could not leverage the potential benefit of e-Commerce. In this paper, the authors firstly overview the current state-of-threat by surveying was people's perception about trust in e-Commerce in developing countries like Bangladesh and argue that the security requirements of e-Commerce service generally go beyond the more traditional requirements of network security. The result analysis shows that, challenges in building trust for Business-to-Consumer (B2C) e-Commerce venture (local/international) is the major concern. The authors propose an e-Commerce enabled model for secure electronic fund transfer, and discuss ways to mitigate challenges in building trust in B2C.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122641985","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
扫码关注我们
求助内容：
应助结果提醒方式：