Throughput analysis of Delay Tolerant Networks with finite buffers

Modeling the fundamental limits of communication in intermittently connected mobile wireless scenarios is an important problem in understanding such networks. Real-world deployments such as delay tolerant networks (DTNs) exhibit such intermittent connectivity. In addition, the effect of finite buffers in such communication paradigms requires investigation. This paper deals with the problem of modeling the throughput and message delivery delay in networks modeled by nodes performing a random walk on a grid-graph. In addition to finite buffer effects, features such as channel access constraints are introduced in the model , presenting a fairly realistic networking scenario. By means of identifying simple, finite-state embedded Markov chains in such mobile systems, closed-form solutions for the problems addressed may be obtained.

[1]  Mostafa Ammar,et al.  Routing in Space and Time in Networks with Predictable Mobility , 2004 .

[2]  Devavrat Shah,et al.  Throughput-delay trade-off in energy constrained wireless networks , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[3]  David J. Aldous,et al.  Lower bounds for covering times for reversible Markov chains and random walks on graphs , 1989 .

[4]  J. Dshalalow Advances in Queueing Theory, Methods, and Open Problems , 1995 .

[5]  Cauligi S. Raghavendra,et al.  Single-copy routing in intermittently connected mobile networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[6]  Konstantinos Psounis,et al.  Contention-aware analysis of routing schemes for mobile opportunistic networks , 2007, MobiOpp '07.

[7]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2005, IEEE Trans. Inf. Theory.

[8]  Devavrat Shah,et al.  Optimal Throughput–Delay Scaling in Wireless Networks—Part II: Constant-Size Packets , 2006, IEEE Transactions on Information Theory.

[9]  Ahmad Al Hanbali,et al.  Simple Models for the Performance Evaluation of a Class of Two-Hop Relay Protocols , 2007, Networking.

[10]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[11]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[12]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Devavrat Shah,et al.  Optimal throughput-delay scaling in wireless networks - part I: the fluid model , 2006, IEEE Transactions on Information Theory.

[14]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[15]  Mostafa H. Ammar,et al.  Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[16]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[17]  Robert B. Cooper Introduction to Queuing Theory , 1990 .

[18]  Konstantinos Psounis,et al.  Performance analysis of epidemic routing under contention , 2006, IWCMC '06.