The week's pick
Reseach Article
A New Queuing Policy for Delay Tolerant Networks
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 1 - Number 20 |
| Year of Publication: 2010 |
| Authors: R.S.D. Wahidabanu, G.Fathima |
10.5120/422-622
|
R.S.D. Wahidabanu, G.Fathima . A New Queuing Policy for Delay Tolerant Networks. International Journal of Computer Applications. 1, 20 ( February 2010), 52-55. DOI=10.5120/422-622
Abstract
Recently there has been much research activity in the area of delay tolerant networks (DTNs). There are several different types of DTNs depending on their characteristics. Routing is one of the key components in the DTN architecture. The basic principle behind the routing protocols for DTNs is store, carry and forward. Message transmission occur only when nodes encounter each other. Due to mobility of the nodes, the contact duration is limited. The contact duration may not be sufficient for a node to transmit all messages it has. Therefore decision has to be made on which message to forward. Similarly, in order to cope up with long disconnections, messages are buffered for a long period of time. If buffer capacity is reached, nodes must decide on which message to be dropped. Thus a new policy has been proposed in this paper which takes care of both. The proposed policy is based on their class of service and the expiration time. The delay tolerant networks whose behaviour is random is considered in this paper. Therefore epidemic routing protocol which is suitable for such network has been mainly focused. The simulation shows that the new policy outperforms existing policy in terms of delivery ratio and delivery latency with preferential delivery.
References
- A. Lindgren et al., "Probabilistic Routing in Intermittently Connected Networks," Mobile Comp. and Commun. Rev., vol. 7, no. 3, July 2003.
- A. Spyropoulos et al., "Spray and Wait: An Efficient Routing Scheme For Intermittently Connected Mobile Networks," ACM SIGCOMM Wksp. Delay Tolerant Networking (WDTN-05), Aug.2005.
- Alan Demers, Dan Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard. Sturgis, Dan Swinehart, and Doug Terry. "Epidemic algorithms for replicated database maintenance." In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, pages 1-12, 1987.
- Amin Vahdat and David Becker. "Epidemic routing for partially connected ad hoc networks Technical report CS-200006, Duke University, April 2000. http://issg.cs.duke.edu/epidemic/
- Bundle Protocol specification , RFC 5050
- Evan P.C. Jones, Paul A.S.Ward, " Practical Routing in Delay Tolerant Networks" , IEEE Transactions on Mobile Computing, Vol. 6, No. 8, Aug 2007
- Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu, and Jorjeta Jetcheva. "A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols". In Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), October 1998.
- Kevin Fall, "A delay-Tolerant Network Architecture for challenged Internet ", SIGCOMM, August 2003.
- S.K.Das, R. Jayaram, N. Kakani and S.K. Sen. "Call admission and Control for Quality-of -Service (QoS) Provisioning in Next Generation Wireless Networks". In Fifth International Workshop on Mobile Multimedia Communication (MOMuc '98), October 1998.
- Sushant Jain, University of Washington Kevin Fall, Intel Research, Berkeley, Rabin Patra, University of California, Berkeley. "Routing in Delay Tolerant Network" , SIGCOMM'04, Aug. 30-Sept. 3, 2004.
- The Network Simulator - ns-2, 2004. http://www.isi.edu/nsnam/ns/
- T.Small and Z. J. Haas, "The shared Wireless Infostation Model - A New Ad Hoc Networking Paradigm (or Where there is a Whale, there is a Way)," Mobihoc 2003, June 1-3, 2003.
- Zhensheng Zhang, San Diego Research Center , "Routing In Intermittently Connected Mobile Ad Hoc Networks And Delay Tolerant Networks: Overview and Challenges " IEEE Communications Surveys 1st Quarter 2006, Vol. 8, No. 1
Index Terms
Keywords