PACKET DELIVERY RATIO/COST IN MANETS WITH ERASURE CODING AND

PACKET REPLICATION
Abstract
This project studies the performance of a general two-hop relay (2HR)-(x,w, f) packet delivery
scheme that combines both erasure coding and packet replication techniques in mobile ad hoc
networks (MANETs). Under this packet delivery scheme, a group of x packets is first encoded
into w(w x) coded packets using erasure coding, and each coded packet is then replicated to at
most f distinct relay nodes that can help to forward the coded packets to its destination node. The
original packets can be recovered when x distinct coded packets reach the destination node. To
understand the packet delivery process under the 2HR-(x,w,f) scheme, we develop a
multidimensional Markov chain framework, and based on this analytical expressions on the
packet delivery ratio and corresponding expected packet delivery cost are further derived.
Existing System
An erasure-coding-based packet delivery scheme in delay tolerant networks (DTNs), where a
fluid model was developed to analyze its delivery ratio performance and the corresponding
delivery cost. For general MANETs, the erasure-coding-based packet delivery schemes have
been investigated. It is notable that, in the given studies, each coded packet is delivered to only
one relay node and the performance improvement there is obtained by increasing the number of
distinct coded packets. However, increasing the number of coded packets will lead to higher
computational complexity in encoding and decoding operations, both of which consume a lot of
battery power. In our previous work, we studied the delivery delay performance under the
considered 2HR-(x,w, f) algorithm. The delivery delay of a packet is defined as the time elapsed
between the time slot when the source node starts to deliver copies for this packet and the time
slot when the destination node successfully recovers this packet.
Disadvantages

Consume a lot of battery power

Waste a lot of communication resources

Block Diagram

Markov chain model

Two-hop relay

Derive analytical expressions

Compute packet delivery ratio

Calculate the delivery cost

Proposed System
In this project, we consider a packet lifetime constraint and employ a Markov chain model to
analyze the packet delivery ratio and the corresponding delivery cost performance, which are
defined as the fraction of packets that can be recovered at the destination node before their
lifetime expires and the corresponding expected transmission and receiving power consumed,
respectively. The main contributions of this project are summarized as follows.

We first develop a multidimensional Markov chain to model the packet delivery process

under the 2HR-(x,w, f) algorithm in the considered MANET.

Based on the Markov chain model, we then derive analytical expressions for the packet
delivery ratio and the corresponding delivery cost under a given packet lifetime

constraint.
Finally, we conduct simulation studies to verify the efficiency of the developed delivery
ratio/cost results and provide numerical results to demonstrate our theoretical findings.

Advantages

It consumes less amount of energy

Increase the packet delivery ratio

Conclusion
This project has investigated the packet delivery ratio and cost performance in MANETs under a
general 2HR-(x,w, f) packet delivery scheme that combines erasure coding and packet replication
techniques. A Markov chain framework was developed to model the packet delivery process
under the 2HR- (x,w, f) scheme, based on which analytical expressions of the packet delivery
ratio/cost can be obtained. Extensive simulations demonstrate that our theoretical results can
accurately predict the packet delivery ratio/cost performance under the 2HR-(x,w, f) scheme.
References
[1]. A. Goldsmith et al., Beyond Shannon: The quest for fundamental performance limits of
wireless ad hoc networks, IEEE Commun. Mag., vol. 49, no. 5, pp. 195205, May 2011.
[2]. E. Altman, F. D. Pellegrini, and L. Sassatelli, Dynamic control of coding in delay
tolerant networks, in Proc. IEEE INFOCOM, 2010, pp. 15.
[3]. E. Altman and F. D. Pellegrini, Forward correction and fountain codes in delay-tolerant
networks, IEEE/ACM Trans. Netw., vol. 19, no. 1, pp. 113, Feb. 2011.
[4]. E. Altman, L. Sassatelli, and F. D. Pellegrini, Dynamic control of coding for progressive
packet arrivals in DTNs, IEEE Trans. Wireless Commun., vol. 12, no. 2, pp. 725735,
Feb. 2013.
[5]. A. James, A. S.Madhukumar, E. Kurniawan, and F. Adachi, Performance analysis of
fountain codes in multihop relay networks, IEEE Trans. Veh. Technol., vol. 62, no. 9, pp.
43794391, Nov. 2013.