{"title":"使节点合作:ddn中消息转发的安全激励机制","authors":"Honglong Chen, W. Lou","doi":"10.1109/ICCCN.2013.6614150","DOIUrl":null,"url":null,"abstract":"In traditional Delay Tolerant Networks (DTNs), the nodes can take advantage of intermittent contact opportunities to forward messages. However, in noncooperative DTNs, the nodes may be selfish and reluctant to cooperate with each other in message forwarding. Therefore, it is necessary to motivate the nodes to cooperate with each other in such DTNs. The previously proposed incentive mechanisms have obvious limitations such as the security vulnerability. To resolve such kind of drawbacks, in this paper we propose two credit-based rewarding schemes, called earliest path singular rewarding scheme and earliest path cumulative rewarding scheme respectively, to ensure the nodes truthfully forward the messages. The proposed rewarding schemes are incentive compatible. They also ensure that the payment for each delivered message is upper bounded. Furthermore, the proposed rewarding schemes can prevent selfish nodes from having malicious behaviors. Simulations based on the real trace are conducted to illustrate the effectiveness of the proposed rewarding schemes.","PeriodicalId":207337,"journal":{"name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Making Nodes Cooperative: A Secure Incentive Mechanism for Message Forwarding in DTNs\",\"authors\":\"Honglong Chen, W. Lou\",\"doi\":\"10.1109/ICCCN.2013.6614150\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In traditional Delay Tolerant Networks (DTNs), the nodes can take advantage of intermittent contact opportunities to forward messages. However, in noncooperative DTNs, the nodes may be selfish and reluctant to cooperate with each other in message forwarding. Therefore, it is necessary to motivate the nodes to cooperate with each other in such DTNs. The previously proposed incentive mechanisms have obvious limitations such as the security vulnerability. To resolve such kind of drawbacks, in this paper we propose two credit-based rewarding schemes, called earliest path singular rewarding scheme and earliest path cumulative rewarding scheme respectively, to ensure the nodes truthfully forward the messages. The proposed rewarding schemes are incentive compatible. They also ensure that the payment for each delivered message is upper bounded. Furthermore, the proposed rewarding schemes can prevent selfish nodes from having malicious behaviors. Simulations based on the real trace are conducted to illustrate the effectiveness of the proposed rewarding schemes.\",\"PeriodicalId\":207337,\"journal\":{\"name\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 22nd International Conference on Computer Communication and Networks (ICCCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2013.6614150\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2013.6614150","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Making Nodes Cooperative: A Secure Incentive Mechanism for Message Forwarding in DTNs
In traditional Delay Tolerant Networks (DTNs), the nodes can take advantage of intermittent contact opportunities to forward messages. However, in noncooperative DTNs, the nodes may be selfish and reluctant to cooperate with each other in message forwarding. Therefore, it is necessary to motivate the nodes to cooperate with each other in such DTNs. The previously proposed incentive mechanisms have obvious limitations such as the security vulnerability. To resolve such kind of drawbacks, in this paper we propose two credit-based rewarding schemes, called earliest path singular rewarding scheme and earliest path cumulative rewarding scheme respectively, to ensure the nodes truthfully forward the messages. The proposed rewarding schemes are incentive compatible. They also ensure that the payment for each delivered message is upper bounded. Furthermore, the proposed rewarding schemes can prevent selfish nodes from having malicious behaviors. Simulations based on the real trace are conducted to illustrate the effectiveness of the proposed rewarding schemes.