Congestion-Aware Incentive Scheme Based on Double Auction for DTN

Qingfeng Jiang; Chaoguang Men; Meijuan Jia; Xiaoxu Cheng

doi:10.11959/j.issn.1000-0801.2015027

您当前的位置：

首页 >

文章列表页 >

Congestion-Aware Incentive Scheme Based on Double Auction for DTN

research and development | 更新时间：2024-06-05

- Congestion-Aware Incentive Scheme Based on Double Auction for DTN
- Telecommunications Science Vol. 31, Issue 1, Pages: 15-22(2015)
- 作者机构：
  
  1. 哈尔滨工程大学计算机科学与技术学院哈尔滨 150001
  2. 大庆师范学院计算机科学与信息技术学院大庆 163712
- 作者简介：
- 基金信息：
- DOI：10.11959/j.issn.1000-0801.2015027
  CLC：
- Published Online：2015-01，
  
  Published：20 January 2015
- 稿件说明：
移动端阅览
Qingfeng Jiang, Chaoguang Men, Meijuan Jia, et al. Congestion-Aware Incentive Scheme Based on Double Auction for DTN[J]. Telecommunications science, 2015, 31(1): 15-22.
DOI：

Qingfeng Jiang, Chaoguang Men, Meijuan Jia, et al. Congestion-Aware Incentive Scheme Based on Double Auction for DTN[J]. Telecommunications science, 2015, 31(1): 15-22. DOI： 10.11959/j.issn.1000-0801.2015027.

摘要

为激励DTN自私节点在自身缓存有限时，有效地转发其他节点的消息，提出一种基于双向拍卖的拥塞感知激励策略。该策略中节点根据当前空闲缓存大小和消息接收速率确定自身拥塞程度，结合消息的传递概率和拥塞度并基于双向拍卖模型进行消息的买卖，从而实现节点间的合作。在真实数据集上进行仿真验证，结果表明由于进行了拥塞感知，该策略能够进一步激励自私节点进行合作转发，提高消息传递成功率，减小消息传递时延。

Abstract

To stimulate the DTN selfish nodes to cooperatively forward messages when the buffer was limited

a congestion-aware incentive scheme based on double auction for DTN was proposed. In the scheme

nodes determined the self congestion degree according to the current free buffer and message receiving rate. Combining the message delivery probability and congestion degree

nodes traded the message based on double auction model

thereby achieved the cooperation between nodes. Extensive simulations were carried out on real-world traces to evaluate the proposed scheme. The experimental results show that

due to the congestion aware

the incentive scheme can further stimulate selfish nodes to cooperatively forward messages

improve the message delivery ratio and reduce the message delivery delay.

关键词

Keywords

references

李向群，刘立祥，胡晓惠等 . 延迟/中断可容忍网络研究进展 . 计算机研究与发展， 2009 , 46 ( 8 ): 1270 ～ 1277

Li X Q , Liu L X , Hu X X , et al . Delay/disruption-tolerant network study . Journal of Computer Research and Development , 2009 , 46 ( 8 ): 1270 ～ 1277

Spyropoulos T , Psounis K , Raghavendra C S . Efficient routing in intermittently connected mobile networks: the single-copy case . IEEE/ACM Transactions on Networking , 2008 , 16 ( 1 ): 63 ～ 76

Dalyd E , Haahr M . Social network analysis for information flow in disconnected delay-tolerant MANETs . IEEE Transactions on Mobile Computing , 2009 , 8 ( 5 ): 1 ～ 16

Burgess J , Gallagher B , Jensen D , et al . MaxProp: routing for vehicle-based disruption-tolerant networks . Proceedings of the Conference on INFOCOM , Barcelona, Spain , 2006 : 1 ～ 11

Balasubramanian A , Levine B N , Venkataramani A . DTN routing as a resource allocation problem . Proceeding of ACM SIGCOMM , Kyoto, Japan , 2007 : 373 ～ 384

Karaliopoulos M . Assessing the vulnerability of DTN data relaying schemes to node selfishness . IEEE Communications Letters , 2009 , 13 ( 12 ): 923 ～ 925

