{"title":"一种DTN路由机制设计方案","authors":"Zhi Lin, Shengling Wang, Chun-Chi Liu, Madiha Ikram","doi":"10.1109/IIKI.2016.42","DOIUrl":null,"url":null,"abstract":"The routing in DTN (Delay/Disruption Tolerant Network) deals with network partition and the mobility of nodes. In order to motivate involvement in routing, several incentive schemes are created, one of them is by payment. Suppose the budget is limited, the question is how to make a routing plan based on payments. That is to say how a sender can decide the data amount assigned to one special next hop and the payment for it. This paper proposes a mechanism design approach to define the utility function of the sender and the next hops, then maximize the utility functions for all the participants, including the sender and next hops, using the tool of KKT (Karush-Kuhn-Tucker) conditions solving a nonlinear programming problem with one inequality constraint. Index","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Mechanism Design Solution for DTN Routing\",\"authors\":\"Zhi Lin, Shengling Wang, Chun-Chi Liu, Madiha Ikram\",\"doi\":\"10.1109/IIKI.2016.42\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The routing in DTN (Delay/Disruption Tolerant Network) deals with network partition and the mobility of nodes. In order to motivate involvement in routing, several incentive schemes are created, one of them is by payment. Suppose the budget is limited, the question is how to make a routing plan based on payments. That is to say how a sender can decide the data amount assigned to one special next hop and the payment for it. This paper proposes a mechanism design approach to define the utility function of the sender and the next hops, then maximize the utility functions for all the participants, including the sender and next hops, using the tool of KKT (Karush-Kuhn-Tucker) conditions solving a nonlinear programming problem with one inequality constraint. Index\",\"PeriodicalId\":371106,\"journal\":{\"name\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIKI.2016.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":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIKI.2016.42","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The routing in DTN (Delay/Disruption Tolerant Network) deals with network partition and the mobility of nodes. In order to motivate involvement in routing, several incentive schemes are created, one of them is by payment. Suppose the budget is limited, the question is how to make a routing plan based on payments. That is to say how a sender can decide the data amount assigned to one special next hop and the payment for it. This paper proposes a mechanism design approach to define the utility function of the sender and the next hops, then maximize the utility functions for all the participants, including the sender and next hops, using the tool of KKT (Karush-Kuhn-Tucker) conditions solving a nonlinear programming problem with one inequality constraint. Index
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
