{"title":"Trust modeling for secure route discovery in mobile ad-hoc networks","authors":"G. Wadhwani, S. Khatri, S. K. Muttoo","doi":"10.1109/ICRITO.2017.8342457","DOIUrl":null,"url":null,"abstract":"Mobile ad-hoc network can be established without any predefined infrastructure and nodes in it communicate with each other in an arbitrary way. All the nodes are expected to have routing capabilities to facilitate communication in the network. The arbitrary movement of nodes and presence of compromised nodes renders the requirement of a route discovery method which can suggest a trustworthy route. In this paper a route discovery technique is suggested based on trust and hop count to find the most trustworthy and optimal path between a pair of communicating nodes. In the proposed method trust is calculated on the basis of direct observation and recommendations from other trustworthy nodes. The impact of recommendations on aggregated trust depends upon the number of interactions between recommender and recommended node. The nodes which are forwarding more number of packets with lesser delay are said to be trustworthy.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRITO.2017.8342457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Mobile ad-hoc network can be established without any predefined infrastructure and nodes in it communicate with each other in an arbitrary way. All the nodes are expected to have routing capabilities to facilitate communication in the network. The arbitrary movement of nodes and presence of compromised nodes renders the requirement of a route discovery method which can suggest a trustworthy route. In this paper a route discovery technique is suggested based on trust and hop count to find the most trustworthy and optimal path between a pair of communicating nodes. In the proposed method trust is calculated on the basis of direct observation and recommendations from other trustworthy nodes. The impact of recommendations on aggregated trust depends upon the number of interactions between recommender and recommended node. The nodes which are forwarding more number of packets with lesser delay are said to be trustworthy.