Congestion aware routing algorithm for delay-disruption tolerance networks

Abstract

There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks (DTN). To solve this problem, an attribute hierarchical model was proposed, in which the predefined criteria were summarized as static identity attributes, forwarding desire attributes and delivery capability attributes (IDC). Based on this model, a novel multi-attributes congestion aware routing (MACAR) scheme with uncertain information for next-hop selection was presented, by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations. The simulation results show that MACAR presents higher successful delivery rate, lower average delay and effectively alleviate congestion.

Keywords

delay-disruption tolerant network / congestion control / routing algorithm / custody transfer

References

[1] FALL K. A delay-tolerant network architecture for challenged internets [C]// Proceedings of ACM SIGCOMM. Karlsruhe, 2003: 27–34.

[2] FALL K. HONG W, MADDEN S. Custody transfer for reliable delivery in delay tolerant networks. [EB/OL]. [2010-03-28]. http://www.dtnrg.org/papers/custody-xfer-tr.pdf.

[3] JAIN S, FALL K, PATRA R. Routing in a delay tolerant network [C]// ACM SIGCOM. Portland, 2004: 145–158.

[4] VAHDAT A, BECKER D. Epidemic routing for partially connected ad hoc networks [R]. Duke Technical Report CS-2000-06, 2000: 229–236.

[5] THRASYVOULOS S, KONSTANTINOS P, CAULIGI R. Spray and wait: An efficient routing scheme for intermittently connected mobile networks [C]// Proceedings of ACM SIGCOMM. Philadelphia, 2005: 22–26.

[6] AndersL., AvriD., OlovS.. Probabilistic routing in intermittently connected networks [J]. SIGMOBILE Mobile Computing and Communication Review, 2003, 7(3): 19-20

[7] MUSOLESI M, HAILES S, MASCOLO C. Adaptive routing for intermittently connected mobile ad hoc networks [C]// Proceedings of the 6th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM2005). Taormina-Giardini Naxos, 2005: 183–189.

[8] BOLDRINI C, CONTI M, JACOPINI J. HiBOp: A history based routing protocol for opportunistic networks [C]// IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. Helsinki, 2007: 1–12.

[9] DE RANGO F, TROPEA M, LARATTA G B, MARANO S. Hop-by-hop local flow control over interplanetary networks based on DTN architecture [C]// IEEE ICC 2008. Beijing, 2008: 1920–1924.

[10] ScheuermannB., LochertC., MauveM.. Implicit hop-by-hop congestion control in wireless multihop networks [J]. Elsevier Ad Hoc Network, 2008, 6(2): 260-286

[11] BISIO I, DECOLA, T, MARCHESE M. Congestion aware routing strategies for DTN-based interplanetary networks [C]// IEEE GLOBECOM. New Orleans, 2008: 1–5.

[12] ZHANG Guo-hua, WANG Jing, LIU Yong-he. Congestion management in delay tolerant networks [EB/OL]. [2010-03-28] http://portal.acm.org/citation.cfm?id=1554126.1554206

[13] BURLEIGH S, JENNINGS E, SCHOOLCRAFT J. Autonomous congestion control for an interplanetary internet [C]// AIAA SpaceOps 2006 Conference. Rome, 2006: 123–127.

[14] SELIGMAN M, FALL K, MUNDUR P. Alternative custodians for congestion control in delay tolerant networks [C]// Proceedings of SIGCOMM. Pisa, 2006: 229–236.

[15] YangJ. B., XuD. L.. On the evidential reasoning algorithm for multiple attribute decision analysis under uncertainty [J]. IEEE Transaction Systems, 2002, 32(3): 289-304

[16] HouJun.The evidence reasoning’s combination method, evaluation and application [D], 2006, Xi’an, Northwestern Polytechnical University: 44-47

[17] ARI Keränen, JÖRG Ott, TEEMU Kärkkäinen. The ONE simulator for DTN protocol evaluation [C]// SIMUTools’09: 2nd International Conference on Simulation Tools and Techniques. Rome: 2009: 243–248.