Pub Date : 2010-09-02DOI: 10.1109/ICEIE.2010.5559827
Meiling Zhuang, Xiaofeng Zhang, Jianan Fang
Functional dividing lines are designed according to the Gauss Curvature of each node on undeveloped triangled 3-D body surface. Robert Hooke Law and Young's Modulus are applied to set up energy model based on the edges change before and after each triangle is flattened. To improve the practicability for flattened surface is the emphasis. In combination with the energy model, the algorithm is designed and optimized to minimize the unused energy after the triangles being flattened. At last the graphics of flattened 2D planes along dividing lines and corresponding energy distributing are got. The flattened 2D planes with longitude and weft direction are more fitted for fabrics cutting which will be laid on it.
{"title":"The optimum flattening for undeveloped 3-D body surface based on energy","authors":"Meiling Zhuang, Xiaofeng Zhang, Jianan Fang","doi":"10.1109/ICEIE.2010.5559827","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559827","url":null,"abstract":"Functional dividing lines are designed according to the Gauss Curvature of each node on undeveloped triangled 3-D body surface. Robert Hooke Law and Young's Modulus are applied to set up energy model based on the edges change before and after each triangle is flattened. To improve the practicability for flattened surface is the emphasis. In combination with the energy model, the algorithm is designed and optimized to minimize the unused energy after the triangles being flattened. At last the graphics of flattened 2D planes along dividing lines and corresponding energy distributing are got. The flattened 2D planes with longitude and weft direction are more fitted for fabrics cutting which will be laid on it.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"478 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132652584","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 : 2010-09-02DOI: 10.1109/ICEIE.2010.5559858
Jia Wu, Z. Cai, Zhechao Gao
K-Nearest-Neighbor (KNN) as an important classification method based on closest training examples has been widely used in data mining due to its simplicity, effectiveness, and robustness. However, the class probability estimation, the neighborhood size and the type of distance function confronting KNN may affect its classification accuracy. Many researchers have been focused on improving the accuracy of KNN via distance weighted, attribute weighted, and dynamically selected methods et al. In this paper, we first reviewed some improved algorithms of KNN in three categories mentioned above. Then, we singled out an improved algorithm called dynamic k-nearest-neighbor with distance and attribute weighted, simply DKNDAW. In DKNDAW, we mixed dynamic selected, distance weighted and attribute weighted methods. We experimentally tested our new algorithm in Weka system, using the whole 36 standard UCI data sets which are downloaded from the main website of Weka. In our experiment, we compared it to KNN, WAKNN, KNNDW, KNNDAW, and DKNN. The experimental results show that DKNDAW significantly outperforms KNN, WAKNN, KNNDW, KNNDAW, and DKNN in terms of the classification accuracy.
{"title":"Dynamic K-Nearest-Neighbor with Distance and attribute weighted for classification","authors":"Jia Wu, Z. Cai, Zhechao Gao","doi":"10.1109/ICEIE.2010.5559858","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559858","url":null,"abstract":"K-Nearest-Neighbor (KNN) as an important classification method based on closest training examples has been widely used in data mining due to its simplicity, effectiveness, and robustness. However, the class probability estimation, the neighborhood size and the type of distance function confronting KNN may affect its classification accuracy. Many researchers have been focused on improving the accuracy of KNN via distance weighted, attribute weighted, and dynamically selected methods et al. In this paper, we first reviewed some improved algorithms of KNN in three categories mentioned above. Then, we singled out an improved algorithm called dynamic k-nearest-neighbor with distance and attribute weighted, simply DKNDAW. In DKNDAW, we mixed dynamic selected, distance weighted and attribute weighted methods. We experimentally tested our new algorithm in Weka system, using the whole 36 standard UCI data sets which are downloaded from the main website of Weka. In our experiment, we compared it to KNN, WAKNN, KNNDW, KNNDAW, and DKNN. The experimental results show that DKNDAW significantly outperforms KNN, WAKNN, KNNDW, KNNDAW, and DKNN in terms of the classification accuracy.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"26 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131860237","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 : 2010-09-02DOI: 10.1109/ICEIE.2010.5559796
F. Anifowose, A. Abdulraheem
This paper presents a hybrid model consisting of a fusion of Functional Networks and Type-2 Fuzzy Logic. The model capitalizes on the capability of Functional Networks, using its least square fitting algorithm, to reduce the dimensionality of the input data by selecting the most relevant variables for the prediction of porosity and permeability of oil and gas reservoirs. It also attempts to improve the performance of Type-2 Fuzzy Logic whose complexity is increased and performance degraded with increased dimensionality of input data. The Functional Networks block was used to select the dominant variables from six datasets. The dimensionally-reduced datasets were then divided into training and testing subsets using the stratified sampling approach. Hence, the Type-2 Fuzzy Logic block is trained and tested with the best and dimensionally-reduced variables from the input data. The results showed that the hybrid model performed better in terms of training and testing with higher correlation coefficients, lower root mean square errors and reduced execution times than the original Type-2 Fuzzy Logic system. This work has confirmed the possibility and bright prospect for more hybrid models with better performance indices.
{"title":"A fusion of Functional Networks and Type-2 Fuzzy Logic for the characterization of oil and gas reservoirs","authors":"F. Anifowose, A. Abdulraheem","doi":"10.1109/ICEIE.2010.5559796","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559796","url":null,"abstract":"This paper presents a hybrid model consisting of a fusion of Functional Networks and Type-2 Fuzzy Logic. The model capitalizes on the capability of Functional Networks, using its least square fitting algorithm, to reduce the dimensionality of the input data by selecting the most relevant variables for the prediction of porosity and permeability of oil and gas reservoirs. It also attempts to improve the performance of Type-2 Fuzzy Logic whose complexity is increased and performance degraded with increased dimensionality of input data. The Functional Networks block was used to select the dominant variables from six datasets. The dimensionally-reduced datasets were then divided into training and testing subsets using the stratified sampling approach. Hence, the Type-2 Fuzzy Logic block is trained and tested with the best and dimensionally-reduced variables from the input data. The results showed that the hybrid model performed better in terms of training and testing with higher correlation coefficients, lower root mean square errors and reduced execution times than the original Type-2 Fuzzy Logic system. This work has confirmed the possibility and bright prospect for more hybrid models with better performance indices.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134590406","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 : 2010-09-02DOI: 10.1109/ICEIE.2010.5559810
Feng Xu, Liang Zhou, H. Wen, Chen Huang, Qian Zhao
With iterative decoding, most LDPC codes have a weakness known as error floor. In this work, we propose a fixed bits LDPC decoding scheme to improve the ability of LDPC transmission. The method is universal as it can be applied to any code/channel model/decoding algorithm and it improves performance greatly, without losing the code regularity, without changing the decoding algorithm. Simulation results show that the error floor performance also can be significantly improved with this decoding scheme.
{"title":"A fixed bits LDPC decoder","authors":"Feng Xu, Liang Zhou, H. Wen, Chen Huang, Qian Zhao","doi":"10.1109/ICEIE.2010.5559810","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559810","url":null,"abstract":"With iterative decoding, most LDPC codes have a weakness known as error floor. In this work, we propose a fixed bits LDPC decoding scheme to improve the ability of LDPC transmission. The method is universal as it can be applied to any code/channel model/decoding algorithm and it improves performance greatly, without losing the code regularity, without changing the decoding algorithm. Simulation results show that the error floor performance also can be significantly improved with this decoding scheme.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133110000","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 : 2010-09-02DOI: 10.1109/ICEIE.2010.5559907
C. Pornpanomchai, Naret Chantharangsikul
Currently in the rubber factories employ many experts or scientists to grade the Ribbed Smoked Sheet (RSS). They grade the RSS by using their eyes and experience. The objective of this research is to build a computer system that can help rubber experts to grade the RSS. This system is called “Ribbed Smoked Sheet Grading System (RSSGS)”. The system consists of 4 main components, which are 1) Image Acquisition, 2) Image Preprocessing, 3) RSS Grading, and 4) Display of Result. In the image acquisition component, we use a digital camera to take an RSS image in a controlled environment box. In the image preprocessing component, we apply several image processing methods to prepare a suitable RSS image for a grading process. In the RSS grading component, we apply the k-Mean Clustering and the Euclidean Distance method to classify the RSS into five grades, which are RSS1, RSS2, RSS3 RSS4 and RSS5. In the Result Display component, we create a graphic user interface (GUI) for displaying results of the RSS grading. We test the system by using 398 RSS images for a training dataset and another 322 RSS images for an un-training dataset. The precision rates of our RSSGS are 80.90 percent for an untraining dataset. The average access time for the RSSGS is around 10.88 seconds per RSS image.
{"title":"Ribbed Smoked Sheet Grading System (RSSGS)","authors":"C. Pornpanomchai, Naret Chantharangsikul","doi":"10.1109/ICEIE.2010.5559907","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559907","url":null,"abstract":"Currently in the rubber factories employ many experts or scientists to grade the Ribbed Smoked Sheet (RSS). They grade the RSS by using their eyes and experience. The objective of this research is to build a computer system that can help rubber experts to grade the RSS. This system is called “Ribbed Smoked Sheet Grading System (RSSGS)”. The system consists of 4 main components, which are 1) Image Acquisition, 2) Image Preprocessing, 3) RSS Grading, and 4) Display of Result. In the image acquisition component, we use a digital camera to take an RSS image in a controlled environment box. In the image preprocessing component, we apply several image processing methods to prepare a suitable RSS image for a grading process. In the RSS grading component, we apply the k-Mean Clustering and the Euclidean Distance method to classify the RSS into five grades, which are RSS1, RSS2, RSS3 RSS4 and RSS5. In the Result Display component, we create a graphic user interface (GUI) for displaying results of the RSS grading. We test the system by using 398 RSS images for a training dataset and another 322 RSS images for an un-training dataset. The precision rates of our RSSGS are 80.90 percent for an untraining dataset. The average access time for the RSSGS is around 10.88 seconds per RSS image.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133789006","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 : 2010-09-02DOI: 10.1109/ICEIE.2010.5559815
K. Mishra, R. B. Mishra
Curriculum sequencing is one of the important activities in intelligent tutoring system. This paper presents learning strategy for study and a heuristic method for curriculum sequencing of courseware in intelligent tutoring system. The method has been deployed for the learning of C++. Student's performance in particular course ware for different types of content and questions concerned such as analytical, reasoning, descriptive, reasoning -descriptive, analytical -descriptive, analytical- reasoning and analytical- reasoning-descriptive questionnaire has been evaluated. Based on the performance of student decision has been made whether he has to proceed further or repeat the same course ware for learning.
{"title":"An intelligent tutoring system for C++","authors":"K. Mishra, R. B. Mishra","doi":"10.1109/ICEIE.2010.5559815","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559815","url":null,"abstract":"Curriculum sequencing is one of the important activities in intelligent tutoring system. This paper presents learning strategy for study and a heuristic method for curriculum sequencing of courseware in intelligent tutoring system. The method has been deployed for the learning of C++. Student's performance in particular course ware for different types of content and questions concerned such as analytical, reasoning, descriptive, reasoning -descriptive, analytical -descriptive, analytical- reasoning and analytical- reasoning-descriptive questionnaire has been evaluated. Based on the performance of student decision has been made whether he has to proceed further or repeat the same course ware for learning.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133958710","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 : 2010-09-02DOI: 10.1109/ICEIE.2010.5559773
Ran Wei, Hee Sun Kim, Xing Li, J. Im, Hyun Jeong Kim
Obstructive sleep apnea, the most common form of sleep apnea, is caused by upper airway partial or complete blockage. It has been implicated in the etiology of cardiovascular diseases. Many studies were performed that snoring, which occurs in at least 20% of the general population and 50% of the 50-year-old men, is recognized as the cardinal symptom of OSA. It is critical to prevent development of sleep apnea through control of snoring in early stage. In this study, a new mechanism was developed to detect the snoring sounds automatically and reduce snoring by inflation of air bladder inside the pillow. Clinical evaluation of developed mechanism was performed with the use of polysomnograph (PSG) at the sleep center in Korea. A volunteer was participated for clinical study to test the effectiveness of snore stopping function for one night, 190 minutes with the developed mechanism powered off and 172.5 minutes with the same developed mechanism powered on. In case of PSG results, sleep efficiency is reduced 8.5% for the second half of the sleep. Snoring statistics shows highly meaningful values with the use of developed mechanism. Snoring time was reduced about 63% with the use of developed mechanism. Number of snoring episode was increased 58.3%, however, it may not be directly related with the effectiveness of developed mechanism since the purpose of the pillow is not for reducing snoring episodes. Average snoring episode shows quite amount of decrement from 3.2 minutes to 0.5 minutes. Longest snoring episode was reduced about 95%, and it means that developed mechanism discontinued snoring successfully whenever it detects snoring sounds. The further study would be continued for more wide clinical studies with various inflation/deflation conditions of air bladder.
{"title":"A development of mechanism for reducing snoring","authors":"Ran Wei, Hee Sun Kim, Xing Li, J. Im, Hyun Jeong Kim","doi":"10.1109/ICEIE.2010.5559773","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559773","url":null,"abstract":"Obstructive sleep apnea, the most common form of sleep apnea, is caused by upper airway partial or complete blockage. It has been implicated in the etiology of cardiovascular diseases. Many studies were performed that snoring, which occurs in at least 20% of the general population and 50% of the 50-year-old men, is recognized as the cardinal symptom of OSA. It is critical to prevent development of sleep apnea through control of snoring in early stage. In this study, a new mechanism was developed to detect the snoring sounds automatically and reduce snoring by inflation of air bladder inside the pillow. Clinical evaluation of developed mechanism was performed with the use of polysomnograph (PSG) at the sleep center in Korea. A volunteer was participated for clinical study to test the effectiveness of snore stopping function for one night, 190 minutes with the developed mechanism powered off and 172.5 minutes with the same developed mechanism powered on. In case of PSG results, sleep efficiency is reduced 8.5% for the second half of the sleep. Snoring statistics shows highly meaningful values with the use of developed mechanism. Snoring time was reduced about 63% with the use of developed mechanism. Number of snoring episode was increased 58.3%, however, it may not be directly related with the effectiveness of developed mechanism since the purpose of the pillow is not for reducing snoring episodes. Average snoring episode shows quite amount of decrement from 3.2 minutes to 0.5 minutes. Longest snoring episode was reduced about 95%, and it means that developed mechanism discontinued snoring successfully whenever it detects snoring sounds. The further study would be continued for more wide clinical studies with various inflation/deflation conditions of air bladder.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132184946","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 : 2010-09-02DOI: 10.1109/ICEIE.2010.5559678
Mostafa Farshchi, Y. Y. Jusoh, Masrah Azrifah Azmi Murad
Measuring the development of an enterprise software project progress and performance is crucial to assure a project follow its path. This attention stems in parts from the frequent reports of high profile cases of mismanaged in IT projects particularly in enterprise level such as information technology strategic planning (ITSP) projects. Many project performance measurement models and frameworks have been proposed to address the problem, however, they are usually hard to manage and inefficient in practice due to the complexity, distribution and dynamism of these types of projects. A large and growing body of literature has shown the advantages of employing the agent technology in distributed, dynamic, and complex environments. Therefore, in this study the advantages of the agent technology will be applied to improve the progress and measurement process of the software project performance measurement approaches. In this paper, a multi-agent system architectural model with the focus in implementation phase of the ITSP projects is proposed to promote and facilitate the process of project performance measurement. Furthermore the prototype of the proposed solution is explained and the evaluation approach is discussed.
{"title":"Agent-based distributed performance measurement system for ITSP projects","authors":"Mostafa Farshchi, Y. Y. Jusoh, Masrah Azrifah Azmi Murad","doi":"10.1109/ICEIE.2010.5559678","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559678","url":null,"abstract":"Measuring the development of an enterprise software project progress and performance is crucial to assure a project follow its path. This attention stems in parts from the frequent reports of high profile cases of mismanaged in IT projects particularly in enterprise level such as information technology strategic planning (ITSP) projects. Many project performance measurement models and frameworks have been proposed to address the problem, however, they are usually hard to manage and inefficient in practice due to the complexity, distribution and dynamism of these types of projects. A large and growing body of literature has shown the advantages of employing the agent technology in distributed, dynamic, and complex environments. Therefore, in this study the advantages of the agent technology will be applied to improve the progress and measurement process of the software project performance measurement approaches. In this paper, a multi-agent system architectural model with the focus in implementation phase of the ITSP projects is proposed to promote and facilitate the process of project performance measurement. Furthermore the prototype of the proposed solution is explained and the evaluation approach is discussed.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132949647","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 : 2010-09-02DOI: 10.1109/ICEIE.2010.5559785
S. Jun
In biomedical brain imaging, several distinctive brain imaging modalities have been developed with each demonstrating particular strengths and weaknesses. Despite such recent developments in biomedical brain imaging, an essential question persists: How can multi-modalities be effectively integrated so that they complement each other without compromising their inherently beneficial qualities? Toward such an end, Bayesian frame represents a reasonable solution for even the most complicated problems since corresponding fusion is particularly straightforward. Accordingly, a Bayesian integrative strategy for MEG and EEG brain imaging modalities is proposed in this work. The corresponding effects of synergy as well as overall feasibility are examined through numerical simulations. In addition, spatiotemporal noise covariance incorporated into the fusion frame is discussed.
{"title":"MEG and EEG fusion in Bayesian frame","authors":"S. Jun","doi":"10.1109/ICEIE.2010.5559785","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559785","url":null,"abstract":"In biomedical brain imaging, several distinctive brain imaging modalities have been developed with each demonstrating particular strengths and weaknesses. Despite such recent developments in biomedical brain imaging, an essential question persists: How can multi-modalities be effectively integrated so that they complement each other without compromising their inherently beneficial qualities? Toward such an end, Bayesian frame represents a reasonable solution for even the most complicated problems since corresponding fusion is particularly straightforward. Accordingly, a Bayesian integrative strategy for MEG and EEG brain imaging modalities is proposed in this work. The corresponding effects of synergy as well as overall feasibility are examined through numerical simulations. In addition, spatiotemporal noise covariance incorporated into the fusion frame is discussed.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133130533","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 : 2010-09-02DOI: 10.1109/ICEIE.2010.5559795
Rashid Amin, Shehzad Ashraf ch, M. Akhtar, Aftab Khan
Mobile ad hoc network and peer-to-peer networks are most advancing and emerging research areas in the recent years. Both of these networks are based on the same phenomenon like self-configuration and self-organization. Although, peer-to-peer network was firstly designed for wired network but now a days it may be deployed over mobile ad hoc network. When P2P networks are deployed over ad hoc network, it faces different problems due to dynamic topology and limited resources like memory, bandwidth and battery life of mobile nodes. In mobile ad hoc network nodes are continuously moving in a certain direction so network topology is changing from time to time. Node mobility is an important issue in these networks. Most of the researchers used only one mobility model in evaluation of routing protocols in mobile peer-to-peer network. As mobility models plays an important role in evaluation of the performance of different protocols, so other mobility models should also be used. We consider two mobility models probabilistic random walk and freeway mobility model in this network and we also compare these results with already used random waypoint mobility model. We used an ad hoc routing protocol Ad hoc On Demand Distance Vector routing under a peer-to-peer network application to evaluate the performance under prescribed mobility model. The results have been validated using network simulator (NS-2) and this helped in choosing proper mobility model for specific environment.
{"title":"Analyzing performance of ad hoc network mobility models in a peer-to-peer network application over mobile ad hoc network","authors":"Rashid Amin, Shehzad Ashraf ch, M. Akhtar, Aftab Khan","doi":"10.1109/ICEIE.2010.5559795","DOIUrl":"https://doi.org/10.1109/ICEIE.2010.5559795","url":null,"abstract":"Mobile ad hoc network and peer-to-peer networks are most advancing and emerging research areas in the recent years. Both of these networks are based on the same phenomenon like self-configuration and self-organization. Although, peer-to-peer network was firstly designed for wired network but now a days it may be deployed over mobile ad hoc network. When P2P networks are deployed over ad hoc network, it faces different problems due to dynamic topology and limited resources like memory, bandwidth and battery life of mobile nodes. In mobile ad hoc network nodes are continuously moving in a certain direction so network topology is changing from time to time. Node mobility is an important issue in these networks. Most of the researchers used only one mobility model in evaluation of routing protocols in mobile peer-to-peer network. As mobility models plays an important role in evaluation of the performance of different protocols, so other mobility models should also be used. We consider two mobility models probabilistic random walk and freeway mobility model in this network and we also compare these results with already used random waypoint mobility model. We used an ad hoc routing protocol Ad hoc On Demand Distance Vector routing under a peer-to-peer network application to evaluate the performance under prescribed mobility model. The results have been validated using network simulator (NS-2) and this helped in choosing proper mobility model for specific environment.","PeriodicalId":211301,"journal":{"name":"2010 International Conference on Electronics and Information Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116510509","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
扫码关注我们
求助内容：
应助结果提醒方式：