IJSER Home >> Journal >> IJSER
International Journal of Scientific and Engineering Research
ISSN Online 2229-5518
ISSN Print: 2229-5518 7    
Website: http://www.ijser.org
scirp IJSER >> Volume 2, Issue 7, July 2011 Edition
Buffer Scheduling Policy for Opportunitic Networks
Full Text(PDF, 3000)  PP.  
Author(s)
Qaisar Ayub, Sulma Rashid, M.Soperi Mohd Zahid
KEYWORDS
buffer drop policies, Delay tolerance network, Algorithm, buffer scheduling, upper bound, large size message
ABSTRACT
In Delay Tolerant Networks (DTNs), the optimal use of buffer management polices can improve the network throughput. In this paper, we propose a buffer management strategy called as Message Drop Control (MDC). This technique controls the message drop by using an upper bound which is the count of buffered message at router and size of the messages. If count exceed the upper bound drop will not occurs else large size message will be dropped from queue. We examine the performance of proposed drop policy by comparing it with existing MOFO, DOA, and LIFO. The simulation results proves that MDC policy out perform well as existing ones in terms of delivery probability, message drop, overhead and buffer time average.
References
[1] KERÄNEN, A., AND OTT, J. Increasing Reality for DTN Protocol Simulations. Tech. rep., Helsinki University of Technology, Networking Laboratory, July 2007.

[2] K. Fall, “A delay tolerant network architecture for challenged internets”, in Proc. ACM SIGCOMM, pp.27-24, 2003.

[3] Qaisar Ayub, Sulma Rashid,” T-Drop: An optimal buffer management policy to improve QOS in DTN routing protocols”, Journal of Computing, Vol 2, ISSUE 10,

[4] Rashid, S., et al., E-DROP: An Effective Drop Buffer Management Policy for DTN Routing Protocols. International Journal, 2011. 13(7): p. 8-13.

[5] Vahdat and D. Becker, “Epidemic routing for partiallyconnected ad hoc networks,” Tech. Rep. CS-2000-06, Duke University, July 2000.

[6] T. Spyropoulos, K. Psounis and C. S. Raghvendra ""Spray and Wait Efficient routing in intennittently connected Networks,"" in Proceeding of Mobile Computer and Communication review Vol. 7,no. 3, July 2003.

[7] R Ramnathan, R. Hansen, P. Basu, R. R Hain and R Krishnan, "" Prioritized Epidemic Routing for Partially Connected Ad Hoc Networks "", in proceeding of ACM MobiOpp'07, 2007.

[8] T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Singlecopy routing in intermittently connected mobile networks,” in Proc. IEEE Conf. Sensor and Ad Hoc Communications and Networks (SECON),2004, pp. 235–244.

[9] R. C. Shah, S. Roy, S. Jain, and W. Brunette, “Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks,” Elsevier Ad Hoc Networks Journal, vol. 1, pp. 215–233, Sept. 2003.

[10] A.INDGREN AND K. S. PHANSE, “EVALUATION OF QUEUING POLICIES AND FORWARDING STRATEGIES FOR ROUTING IN INTERMITTENTLY CONNECTED NETWORKS,” IN PROC. OF IEEE COMSWARE, PP. 1-10, JAN. 2006.

[11] YUN LI, LING ZHAO ,ZHANJUN LIU, QILIE LIU.” N-DROP CONGESTION CONTROL STRATEGY UNDER EPIDEMIC ROUTING IN DTN.” RESEARCH CENTER FOR WIRELESS INFORMATION NETWORKS, CHONGQING UNIVERSITY OF POSTS & TELECOMMUNICATIONS, CHONGQING 400065,CHINA, PP. 457-460, 2009.

[12] AMIR KRIFA, CHADI BARAKAT, THRASYVOULOS SPYROPOULOS, “OPTIMAL BUFFER MANAGEMENT POLICIES FOR DELAY TOLERANT NETWORKS,” IEEE CONFERENCE ON SENSOR, MESH AND AD HOC COMMUNICATIONS AND NETWORKS (SECON 2008), JUNE 2008.

[13] Sulma Rashid,Qaisar Ayub,”Effective buffer management policy DLA for DTN routing Protocals under congetion”, International Journal of Computer and Network Security,Vol 2,NO 9,Sep 2010. pp .118-121.

[14] Al-Siyabi, M., H. Cruickshank, and Z. Sun. “Quality of service provisioning for delay tolerant network by implementing admission control model for aircrafts bundles data transmission.”, 2010: ACM.

Untitled Page