A multi-attribute decision making approach to congestion control in delay tolerant networks

DTNs are prone to congestion due to limited resource on each node and unpredictable end-to-end delay. We aim to develop an effective congestion control mechanism in this paper. For this purpose, we first identify a list of major congestion factors by analyzing the causes of congestion. We then model the congestion control as a multiple attribute decision making problem (MADM), in which the weight of congestion factors is measured by an entropy method. To solve this problem, we present a MADM-based congestion control mechanism that determines a set of forwarding messages and its transmission order on each encounter event. Moreover, we design a buffer management scheme that deletes messages whose removal would incur the least impact to the network performance when the buffer overflows. Extensive real-trace driven simulation is conducted and the experimental results finally validate the efficiency of our proposed congestion control mechanism.

[1]  Robin Kravets,et al.  Retiring Replicants: Congestion Control for Intermittently-Connected Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[2]  Ke Xu,et al.  A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks: Applications, Taxonomy and Design-Related Issues , 2014, IEEE Communications Surveys & Tutorials.

[3]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[4]  Zhenfu Cao,et al.  A Probabilistic Misbehavior Detection Scheme toward Efficient Trust Establishment in Delay-Tolerant Networks , 2014 .

[5]  M. Singh,et al.  An Evidential Reasoning Approach for Multiple-Attribute Decision Making with Uncertainty , 1994, IEEE Trans. Syst. Man Cybern. Syst..

[6]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[7]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[8]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[9]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

[10]  Milena Radenkovic,et al.  Congestion aware data dissemination in social opportunistic networks , 2011, MOCO.

[11]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[12]  Thrasyvoulos Spyropoulos,et al.  Message Drop and Scheduling in DTNs: Theory and Practice , 2012, IEEE Transactions on Mobile Computing.