Simple models for the performance evaluation of a class of two-hop relay protocols

14Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We evaluate the performance of a class of two-hop relay protocols for mobile ad hoc networks. The interest is on the multicopy two-hop relay (MTR) protocol, where the source may generate multiple copies of a packet and use relay nodes to deliver the packet (or a copy) to its destination, and on the two-hop relay protocol with erasure coding. Performance metrics of interest are the time to deliver a single packet to its destination, the number of copies of the packet at delivery instant, and the total number of copies that the source generates. The packet copies at relay nodes have limited lifetime (time-to-live TTL). Via a Markovian analysis, the three performance metrics of the MTR protocol are obtained in closed-from in the case where the number of the copies in the network is limited. Also, we develop an approximation analysis in the case where the inter-meeting times between nodes are arbitrarily distributed and the TTLs of the copies are constant and all equal. In particular, we show that exponential intermeeting times yield stochastically smaller delivery delays than hyper-exponential inter-meeting times, and that exponential TTLs yield stochastically larger delivery delays than constant TTLs. Finally, we characterize the delivery delay and the number of transmissions in the two-hop relay protocol with erasure coding and compare this scheme with the multicopy scheme. © IFIP International Federation for Information Processing 2007.

Cite

CITATION STYLE

APA

Al Hanbali, A., Kherani, A. A., & Nain, P. (2007). Simple models for the performance evaluation of a class of two-hop relay protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 191–202). Springer Verlag. https://doi.org/10.1007/978-3-540-72606-7_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free