一种结合传染路由的缓存调度算法

doi:10.3969/j.issn.1001-2400.2012.01.025

J4 ›› 2012, Vol. 39 ›› Issue (1): 141-145.doi: 10.3969/j.issn.1001-2400.2012.01.025

• Original Articles • Previous Articles Next Articles

Buffer schedule algorithm combined with epidemic routing

TANG Lijun¹;LI Yun²;CHAI Yi¹;WANG Xiang²

(1. College of Automation, Chongqing Univ., Chongqing 400044， China;
2. Key Lab. of Mobile Commun. Tech., Chongqing Univ. of Post and Telecomm., Chongqing 400065， China)

Received:2010-11-04 Online:2012-02-20 Published:2012-04-06
Contact: TANG Lijun E-mail:tanglijun_2002@163.com

Abstract

Abstract:

The Delay-Tolerant network(DTN) is a wireless network, in which links between nodes may be disconnected frequently. In DTNs, packets are mainly delivered in a “store-carry-forward” manner, which is different from the “store-and-forward” method used in conventional networks. However, due to the short contact duration between nodes in network and the limited buffer size of the nodes,the packets in the forwarding path may be easily lost without considering an effective buffer schedule policy. For the above characteristics of the network itself, in this paper we propose a buffer schedule algorithm to forward data in the nodal buffer in order of the average contact frequency between the current node's neighbor nodes and the corresponding packet's destination node combined with the epidemic routing protocol. And the performance of the proposed algorithm is evaluated on the NS-2 simulation platform. Final simulation results show that its performance metrics, including the increase in data delivery rate, decrease in end-to-end delay and reduction of network overhead, are improved significantly with limited network resources.

Key words: delay-tolerant network, epidemic routing, buffer schedule, contact frequency

CLC Number:

TN915.9

TANG Lijun;LI Yun;CHAI Yi;WANG Xiang. Buffer schedule algorithm combined with epidemic routing[J].J4, 2012, 39(1): 141-145.

References

［1］ Smith J E, Weingarten F W. Research Challenges for the Next Generation Internet ［DB/OL］. ［1997-05-12］. http://www. cra. org/Policy/NGI/research-chall.pdf.
［2］陈晨, 高新波. 一种无线传感器网络移动性支持自适应MAC协议［J］. 西安电子科技大学学报, 2010, 37(2): 279-284.
Chen Chen, Gao Xinbo. Mobility Supporting Adaptive MAC Protocol in WSN ［J］. Journal of Xidian University, 2010, 37(2): 279-284.
［3］ Fall K. A Delay-tolerant Network Architecture for Challenged Internets ［C］//Proceedings of ACM SIGCOMM 2003. Karlsruhe: ACM SIGCOMM, 2003: 27-34.
［4］ Cerf V, Burleigh S, Torgerson L, et al. Delay-tolerant Networking Architecture［DB/OL］. ［2010-10-08］. http://www.datatracker.ieff.org/doc/rfc4838/.
［5］ Vahdat A, Becker D. Epidemic Routing for Partially-connected Ad Hoc Networks: Technical Report CS-200006 ［R］. Durham: Duke University, 2000.
［6］ Lindgren A, Doria A, Schelen O. Probabilistic Routing in Intermittently Connected Networks ［J］. SIGMOBILE Mobile Computing and Communication Review, 2003, 7(3): 1-8.
［7］ Liu Haitao, Zhang Baoxian. Opportunistic Routing for Wireless Ad Hoc and Sensor Networks: Present and Future Directions ［J］. IEEE Communication Magazine, 2009, 47(12): 103-109.
［8］ Spyropoulos T, Psounis K, Raghavendra C S. Efficient Routing in Intermittently Connected Mobile Networks: the Multiple-copy Case ［J］. Trans on Networking, 2008, 16(1): 77-90.
［9］ Zhang Xiaolan, Neglia G, Kurose J, et al. Performance Modeling of Epidemic Routing［J］. Computer Networks, 2007, 51(10): 2867-2891.
［10］ Krifa A, Barakat C, Spyropoulos T. Optimal Buffer Management Policies for Delay Tolerant Networks ［C］//IEEE SECON 2008 Proceedings. New York: IEEE, 2008: 260-268.
［11］ Liao Yong, Tan Kun. Estimation based Erasure-coding Routing in Delay Tolerant Networks ［C］//Proceedings of the 2006 International Conference on Wireless Communications and Mobile Computing. British Columbia: Vancouver, 2006: 557-562.

Buffer schedule algorithm combined with epidemic routing

PDF (PC)

Like

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 0

Metrics

Comments

Recommended 0