M. Hilal, S. H. Hanizan, S. M. Shahrizan, A. Wan Mahani
{"title":"利用S-MPRP算法增强MANET性能","authors":"M. Hilal, S. H. Hanizan, S. M. Shahrizan, A. Wan Mahani","doi":"10.1109/iccoins.2018.8510592","DOIUrl":null,"url":null,"abstract":"Mobile Ad-Hoc NETworks (MANET) designed specifically for WMNs. MANET plays an important role to find single the best path to a destination from various paths available using Ad-Hoc On Demand Distance Vector (AODV) routing protocol. However, when multiple nodes choose the same path, it will cause the path to be overload and deteriorating the overall performance of the network. Multipath Parallel Routing Protocol (MPRP) comes out to overcome this problem. The scope of this project is to study and discuss how MPRP and Coordinated Distributed Scheme (CDS) enhance the performance of WMNs. MPRP and CDS is combined to allow the selection of shortest path. The algorithm named Shortest Path Multipath Parallel Routing Protocol (S-MPRP). S-MPRP enhanced the performance of MPRP by allowing the selecting second best path when the best path is congested. Due to cost limitation, the simulation carried out using Network Simulation 2 (NS2) to compare the performance of WMNs between S-MPRP and AODV. Simple configurations have been done to configure the S-MPRP on the nodes. The simulation results shows S-MPRP helps WMNs produce a better result in terms of throughput, delay and normalized control overhead.","PeriodicalId":168165,"journal":{"name":"2018 4th International Conference on Computer and Information Sciences (ICCOINS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhancing MANET Performance Using S-MPRP Algorithm\",\"authors\":\"M. Hilal, S. H. Hanizan, S. M. Shahrizan, A. Wan Mahani\",\"doi\":\"10.1109/iccoins.2018.8510592\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile Ad-Hoc NETworks (MANET) designed specifically for WMNs. MANET plays an important role to find single the best path to a destination from various paths available using Ad-Hoc On Demand Distance Vector (AODV) routing protocol. However, when multiple nodes choose the same path, it will cause the path to be overload and deteriorating the overall performance of the network. Multipath Parallel Routing Protocol (MPRP) comes out to overcome this problem. The scope of this project is to study and discuss how MPRP and Coordinated Distributed Scheme (CDS) enhance the performance of WMNs. MPRP and CDS is combined to allow the selection of shortest path. The algorithm named Shortest Path Multipath Parallel Routing Protocol (S-MPRP). S-MPRP enhanced the performance of MPRP by allowing the selecting second best path when the best path is congested. Due to cost limitation, the simulation carried out using Network Simulation 2 (NS2) to compare the performance of WMNs between S-MPRP and AODV. Simple configurations have been done to configure the S-MPRP on the nodes. The simulation results shows S-MPRP helps WMNs produce a better result in terms of throughput, delay and normalized control overhead.\",\"PeriodicalId\":168165,\"journal\":{\"name\":\"2018 4th International Conference on Computer and Information Sciences (ICCOINS)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 4th International Conference on Computer and Information Sciences (ICCOINS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iccoins.2018.8510592\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 4th International Conference on Computer and Information Sciences (ICCOINS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccoins.2018.8510592","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enhancing MANET Performance Using S-MPRP Algorithm
Mobile Ad-Hoc NETworks (MANET) designed specifically for WMNs. MANET plays an important role to find single the best path to a destination from various paths available using Ad-Hoc On Demand Distance Vector (AODV) routing protocol. However, when multiple nodes choose the same path, it will cause the path to be overload and deteriorating the overall performance of the network. Multipath Parallel Routing Protocol (MPRP) comes out to overcome this problem. The scope of this project is to study and discuss how MPRP and Coordinated Distributed Scheme (CDS) enhance the performance of WMNs. MPRP and CDS is combined to allow the selection of shortest path. The algorithm named Shortest Path Multipath Parallel Routing Protocol (S-MPRP). S-MPRP enhanced the performance of MPRP by allowing the selecting second best path when the best path is congested. Due to cost limitation, the simulation carried out using Network Simulation 2 (NS2) to compare the performance of WMNs between S-MPRP and AODV. Simple configurations have been done to configure the S-MPRP on the nodes. The simulation results shows S-MPRP helps WMNs produce a better result in terms of throughput, delay and normalized control overhead.