{"title":"基于观察路径性能的manet集中式信誉系统","authors":"J. Konorski, K. Rydzewski","doi":"10.1109/WMNC.2015.42","DOIUrl":null,"url":null,"abstract":"A reputation system for MANETs is described that attempts to deduce nodal trustworthiness (forwarding behaviour) from observed end-to-end path performance. The trustworthiness deduction algorithm produces interval estimates and works well if node misbehaviour is not selective with respect to traversing paths. Nodal reputation levels are next calculated in the spirit of generous tit-for-tat so as to best reflect momentary nodal trustworthiness. High-reputed sources are favoured when forwarding transit packets (indirect reciprocity) and high-reputed paths are favoured by the multipath DSR. For a simplified network model and assuming the nodes are able to control their reputation levels with a view of a high source throughput, we find that high reputation may be costly to maintain. We examine an arising reputation game and conditions under which it produces a cooperation-stimulating Nash equilibrium.","PeriodicalId":240086,"journal":{"name":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Centralized Reputation System for MANETs Based on Observed Path Performance\",\"authors\":\"J. Konorski, K. Rydzewski\",\"doi\":\"10.1109/WMNC.2015.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A reputation system for MANETs is described that attempts to deduce nodal trustworthiness (forwarding behaviour) from observed end-to-end path performance. The trustworthiness deduction algorithm produces interval estimates and works well if node misbehaviour is not selective with respect to traversing paths. Nodal reputation levels are next calculated in the spirit of generous tit-for-tat so as to best reflect momentary nodal trustworthiness. High-reputed sources are favoured when forwarding transit packets (indirect reciprocity) and high-reputed paths are favoured by the multipath DSR. For a simplified network model and assuming the nodes are able to control their reputation levels with a view of a high source throughput, we find that high reputation may be costly to maintain. We examine an arising reputation game and conditions under which it produces a cooperation-stimulating Nash equilibrium.\",\"PeriodicalId\":240086,\"journal\":{\"name\":\"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WMNC.2015.42\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 8th IFIP Wireless and Mobile Networking Conference (WMNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WMNC.2015.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Centralized Reputation System for MANETs Based on Observed Path Performance
A reputation system for MANETs is described that attempts to deduce nodal trustworthiness (forwarding behaviour) from observed end-to-end path performance. The trustworthiness deduction algorithm produces interval estimates and works well if node misbehaviour is not selective with respect to traversing paths. Nodal reputation levels are next calculated in the spirit of generous tit-for-tat so as to best reflect momentary nodal trustworthiness. High-reputed sources are favoured when forwarding transit packets (indirect reciprocity) and high-reputed paths are favoured by the multipath DSR. For a simplified network model and assuming the nodes are able to control their reputation levels with a view of a high source throughput, we find that high reputation may be costly to maintain. We examine an arising reputation game and conditions under which it produces a cooperation-stimulating Nash equilibrium.