Issue No. 12 - Dec. (2013 vol. 24)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2012.235
Tamer Abdelkader , University of Waterloo, Waterloo
Kshirasagar Naik , University of Waterloo, Waterloo
Amiya Nayak , University of Ottawa, Ottawa
Nishith Goel , Cistech Limited, Ottawa
Vineet Srivastava , Cistech Limited, Ottawa
Delay tolerant networks (DTN) are characterized by a lack of continuous end-to-end connections due to node mobility, constrained power sources, and limited data storage space of some or all of its nodes. To overcome the frequent disconnections, DTN nodes are required to store data packets for long periods of time until they come near other nodes. Moreover, to increase the delivery probability, they spread multiple copies of the same packet on the network so that one of them reaches the destination. Given the limited storage and energy resources of many DTN nodes, there is a tradeoff between maximizing delivery and minimizing storage and energy consumption. In this paper, we study the routing problem in DTN with limited resources. We formulate a mathematical model for optimal routing, assuming the presence of a global observer that can collect information about all the nodes in the network. Next, we propose a new protocol based on social grouping among the nodes to maximize data delivery while minimizing network overhead by efficiently spreading the packet copies in the network. We compare the new protocol with the optimal results and the existing well-known routing protocols using real life simulations. Results show that the proposed protocol achieves higher delivery ratio and less average delay compared to other protocols with significant reduction in network overhead.
Routing protocols, Delays, Fault tolerant systems, Receivers, Social network services
T. Abdelkader, K. Naik, A. Nayak, N. Goel and V. Srivastava, "SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping," in IEEE Transactions on Parallel & Distributed Systems, vol. 24, no. 12, pp. 2472-2481, 2013.