Open Access Open Access  Restricted Access Subscription or Fee Access

Network Capacity Enhancement Specific to Mobile Environment Using DTN

Hemal Shah, Yogeshwar P. Kosta

Abstract


A communications network that withstands long delays or outages and is capable of storing packets temporarily stationed in intermediate nodes, until an end-to-end route is re-established or regenerated is known as a delay tolerant network or in short DTN. This paper aims to consolidate general & basic aspects relating to information needs to efficiently execute DTN routing. We start by presenting the evolution of some routing protocols, spotting few routing schemes relevant to us, discuss their groups and classifications, their operating network environment, and through critical study and observation, to identify specific parameters that are common across relevant schemes associated with routing that helps to bring out the advantage and disadvantage associated with them in an attempt to establishing some possible future extensions-of-the-existing through consolidation - accomplished by capturing, organizing and showcasing the same in metrics and proposing new schemes as well. This leads us to identify specific schemes and techniques that will help us to exploit the delay and utilize the time judiciously to improve the over all efficiency of information exchange in a DTN network. The essence of this study being; to utilize efficiently the temporal period (delay) by opportunistically establishing connectivity - in a strategic manner, to help exchange information across by locally distributed resources, thus making optimal use of available network resources and enhancing the efficiency of information exchange.

Keywords


Forwarding, Replication, Single-Copy, Multiple-Copy, Relay, Delivery Ratio, Delay, Throughput, Local Resource, Routing Techniques, Routing Efficiencies, Protocol Introduction

Full Text:

PDF

References


W. Zhao, Y. Chen, M. Ammar, M. D. Corner, B. N. Levine,E. Zegura, ”Capacity Enhancement using Throwboxes in DTNs” IEEE MASS,2006.

Jea D., Somasundara A. A,Srivastava M. B.,” Multiple Controlled Mobile Elements (Data Mules) for Data Collection in Sensor Networks” ,IEEE/ACM International Conference on Distributed Computing in Sensor Systems (DCOSS), June 2005.

A. Lindgren, A. Doria, O. Schelen,“Probabilistic routing in intermittently connected networks.“, SIGMOBILE Mobile Computing and Communications Review. Vol. 7, 2003.

T. Spyropoulos, K. Psounis, C. S. Raghavendra, “Efficient routing in intermittently connected mobile networks:The single-copy case” IEEE/ACM Trans. on Networking. Vol. 16, 2008

T. Spyropoulos, K. Psounis, and C. S. Raghavendra,”Efficient routing in intermittently connected mobile networks:The multiple-copy case. IEEE/ACM Trans. on Networking. Vol. 16, 2008

A. Vahdat, D. Becker,”Epidemic routing for partially connected ad hoc networks”, Duke University : s.n., 2000,Technical Report CS-200006.

Burgess, B. Gallagher, D. Jensen,B. Levine,”Maxprop: Routing for vehicle-based disruption tolerant networking”, Barcelona, Spain : s.n.,IEEE Infocom, April 2006

Jain, K. Fall, R. Patra,”Routing in a Delay Tolerant Network”, Proc. ACM SIGCOMM. pp. 145–158, 2004

R. H. Frenkiel, B. R. Badrinath, J. Borres, R. D. Yates,” The infostations challenge: balancing cost and ubiquity in delivering wireless data”, IEEE Personal Communications. Vols. 7, No. 2, pp. 66–71, 2000.

J. Widmer, J.-Y. Le Boudec,”Network coding for efficient communication in extreme networks” ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN’05) . pp. 284–291, August 2005.

Evan P.C. Jones, Paul A.S. Ward,”Routing Strategies for Delay-Tolerant Networks” s.l. : ACM, Computer Communication Review, 2006

W. Zhao, M. Ammar,E. Zegura,” A Message Ferrying Approach for Data Delivery in sparse Mobile Ad Hoc Networks”, 5th ACM international symposium on Mobile ad hoc networking and computing.

J.Leguay, T.Friedman,V.Conan,”DTN Routing in mobility pattern space”,ACM SIGCOMM Workshop on DTN, 2003.

Thrasyvoulos Spyropoulos, Konstantinos Psounis,Cauligi S. Raghavendra,”Spray and wait: an efficient routing scheme for intermittently connected mobile networks”, USC : ACM, , SIGCOMM, 2005.

Thrasyvoulos Spyropoulos, Konstantinos Psounis,Cauligi Raghavendra,” Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility”, s.l. : IEEE, Pervasiv Computing and Communications Workshops, 2007. PerCom Workshops '07. Fifth Annual IEEE International Conference. pp. 79 – 85, March 2007.

S. Jain, M. Demmer, R. Patra, K. Fall,”Using redundancy to cope with failures in a delay tolerant network”, NY, USA : ACM Press, SIGCOMM. pp. 109–120, 2005.

Yong Wang, Sushant Jain,Margaret Martonosi,Kevin Fall, “Erasure-coding based routing for opportunistic networks”, s.l. : ACM SIGCOMM workshop on Delay-tolerant networking. pp. 229 – 236, 2005

Y. Liao, K. Tan, Z. Zhang, L. Gao,”Estimation based erasure-coding routing in delay tolerant networks”, IWCMC, June 2006.

N. Sarafijanovic-Djukic, M. Piorkowski, M. Grossglauser,”Island Hopping: Efficient Mobility-Assisted Forwarding in Partitioned Networks”,SECON’06. Vol. 1, pp. 226–235.

B. Burns, O. Brock, B. N. Levine,”MV routing and capacity building in disruption tolerant networks”,IEEE Infocom, 2005.

Rahul C. Shah, Sumit Roy, Sushant Jain, and Waylon Brunette,”Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks”,IEEE SNPA workshop (Handbook style) Transmission Systems for Communications, 3rd ed., Western Electric Co., Winston-Salem, NC, 1985, pp. 44–60, May 2003.

M. Shin, S. Hong, and I. Rhee,”DTN Routing Strategies using Optimal Search Patterns”, CHANTS’08 .

G. M. Viswanathan, V. Afanasyev, S. V. Buldyrev, E. J. Murphy, P. A. Prince, H. E. Stanley,”Levy flights search patterns ofWandering albatrosses”, Nature. Vol. 381, pp. 413–415, 1996.

B. Kantor, P. Lapsley,”Network news transfer protocol RFC 977”. , Internet Engineering Task Force, Feb 1986.

A. Balasubramanian, B. Levine, and A. Venkataramani,”DTN Routing as a Resource Allocation Problem”,SIGCOMM Comput. Commun. Rev. Vol. 37, pp. 373–384, 2007.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.