Li Y , Su G L , Wu D O , et al . The impact of node selfishness on multicasting in delay tolerant networks . IEEE Transactions on Vehicular Technology , 2011 , 60 ( 5 ): 2224 ～ 2238

詹文杰，汪寿阳 . 评Smith奥秘与双向拍卖的研究进展 . 管理科学学报， 2003 , 6 ( 1 ): 1 ～ 12

Zhan W J , Wang S Y . et al . Review on the Smith's mystery and development of double auctions . Journal of Management Sciences in China , 2003 , 6 ( 1 ): 1 ～ 12

吴越，李建华，林闯 . 机会网络中的安全与信任技术研究进展 . 计算机研究与发展， 2013 ( 2 ): 278 ～ 290

Wu Y , Li J H , Lin C . Survey of security and trust in opportunistic networks . Journal of Computer Research and Development , 2013 ,( 2 ): 278 ～ 290 .

Shevade U , Song H H , Qiu L L , et al . Incentive-aware routing in DTNs . Proceedings of the 16th IEEE International Conference on Network Protocols（ICNP） , Orlando, USA , 2008 : 238 ～ 247

Mei A , Stefa J . Give2Get: forwarding in social mobile wireless networks of selfish individuals . IEEE Transactions on Dependable and Secure Computing , 2012 , 9 （ 4 ）: 569 ～ 582

Zhu H J , Lin X D , Lu R X , et al . SMART: a secure multi-layer credit based incentive scheme for delay-tolerant networks . IEEE Transactions on Vehicular Technology , 2009 , 58 （ 8 ）: 4628 ～ 4639

Chen B B , Chan M C . MobiCent: a credit-based incentive system for disruption tolerant network . Proceedings of the Conference on INFOCOM , San, Diego, USA , 2010 : 1 ～ 9

Chen K , Shen H Y . Multicent: a multifunctional incentive scheme adaptive to diverse performance objectives for DTN routing . Proceedings of IEEE International Conference on Sensing, Communication, and Networking（SECON） , New Orleans, USA , 2013 : 532 ～ 540

赵广松，陈鸣 . 自私性机会网络中激励感知的内容分发的研究 . 通信学报， 2013 , 34 ( 2 ): 73 ～ 84

Zhao G S , Che M . Research of incentive-aware data dissemination in selfish opportunistic networks . Journal on Communications , 2013 , 34 ( 2 ): 73 ～ 84

Buttyan L , Dora L , Felegyhazi M , et al . Barter trade improves message delivery in opportunistic networks . Ad Hoc Networks , 2010 , 8 （ 1 ）: 1 ～ 14

Wang Y , Chuah M C , Chen Y Y . Incentive based data sharing in delay tolerant mobile networks . IEEE Transactions on Wireless Communications , 2014 , 13 （ 1 ）: 370 ～ 381

Gao W , Li Q , Zhao B , et al . Multicasting in delay tolerant networks: a social network perspective . Proceedings of the 10th ACM International Symposium on Mobile Ad Hoc Networking and Computing , New Orleans, USA , 2009 : 299 ～ 308

Krifa A , Barakat C , Spyropoulos T . Optimal buffer management policies for delay tolerant networks . Proccedings of Fifth Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks（SECON'08） , California, USA , 2008 : 260 ～ 268

Gode D k , Sunder S . Allocative efficiency of markets with zero intelligence（ZI）traders:market as a partial substitute for individual rationality . Journal of Political Economy , 1993 （ 101 ）: 119 ～ 137

Keranen A , Ott J , Karkkainen T . The ONE simulator for DTN protocol evaluation . Proceedings of the 2nd International Conference on Simulation Tools and Techniques , Rome, Italy , 2009 : 1 ～ 10

Infocom05 data set . http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/infocom http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/infocom , 2006

Views

403

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Efficient Online Dynamic Allocation Algoritbm of Virtual Macbine in Cloud Computing

Related Author

Limin Zhang

Related Institution

No data

⁰