An adaptive and efficient buffer management scheme for resource-constrained delay tolerant networks

Abstract Provisioning buffer management mechanism is especially crucial in resource-constrained delay tolerant networks (DTNs) as maximum data delivery ratio with minimum overhead is expected in highly congested environments. However, most DTN protocols do not consider resource limitations (e.g., buffer, bandwidth) and hence, results in performance degradation. To strangle and mitigate the impact of frequent buffer overflows, this paper presents an adaptive and efficient buffer management scheme called size-aware drop (SAD) that strives to improve buffer utilization and avoid unnecessary message drops. To improve data delivery ratio, SAD exactly determines the requirement based on differential of newly arrived message(s) and available space. To vacate inevitable space from a congested buffer, SAD strives to avoid redundant message drops and deliberate to pick and discard most appropriate message(s) to minimize overhead. The performance of SAD is validated through extensive simulations in realistic environments (i.e., resource-constrained and congested) with different mobility models (i.e., Random Waypoint and disaster). Simulation results demonstrate the performance supremacy of SAD in terms of delivery probability and overhead ratio besides other metrics when compared to contemporary schemes based on Epidemic (DOA and DLA) and PRoPHET (SHLI and MOFO).

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

[2]  Robin Kravets,et al.  Event-driven, role-based mobility in disaster recovery networks , 2007, CHANTS '07.

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

[4]  Pin-Han Ho,et al.  Message Scheduling and Forwarding in Congested DTNs , 2012 .

[5]  M. Soperi Mohd Zahid,et al.  E-DROP: An Effective Drop Buffer Management Policy for DTN Routing Protocols , 2011 .

[6]  Thrasyvoulos Spyropoulos,et al.  An optimal joint scheduling and drop policy for Delay Tolerant Networks , 2008, 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[7]  Li Li,et al.  Practical Routing in Delay-Tolerant Networks , 2007, IEEE Trans. Mob. Comput..

[8]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[9]  Scott C. Burleigh,et al.  Bundle Protocol Specification , 2007, RFC.

[10]  Simin Nadjm-Tehrani,et al.  Adding Redundancy to Replication in Window-aware Delay-tolerant Routing , 2010, J. Commun..

[11]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[12]  Mathieu Robin,et al.  A Comparative Study of Active Queue Management Schemes , 2004 .

[13]  Theodore S. Rappaport,et al.  A Survey of Recent Developments in Home M2M Networks , 2013, IEEE Communications Surveys & Tutorials.

[14]  Muhammad Imran,et al.  Localized Algorithm for Segregation of Critical/Non-critical Nodes in Mobile Ad Hoc and Sensor Networks , 2013, ANT/SEIT.

[15]  Mkadmi Chedia,et al.  Experimental Study of the Infiltration in the Gafsa Oases in Tunisia , 2012 .

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

[17]  Jiafu Wan,et al.  Towards Key Issues of Disaster Aid based on Wireless Body Area Networks , 2013, KSII Trans. Internet Inf. Syst..

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

[19]  Donald F. Towsley,et al.  Performance Modeling of Epidemic Routing , 2006, Networking.

[20]  Thrasyvoulos Spyropoulos,et al.  Optimal Buffer Management Policies for Delay Tolerant Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[21]  Athanasios V. Vasilakos,et al.  Routing for disruption tolerant networks: taxonomy and design , 2010, Wirel. Networks.

[22]  Athanasios V. Vasilakos,et al.  Delay Tolerant Networks: Protocols and Applications , 2011 .

[23]  Meenu Chawla,et al.  Survey of buffer management policies for delay tolerant networks , 2014 .

[24]  D. V. Telpukhov,et al.  Hardware Implementation of Fir Filter Based on Number-theoretic Fast Fourier Transform in Residue Number System , 2014 .

[25]  Arun Venkataramani,et al.  Replication Routing in DTNs: A Resource Allocation Approach , 2010, IEEE/ACM Transactions on Networking.

[26]  Marcelo Dias de Amorim,et al.  Tuning message size in opportunistic mobile networks , 2009, MobiHeld '09.

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

[28]  Li Qiu,et al.  Edge-Markovian dynamic graph based performance evaluation for Delay Tolerant Networks , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[29]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[30]  Abdul Hanan Abdullah,et al.  Message Drop Control Buffer Management Policy for DTN Routing Protocols , 2013, Wireless Personal Communications.

[31]  Abdul Hanan Abdullah,et al.  Mean drop an effectual buffer management policy for delay tolerant network , 2012 .

[32]  Soontae Kim,et al.  Enhanced buffer management policy that utilises message properties for delay-tolerant networks , 2011, IET Commun..