Please use this identifier to cite or link to this item:
|Title:||Plankton: An efficient DTN routing algorithm||Authors:||Guo, X.F.
Delay/disruptive tolerant network (DTN) routing
|Issue Date:||2013||Citation:||Guo, X.F.,Chan, M.C. (2013). Plankton: An efficient DTN routing algorithm. 2013 IEEE International Conference on Sensing, Communications and Networking, SECON 2013 : 550-558. ScholarBank@NUS Repository. https://doi.org/10.1109/SAHCN.2013.6645027||Abstract:||In this paper, we present an efficient routing algorithm, Plankton, for Delay/Disruptive Tolerant Network (DTN). Plankton utilizes replica control to reduce overhead and contact probability estimates to improve performance. Plankton has two major features. First, it uses a combination of both short-term bursty contacts and long-term association based statistics for contact prediction. Second, it dynamically adjusts replication quotas based on estimated contact probabilities and delivery probabilities. Our evaluation on extensive traces shows that Plankton achieves significantly better prediction accuracy than existing algorithms for contact probability prediction. In addition, we show that while Plankton incurs much lower communication overhead compared to Spray-and-Wait, MaxProp and RAPID with savings from 14% to 88%, it can also achieve similar if not better delivery ratios and latencies. © 2013 IEEE.||Source Title:||2013 IEEE International Conference on Sensing, Communications and Networking, SECON 2013||URI:||http://scholarbank.nus.edu.sg/handle/10635/78286||DOI:||10.1109/SAHCN.2013.6645027|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 18, 2020
checked on Oct 4, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.