Pub Date : 2009-12-01DOI: 10.7763/IJCTE.2011.V3.383
Iffat Chowdhury, Jutheka Lahiry, S. Hasan
Applications like streaming audio, Internet telephony and multi-player online games prefer timeliness in packet delivery to reliability. TCP's reliability through packet retransmission and abrupt rate control features are unsuitable for these applications. As a result, these applications prefer UDP as the transport layer protocol. UDP does not have any congestion control mechanism which is vital for the overall stability of the Internet. For this reason, a new transport layer protocol Datagram Congestion Control Protocol (DCCP) has been introduced by the Internet Engineering Task Force (IETF). DCCP is suitable for these applications because of its exclusive characteristics. It can be useful for those applications which need a session and congestion control unlike UDP and do not need reliability or retransmission like TCP. However, since DCCP is a new protocol, its performance for these applications has to be analyzed thoroughly before it emerges as a de facto transport protocol for these applications. This paper describes the basic principle of DCCP, its congestion control mechanism and measures the performance of DCCP. The results show that DCCP provides better performance for those applications that suffers the tradeoff between delay and in-order delivery.
{"title":"Performance analysis of Datagram Congestion Control Protocol (DCCP)","authors":"Iffat Chowdhury, Jutheka Lahiry, S. Hasan","doi":"10.7763/IJCTE.2011.V3.383","DOIUrl":"https://doi.org/10.7763/IJCTE.2011.V3.383","url":null,"abstract":"Applications like streaming audio, Internet telephony and multi-player online games prefer timeliness in packet delivery to reliability. TCP's reliability through packet retransmission and abrupt rate control features are unsuitable for these applications. As a result, these applications prefer UDP as the transport layer protocol. UDP does not have any congestion control mechanism which is vital for the overall stability of the Internet. For this reason, a new transport layer protocol Datagram Congestion Control Protocol (DCCP) has been introduced by the Internet Engineering Task Force (IETF). DCCP is suitable for these applications because of its exclusive characteristics. It can be useful for those applications which need a session and congestion control unlike UDP and do not need reliability or retransmission like TCP. However, since DCCP is a new protocol, its performance for these applications has to be analyzed thoroughly before it emerges as a de facto transport protocol for these applications. This paper describes the basic principle of DCCP, its congestion control mechanism and measures the performance of DCCP. The results show that DCCP provides better performance for those applications that suffers the tradeoff between delay and in-order delivery.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"47 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":"132986283","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.5407321
Muhammad Sakibur Rahman, M. M. S. Kowsar
The importance of IEEE 802.16, Worldwide Interoperability for Microwave Access (WiMAX) is growing and will compete with technologies such as 3G. The acceptance and adoption of technologies also depend on security. Therefore, this article shows security vulnerabilities found in WiMAX and gives possible solutions to eliminate them. We find the initial network procedure is not effectively secured that makes man-in-the-middle attack possible. Focusing on this attack, we propose Diffie-Hellman (DH) key exchange protocol to enhance the security level during network initialization. We modify DH key exchange protocol to fit it into mobile WiMAX network as well as to eliminate existing weakness in original DH key exchange protocol. Finally we found that the proposed algorithm shows 2.5 times better performance in comparison with existing systems.
{"title":"WiMAX security analysis and enhancement","authors":"Muhammad Sakibur Rahman, M. M. S. Kowsar","doi":"10.1109/ICCIT.2009.5407321","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407321","url":null,"abstract":"The importance of IEEE 802.16, Worldwide Interoperability for Microwave Access (WiMAX) is growing and will compete with technologies such as 3G. The acceptance and adoption of technologies also depend on security. Therefore, this article shows security vulnerabilities found in WiMAX and gives possible solutions to eliminate them. We find the initial network procedure is not effectively secured that makes man-in-the-middle attack possible. Focusing on this attack, we propose Diffie-Hellman (DH) key exchange protocol to enhance the security level during network initialization. We modify DH key exchange protocol to fit it into mobile WiMAX network as well as to eliminate existing weakness in original DH key exchange protocol. Finally we found that the proposed algorithm shows 2.5 times better performance in comparison with existing systems.","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":"129236297","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.5407126
Md. Enamul Hoque Prince, G. Hossain, Ali Akbar Dewan, Pijush Debnath
Communication through mobile device is the most effective and fastest way that becomes a part of our daily life nowadays. Particularly, Short Message Service (SMS), is one of the most popular and relatively cheaper application of cell phone. In Bangladesh, there has been an enormous growth of mobile users and in this context, it is quite reasonable that people like to send SMS with their own language. Taking these challenges, a few initiatives were taken to introduce Bangla text in Mobile phones, more specifically, in messaging. But unfortunately, Bangla SMS is not popular yet in our country due to the presence of large number of characters and complex script. In fact, it is very much difficult to map Bangla characters efficiently on a mobile with 12 keys only. That's why, it motivated us to design an intelligent mobile keypad layout, which significantly reduces the number of keystrokes than existing methods, and remove difficulties of entering text. We eliminate traditional multi-tapping on a single button and introduce two key press technique, by arranging characters in two-dimensional matrix. Using this keypad the system becomes faster, reliable and flexible. Predictive text input method is also added in the system for further speeding up messaging. Moreover, our text-entry system ensures accessibility to visual impaired people by avoiding disambiguation caused by multi-tapping and introducing audio feedback for inserting each Bangla characters, which is not supported by existing systems. Finally, after analyzing the result on different sample SMS data, we showed that, our proposed keypad with the predictive input system reduces the number of key presses than the common Bangla keypad by 60.34%.
{"title":"An audible Bangla text-entry method in Mobile phones with intelligent keypad","authors":"Md. Enamul Hoque Prince, G. Hossain, Ali Akbar Dewan, Pijush Debnath","doi":"10.1109/ICCIT.2009.5407126","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407126","url":null,"abstract":"Communication through mobile device is the most effective and fastest way that becomes a part of our daily life nowadays. Particularly, Short Message Service (SMS), is one of the most popular and relatively cheaper application of cell phone. In Bangladesh, there has been an enormous growth of mobile users and in this context, it is quite reasonable that people like to send SMS with their own language. Taking these challenges, a few initiatives were taken to introduce Bangla text in Mobile phones, more specifically, in messaging. But unfortunately, Bangla SMS is not popular yet in our country due to the presence of large number of characters and complex script. In fact, it is very much difficult to map Bangla characters efficiently on a mobile with 12 keys only. That's why, it motivated us to design an intelligent mobile keypad layout, which significantly reduces the number of keystrokes than existing methods, and remove difficulties of entering text. We eliminate traditional multi-tapping on a single button and introduce two key press technique, by arranging characters in two-dimensional matrix. Using this keypad the system becomes faster, reliable and flexible. Predictive text input method is also added in the system for further speeding up messaging. Moreover, our text-entry system ensures accessibility to visual impaired people by avoiding disambiguation caused by multi-tapping and introducing audio feedback for inserting each Bangla characters, which is not supported by existing systems. Finally, after analyzing the result on different sample SMS data, we showed that, our proposed keypad with the predictive input system reduces the number of key presses than the common Bangla keypad by 60.34%.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"323 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113991316","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.5407310
A. Habib, Debashish Roy
Defending against DoS attacks is extremely difficult; effective solutions probably require significant changes to the Internet architecture. We present a series of architectural changes aimed at preventing most flooding DoS attacks, and making the remaining attacks easier to defend against. The goal is to stimulate a debate on tradeoffs between the flexibility needed for future Internet evolution and the need to be robust to defend attack.
{"title":"Steps to defend against DoS attacks","authors":"A. Habib, Debashish Roy","doi":"10.1109/ICCIT.2009.5407310","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407310","url":null,"abstract":"Defending against DoS attacks is extremely difficult; effective solutions probably require significant changes to the Internet architecture. We present a series of architectural changes aimed at preventing most flooding DoS attacks, and making the remaining attacks easier to defend against. The goal is to stimulate a debate on tradeoffs between the flexibility needed for future Internet evolution and the need to be robust to defend attack.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"261 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":"116607792","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.5407313
Md. Raihan Jamil, N. Ahmad
Online trading between businesses or individuals has employed attention of corporations worldwide as they are challenged to remain viable through difficult economic conditions. Despite the losses of so many businesses two years ago when the “dot-com bubble” burst, no serious business analyst disagrees that electronic commerce is steadily transforming how business is done, hence changing the business environment globally. Businesses everywhere need to understand if, when and how to use electronic commerce. The organizational factors, which are critical to the success of e-commerce, are investigated in this research. Different pieces of literature report different factors as key to success and generally based on subjective, perceptual data. A synthesis of existing literature is a basis for survey questions. The data is collected from Bangladesh e-commerce based organizations who are offering their goods & services on electronic channels, using postal questionnaires and Interview technique. The top factors found to be most critical for the success in e-commerce are: quick responsive products/services, organizational flexibility, services expansion, systems integration and enhanced customer service. An important lesson from this research is that organizations need to view the e-commerce initiative as a business critical area rather that just a technical issue. They need to give attention to internal integration, which may include channels, technology and business process integration, and improving the overall services to their customers.
{"title":"Present status and critical success factors of e-Commerce in Bangladesh","authors":"Md. Raihan Jamil, N. Ahmad","doi":"10.1109/ICCIT.2009.5407313","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407313","url":null,"abstract":"Online trading between businesses or individuals has employed attention of corporations worldwide as they are challenged to remain viable through difficult economic conditions. Despite the losses of so many businesses two years ago when the “dot-com bubble” burst, no serious business analyst disagrees that electronic commerce is steadily transforming how business is done, hence changing the business environment globally. Businesses everywhere need to understand if, when and how to use electronic commerce. The organizational factors, which are critical to the success of e-commerce, are investigated in this research. Different pieces of literature report different factors as key to success and generally based on subjective, perceptual data. A synthesis of existing literature is a basis for survey questions. The data is collected from Bangladesh e-commerce based organizations who are offering their goods & services on electronic channels, using postal questionnaires and Interview technique. The top factors found to be most critical for the success in e-commerce are: quick responsive products/services, organizational flexibility, services expansion, systems integration and enhanced customer service. An important lesson from this research is that organizations need to view the e-commerce initiative as a business critical area rather that just a technical issue. They need to give attention to internal integration, which may include channels, technology and business process integration, and improving the overall services to their customers.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"89 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":"126224425","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.5407142
Mozammel H. A. Khan, Raqibul Hasan
Reversible multiple-valued logic circuit has several advantages over reversible binary logic circuit. In this paper, we propose a method of minimization of Galois field sum of products (GFSOP) expression for non-reversible quinary logic function. We also propose a method of reversible realization of quinary GFSOP expression as cascade of quinary reversible gates. Experimental results show that a significant minimization can be achieved using the proposed minimization method.
{"title":"Minimized reversible synthesis of non-reversible quinary logic function","authors":"Mozammel H. A. Khan, Raqibul Hasan","doi":"10.1109/ICCIT.2009.5407142","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407142","url":null,"abstract":"Reversible multiple-valued logic circuit has several advantages over reversible binary logic circuit. In this paper, we propose a method of minimization of Galois field sum of products (GFSOP) expression for non-reversible quinary logic function. We also propose a method of reversible realization of quinary GFSOP expression as cascade of quinary reversible gates. Experimental results show that a significant minimization can be achieved using the proposed minimization method.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"32 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":"121813363","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.5407316
Md. Rakibul Haque, Reaz Ahmed
Searching with partial knowledge and misspelled keywords is a challenging problem in Peer-to-Peer networks. This paper presents FM-Chord, a novel searching mechanism for information retrieval with queries containing spelling and pronunciation mistakes in keywords using a widely-used structured overlay Chord. FM-Chord uses Double Metaphone encoding and 3-grams of keywords to reduce the effect of edit distance between the advertisement and query keywords. FM-Chord replicates advertisement to achieve fault tolerance to node failures. We evaluate the performance of our proposed mechanism in FM-Chord with necessary simulation results.
{"title":"FM-Chord: Fault-tolerant Chord supporting misspelled queries","authors":"Md. Rakibul Haque, Reaz Ahmed","doi":"10.1109/ICCIT.2009.5407316","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407316","url":null,"abstract":"Searching with partial knowledge and misspelled keywords is a challenging problem in Peer-to-Peer networks. This paper presents FM-Chord, a novel searching mechanism for information retrieval with queries containing spelling and pronunciation mistakes in keywords using a widely-used structured overlay Chord. FM-Chord uses Double Metaphone encoding and 3-grams of keywords to reduce the effect of edit distance between the advertisement and query keywords. FM-Chord replicates advertisement to achieve fault tolerance to node failures. We evaluate the performance of our proposed mechanism in FM-Chord with necessary simulation results.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"44 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":"116689940","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.5407127
H. M. I. Hassan, M. Hasan, Md. Fazle Elahi Khan, M. Shahjahan
Human walks, runs, dances and left behind interesting information on their actions. This paper presents how chaotic dynamics help to interpret and classify human actions. The trajectories of two legs are extracted during a motion such as walk. These trajectories of foot points are collected from an artificial human video arrangement. Each dimension of trajectory represents a time series. The phase space for each time series is reconstructed using appropriate time delay and dimension. The plot exhibited a characteristic trajectory representing the regularity of the time series. Analysis of time series obtained in human with three different motions revealed that the trajectory behaves in such a way that the time series is governed with a deterministic rule. Unique patterns are observed for a particular motion. This can be revealed from the phase space and self organizing map (SOM) network. The motions (walk, run, and jump) can be categorized in terms of different shape of phase space and output of the SOM network. The results are validated with correlation dimension. These representations are very useful in classifying the human motions.
{"title":"Extracting unique patterns from human actions","authors":"H. M. I. Hassan, M. Hasan, Md. Fazle Elahi Khan, M. Shahjahan","doi":"10.1109/ICCIT.2009.5407127","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407127","url":null,"abstract":"Human walks, runs, dances and left behind interesting information on their actions. This paper presents how chaotic dynamics help to interpret and classify human actions. The trajectories of two legs are extracted during a motion such as walk. These trajectories of foot points are collected from an artificial human video arrangement. Each dimension of trajectory represents a time series. The phase space for each time series is reconstructed using appropriate time delay and dimension. The plot exhibited a characteristic trajectory representing the regularity of the time series. Analysis of time series obtained in human with three different motions revealed that the trajectory behaves in such a way that the time series is governed with a deterministic rule. Unique patterns are observed for a particular motion. This can be revealed from the phase space and self organizing map (SOM) network. The motions (walk, run, and jump) can be categorized in terms of different shape of phase space and output of the SOM network. The results are validated with correlation dimension. These representations are very useful in classifying the human motions.","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":"129045911","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.5407259
M. Hasan
In Information Retrieval (IR), the similarity scores between a query and a set of documents are calculated, and the relevant documents are ranked based on their similarity scores. IR systems often consider queries as short documents containing only a few words in calculating document similarity score. In Computer Aided Assessment (CAA) of narrative answers, when model answers are available, the similarity score between Students' Answers and the respective Model Answer may be a good quality-indicator. With such an analogy in mind, we applied basic IR techniques in the context of automatic assessment and discussed our findings. In this paper, we explain the development of a web-based automatic assessment system that incorporates 5 different text analysis techniques for automatic assessment of narrative answers using vector space framework. We apply Uni-gram, Bi-gram, TF.IDF, Keyphrase Extraction, and Keyphrase with Synonym Resolution before representing model answers and students' answers as document vectors; and then we compute document similarity scores. The experimental results based on 30 narrative questions with 30 model answers, and 300 student's answers (from 10 students) show that the correlation of automatic assessment with human assessment is higher when advanced text processing techniques such as Keyphrase Extraction and Synonym Resolution are applied.
{"title":"Can Information Retrieval techniques automatic assessment challenges?","authors":"M. Hasan","doi":"10.1109/ICCIT.2009.5407259","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407259","url":null,"abstract":"In Information Retrieval (IR), the similarity scores between a query and a set of documents are calculated, and the relevant documents are ranked based on their similarity scores. IR systems often consider queries as short documents containing only a few words in calculating document similarity score. In Computer Aided Assessment (CAA) of narrative answers, when model answers are available, the similarity score between Students' Answers and the respective Model Answer may be a good quality-indicator. With such an analogy in mind, we applied basic IR techniques in the context of automatic assessment and discussed our findings. In this paper, we explain the development of a web-based automatic assessment system that incorporates 5 different text analysis techniques for automatic assessment of narrative answers using vector space framework. We apply Uni-gram, Bi-gram, TF.IDF, Keyphrase Extraction, and Keyphrase with Synonym Resolution before representing model answers and students' answers as document vectors; and then we compute document similarity scores. The experimental results based on 30 narrative questions with 30 model answers, and 300 student's answers (from 10 students) show that the correlation of automatic assessment with human assessment is higher when advanced text processing techniques such as Keyphrase Extraction and Synonym Resolution are applied.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"43 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":"114242285","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.5407159
Farzana Yasmeen, S. Urushidani, S. Yamada
Observably, participants in realistic scenarios repeatedly navigate specific locations based on routine behavior, leading to inherently structured movement patterns. In this paper we propose a delay-tolerant routing scheme, called Probabilistic Routing with Minimum Proximity (PRMP), which aims to utilize prior movement patterns of peers to predict future probability of forwarding messages to a location proximal to a destinations home address. A source considers next-hop forwarding based on a probabilistic benefit-metric; which takes into account a nodes frequented trajectories and current position, its spatial distance from a destinations stationary home location and the probability of any of its immediate trajectories minimizing the spatial distance to the destinations home. Delivering a message to a nodes' home address in the network is synonyms to delivering mail to an individual's designated mailbox. The protocol avoids flooding completely in efforts to optimize use of network resources. Simulations of PRMP reflect low buffer occupancy at both high and low loads in the network. It also maintains resource optimization in varying node densities compared to two prominent DTN flooding protocols - Epidemic and PRoPHET.
{"title":"A probabilistic position-based routing scheme for delay-tolerant networks","authors":"Farzana Yasmeen, S. Urushidani, S. Yamada","doi":"10.1109/ICCIT.2009.5407159","DOIUrl":"https://doi.org/10.1109/ICCIT.2009.5407159","url":null,"abstract":"Observably, participants in realistic scenarios repeatedly navigate specific locations based on routine behavior, leading to inherently structured movement patterns. In this paper we propose a delay-tolerant routing scheme, called Probabilistic Routing with Minimum Proximity (PRMP), which aims to utilize prior movement patterns of peers to predict future probability of forwarding messages to a location proximal to a destinations home address. A source considers next-hop forwarding based on a probabilistic benefit-metric; which takes into account a nodes frequented trajectories and current position, its spatial distance from a destinations stationary home location and the probability of any of its immediate trajectories minimizing the spatial distance to the destinations home. Delivering a message to a nodes' home address in the network is synonyms to delivering mail to an individual's designated mailbox. The protocol avoids flooding completely in efforts to optimize use of network resources. Simulations of PRMP reflect low buffer occupancy at both high and low loads in the network. It also maintains resource optimization in varying node densities compared to two prominent DTN flooding protocols - Epidemic and PRoPHET.","PeriodicalId":443258,"journal":{"name":"2009 12th International Conference on Computers and Information Technology","volume":"36 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":"125598536","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
扫码关注我们
求助内容：
应助结果提醒方式：