Delivery ratio in two-hop relay MANETs with limited message lifetime and redundancy

A lot of work has been done to model and analyze the performances of two-hop relay algorithm and its variants. However, the delivery ratio, especially under limited message lifetime, has been largely neglected in literature, which is not only of significant importance for delay sensitive applications (where a message beyond some delay limit will typically be dropped) but also of practical interests for general MANET scenarios (where mobile nodes are usually both energy-constrained and buffer storage-limited). In this paper, we study the delivery ratio of a generalized two-hop relay with limited message lifetime and redundancy. In particular, a finite-state absorbing Markov chain-based theoretical framework is first developed to model the complicated message delivery process under the considered relay algorithm. Closed-form expressions are then derived for the message delivery ratio under any given message lifetime, where the important interference, medium contention and traffic contention issues are carefully incorporated into analysis. Finally, extensive simulations are conducted to validate the theoretical framework and corresponding delivery ratio results.

[1]  Yuguang Fang,et al.  Throughput, Delay, and Mobility in Wireless Ad Hoc Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[2]  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).

[3]  Sanjeev R. Kulkarni,et al.  A deterministic approach to throughput scaling in wireless networks , 2002, IEEE Transactions on Information Theory.

[4]  Ioannis Stavrakakis,et al.  Study of two-hop message spreading in DTNs , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[5]  Xiaohong Jiang,et al.  Group-based two-hop relay with redundancy in MANETs , 2011, 2011 IEEE 12th International Conference on High Performance Switching and Routing.

[6]  Xiaohong Jiang,et al.  Delay and Capacity in Ad Hoc Mobile Networks with f-cast Relay Algorithms , 2011, IEEE Transactions on Wireless Communications.

[7]  Nei Kato,et al.  Detecting Blackhole Attack on AODV-based Mobile Ad Hoc Networks by Dynamic Learning Method , 2007, Int. J. Netw. Secur..

[8]  Marcelo Dias de Amorim,et al.  Performance of Opportunistic Epidemic Routing on Edge-Markovian Dynamic Graphs , 2011, IEEE Transactions on Communications.

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

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

[11]  Eitan Altman,et al.  Performance of ad hoc networks with two-hop relay routing and limited packet lifetime (extended version) , 2008, Perform. Evaluation.

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

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

[14]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .