{"title":"Enhancing Efficiency towards Handling Mobility Uncertainty in Mobile Ad-Hoc Network (MANET)","authors":"S. Roychoudhury, P. Dutta, B. Maiti","doi":"10.1109/ICIT.2008.45","DOIUrl":null,"url":null,"abstract":"In this article, we have concentrated on selecting there liable path from source to destination in a mobile ad-hoc net work (MANET) framework using Dempster-Shafer Theory (DST) of evidence. The belief and plausibility functions are used here for calculating the suitable path for sending data packet from source to destination selecting the proper neighborhood on the basis of radio range of the source node. The radio range is determined depending on the Proximity Index and birth rate and death rate of the neighborhood nodes of the source node.Whenever data packet is changing hops within source and destination some credit and penalty are introduced to the next and previous hops respectively. In the concluding section of the present article a measure of gain (in delay) has been introduced for comparison of the existing methods vis-a-vis that of the proposed one.","PeriodicalId":184201,"journal":{"name":"2008 International Conference on Information Technology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2008.45","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
In this article, we have concentrated on selecting there liable path from source to destination in a mobile ad-hoc net work (MANET) framework using Dempster-Shafer Theory (DST) of evidence. The belief and plausibility functions are used here for calculating the suitable path for sending data packet from source to destination selecting the proper neighborhood on the basis of radio range of the source node. The radio range is determined depending on the Proximity Index and birth rate and death rate of the neighborhood nodes of the source node.Whenever data packet is changing hops within source and destination some credit and penalty are introduced to the next and previous hops respectively. In the concluding section of the present article a measure of gain (in delay) has been introduced for comparison of the existing methods vis-a-vis that of the proposed one.