Advanced Optimal Buffer Scheduling Policy in Opportunistic Networks

Abstract:

Opportunistic Networks (ONs) are the newly emerging type of Delay Tolerant Network (DTN) systems that opportunistically exploit unpredicted contacts among nodes to share information. As with all DTN environments ONs experience frequent and large delays, and an end-to-end path may only exist for a brief and unpredictable time. In this paper, we employ optimal theory to propose a novel buffer management strategy named Optimal Buffer Scheduling Policy (OBSP) to optimize the sequence of message forwarding and message discarding. In OBSP, global optimization considering delivery ratio, transmission delay, and overhead is adopted to improve the overall performance of routing algorithms. The simulation results show that the OBSP is much better than the existing ones.

• Periodical: Advanced Engineering Forum (Volume 4)
• Pages: 13-18
• DOI: https://doi.org/10.4028/www.scientific.net/AEF.4.13
• Online since: June 2012
• Authors: Qi Lie Liu, Guang De Li, Yun Li, Ying Jun Pan, Feng Zhi Yu
• Keywords: Buffer Management, Opportunistic Networks, Optimal Theory, Scheduling Policy

References

[1] K. Fall, A delay tolerant network architecture for challenged internets, in Proc. ACM SIGCOMM, pp.27-24, (2003).

[2] S. Jain, K. Fall, and R. Patra, Routing in a delay tolerant network, In Proceedings of ACM SIGCOMM, Aug. (2004).

[3] Vahdat and D. Becker, Epidemic routing for partially connected ad hoc networks, , Duke University, Tech. Rep. CS-200006, (2000).

[4] K. P. Thrasyvoulos Spyropoulos and C. Raghavendra, An efficient routing scheme for intermittently connected mobile networks, ACM SIGCOMM workshop on Delay Tolerant Networking (WDTN-05), (2005).

DOI: 10.1145/1080139.1080143

[5] A. Lindgren, A. Doria, and O. Schelen, Probabilistic routing in intermittently connected networks, SIGMOBILE Mobile Computing and Communication Review, vol. 7, no. 3, (2003).

DOI: 10.1145/961268.961272

[6] Etienne C. R. de Oliveria, Celio V. N. de Albuquerque, NECTAR: a DTN routing protocol based on neighborhood contact history, in Proc. ACM Symposium on Applied Computing, pp.40-46, (2009).

DOI: 10.1145/1529282.1529290

[7] A. Ker¨anen, J. Ott, The ONE Simulator for DTN Protocol Evaluation, in SIMUTools, (2009).

[8] A. Krifa, C. Baraka, and T. Spyropoulos, Optimal Buffer Management Policies for Delay Tolerant Networks, in Proc. IEEE SECON, pp.260-268, (2008).

DOI: 10.1109/sahcn.2008.40

[9] V. Erramilli and M. Crovella, Forwarding in Opportunistic Networks with Resource Constraints, in Proc. ACM, (2008).

DOI: 10.1145/1409985.1409994

[10] K. Shin, S. Kim, Enhanced buffer management policy that utilizes message properties for delay-tolerant networks, in the Institution of Engineering and Technology, pp.753-759, (2011).

DOI: 10.1049/iet-com.2010.0422