Packet Delivery Ratio/Cost in MANETs With Erasure Coding and Packet Replication
This paper 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. Finally, extensive simulation and numerical studies are conducted to illustrate the efficiency of the developed theoretical models and to illustrate our findings. Our results indicate that the replication parameter f should be carefully selected in order to obtain a high packet-delivery-ratio performance while maintaining a relatively low delivery cost.
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 OF EXISTING SYSTEM:
Consume a lot of battery power
Waste a lot of communication resources
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 OF PROPOSED SYSTEM:
It consumes less amount of energy
Increase the packet delivery ratio
SYSTEM BLOCK DIAGRAM
System : Pentium IV 2.4 GHz.
Hard Disk : 40 GB.
Floppy Drive : 44 Mb.
Monitor : 15 VGA Colour.
Ram : 512 Mb.
Operating system : Windows XP/7/LINUX.
Implementation : NS2
NS2 Version : 2.28
Front End : OTCL (Object Oriented Tool Command Language)
Tool : Cygwin (To simulate in Windows OS)
Bin Yang, Yin Chen, Ying Cai, and Xiaohong Jiang, Senior Member, IEEE, “Packet Delivery Ratio/Cost in MANETs With Erasure Coding and Packet Replication”, IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 64, NO. 5, MAY 2015.