一种DTN路由机制设计方案

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI) Pub Date : 2016-10-01 DOI:10.1109/IIKI.2016.42

Zhi Lin, Shengling Wang, Chun-Chi Liu, Madiha Ikram

{"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}

引用次数: 4

摘要

DTN (Delay/Disruption Tolerant Network)中的路由处理网络分区和节点的可移动性。为了激励参与路由，创建了几种激励方案，其中之一是通过支付。假设预算有限，问题是如何根据付款制定路由计划。也就是说，发送方如何决定分配给一个特殊的下一跳的数据量及其支付方式。本文提出了一种机制设计方法来定义发送方和下一跳的效用函数，然后利用KKT (Karush-Kuhn-Tucker)条件工具求解一个带有一个不等式约束的非线性规划问题，使包括发送方和下一跳在内的所有参与者的效用函数最大化。指数

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A Mechanism Design Solution for DTN Routing

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)

自引率

0.00%

发文量