Pub Date : 2014-12-01DOI: 10.1109/PDGC.2014.7030761
A. S. Sai Prasanna, Iyer Chandrashekaran Gurumurthy, D. H. R. Naidu, P. K. Baruah
The advent of ubiquitous mobile communication has posed a lot of challenges, one of the prominent being suppression of background noise, especially in non-stationary noisy environments. In literature, several speech enhancement techniques have been proposed to tackle this problem of noise reduction. Codebook-based speech enhancement (CBSE) employing trained speech and noise codebooks, is one of the most effective noise reduction technique for handling non-stationary noise. However, the high compute intensive nature of this technique renders it inapplicable in real-time speech enhancement scenarios by introducing a significant delay in speech transmission. In this paper, this problem is addressed by providing an efficient, parallel CBSE algorithm. The proposed parallel CBSE algorithm achieves significant speedup and reduced execution time, resulting in a speech transmission delay which is well within the limits of realizing real-time speech enhancement. The proposed parallel CBSE algorithm is then used as a basis to provide a novel cloud based framework to achieve real-time speech enhancement in mobile communication as a proof-of-concept. The proposed parallel implementation can also be used in a variety of applications which demand real-time speech enhancement such as teleconferencing systems, digital hearing aid devices and speech recognition systems.
{"title":"Real-time codebook-based speech enhancement with GPUs","authors":"A. S. Sai Prasanna, Iyer Chandrashekaran Gurumurthy, D. H. R. Naidu, P. K. Baruah","doi":"10.1109/PDGC.2014.7030761","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030761","url":null,"abstract":"The advent of ubiquitous mobile communication has posed a lot of challenges, one of the prominent being suppression of background noise, especially in non-stationary noisy environments. In literature, several speech enhancement techniques have been proposed to tackle this problem of noise reduction. Codebook-based speech enhancement (CBSE) employing trained speech and noise codebooks, is one of the most effective noise reduction technique for handling non-stationary noise. However, the high compute intensive nature of this technique renders it inapplicable in real-time speech enhancement scenarios by introducing a significant delay in speech transmission. In this paper, this problem is addressed by providing an efficient, parallel CBSE algorithm. The proposed parallel CBSE algorithm achieves significant speedup and reduced execution time, resulting in a speech transmission delay which is well within the limits of realizing real-time speech enhancement. The proposed parallel CBSE algorithm is then used as a basis to provide a novel cloud based framework to achieve real-time speech enhancement in mobile communication as a proof-of-concept. The proposed parallel implementation can also be used in a variety of applications which demand real-time speech enhancement such as teleconferencing systems, digital hearing aid devices and speech recognition systems.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126472467","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030756
Prashant K. Gupta, M. Madan, Kajal Puri, Abhishek Gulati
The industry that has been benefitted the most by the developments in VLSI technology is that of mobile phones. Modern day mobile handsets are referred to as smartphones and have reached to the hands of every person even in the remote corners of the world. Yet another revolutionary research was the development of the Android open source mobile OS which has made the mobile phones smarter. So, we decided to develop a mobile based examination system to reach the population even at the most remote areas. An Android driven examination system that we have designed and implemented is made with an intent to serve the education industry and provide efficient and reliable result along with powerful user interface. Our system aims at making the examination system a lot more convenient for the students as well as the faculty members and reducing the manual headache required in the traditional process. Google's Android is the most popular OS globally including India [2]. Android being so popular can be considered an OS that the masses have used in their smart phones; hence our system is designed considering the convenience of the faculty and the student taking the examination. Using the impeccable UI functionalities that have been provided using the Android Development Kit we have designed and implemented our system.
{"title":"Student oriented mobile based examination process","authors":"Prashant K. Gupta, M. Madan, Kajal Puri, Abhishek Gulati","doi":"10.1109/PDGC.2014.7030756","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030756","url":null,"abstract":"The industry that has been benefitted the most by the developments in VLSI technology is that of mobile phones. Modern day mobile handsets are referred to as smartphones and have reached to the hands of every person even in the remote corners of the world. Yet another revolutionary research was the development of the Android open source mobile OS which has made the mobile phones smarter. So, we decided to develop a mobile based examination system to reach the population even at the most remote areas. An Android driven examination system that we have designed and implemented is made with an intent to serve the education industry and provide efficient and reliable result along with powerful user interface. Our system aims at making the examination system a lot more convenient for the students as well as the faculty members and reducing the manual headache required in the traditional process. Google's Android is the most popular OS globally including India [2]. Android being so popular can be considered an OS that the masses have used in their smart phones; hence our system is designed considering the convenience of the faculty and the student taking the examination. Using the impeccable UI functionalities that have been provided using the Android Development Kit we have designed and implemented our system.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124461863","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030715
R. Vaid, V. Katiyar
Designing an energy efficient key management scheme to secure Wireless Sensor Networks is a challenging task because sensor nodes in the network are resource constrained. If an initial key is used in the network lifetime, a key stolen by an unauthorized node will results in data compromised that is generated in the network. So a re-keying is necessary after a specified number of rounds to avoid the side effect of stale key in the network. In clustering environment, a number of keys are needed for every sensor. If the role of sensor is cluster head, then one key is required to collect data from all cluster members. This key is shared between the cluster head sensor and all the sensors which are members of that cluster. The different key is required to transfer the aggregated data to base station this key is only shared between the sensor node which is cluster head and the base station. But if the role of cluster head is changed from one sensor to different sensor randomly, a new key will be require that is share between sensor node and new cluster head and also a new key will be required that is shared between this new cluster head and the base station. If the scheme is followed then re-keying after every round is a bottleneck of the network as more than one re-keying is require for every sensor. In this paper, we have presented a new virtual location based key management scheme (VLKM). This scheme used virtual location to generate a round key for every sensor. Simulation results show that proposed scheme performs better than other comparable schemes in the literature without increasing the communication overheads.
{"title":"VLKM: Virtual location-based key management scheme for Wireless Sensor Networks","authors":"R. Vaid, V. Katiyar","doi":"10.1109/PDGC.2014.7030715","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030715","url":null,"abstract":"Designing an energy efficient key management scheme to secure Wireless Sensor Networks is a challenging task because sensor nodes in the network are resource constrained. If an initial key is used in the network lifetime, a key stolen by an unauthorized node will results in data compromised that is generated in the network. So a re-keying is necessary after a specified number of rounds to avoid the side effect of stale key in the network. In clustering environment, a number of keys are needed for every sensor. If the role of sensor is cluster head, then one key is required to collect data from all cluster members. This key is shared between the cluster head sensor and all the sensors which are members of that cluster. The different key is required to transfer the aggregated data to base station this key is only shared between the sensor node which is cluster head and the base station. But if the role of cluster head is changed from one sensor to different sensor randomly, a new key will be require that is share between sensor node and new cluster head and also a new key will be required that is shared between this new cluster head and the base station. If the scheme is followed then re-keying after every round is a bottleneck of the network as more than one re-keying is require for every sensor. In this paper, we have presented a new virtual location based key management scheme (VLKM). This scheme used virtual location to generate a round key for every sensor. Simulation results show that proposed scheme performs better than other comparable schemes in the literature without increasing the communication overheads.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"51 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122422351","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030775
Faizul Navi Khan, K. Govil, A. Agarwal
A Distributed NetworkSystem (DNS) is a set of application and system programs, and data exchanges across a number of independent personal computers connected by a communication network. Task allocation in distributed network system is always a challenging task and also very helpful in order to enhance the performance of DNS. Although there are two types of approaches for task allocation and these are dynamic and static. Dynamic approach of task allocation is much appropriate manner and it also makes the best use of available computational power in DNS. Task allocation problem can be explained as `m' number tasks are required to execute on `n' number of processors where number tasks (m) is always greater than number of processors (n) (m>n). This research paper proposed a dynamic task allocation model to allocate the `m' number of tasks on `n' number of processors in distributed network system and execution completes in k number of phases. Proposed dynamic model will help to reduce the cost of task allocation. Phase wise execution cost, inter task communication cost, residing cost of each task on different processors, and reallocation cost for each task also have taken into the consideration to design a dynamic task allocation model.
{"title":"Performance enhancement of distributed network system by phase-wise dynamic task allocation","authors":"Faizul Navi Khan, K. Govil, A. Agarwal","doi":"10.1109/PDGC.2014.7030775","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030775","url":null,"abstract":"A Distributed NetworkSystem (DNS) is a set of application and system programs, and data exchanges across a number of independent personal computers connected by a communication network. Task allocation in distributed network system is always a challenging task and also very helpful in order to enhance the performance of DNS. Although there are two types of approaches for task allocation and these are dynamic and static. Dynamic approach of task allocation is much appropriate manner and it also makes the best use of available computational power in DNS. Task allocation problem can be explained as `m' number tasks are required to execute on `n' number of processors where number tasks (m) is always greater than number of processors (n) (m>n). This research paper proposed a dynamic task allocation model to allocate the `m' number of tasks on `n' number of processors in distributed network system and execution completes in k number of phases. Proposed dynamic model will help to reduce the cost of task allocation. Phase wise execution cost, inter task communication cost, residing cost of each task on different processors, and reallocation cost for each task also have taken into the consideration to design a dynamic task allocation model.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122772140","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030720
Tanya Garg, Y. Kumar
In the era of digital world, the computer networks are receiving multidimensional advancements. Due to these advancements more and more services are available for malicious exploitation. New vulnerabilities are found from common programs and even on vulnerability in a single computer might compromise the network of an entire company. There are two parallel ways to address this threat. The first way is to ensure that a computer doesn't have any known security vulnerabilities, before allowing it to the network it has access rights. The other way, is to use an Intrusion Detection System. IDSs concentrate on detecting malicious network traffic, such as packets that would exploit known security vulnerability. Generally the intrusions are detected by analyzing 41 attributes from the intrusion detection dataset. In this work we tried to reduce the number of attributes by using various ranking based feature selection techniques and evaluation has been done using ten classification algorithms that I have evaluated most important. So that the intrusions can be detected accurately in short period of time. Then the combinations of the six reduced feature sets have been made using Boolean AND operator. Then their performance has been analyzed using 10 classification algorithms. Finally the top ten combinations of feature selection have been evaluated among 1585 unique combinations. Combination of Symmetric and Gain Ratio while considering top 15 attributes has highest performance.
{"title":"Combinational feature selection approach for network intrusion detection system","authors":"Tanya Garg, Y. Kumar","doi":"10.1109/PDGC.2014.7030720","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030720","url":null,"abstract":"In the era of digital world, the computer networks are receiving multidimensional advancements. Due to these advancements more and more services are available for malicious exploitation. New vulnerabilities are found from common programs and even on vulnerability in a single computer might compromise the network of an entire company. There are two parallel ways to address this threat. The first way is to ensure that a computer doesn't have any known security vulnerabilities, before allowing it to the network it has access rights. The other way, is to use an Intrusion Detection System. IDSs concentrate on detecting malicious network traffic, such as packets that would exploit known security vulnerability. Generally the intrusions are detected by analyzing 41 attributes from the intrusion detection dataset. In this work we tried to reduce the number of attributes by using various ranking based feature selection techniques and evaluation has been done using ten classification algorithms that I have evaluated most important. So that the intrusions can be detected accurately in short period of time. Then the combinations of the six reduced feature sets have been made using Boolean AND operator. Then their performance has been analyzed using 10 classification algorithms. Finally the top ten combinations of feature selection have been evaluated among 1585 unique combinations. Combination of Symmetric and Gain Ratio while considering top 15 attributes has highest performance.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122814385","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030709
Anil Sharma, M. Sood
To gain the competitive advantage, valid and timely information is the key. Information is produced and consumed at a very fast rate in today's era. This is the impact of data integration technologies which has acknowledged an unpredictable growth in the last few years. For the reason that of technological advancement, data analysis systems and techniques are developed which get into the data and find the unseen information which further can be used as Business Intelligence (BI). BI systems and technologies help the business managers to come across the historical data to analyze and forecast the future trends based on it. BI systems and technologies are essentially designed in context to Data Warehouse because of the density in the decision making process which desires to analyze a huge historical data. BI can broadly be categorized into Business Reporting and Data Mining. This paper focuses on the first category i.e. Business Reports and the authors suggest the utilization of Materialized Views to generate fast and relevant business reports to formulate the Business Intelligence.
{"title":"Utilizing materialized views to formulate business intelligence","authors":"Anil Sharma, M. Sood","doi":"10.1109/PDGC.2014.7030709","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030709","url":null,"abstract":"To gain the competitive advantage, valid and timely information is the key. Information is produced and consumed at a very fast rate in today's era. This is the impact of data integration technologies which has acknowledged an unpredictable growth in the last few years. For the reason that of technological advancement, data analysis systems and techniques are developed which get into the data and find the unseen information which further can be used as Business Intelligence (BI). BI systems and technologies help the business managers to come across the historical data to analyze and forecast the future trends based on it. BI systems and technologies are essentially designed in context to Data Warehouse because of the density in the decision making process which desires to analyze a huge historical data. BI can broadly be categorized into Business Reporting and Data Mining. This paper focuses on the first category i.e. Business Reports and the authors suggest the utilization of Materialized Views to generate fast and relevant business reports to formulate the Business Intelligence.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115381418","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030788
Nishtha, M. Sood
Software Defined Network (SDN) is the latest network architecture in which the data and control planes do not reside on the same networking element. The control of packet forwarding in this architecture is taken out and is carried out by a programmable software component, the controller, whereas the forwarding elements are only used as packet moving devices that are driven by the controller. SDN architecture also provides Open APIs from both control and data planes. In order to provide communication between the controller and the forwarding hardware among many available protocols, OpenFlow (OF), is generally regarded as a standardized protocol for SDN. Open APIs for communication between the controller and applications enable development of network management applications easy. Therefore, SDN makes it possible to program the network thus provide numerous benefits. As a result, various vendors have developed SDN architectures. This paper summarizes as well as compares most of the common SDN architectures available till date.
{"title":"Software defined network — Architectures","authors":"Nishtha, M. Sood","doi":"10.1109/PDGC.2014.7030788","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030788","url":null,"abstract":"Software Defined Network (SDN) is the latest network architecture in which the data and control planes do not reside on the same networking element. The control of packet forwarding in this architecture is taken out and is carried out by a programmable software component, the controller, whereas the forwarding elements are only used as packet moving devices that are driven by the controller. SDN architecture also provides Open APIs from both control and data planes. In order to provide communication between the controller and the forwarding hardware among many available protocols, OpenFlow (OF), is generally regarded as a standardized protocol for SDN. Open APIs for communication between the controller and applications enable development of network management applications easy. Therefore, SDN makes it possible to program the network thus provide numerous benefits. As a result, various vendors have developed SDN architectures. This paper summarizes as well as compares most of the common SDN architectures available till date.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131389440","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030725
Vikas Kumar, S. Chaudhary
Ontology plays an important role not only for data processing in knowledge based systems but also, provide interoperability in heterogeneous environment and is a cornerstone of semantic web technology. The required technology is used for knowledge representation in OWL/RDF format and facilitate faster access of concepts in domain of interest. Development of ontology is a tedious job and requires a lot of man power in terms of experts' time and knowledge. Although there are various tools and techniques for light weight ontology learning; yet full automation of heavy weight ontology learning from text documents is a distant dream. In this paper we have proposed a framework for learning heavy weight ontology, using text documents written in English language. Initial experimental results are shown for demonstration of our on going research.
{"title":"Heavy weight ontology learning using text documents","authors":"Vikas Kumar, S. Chaudhary","doi":"10.1109/PDGC.2014.7030725","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030725","url":null,"abstract":"Ontology plays an important role not only for data processing in knowledge based systems but also, provide interoperability in heterogeneous environment and is a cornerstone of semantic web technology. The required technology is used for knowledge representation in OWL/RDF format and facilitate faster access of concepts in domain of interest. Development of ontology is a tedious job and requires a lot of man power in terms of experts' time and knowledge. Although there are various tools and techniques for light weight ontology learning; yet full automation of heavy weight ontology learning from text documents is a distant dream. In this paper we have proposed a framework for learning heavy weight ontology, using text documents written in English language. Initial experimental results are shown for demonstration of our on going research.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131124656","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030727
Deepika Dhiman, N. Sood
An autonomous collection of the mobile nodes communicating with each other with the help of wireless links either in a direct or indirect manner or rely on other mobile nodes is referred as MANET. The routing protocols in MANET are designed on the basis of the assumption that all the participating nodes co-operate with each other. Due to certain issues like open structure and limited energy supply, the nodes sometimes misbehave and act in a selfish manner. 2ACK scheme used as an add-on technique on few routing protocols (e.g. DSR) to detect such misbehaviour for mitigating their adverse effect. The major limitation of this 2ACK scheme is additional routing overhead due to authenticated 2ACK packets. Thus, this research work focuses on reducing the end-to-end delay and routing overhead by modifying the authentication mechanism in 2ACK scheme. The simulation results have been presented for evaluating the performance of the work done.
{"title":"Enhanced 2ACK scheme for reducing routing overhead in MANETs","authors":"Deepika Dhiman, N. Sood","doi":"10.1109/PDGC.2014.7030727","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030727","url":null,"abstract":"An autonomous collection of the mobile nodes communicating with each other with the help of wireless links either in a direct or indirect manner or rely on other mobile nodes is referred as MANET. The routing protocols in MANET are designed on the basis of the assumption that all the participating nodes co-operate with each other. Due to certain issues like open structure and limited energy supply, the nodes sometimes misbehave and act in a selfish manner. 2ACK scheme used as an add-on technique on few routing protocols (e.g. DSR) to detect such misbehaviour for mitigating their adverse effect. The major limitation of this 2ACK scheme is additional routing overhead due to authenticated 2ACK packets. Thus, this research work focuses on reducing the end-to-end delay and routing overhead by modifying the authentication mechanism in 2ACK scheme. The simulation results have been presented for evaluating the performance of the work done.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116088501","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 : 2014-12-01DOI: 10.1109/PDGC.2014.7030731
Anchal, P. Saini, C. Krishna
Mutual exclusion (Mutex) is a major coordination problem in distributed systems. To handle Mutex, the corresponding solutions are mainly classified into permission-based, token-based and quorum-based protocols. Mobile Ad-hoc Networks referred as MANETs introduce new obstacles for designing algorithms that help in solving distributed mutual exclusion problem. To our knowledge, few algorithms have been proposed in the literature which follows token-based or permission-based approach. In this paper, we propose an efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks. The significant motivation for our algorithm is to ensure that every node should transmit the lowest number of effective messages in the underlying network. Moreover, it will lead to reduced communication delay in order to retrieve the required permissions. We observed that the proposed algorithm outperforms the Mobile_RA algorithm in performance parameters such as synchronization delay, response time as well as message complexity. The results have been substantiated by simulation experiments.
{"title":"An efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks","authors":"Anchal, P. Saini, C. Krishna","doi":"10.1109/PDGC.2014.7030731","DOIUrl":"https://doi.org/10.1109/PDGC.2014.7030731","url":null,"abstract":"Mutual exclusion (Mutex) is a major coordination problem in distributed systems. To handle Mutex, the corresponding solutions are mainly classified into permission-based, token-based and quorum-based protocols. Mobile Ad-hoc Networks referred as MANETs introduce new obstacles for designing algorithms that help in solving distributed mutual exclusion problem. To our knowledge, few algorithms have been proposed in the literature which follows token-based or permission-based approach. In this paper, we propose an efficient permission-cum-cluster based distributed mutual exclusion algorithm for mobile adhoc networks. The significant motivation for our algorithm is to ensure that every node should transmit the lowest number of effective messages in the underlying network. Moreover, it will lead to reduced communication delay in order to retrieve the required permissions. We observed that the proposed algorithm outperforms the Mobile_RA algorithm in performance parameters such as synchronization delay, response time as well as message complexity. The results have been substantiated by simulation experiments.","PeriodicalId":311953,"journal":{"name":"2014 International Conference on Parallel, Distributed and Grid Computing","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124362152","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
扫码关注我们
求助内容：
应助结果提醒方式：